Develop an application in java language that stores characters A, B and C in a queue array and then displays both the size and the first-in element of the stack. The application should then remove the first element of the queue and then display both the size and the first-in element of the queue again. Appropriate queue methods should be used to add, delete and display characters.

Develop an application in java language that stores characters A, B and C in a queue array and then displays both the size and the first-in element of the stack. The application should then remove the first element of the queue and then display both the size and the first-in element of the queue again. Appropriate queue methods should be used to add, delete and display characters.

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 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
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.
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.
In C++, develop an algorithm that adds the value val to a queue object Q. The queue is represented using an array data of size s. The algorithm should assume that the queue is not full. The most recently added item is at index r (rear), and the least recently added item is at index f (front). If the queue is empty, r = f = -1.
In a queue implementation using array of size 5, the array index starts with 0 where head and tail values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place. 0 5 1 2
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.
Given the following stack A = {29, 18, 10, 15, 20, 9, 5, 13, 2, 4, 15} Create a queue by taking the elements from the top of the stack and adding them to the queue.
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 program that reads 10 integers anddisplays them in the reverse of the order in which they were read. If two consecutivenumbers are identical, then only display one of them. Implement yourprogram using only stack and not arrays or queues.
A popular way to implement queues using the java.util package is to use the Queue interface. Write an application called Tail, that prints the last k strings found on the standard input (assuming the standard input has k or more strings), using the Queue interface. The user should be able to type java Tail 20 < bigfile.txt
How to create a Stack using queues without using the imported libraries such as util
Given a pointer based queue below: A B C D E F G Assuming the front is on A and the rear is on G, what is the result of enqueueing X and dequeueing one element?