## Queue MCQ

1. Which one of the following is an application of Queue Data Structure?

View Answer

2. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

View Answer

3. Let the following circular queue can accommodate maximum six elements with the following data

front = 2 rear = 4

queue = _______; L, M, N, ___, ___

What will happen after ADD O operation takes place?

View Answer

4.How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

View Answer

5.In a Queue, if a user tries to remove an element from empty Queue it is called _________.

View Answer

6. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

View Answer

7.A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same

View Answer

8. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

View Answer

9.If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element in the queue?

View Answer

10.Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

View Answer

**Also Check : **