# Queue Operations

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Queue Operations”.

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) Queue**

b) Stack

c) Tree

d) Linked list

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

a) Stack

b) Array**c) Queue**

d) Tree

3. A queue follows __________**a) FIFO (First In First Out) principle**

b) LIFO (Last In First Out) principle

c) Ordered array

d) Linear tree

4. Circular Queue is also known as ________**a) Ring Buffer**

b) Square Buffer

c) Rectangle Buffer

d) Curve Buffer

5. 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) ABDC

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

a) Queue

b) Circular queue**c) Dequeue**

d) Priority 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

8. Queues serve major role in ______________

a) Simulation of recursion

b) Simulation of arbitrary linked list**c) Simulation of limited resource allocation**

d) Simulation of heap sort

9. Which of the following is not the type of queue?

a) Ordinary queue**b) Single ended queue**

c) Circular queue

d) Priority queue