Write a C++ program that will generate a queue in which the size of queue will be dependent on the user. Put the numbers in the queue till the queue reaches its size. Create a menu and perform the following function on that queue. Enqueue:Add an element in the end of the queue Dequeue: Remove an element from the front of the queue IsEmpty: Check if the queue is empty IsFull: Check if the queue is full Peek: Get the value of the front of the queue without removing it

Write a C++ program that will generate a queue in which the size of queue will be dependent on the user. Put the numbers in the queue till the queue reaches its size. Create a menu and perform the following function on that queue. Enqueue:Add an element in the end of the queue Dequeue: Remove an element from the front of the queue IsEmpty: Check if the queue is empty IsFull: Check if the queue is full Peek: Get the value of the front of the queue without removing it

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

In C++, Write a program which is menudriven ( i) Enque, ii) Deque, iii) Peek iv) Print). It will create a circularQueue of integer type data using array. You have to implement the followingoperations.a. Enqueue (Insert a data to the queue)b. Dequeue (Remove an item from the queue and printit)c. Peek (Print the item at the Front)Print (Print the elements present at the queue)
Write a c 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. Display 4. 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.
in c++ Write a function that takes a queue with 20 integer values and deletes the elements thatare between 15 and 20. In other words, only the elements less than 15 or greater than 20remain in the queue. This means that you need to have an auxiliary queue to store theelements between 15 and 20 and restore them back to the original queue.
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.
Please implement the following problem in C++: Although a queue is "best" implemented with a list, it can be implemented with a vector if you take into account the starting position of the queue. For example, if five elements are pushed onto the queue, the start of the queue is at position zero and the end is at position 4. If we, then, pop two elements, the start would be at position 2 and the end at position 4. The two "popped" elements are not really removed from the vector, and that avoids the O(N) time problem for the pop function.Implement a class which uses a vector to store the queue. Be mindful of performance, such that if the queue is empty, the size of the underlying vector is "reset."
Write a program in C that performs the following tasks: Store the information about books in the library using a linked list structure. Each book should have the following information: book name, author name, ISBN, and publication year. Allow the user to add a new book to the linked list. Allow the user to delete a book from the linked list based on ISBN. Allow the user to search for a book in the linked list based on book name, author name, ISBN or publication year. Display the list of all books in the library. Note: The program should use the linked list implementation for storing the books and should not use any built-in library functions for linked lists.
Write a java function toRemoves the element at the front of this queue and returns a reference to it. return the element removed from the front of the queue throws EmptyCollectionException if the queue is empty.
Write a function to remove the item that immediately comes before in item X from an integer queue if the item X is repeated then you should remove all the items immediately comes before it don't use different data structures this is the code and its output, is there a way to rephrase this code please ? ( #include<iostream>#include<queue>using namespace std;void fill(queue<int>&q,int z){for(int i=0; i<z; i++)q.push(rand()% 20+1);}void print(queue<int> q){int item;while(!q.empty()){item =q.front();cout<<item<<"\t";q.pop();}cout<<endl<<endl;}void removeBefore(queue<int> &q, int x){queue<int>temp;int item ,prev;while(!q.empty()){prev =q.front();q.pop();int c= q.size();if(q.empty()){q.push(prev);break;}item =q.front();if(item != x)temp.push(prev);if(c == 1){q.pop();temp.push(item);}}while(!temp.empty()){item = temp.front();q.push(item);temp.pop();}}main(){queue<int>q;fill(q, 10);print(q);int x;cout<<"please…
Using c++ I would like to implement a queue as a class with a linked list. This queue Is used to help the class print job in displaying things like: a confirmation of the job request received and the status ( denied/accepted) along with the details such as a tracking number, position in the queue( if accepted), reason for denial (if denied), etc. These classes will be used in a menu-driven application that has the following options: request a print job ask for the job name; the name may have blank spaces and consist of alphanumeric characters only, must start with a letter display a confirmation of the job request received and the status ( denied/accepted) along with the details such as a tracking number, position in the queue( if accepted), reason for denial (if denied), etc execute a print job (remove from the queue ) display a confirmation along with the tracking number, the name of the print job, and the number of print jobs currently in the queue display number of print…
Hi, asked a question earlier regarding the following problem! So sorry, I was able to understand the explanation of the expert, however the code was in C++ which I am still unfamiliar with. Wanted to ask how we can go about solving this problem in java? Question: You have probably heard about the deque (double-ended queue) data structure, which allows for efficient pushing and popping of elements from both the front and back of the queue. Depending on the implementation, it also allows for efficient random access to any index element of the queue as well. Now, we want you to bring this data structure up to the next level, the teque (triple-ended queue)! The teque supports the following four operations: push_back x: insert the element ?x into the back of the teque. push_front x: insert the element ?x into the front of the teque. push_middle x: insert the element ?x into the middle of the teque. The inserted element ?x now becomes the new middle element of the teque. If ?k is the…
Assume q1 is a queue created in the main and q2 is created in a block scope and we write q2=q1 and in the main function we print the items of the q1, if no operator= overload method then then Select one: a. The q1 has the same items of q2 b. The q1 items becomes rubbish c. The q1 becomes empty d. The q1 was not changed
Write a method that uses two data structures, a stack and a queue, to split numbers The numbers must be split into even and odd numbers. If the number is odd and divisible by 3, it is added into the queue; otherwise the top element, if any, of the stack is removed and the square of the number is added onto the stack.