Queue

What kind of a data structure does a queue is?

• Linear

• Non-Linear

• Both A n B

• None

In Queues, we can insert an element at ___ end and can delete an element at ____ end.

• REAR,FRONT

• FRONT,REAR

• TOP,BOTTOM

• BOTTOM, TOP

. _____ helps us to implement Breadth First Traversal on a graph

Consider P,Q,R and S are the four elements in a queue. If we delete an element at a time then on which order they will get deleted?

• PQRS

• SRQP

• PSQR

• SRQP

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index of__.

• 0

• 7

• 9

• 10

How many stacks are needed to implement a queue?

• 1

• 2

• 3

• 4

In Queue, ENQUEUE means____ whereas DEQUEUE refers____.

• an insertion operation, a deletion operation

• End of the queue, defining a queue.

• Both A and B.

• None of the above are true

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

• Insertion

• Deletion

• To empty a queue

• Both Insertion and To empty a queue

Let the following circular queue can accommodate maximum six elements with the following data.What will happen after ADD O operation takes place?

front = 2 rear = 4

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

• . front = 2 rear = 5

  queue = ______; L, M, N, O, ___

• front = 3 rear = 5

  queue = L, M, N, O, ___

• front = 3 rear = 4

  queue = ______; L, M, N, O, ___

• . front = 2 rear = 4

  queue = L, M, N, O, ___

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