Develop a Student Information System. The system need to implement the insertNode(), deleteNode() and displayList() functions. The insertNode() function is used to insert a new node of student record to the linked list. Assume that the input id is always unique, thus the linked list shall contain the student records with their respective id numbers are in ascending order. The displayList() function is used to display the list after inserting new node and/or after deleting a node. Please refer to the given structure definition shown in Figure 1 Your system interface should consider a few element such as user friendly, attractive and appropriate word. You may add more suitable data in the structure but limited to not more than 3. The deleteNode() function is used to remove a record of the targeted id from the linked list. The deleteNode() function shall return the target id if the record to be deleted exists, otherwise return o. struct student{ int id; char name[20]; double cpa; struct student *nextPtr3B }3;

Develop a Student Information System. The system need to implement the insertNode(), deleteNode() and displayList() functions. The insertNode() function is used to insert a new node of student record to the linked list. Assume that the input id is always unique, thus the linked list shall contain the student records with their respective id numbers are in ascending order. The displayList() function is used to display the list after inserting new node and/or after deleting a node. Please refer to the given structure definition shown in Figure 1 Your system interface should consider a few element such as user friendly, attractive and appropriate word. You may add more suitable data in the structure but limited to not more than 3. The deleteNode() function is used to remove a record of the targeted id from the linked list. The deleteNode() function shall return the target id if the record to be deleted exists, otherwise return o. struct student{ int id; char name[20]; double cpa; struct student *nextPtr3B }3;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

USING C++ Find and delete the node with the smallest info in the list. (Delete only the first occurrence and traverse the list only once.) Add these as abstract functions in the class linkedListType and provide the definitions of these functions in the class unorderedLinkedList. Also, write a program to test these functions. PLS USE THIS CLASS TYPES
Write a function that changes the places of the first and second nodes of a linked list. I.e. the First node will become the second node, and the second node will become the first node. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.
For example: Programming generates and modifies linked lists: Typically, the software monitors two nodes: How to utilise the null reference in the node of a linked list in two common scenarios.
Write a function that changes the places of the first and last nodes of a linked list. I.e. First node will become last node, and the last node will become first node. Others nodes will not be affected.THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.
Suppose a node of a linked list is defined as follows in your program: typedef struct{ char data; struct Node* link; } Node; Write the definitions of two functions (i) Node* pop(Node* top) – which removes the top element of the stack, and (ii) bool compare(Node* topA, Node* topB) - which returns true if the both stacks have identical data. The function returns false if the data in both stacks are not identical. In the function definitions, top, topA, and topB point the top elements of corresponding stacks. You must use the following function definitions in your answer. The peek function has already been defined. You need to write the definition of pop and compare functions. You are not allowed to modify the parameters and/or return types of the functions. Node* pop(Node* top){ //write the function definition } char peek(Node* top){ return top->data; } bool compare(Node* topA, Node* topB){ //write the function definition } Write the time complexity in Big-O notation…
Consider the following scenario: a software creates and manipulates a linked list, like follows:The software would normally maintain track of two special nodes, which are as follows: Explanation of how to utilise the null reference in the node of the linked list in two frequent situations?
1. Suppose you have already developed an SLL ADT. You have to search a specificelement of the linked list. If you find the element in the list then you have to swapits previous node with its next node. Otherwise, simply print the message “Datanot found”. Now write a function in your SLL ADT with this functionality.
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Here is the input: ynny yy 11 nny yy 11 y 12 y 13 y 14 nny ynyy 21 y 22 y 23 y 24 nny yy 11 y 12 y 13 y 14 ny nny yy 11 y 12 y 13 y 14 nyy 21 ny nyy 41 y 42 nny ynyy 21 y 22 y 23 y 24 nyy 31 ny nyy 51 y 52 nnn The correct output should look as follows: Dynamic memory for 0 CNodes freedDynamic memory for 1 PNodes freed11 11 Dynamic memory for 1 CNodes freedDynamic memory for 1 PNodes freed11 12 13 14 11 12 13 14 Dynamic memory for 4 CNodes freedDynamic memory for 1 PNodes freed21 22 23 24 21 22 23 24 Dynamic memory for 0 CNodes freedDynamic memory for 4 CNodes…
The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue). ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Here is the input: ynny yy 11 nny yy 11 y 12 y 13 y 14 nny ynyy 21 y 22 y 23 y 24 nny yy 11 y 12 y 13 y 14 ny nny yy 11 y 12 y 13 y 14 nyy 21 ny nyy 41 y 42 nny ynyy 21 y 22 y 23 y 24 nyy 31 ny nyy 51 y 52 nnn The correct output should look as follows: Dynamic memory for 0 CNodes freedDynamic memory for 1 PNodes freed11 11 Dynamic memory for 1 CNodes freedDynamic memory for 1 PNodes freed11 12 13 14 11 12 13 14 Dynamic memory for 4 CNodes freedDynamic memory for 1 PNodes freed21 22 23 24 21 22 23 24 Dynamic memory for 0 CNodes freedDynamic memory for 4 CNodes…
In a workspace array, a double linked list may be implemented by utilising just one index next. To locate the backward linkages, we do not need to maintain a distinct field back in the nodes that make up the workspace array. The goal is to insert a member workspace[current] rather than the index of the next item on the list into workspace[current]. difference equals the index of the entry after the current entry less the index of the item before it. We must additionally keep two pointers to subsequent nodes in the list, the current index and the prior index of the node right before current in the linked list.To find the next entry of the list, we calculate workspace[current].difference + previous; Similarly, to find the entry preceding previous, we calculate current − workspace[previous].difference;
Create a function that takes the first Node in a linked list as an input, reverses the list (destructively), and then returns the original Node.