1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of the front and rear is 0. Now show the state of the queue if the following operation is performed on the queue. Also find the value of front and rear in each step. insert (10); insert (5), delete (), insert (9); insert (9); insert (7); insert (5); insert (8); insert (10); insert (11)

1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of the front and rear is 0. Now show the state of the queue if the following operation is performed on the queue. Also find the value of front and rear in each step. insert (10); insert (5), delete (), insert (9); insert (9); insert (7); insert (5); insert (8); insert (10); insert (11)

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

We can declare a new array and copy the items of the old queue to new and by this, it will extend the size of the queue.
In an array based FIFO queue Q, which of the following is correct about the queue after Q.Dequeue( ) is executed? The size of the array is 9 as shown below: 5 (front) 9 8 7 3(rear) 4 front = 1; rear =8 front = 0; rear =7; front = 2; rear =3; front = 0; rear =8;
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.
If a queue is empty, Select one: A.You can dequeue an element from the queue B.The size of the queue is 1 C.You cannot enqueue an element into the queue. D.You cannot dequeue an element from the queue.
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
Queue abcQ = new Queue (); Queue out = new Queue (); //statements to insert value 1, 2, 3, 4, 5 into abcQ for (int i = 0; i < 5; i++) { int a = Integer.parseInt (abcQ.dequeue ().tostring ()); int b = Integer.parseInt (abcQ.dequeue ().tostring ()); abcQ.enqueue (a); abcQ.enqueue (b); out.enqueue (a + b); for (int i = 0; i < 5; i++) System.out.print (abcQ.dequeue () + " "); System.out.println ("\n") ; for (int i = 0; i < 5; i++) System.out.print (out.dequeue () + " "); (- ks)
Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; this.nextNodeRef = null; } // Constructor public ItemNode(String itemInit, ItemNode nextLoc) {…
If the elements “A”, “B”, “C” and “D” are placed in a queue and are removed one at a time, in what order will they be removed?
2.When you send a file to be printed on a shared printer, it is put onto a printqueue with other jobs. Anytime before your job prints, you can access the queueto remove it. Thus, some queues support a remove operation. Add this method tothe queue implementations. The method should expect an integer index as anargument. It should then remove and return the item in the queue at that position(counting from position 0 at the front to position n –1 at the rear). Use this Python template: class Queue:'''TODO: Remove the "pass" statements and implement each methodAdd any methods if necesssaryDON'T use any builtin queue class to store your items'''def __init__(self): # Constructor functionpassdef isEmpty(self): # Returns True if the queue is empty or False otherwisepassdef len(self): # Returns the number of items in the queuepassdef peek(self): # Returns the item at the front of the queuepassdef add(self, item): # Adds item to the rear of the queuepassdef pop(self): # Removes and returns the…
in java A queue q stores int values. Show what q will look like after each of the following instructions is executed. Show elements from front to rear of the queue. E.g., If you show it as (a,b,c) a is in the font, c in the rear of the queue. q.enqueue(13); q.enqueue(6); q.enqueue(12); q.dequeue(); q.dequeue(); q.enqueue(15); q.enqueue(46); q.dequeue(); q.enqueue(13); q.enqueue(30);
A data structure called a deque is closely related to a queue. The name deque stands for “double-ended queue.” The difference between the two is that with a deque, you can insert, remove, or view from either end of the queue. Implement a deque using arrays
For the Queue use the java interface Queue with the ArrayDeque classFor the Stack use the java Deque interface with the ArrayDeque classFor the LinkedList, use the java LinkedList class Also, when you are asked to create and use a Queue, you can use only those methods pertaining to the general operations of a queue (Enqueue: addLast, Dequeue: removeFirst, and peek() Similarly, when you are asked to create and/or use a stack, you can use only those methods pertaining to the general operations of a Stack (push: addFirst, pop:removeFirst, and peek() ) Your code should not only do the job, but also it should be done as efficiently as possible: fast and uses no additional memory if at all possible Questions Write a method “int GetSecondMax(int[] array)” . this method takes an array of integers and returns the second max value Example: if the array contains: 7, 2, 9, 5, 4, 15, 6, 1}. It should return the value: 9