4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page

4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page

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

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).…
10.14 A CircularList is used in the implementation of QueueLists. Use Node with a head and tail reference to implement QueueLists in a time and space efficient manner. 10.15 Burger Death must keep track of all orders placed through the drive-through window. Create a data structure to help their ordering system.
Without using C++ queue STL, write a simple menu based selection to insert, delete, show andexit from queue.1. Create a class called Queue with member variable queueArr as integer queue array,integer rear and integer front to keep track both rear and front element in the queuearray.2. Define several member functions in Queue such as aa. constructor – initialize both rear and front to -1b. insert – receive an integer and check if queue is full, if not then insert the integerto the queue arrayc. delete – delete front element from queue if front is not equal to rear (empty)d. display – if rear is not equal to front, then print out the queue array.3. Write a main function to test the Queue class i. Create a class called Queue with member variable queueArr, integerqueue array, integer rear, integer front ii. a. Initialize rear and front to -1b. Receive an integer and check if queue is full, if not theninsert the integer to the queue arrayc. Delete front element from queue if front is not…
Programming Exercise 8 asks you to redefine the class to implement the nodes of a linked list so that the instance variables are private. Therefore, the class linkedListType and its derived classes unorderedLinkedList and orderedLinkedList can no longer directly access the instance variables of the class nodeType. Rewrite the definitions of these classes so that these classes use the member functions of the class nodeType to access the info and link fields of a node. Also write programs to test various operations of the classes unorderedLinkedList and orderedLinkedList. template <class Type>class nodeType{public:const nodeType<Type>& operator=(const nodeType<Type>&);//Overload the assignment operator.void setInfo(const Type& elem);//Function to set the info of the node.//Postcondition: info = elem;Type getInfo() const;//Function to return the info of the node.//Postcondition: The value of info is returned.void setLink(nodeType<Type>…
In Java. The following is a class definition of a linked list Node:class Node{int info;Node next;}Show the instructions required to create a linked list that is referenced by head and stores in order, the int values 13, 6 and 2. Assume that Node's constructor receives no parameters.
The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that Node's constructor receives no parameters. For each line of the code below, explain what memory is being allocated by JVM (Java Virtual Machine). int counter = 0; double dd; String str = "New Label"; Node myNode; myNode = new Node(); Subject: Java Programming
Without using C++ queue STL, write a simple menu based selection to insert, delete, show and exit from queue. 1. Create a class called Queue with member variable queueArr as integer queue array, integer rear and integer front to keep track both rear and front element in the queue array.2. Define several member functions in Queue such as: a) constructor – initialize both rear and front to -1 b) insert – receive an integer and check if queue is full, if not then insert the integer to the queue array c) delete – delete front element from queue if front is not equal to rear (empty)d) display – if rear is not equal to front, then print out the queue array. 3. Write a main function to test the Queue class.
Implement a Doubly linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods1. Define a Node Class.a. Instance Variables # E element - (generics framework) # Node next (pointer) - refer to the next node (Self-referential) # Node prev (pointer) - refer to the previous node (Self-referential)b. Constructorc. Methods # E getElement() //Return the value of this node. # setElement(E e) // Set value to this node. # Node getNext() //Return the next pointer of this node. # setNext(Node n) //Set the next pointer to this node. # Node getPrev() //Return the pointer of this node. # setPrev(Node n) //Set the previous pointer to this node. # displayNode() //Display the value of this node.
/** * This class will use Nodes to form a linked list. It implements the LIFO * (Last In First Out) methodology to reverse the input string. * **/ public class LLStack { private Node head; // Constructor with no parameters for outer class public LLStack( ) { // to do } // This is an inner class specifically utilized for LLStack class, // thus no setter or getters are needed private class Node { private Object data; private Node next; // Constructor with no parameters for inner class public Node(){ // to do // to do } // Parametrized constructor for inner class public Node (Object newData, Node nextLink) { // to do: Data part of Node is an Object // to do: Link to next node is a type Node } } // Adds a node as the first node element at the start of the list with the specified…
1. Write code to define LinkedQueue<T> and CircularArrayQueue<T> classes which willimplement QueueADT<T> interface. Note that LinkedQueue<T> and CircularArrayQueue<T>will use linked structure and circular array structure, respectively, to define the followingmethods.(i) public void enqueue(T element); //Add an element at the rear of a queue(ii) public T dequeue(); //Remove and return the front element of the queue(iii) public T first(); //return the front element of the queue without removing it(iv) public boolean isEmpty(); //Return True if the queue is empty(v) public int size(); //Return the number of elements in the queue(vi) public String toString();//Print all the elements of the queuea. Create an object of LinkedQueue<String> class and then add some names of your friendsin the queue and perform some dequeue operations. At the end, check the queue sizeand print the entire queue.b. Create an object from CircularArrayQueue<T> class and…
// FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)//// TYPEDEFS and MEMBER CONSTANTS for the p_queue class:// typedef _____ value_type// p_queue::value_type is the data type of the items in// the p_queue. It may be any of the C++ built-in types// (int, char, etc.), or a class with a default constructor, a// copy constructor, an assignment operator, and a less-than// operator forming a strict weak ordering.//// typedef _____ size_type// p_queue::size_type is the data type considered best-suited// for any variable meant for counting and sizing (as well as// array-indexing) purposes; e.g.: it is the data type for a// variable representing how many items are in the p_queue.// It is also the data type of the priority associated with// each item in the p_queue//// static const size_type DEFAULT_CAPACITY = _____// p_queue::DEFAULT_CAPACITY is the default initial capacity of a// p_queue that is created by the default…
// FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)//// TYPEDEFS and MEMBER CONSTANTS for the p_queue class:// typedef _____ value_type// p_queue::value_type is the data type of the items in// the p_queue. It may be any of the C++ built-in types// (int, char, etc.), or a class with a default constructor, a// copy constructor, an assignment operator, and a less-than// operator forming a strict weak ordering.//// typedef _____ size_type// p_queue::size_type is the data type considered best-suited// for any variable meant for counting and sizing (as well as// array-indexing) purposes; e.g.: it is the data type for a// variable representing how many items are in the p_queue.// It is also the data type of the priority associated with// each item in the p_queue//// static const size_type DEFAULT_CAPACITY = _____// p_queue::DEFAULT_CAPACITY is the default initial capacity of a// p_queue that is created by the default…