CHAPTER 4- QUEUES

1. What is a Queue?

• A data structure where elements are added and removed from the same end

• A data structure where elements are added at one end and removed from the other end

• A data structure where elements are added and removed randomly

• A data structure where elements are added in the middle.

2. Which are the basic operations involved in a Queue?

• Insert and Pop

• Enqueue and Dequeue

• Dequeue and Remove

• Insert and Delete

3. Which principle does Queue follow?

• FIFO (First In First Out)

• LIFO (Last In First Out)

• FILO (First In Last Out)

• Random Order

4. Where are new items inserted in a Queue?

• Top of the Queue

• Middle of the Queue

• Front of the Queue

• Rear of the Queue

5. How are elements removed from a Queue?

• From the rear of the Queue

• From the middle of the Queue

• From the front of the Queue

• Randomly

6. Which of the following is an example of Queue in real-world applications?

• A line of customers at a store

• A pile of laundry

• A group of students in a classroom

• A collection of books on a shelf

Enqueue operation is performed at:

• Front of the Queue

• Rear of the Queue

• Middle of the Queue

• Any location

What is the main difference between a Queue and a Stack?

• Queue uses LIFO, Stack uses FIFO

• Queue uses FIFO, Stack uses LIFO

• Both use FIFO

• Both use LIFO

What is the name of the Queue data structure that allows wrapping around from the rear end to the front?

• Linear Queue

• Linked List

• Circular Queue

• Queue Tree

What happens if a Queue is full when trying to perform Enqueue?

• Queue Overflow

• Queue Underflow

• Queue Wrap Around

• Queue Reset