Queue Operation Test

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

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

3. Queues serve major role in ______________

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

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?

6. 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 _____________

7. Circular Queue is also known as ________

8. A queue follows __________

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