Peek Front Element of Queue in DSA C - Build from Scratch

Peek Front Element of Queue

📖 Scenario: Imagine a line of customers waiting at a ticket counter. We want to see who is at the front of the line without removing them.

🎯 Goal: You will create a queue of customer IDs, then write code to peek at the front customer without removing them.

📋 What You'll Learn

Create an integer array called queue with exactly these values: 101, 102, 103, 104, 105

Create an integer variable called front_index and set it to 0

Write code to peek the front element of the queue using queue[front_index]

Print the front element using printf with the exact format: "Front element: %d\n"

💡 Why This Matters

🌍 Real World

Queues are used in real life to manage lines, like customers waiting or tasks waiting to be processed.

💼 Career

Understanding queues and how to peek at elements is important for software development, especially in areas like task scheduling and resource management.

1

Create the queue array

Create an integer array called queue with these exact values: 101, 102, 103, 104, 105

DSA C

# Your code here

Hint

Use curly braces to list the values inside the array.

2

Set the front index

Create an integer variable called front_index and set it to 0

DSA C

int queue[] = {101, 102, 103, 104, 105};
# Your code here

Hint

The front of the queue is at index 0 initially.

3

Peek the front element

Create an integer variable called front_element and set it to queue[front_index]

DSA C

int queue[] = {101, 102, 103, 104, 105};
int front_index = 0;
# Your code here

Hint

Use the front_index to get the front element from the queue array.

4

Print the front element

Print the front element using printf with the exact format: "Front element: %d\n" and the variable front_element

DSA C

int queue[] = {101, 102, 103, 104, 105};
int front_index = 0;
int front_element = queue[front_index];
# Your code here

Hint

Use printf to show the front element with the exact text and newline.