DATA STRUCTURES AND ALGORITHMS SESSION 5 PPT. pptx

Queues – Queue Operations and Circular Queues

1. Queues – Queue Operations and Circular Queues

2. 1. What is the difference between a stack and a queue?

3.  A stack follows LIFO (Last In, First Out) order, meaning the last element added is the first one removed.  A queue follows FIFO (First In, First Out) order, meaning the first element added is the first one removed.

4. 2. In a queue, which element is removed first?

5. The first element inserted (front element) is removed first, following the FIFO principle.

6. 3. Define enqueue operation.

7. Enqueue is the operation of inserting (adding) an element at the rear (end) of the queue.

8. 4. What type of queue allows reusing empty spaces at the front?

9. A circular queue allows reusing empty spaces at the front once elements have been dequeued , preventing wasted memory.

10. 5. True or False: A queue follows LIFO order.

11. False. A queue follows FIFO (First In, First Out) order, not LIFO.

12. Have you ever lined up in a cafeteria or a ticket booth? How does it relate to how data is processed in queues?