Recursive Linked List
Student Class List Project
Disclaimer: I \<name\> have not used any code other than my own (or that in the textbook) for this project. I also have not used any function or data-structure from the Standard-Template Library. I understand that any violation of this disclaimer will result in a 0 for the project.
Purpose: To better understand
• Linked lists
You will write an application which stores the courses taken by a student. You will design a Course class which will contain at least: Course Number
Grade (numeric GPA style 4_0 – 0.0)
The courses taken by the student will be provided In a data file. You will have to parse the data from that file and add it to a Linked List of courses.
Your Linked List class must be designed to hold an unlimited number of Course objects. All new Course objects are to be inserted in the list maintaining list order. (Ordered by Course Number).
There can be NO LOOPS of any type in the Linked List class. Recursion MUST be used here.
Once all data has been read from the data. txt file and the resuiting Course objects Inserted into your linked list, you must print out the list of courses using a PrintListO function from you Linked List object Again. this function must use NO LOOPS;recursion only to print the entire list. The PrintListO should first print the size of the list using your recursive sizeO function.
After the fist of courses has been prlnted, you shouid then calculate and display the cumulative GPA of all courses In the list. Again, recursion must be used here instead of loops.
Ii’ C:\UserS\O.na D099e1t\OneOrive\Oocuments\UVU\F.1I 2017\cs242O\We.k 2\RecursiveUst\Debug\Re<urst,,_ –
When the program completes, all courses should be properly deleted from the Linked ust: again. using only recursion. Several files are provided for you. You will need to add code to the following files: