The aim of this homework is to get familiar with basic manipulation with pointers and simple/double linked lists, such as: finding (searching for) a node in a list, dynamically adding/deleting a node in a list, creating new list, printing a list, printing a certain node in a list, as well as cooperation of both of those kinds of lists when building a more complex frameworks of linked lists of (double) linked list. Your job here is to manage the student's data that SU has for the term. Concretely, which student has been registered for which course(s). Since neither the number of students, nor the course(s) he/she will take are known beforehand, we will have to manage this information using dynamically, thus you will dynamically allocate and free memory on the run in accordance to your needs. This means that you are going to use the new statement when allocating a block of memory from the heap and the delete one when freeing a memory block you want need anymore. Pay attention to avoid memory leaks (unused memory which has not been freed) as well as accessing already freed (deleted) memory chunks.
Attachment:- Assignment.pdf