#2 C++, make a program (queue linkedlist) like in the image that asks the user to inqueue/dequeue/display queue. The function should be like in the given image. Enter letter of choice: cQueue: 0 1 2 3Enqueue more item? Press y if yes, otherwise press any key: nEnding Enqueue functionRun program again? Press y if yes, otherwise press any key: yWhat do you want to do?a.Inqueue item into the Queueb.Dequeue item into the Queuec.Display queueEnter letter of choice: bHow many items to be dequeued off the Queue?: 1Queue: 1 2 3Dequeue more items? Press y if yes, otherwise press any key: yHow many items to be dequeued off the Queue?: 2Queue: 3Dequeue more items? Press y if yes, otherwise press any key: yHow many items to be dequeued off the Queue?: 2You can't dequeue from an empty Queue What do you want to do?-a.Inqueue item into the Queueb.Dequeue item into the Queuec.Display queueEnter letter of choice: cQueue: NULLRun program again? Press y if yes, otherwise press any key: yWhat do you want to do?a.Inqueue item into the Queueb.Dequeue item into the Queuec.Display queueEnter letter of choice: bYou can't dequeue from an empty QueueRun program again? Press y if yes, otherwise press any key: yWhat do you want to do?a.Inqueue item into the Queueb.Dequeue item into the Queuec.Display queueEnter letter of choice: aQueue:Enqueue more item? Press y if yes, otherwise press any key: yEnter item to the queue: 1Queue: 01Enqueue more item? Press y if yes, otherwise press any key: yEnter item to the queue: 2Queue: 0 1 2Enqueue more item? Press y if yes, otherwise press any key: yEnter item to the queue: 3Queue: 1 2 3Enqueue more item? Press y if yes, otherwise press any key: nEnding Enqueue functionRun program again? Press y if yes, otherwise press any key: yWhat do you want to do?a.Inqueue item into the Queueb.Dequeue item into the Queuec.Display queue

The correct answer for the above mentioned question is given in the following steps for your…

Enter letter of choice: c Queue: 0 1 2 3 Enqueue more item? Press y if yes, otherwise press any key: n Ending Enqueue function Run program again? Press y if yes, otherwise press any key: y What do you want to do? a.Inqueue item into the Queue b. Dequeue item into the Queue c.Display queue Enter letter of choice: b How many items to be dequeued off the Queue?: 1 Queue: 1 2 3 Dequeue more items? Press y if yes, otherwise press any key: y How many items to be dequeued off the Queue?: 2 Queue: 3 Dequeue more items? Press y if yes, otherwise press any key: y How many items to be dequeued off the Queue?: 2 You can't dequeue from an empty Queue

Enter letter of choice: c Queue: 0 1 2 3 Enqueue more item? Press y if yes, otherwise press any key: n Ending Enqueue function Run program again? Press y if yes, otherwise press any key: y What do you want to do? a.Inqueue item into the Queue b. Dequeue item into the Queue c.Display queue Enter letter of choice: b How many items to be dequeued off the Queue?: 1 Queue: 1 2 3 Dequeue more items? Press y if yes, otherwise press any key: y How many items to be dequeued off the Queue?: 2 Queue: 3 Dequeue more items? Press y if yes, otherwise press any key: y How many items to be dequeued off the Queue?: 2 You can't dequeue from an empty Queue

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a C++ program that: (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer, (using the STL implementations), storing strings, using the following hash function: ((first_letter) + (last_letter) - (second_letter))% 15 (2) the driver program should: a. query the user for ten words and store them using the hash technique described above. b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled. c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).
write a full c programmig language:
In Java and in C++ the best way to implement a Stack is by deriving from any implementation of the ADT List. For instance: class Queue : public DoublelinkedList { }; True False
Write a C++ class implementing DOUBLE THREADED BINARY SEARCH TREE that supports the following operations: kthElement(k) -- finds the k-th largest element in the BST and prints the key value. Your code should run in O(h) time. Note: It has be done using double threaded binary search tree. Please comment your code and share the screenshot of the output
5. The creeping problem occurs when a queue is implemented as an array. (a) Define the creeping problem. (b) Describe how to implement a queue as an array in order to avoid the creeping problem. (c) Write the C++ method Join for the new type of Queue described in (b) above.
Computer Science In c++, make a class that displays a piechart. It should be able to change the number of slices, all while being taken in from a queue. The queue should be within its own class as well, for instance, "push" and "pop", should not be the queue/stack c++ has implemented. Be innovative to it and add color!
Suppose you are tasked with implementing a reverse queue in which elements are enqueued at the front and dequeued at the rear The umplementation is dynamic, and your queue class has Node pointers called front and rear, which point to the front and rear nodes in the queue respectively. The Node struct is given below: struct Node char element; Node * next ; }; Implement the dequeue function of the reverse queue which should return the dequeued value. The function prototype is T dequeue () For the toolbar (PCLor ALT+FN+F10 (Mac).
B. Consider a Priority Queue where insertion in the queue is random. Your task is to write a function of DeQueue_All_Highest, where all nodes with highest priority node should be deleted. You will first find the highest priority in the queue and delete all nodes containing highest priority. A node structure is defined as follows struct QNode{ int data; int priority; node * next; };
Write a C++ program to implement circular queue using singly linked list for managing student’s data. Your program should must perform the following specified functions: Enter the record of a new student Delete the record of student Display records of all students Following details should be displayed against each record: Name, Registration Number, Father Name
Implement basic functions of queue, i.e., enqueue, dequeue, front and rare by considering:enqueue 1, enqueue 2, enqueue 3, dequeue, dequeue. Subject : C++
Write a C++ code to push in a queue two modes and print it out. The Node given as: class Node { public: string countryName; string capital; Node *next; ];
In C++,