Q.Fill in the blank

The Queue Data Structure: A First Look

Imagine you're standing in line at a railway reservation counter. You join at the back, wait your turn, and when you finally reach the front, the clerk serves you and you leave. Everyone else behind you moves one step forward. This everyday experience is the perfect picture of a queue in computer science.

A queue is a collection of elements that follows the First In, First Out (FIFO) principle. The first person to join the line is the first person to be served. The last person to join is the last to be served. In computing, a queue works exactly the same way: the first item you put into the queue is the first item you take out.

The Two Ends of a Queue

Every queue has two distinct ends, and each has a specific name:

• Rear (or back): This is where new elements are added. In our railway line analogy, this is where a new person joins at the back.
• Front: This is where elements are removed. This is the counter where the clerk serves the person at the head of the line.

The key rule is that you can only add at the rear and only remove from the front. You cannot jump the queue, and you cannot take someone out from the middle.

Two Fundamental Operations

A queue supports exactly two basic operations:

• Enqueue: Adding an element to the rear of the queue. The queue grows by one.
• Dequeue: Removing an element from the front of the queue. The queue shrinks by one.

There is also a peek or front operation that lets you look at the element at the front without removing it — like checking who is next in line without serving them yet.

Why Queues Matter in Computing

Queues appear everywhere in computer systems, often invisibly. Here are some real-world examples that a commerce or humanities student would recognise:

• Printer spooling: When multiple people send documents to a shared printer, the documents are placed in a queue. The first document sent is the first one printed. If there were no queue, documents would get mixed up or lost.
• Customer service systems: In a bank or call centre, customers are placed in a queue. The first customer to arrive is the first to be helped. This ensures fairness.
• Ticket booking systems: When thousands of people try to book railway or movie tickets online, the system places requests in a queue. The first request received is processed first.
• Operating system processes: When your computer runs multiple programs, the CPU (the brain of the computer) processes them one by one using a queue. The first program that asks for CPU time gets it first.

How the NCERT Textbook Describes It

The NCERT Computer Science textbook (Class XII) defines a queue as a linear data structure that follows the FIFO principle. It emphasises that insertion happens at one end (rear) and deletion at the other end (front). The textbook also introduces the terms enqueue and dequeue as the standard names for these operations.

The NCERT further explains that queues are used in scenarios where resources are shared among multiple users — exactly like the printer and ticket booking examples above.

A Simple Mental Model

Think of a queue as a pipe open at both ends. You drop marbles in at one end, and they come out at the other end in the same order you dropped them. You cannot take a marble out from the middle. You cannot add a marble at the exit end. The order is preserved perfectly.

This preservation of order is the queue's superpower. While a stack (another data structure) reverses order — last in, first out — a queue keeps everything in its original sequence.

When Would You NOT Use a Queue?

Queues are not suitable when you need to access elements in the middle or at random positions. If you need to jump to a specific item quickly, or if you need to process items in reverse order, a queue will be inefficient. For those cases, other structures like arrays or stacks are better.

But for any situation where first come, first served is the rule, the queue is the natural and elegant solution.