Data Structures

Queues

In computer science, a Queue is a linear data structure that follows the First-In, First-Out (FIFO) principle. Think of it exactly like a line at a coffee shop: the first person to get in line is the first person to be served.

The Core Concept: FIFO

The FIFO principle ensures that elements are processed in the exact order they arrived. This makes queues essential for scenarios where timing and order matter, such as print job spooling or handling web requests.

The Queue Interface (ADT)

As an Abstract Data Type (ADT), a queue is defined by its behavior (what it does) rather than its implementation (how it’s coded). A standard Queue ADT supports the following primary operations:

Primary Operations

• enqueue(element): Adds an item to the back (tail) of the queue.

• dequeue(): Removes and returns the item from the front (head) of the queue.

• peek() / front()`: Returns the item at the front without removing it.

Helper Operations

• isEmpty(): Returns a boolean indicating if the queue has no elements.

• size(): Returns the number of elements currently in the queue.

Real-World Applications

• CPU Scheduling: Managing processes waiting for CPU time.

• Breadth-First Search (BFS): Queues are the backbone of BFS in graph theory.

• Buffers: Handling data packets in networking or IO streams where the transmission speed differs from the processing speed.