Why Queue Exists and What Problems It Solves in DSA C - See It Work

Understanding Why Queue Exists and What Problems It Solves

📖 Scenario: Imagine you are managing a line of customers waiting to buy tickets at a movie theater. The first person who arrives should be the first person served. This is exactly how a queue works in programming.

🎯 Goal: You will create a simple queue using an array in C. You will add items to the queue, remove items in the order they came, and see how this helps solve real-world problems like managing waiting lines.

📋 What You'll Learn

Create an array-based queue with fixed size

Add elements to the queue (enqueue)

Remove elements from the queue (dequeue)

Show the queue state after operations

💡 Why This Matters

🌍 Real World

Queues are used in real life to manage lines, like customers waiting for service or print jobs waiting to print.

💼 Career

Understanding queues is important for software developers to manage tasks, requests, and resources efficiently.

1

Create the queue array and variables

Create an integer array called queue with size 5, and two integer variables front and rear both set to -1.

DSA C

# Create the queue array and front, rear variables
// Your code here

Hint

Think of front and rear as pointers to the start and end of the line.

2

Add two numbers to the queue

Set front to 0, then add the numbers 10 and 20 to the queue by increasing rear accordingly.

DSA C

int queue[5];
int front = -1;
int rear = -1;
// Set front to 0 and add 10 and 20 to the queue
// Your code here

Hint

Remember to move rear forward after adding each item.

3

Remove one number from the queue

Remove the first number from the queue by increasing front by 1.

DSA C

int queue[5];
int front = -1;
int rear = -1;
front = 0;
rear = 0;
queue[rear] = 10;
rear++;
queue[rear] = 20;
// Remove one item from the queue by moving front
// Your code here

Hint

Increasing front means the first item is no longer in the queue.

4

Print the current queue elements

Use a for loop with i from front to rear inclusive to print each element in queue[i] separated by spaces.

DSA C

int queue[5];
int front = -1;
int rear = -1;
front = 0;
rear = 0;
queue[rear] = 10;
rear++;
queue[rear] = 20;
front++;
// Print queue elements from front to rear
// Your code here

Hint

Only the number 20 should print because 10 was removed.