Student Information System

Author: Michelle Loh

---

Summary

This system uses a singly linked list to store and organize related to student information. It allow operation such as adding new student’s information as well searching, deleting, and displaying the student information.

The system uses:

1. Object-Oriented Programming (struc, class and object)
2. Multiple Inheritance
3. Abstract Class (Template)
4. Operator Overloading

---

Linked List Operations

1. The student information should consist as follows:

   • Student name
   • Matric Number
   • Year
   • CGPA

2. These linked list will store the information by:

   • Unordered Linked List
   • Ordered Linked

3. Adding information:

   Unordered Linked List

   • Add information based on the specific location (based on data arrival)
   Ordered Linked List

   • Case 1: The list is initially empty
   • Case 2: The list is not Empty
   • Case 3: The list is not Empty, and the student CGPA to be inserted is higher than the first node in the list. The node to be inserted somewhere is the list

4. Delete information:

   • Case 1: The list is empty
   • Case 2: The node to be deleted is the first node
   • Case 3: The node to be deleted is the last node
   • Case 4: The list does not contain the node with the given info

5. Search/Retrieve based on user input