Question No: 01: Make a class to implement linked list and Implement the basic functions of Linked list. Constructors(default, parameterized, copy) & destructor • void PrinList(),int search_Element(int x), void Insert_Element(int x), void Insert_Element_at(int x, int pos), bool Delete_Element(int x), bool is_Empty, int Length(), void Print_Reverse_List(), void Empty_List(), void Copy_List(...) • Also write a driver (main) program to test your code (provide menu for all operations)

Question No: 01: Make a class to implement linked list and Implement the basic functions of Linked list. Constructors(default, parameterized, copy) & destructor • void PrinList(),int search_Element(int x), void Insert_Element(int x), void Insert_Element_at(int x, int pos), bool Delete_Element(int x), bool is_Empty, int Length(), void Print_Reverse_List(), void Empty_List(), void Copy_List(...) • Also write a driver (main) program to test your code (provide menu for all operations)

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 6PE

See similar textbooks

Similar questions

Hello. Please add a toString() function to the Java class implementation of the singly-linked list which returns the contents of the singly-linked list. Also, does Java have a built-in class that implements singly-linked lists? Thank you. public class SinglyLinkedList<E>{ private static class Node<E> { private E element; private Node<E> next; public Node(E e, Node<E> n) { element = e; next = n; } public E getElement() { return element;} public Node<E> getNext() { return next;} public void setNext(Node<E> n) { next = n;} } private Node<E> head = null; private Node<E> tail = null; private int size = 0; public SinglyLinkedList() {} public int size() { return size;} public boolean isEmpty() { return size == 0;} public E first() { if(isEmpty()) return null; return head.getElement(); } public E last() {…
1- consider the following implementation of double linked list class. public class DLIST<E> { static class Node<E>{ private E data, Node<E> next, Node<E> prev; private Node(E dataItem, Node<E> nextnode, Node<E> prevnode){ // constructor data = dataItem; next = nextnode; prev = prevnode } private Node(E dataItem) { //constructor data = dataItem; next = null; prev=null; } } private Node<E> head=null; private Node<E> tail=null; //initialisation } a) Write a Java method that prints 1st, 3rd, 5th, etc. nodes in the double linked list. b) Write a java method to display the double linked list in the reverse 2-Quick Sort is one of the fastest sorting algorithms in Computer Science. a) Write the quick sort algorithm. b) Sort the following array using the QuickSort algorithm (Assume the first element as the pivotal element).…
1)Write a Java program which stores three values by using singly linked list.- Node class1. stuID, stuName, stuScore, //data fields2. constructor3. update and accessor methods- Singly linked list class which must has following methods:1. head, tail, size// data fields2. constructor3. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst(stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst ( ) //Removes and returns the first element of the list.g. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a singly linked list instance. Test all methods of singly linked list class. 2. Write a Java program which stores three values by using doubly linked list.- Node class4. stuID, stuName, stuScore, //data fields5. constructor6. update and…
Implement a Doubly linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 3. Define TestDLinkedList Classa. Declare an instance of Doubly List class. b. Test all the methods of Doubly List class.
Implement Circular Queue ADT using a circular doubly linked list, the ADT have to be in following convention: Template Class CircularQueue { DoubleList dll; ///////////////////////// Setter/Getters Constructors/ destructor Virtual bool Enqueue(type value)=0; Virtual bool Dequeue(type &value)=0; Virtual bool Front (type &value)=0; Virtual bool Rear (type &value)=0; Virtual void Display( )=0; //Any other function } Task is to extend this class by MyCircularQueue and override the above all pure virtual functions. In C++
(IntelliJ) Write an easier version of a linked list with only a couple of the normal linked list functions and the ability to generate and utilize a list of ints. The data type of the connection to the following node can be just Node, and the data element can be just an int. You will need a reference (Java) or either a reference or a pointer (C++) to the first node, as well as one to the last node. * Create a method or function that accepts an integer, constructs a node with that integer as its data value, and then includes the node to the end of the list. If the new node is the first one, this function will also need to update the reference to the first node. This function will need to update the reference to the final node. Consider how to insert the new node following the previous last node, and keep in mind that the next reference for the list's last node should be null. * Create a different method or function that iteratively explores the list, printing the int data values as…
c)Define a class that implementsa singly linked list with the following methods, assuming that the first node of a linked list is referred to by head:i) A constructor.ii) searchNode that takes asparameter an integer value and returns a reference to the node with that value if it is found,and null otherwise. i)addlnOrder that allows insertion of a node to the linked list such that the list remainssorted in ascendingorder.iv) displayList which displays all the nodes in the linked list.d) Assuming that the class defined in part (c) aboveis used to implement a queueofpositive integers, define the following methods which can be used to implement queueoperations:i) isEmptythat returns true if the queue is empty andfalse otherwise.ii) pop that returns the value of the first node if the linked list is not empty,and -1 otherwise.iii) push that takes as parameteran integer value and adds it to the end of the queue.
Implement a LinkedList class that stores integers using dynamic memory and a proper main program to test it. The following member functions need to be properly implemented and tested: 1. Default constructor. 2. Parmetrized Constructor. 3. Sum. 4. Average. 5. InsertAtHead. 6. InsertAtTail. 7. Delete. 8. Pop. 9. Circular. 10. Display. Sample answer is also provided.
Consider the following implementation of double linked list class. public class DLIST<E> { static class Node<E>{ private E data, Node<E> next, Node<E> prev; private Node(E dataItem, Node<E> nextnode, Node<E> prevnode){ // constructor data = dataItem; next = nextnode; prev = prevnode } private Node(E dataItem) { //constructor data = dataItem; next = null; prev=null; } } private Node<E> head=null; private Node<E> tail=null; //initialisation } a) Write a Java method that prints 1st, 3rd, 5th, etc. nodes in the double linked list. b) Write a java method to display the double linked list in the reverse order.
Consider the following implementation of the node and doubly linked-list: Extend the class doubly_linked_list by adding the following methods: *Largest method .This method should return the largest element in a doubly linked-list. *Delete method. This method should delete the first occurrence of an element (value) from a doubly linked-list. USE C++ PLEASE THE CODE : template <class type> class node{public:type info;node<type> * next;// nextnode<type> * prev;//back }; template <class type>class doubly_linked_list {//data membersprivate:node<type> *head, *tail;int length;public:doubly_linked_list(){head = tail = NULL;length = 0;}bool isEmpty(){ // return (head==NULL);if (head == NULL)return true;elsereturn false;} void Append(type e){node<type> *newnode = new node<type>;newnode->info = e;if (isEmpty()){newnode->next = NULL;newnode->prev = NULL;head = newnode;tail = newnode;}else{tail->next = newnode;newnode->prev =…
help with this function C++ Write a recursive method, to be included in an unsorted linked list class, called greater, that will receive an x parameter. The method will print the info of nodes that contain a value that is greater than theparameter.
Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 3. Define TestSLinkedList Classa. Declare an instance of the Single List class.b. Test all the methods of the Single List class.