Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as a doubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’, ‘CGPA and ‘Age’ of the student. Following operations can be performed on the Student Book. • Constructor to create and Destructor to destroy the Student Book • Add a Student if it is not already present in the Book. • Delete a Student from the Book. • Search a Student in the Student Book using Name or Reg. Number. If found display its details. If not found, display ‘Student not found’. • Display the Student details in forward and reverse order • In main (), define an object of type StudentBook. Get details of 10 student from the user and add to the StudentBook. Ask the user, if the user wants to display, search or delete a student and perform the required actions, accordingly.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as a
doubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’,
‘CGPA and ‘Age’ of the student. Following operations can be performed on the Student
Book.
• Constructor to create and Destructor to destroy the Student Book
• Add a Student if it is not already present in the Book.
• Delete a Student from the Book.
• Search a Student in the Student Book using Name or Reg. Number. If found
display its details. If not found, display ‘Student not found’.
• Display the Student details in forward and reverse order
• In main (), define an object of type StudentBook. Get details of 10 student from
the user and add to the StudentBook. Ask the user, if the user wants to display,
search or delete a student and perform the required actions, accordingly.
Step by step
Solved in 3 steps with 1 images
