Queues Quiz

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

• When a resource is shared among multiple consumers.

• When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes

• Load Balancing

• All of the above

The data structure required for Breadth First Traversal on a graph is?

• Stack

• Queue

• Array

• Tree

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

• Underflow

• Empty collection

• Overflow

• Garbage Collection

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?

• ABCD

• DCBA

• DCAB

• BCDA

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

• AVAIL

• FRONT

• REAR

• None of the mentioned

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?

• rear=(rear%1)+MAX_SIZE

• rear=rear%(MAX_SIZE+1)

• rear=(rear+1)%MAX_SIZE

• rear=rear+(1%MAX_SIZE)

Which of the following is not the type of queue?

• Ordinary queue

• Single ended queue

• Circular queue

• Priority queue

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.

• 1

• 2

• 3

• 4

Which of the following is not an advantage of priority queue?

• Easy to implement

• Processes with different priority can be efficiently handled

• Applications with differing requirements

• Easy to delete elements in any case

What is the term for inserting into a full queue known as?

• overflow

• underflow

• null pointer exception

• program won’t be compiled