# Queue Operations | Data Structure MCQs

1.

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a?

A.) Queue
B.) Stack
C.) Tree

Queue

2.

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

A.) Stack
B.) Queue
C.) Array
D.) Tree

Queue

3.

In Breadth First Search of Graph, which of the following data structure is used?

A.) Stack
B.) Queue
D.) None of the mentioned

Queue

4.

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

A.) Queue
B.) Dequeue
C.) Priority queue
D.) Circular queue

Dequeue

5.

Queues serve major role in

A.) Simulation of recursion
B.) Simulation of arbitrary linked list
C.) Simulation of limited resource allocation
D.) All of the mentioned

Simulation of limited resource allocation

6.

Which of the following is not the type of queue?

A.) Ordinary queue
B.) Single ended queue
C.) Circular queue
D.) Priority queue

Single ended queue

7.

A normal queue, if implemented using an array of size MAX_SIZE, gets full when

A.) Rear = MAX_SIZE – 1
B.) Front = (rear + 1)mod MAX_SIZE
C.) Front = rear + 1
D.) Rear = front

Rear = MAX_SIZE – 1

8.

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?

A.) ABCD
B.) DCBA
C.) DCAB
D.) ABCD

ABCD

9.

A queue is a?

A.) FIFO (First In First Out) list
B.) LIFO (Last In First Out) list
C.) Ordered array
D.) Linear tree