5.3. Operations

A Queue is a linear data structure that follows the FIFO (First In, First Out) principle. The first element added is the first to be removed.

A Queue is a type of data structure used to manage elements in a specific order. The term FIFO means that the first item added to the queue will be the first one to be removed. This is similar to a line at a store, where the first customer in line is the first to get served.

Think of a queue in a coffee shop. The first person to place their order gets their drink first, and everyone else must wait their turn, leaving the line once they've been served. Each person's experience in the queue represents the order of operations in the data structure.

Operations • enqueue(): Add an element to the rear. • dequeue(): Remove an element from the front. • front(): View the front element. • isEmpty(): Check if the queue is empty.

Queues have specific operations that allow you to interact with them effectively. The 'enqueue' operation lets you add an item to the end, while 'dequeue' removes an item from the front. 'Front' allows you to check what item is currently at the front of the queue without removing it, and 'isEmpty' helps you determine if there are any elements present.

Imagine you're adding passengers to a bus. Each time a new passenger arrives, you enqueue them at the back of the line. When it's time for them to board, the person at the front dequeues and gets on the bus. This process ensures that people board in the order they arrived.

Types of Queues • Simple Queue: Basic FIFO structure. • Circular Queue: Rear connects back to the front to reuse space. • Priority Queue: Elements are removed based on priority, not just order.

There are different variations of queues based on how elements are managed. A Simple Queue follows the basic FIFO order. A Circular Queue reuses space by connecting the back of the queue to the front, thus efficiently handling space when elements are dequeued. A Priority Queue allows some elements to take precedence over others, meaning that even if an element is added later, it might be dequeued first if it has a higher priority.

Consider a Simple Queue as a plain line at a movie theater—everyone waits in order. A Circular Queue is like a roundabout where vehicles can keep circulating until they find their exit. A Priority Queue resembles an emergency room, where patients are treated based on the urgency of their condition, rather than the order they arrived.

Example (Queue Operations in Pseudocode): enqueue(10) enqueue(20) dequeue() // removes 10 front() // returns 20

In the pseudocode, the first operation 'enqueue(10)' adds the number 10 to the queue. The next operation 'enqueue(20)' adds 20. When we call 'dequeue()', it removes the first element in the queue, which is 10, because queues operate on a FIFO basis. Finally, 'front()' checks the current leading element in the queue, which would now return 20 after 10 has been removed.

Imagine you're managing a ticket window. When the first customer—who ordered ticket 10—comes up, they get their ticket and leave. The next person, who ordered ticket 20, is now at the front, ready to get served. Just like in our queue operations, the order of service matters!

--