Introduction to Queues

A queue is a fundamental data structure that operates on a FIFO (First In, First
Out) principle, meaning the first element added is the first to be removed. It is
widely used in daily life, such as waiting lines at stores, or print queues where
tasks are processed in order.

Key terms include enqueue, which means adding an element to the rear;
dequeue, removing from the front; and pointers like front and rear which track
the ends of the queue. Understanding these basics prepares us to explore
different types and operations of queues.

by KES SHROFF COLLEGE

Types of Queues
Simple Queue (Linear Queue) Circular Queue
Elements are added at the rear and removed from the front, following Rear connects back to front, enabling efficient reuse of space.
FIFO strictly.

Priority Queue Double-Ended Queue (Deque)

Elements have priorities; highest priority elements are dequeued first. Supports insertion and deletion at both ends, offering flexibility.
Simple Queue (Linear Queue)
Definition Limitation
Elements are inserted at the Once the queue moves
rear and removed from the forward, the space at the front
front in a linear manner. becomes unusable, causing
memory wastage.

Example
Commonly seen in ticket lines where the queue moves in a straight
linear path.
Circular Queue
Definition Advantages Implementation

The rear end wraps around to the front, • Efficient memory usage Uses modulo operator (%) for circular
forming a circle, maximizing space • Prevents wastage caused by linear indexing to manage rear and front
utilization. queues pointers.

Example: Used extensively in CPU

scheduling algorithms to manage process
queues.
Priority Queue
Definition Types Implementation

Elements are dequeued based on priority • Min-Priority Queue: lowest value has Implemented using arrays, linked lists, or
rather than arrival time. highest priority heaps for efficient priority handling.
• Max-Priority Queue: highest value has
Typical use case includes patient
highest priority
management in emergency rooms where
critical patients are treated first.
Double-Ended Queue (Deque)
Definition Types Use Cases
Allows insertion and deletion of • Input-restricted Deque: insertion Used in undo/redo features in software
elements at both the front and rear restricted to one end and managing browser history for
ends. • Output-restricted Deque: deletion forward/backward navigation.
restricted to one end
Basic Queue Operations
Enqueue Dequeue Peek/Front
Add an element to Remove an element View the element at
the rear of the from the front of the the front without
queue. queue. removing it.

IsEmpty / IsFull
Check whether the
queue is empty or
full to prevent
errors.
Enqueue and Dequeue
Algorithms
Enqueue Algorithm
1. Check if queue is full to avoid overflow.
2. If not full, increment the rear pointer.
3. Place the new element at the rear position.

Dequeue Algorithm
1. Check if queue is empty to avoid underflow.
2. If not empty, retrieve the element at the front.
3. Increment the front pointer to remove the element.
Applications of Queues
Operating Systems Networking Data Structure Simulations
Algorithms
Queues handle process Routers use packet queues to Models real-world scenarios
scheduling and I/O manage data flow and avoid Key component in Breadth- such as bank queues or traffic
management ensuring congestion. First Search (BFS) for graph lines for analysis and
fairness. traversal and shortest paths. optimization.
Benefits and Conclusion
Fairness with FIFO
Ensures that elements or tasks are processed in the exact order of arrival without
bias.

Efficient Request Handling

Queues can manage multiple requests or tasks, ensuring smooth and predictable
processing.

Versatility
Applicable in numerous fields from computer science to everyday life for orderly
management.

Fundamental Data Structure

Queues form the backbone of many algorithms and system components, making
them essential learning.