Project 2 Use Netbeans, to write a simple java program using the following data structures: 1. Stack by Linked List2. Circular Queue by Array The program should implement the following functions: 1. Insert2. Read/Print3. Remove an item4. Delete (the entire list) On the initial start of the program, users should be prompted for at least five elements into the list. After which they should be presented with options that will allow them to perform the functions defined above. Note that exception handling must be implemented. Screenshots of the cods as proof of its implementation should be included

Project 2 Use Netbeans, to write a simple java program using the following data structures: 1. Stack by Linked List2. Circular Queue by Array The program should implement the following functions: 1. Insert2. Read/Print3. Remove an item4. Delete (the entire list) On the initial start of the program, users should be prompted for at least five elements into the list. After which they should be presented with options that will allow them to perform the functions defined above. Note that exception handling must be implemented. Screenshots of the cods as proof of its implementation should be included

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 18SA

See similar textbooks

Similar questions

python programming Write a function that will insert a new value into the middle of a Linked List. INPUT: The head of the Linked List, the value to insert OUTPUT: Nothing is output RETURNED: Nothing is returned
Assume a linked list contains following integers: 7, 2, x, 5, 8, x, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; curNode=curNode->getNext(); curNode=curNode->getNext(); int a; a=curNode->getItem(); 1. x 2. 2 3. 7 4. x+9
Write a program which will concatenate two single linked lists. The structure is defined below. Assume that head1 contains the starting address of the first list and head2 contains the starting address of the second list. You need to join them together so that all the students’ roll no and names of both the lists will be displayed together with the help of head1 pointer. struct link { int rollno; char name[20]; struct link *next; }; typedef struct link node; node *head1=NULL, *head2=NULL; //global declaration
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode; curNode=new Node<int>(10,head); head=curNode; int a; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); } A.49 B.39 C.7 D.15
Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a; while(curNode->getNext()!=NULL){ { curNode=curNode->getNext(); } a=curNode->getItem(); A. 15 B. 7 C. 49 D. 3
Write a program for implementing queue using linked lists, for which you should use a structure to create a node with data and the next pointer. The program should be able to insert, delete and display nodes in the queue. The user will be asked to enter his choice either to insert a node (enqueue), delete a node (dequeue), display or to exit from the program.The options for the user should be as the following:1. Insert a node (Enqueue)2. Delete a node (Dequeue)3. Display4. Exit  For example if user selected option 1 then the following should appear in the output:Enter the value to insert:Node is inserted If user selected option 2 then the following should appear in the output:Deleted Element is:  If the user selected option 3 then the program should display the elements that are available in the queue The program will keep on running and taking inputs from the user until he selects the 4th option to exit.
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; curNode->setNext(NULL); while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); } A.5 B.2 C.43 D.38
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; Node<int> *aNode; while(curNode->getItem()<7){ aNode=curNode; curNode=curNode->getNext(); } a=aNode->getItem(); A. 5 B.8 C.0 D.7
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode->getItem()<7){ a+=curNode->getItem(); curNode=curNode->getNext(); } A. 13 B. 5 C. 8 D. 21
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); if(curNode!=NULL) curNode=curNode->getNext(); } A.32 B.43 C.19 D.18
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
TRUE or FALSE? Answer the following question and state the reason why: The delete operation only involves the removing of the node from the list without breaking the links created by the next node. You need an array to represent each node in a linked list. STL lists are also efficient at adding elements at their back because they have a built-in pointer to the last element in the list. A circular linked list has 2 node pointers. cout<<list.back()<<endl; = The back member function returns a reference to the last element in the list. In a Dynamic Stack, the pointer top stays at the head after a push operation. During a Pop operation in Static Stack, the elements are being moved one step up. In a dynamic implementation of stack, the pointer top has an initial value of null. In a dynamic stack, the node that was popped is deleted. In a dynamic stack, the pointer top stays at the head after push operation. STL function top returns a reference to element at the top of the…