You are required to implement the following functions using the Last In First Out data structure. Create a Student class with data-members name, regNo, department and cGpa. You are required to implement the following functions using the First In First Out (queue) data structure • Constructor – for initializing the default values of a Students • setData( ) – for setting the data in the data members from the user • isEmpty( ) – for checking whether queue of students is empty • isFull( ) – for checking whether queue of students is full • enqueue( ) – for inserting a student in a queue. If the queue is full, you are required to ask the user whether he/she wants to insert even if the queue is full. If the user says yes, then re-size your queue to create a bigger queue. Also, check whether the student is already in the queue or not. If the new student is already in the stack, display the user a message stating the book is already in the queue. • dequeue( ) – for removing a student from the queue • display( ) – for displaying all the students in the queue • sortStudents ( ) – for sorting the students based on regNo (Note: it’s a queue and it must follow first in first out rule)
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).
You are required to implement the following functions using the Last In First Out data structure.
Create a Student class with data-members name, regNo, department and cGpa. You are required
to implement the following functions using the First In First Out (queue) data structure
• Constructor – for initializing the default values of a Students
• setData( ) – for setting the data in the data members from the user
• isEmpty( ) – for checking whether queue of students is empty
• isFull( ) – for checking whether queue of students is full
• enqueue( ) – for inserting a student in a queue. If the queue is full, you are required to
ask the user whether he/she wants to insert even if the queue is full. If the user says yes,
then re-size your queue to create a bigger queue. Also, check whether the student is
already in the queue or not. If the new student is already in the stack, display the user a
message stating the book is already in the queue.
• dequeue( ) – for removing a student from the queue
• display( ) – for displaying all the students in the queue
• sortStudents ( ) – for sorting the students based on regNo (Note: it’s a queue and it must
follow first in first out rule)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 7 images
