Peek Front Element of Queue in DSA C - Time & Space Complexity

Time Complexity: Peek Front Element of Queue

O(1)

Understanding Time Complexity

We want to understand how long it takes to look at the front item in a queue.

The question is: How does the time to peek change as the queue grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Peek front element of a queue
int peekFront(Queue* q) {
    if (q->front == NULL) {
        return -1; // Queue is empty
    }
    return q->front->data;
}
    

This code returns the value at the front of the queue without removing it.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing the front pointer of the queue.
• How many times: Exactly once per peek operation.

How Execution Grows With Input

Looking at the front element takes the same steps no matter how big the queue is.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time stays constant even if the queue grows larger.

Final Time Complexity

Time Complexity: O(1)

This means peeking the front element takes the same short time no matter how many items are in the queue.

Common Mistake

[X] Wrong: "Peeking the front element takes longer if the queue is bigger because it has to look through all items."

[OK] Correct: The front element is directly accessible via a pointer, so no searching is needed regardless of queue size.

Interview Connect

Knowing that peeking is a quick, constant-time operation helps you explain queue efficiency clearly in interviews.

Self-Check

"What if the queue was implemented using an array without a front pointer? How would the time complexity of peeking change?"

Practice

1. What does the peek operation do in a queue?

easy

A. Returns the front element without removing it

B. Removes the front element

C. Adds an element to the back

D. Checks if the queue is empty

Solution

1. Step 1: Understand the peek operation

   The peek operation looks at the front element of the queue without changing the queue.

2. Step 2: Compare with other operations

   Removing is done by dequeue, adding by enqueue, and checking empty is a separate check.

3. Final Answer:

   Returns the front element without removing it -> Option A

4. Quick Check:

   Peek = front element without removal [OK]

Hint: Peek shows front without removing [OK]

Common Mistakes:

• Confusing peek with dequeue
• Thinking peek adds elements
• Assuming peek checks emptiness

2. Which of the following is the correct C syntax to peek the front element of a queue named q implemented with an array and front index front?

easy

A. int x = q[front];

B. int x = q[rear];

C. int x = q[front + 1];

D. int x = q[0];

Solution

1. Step 1: Identify front element in array queue

   The front element is at index front in the array q.

2. Step 2: Check other options

   rear points to the back, front + 1 is next element, q[0] may not be front if front moved.

3. Final Answer:

   int x = q[front]; -> Option A

4. Quick Check:

   Peek front = q[front] [OK]

Hint: Peek uses front index, not rear or zero [OK]

Common Mistakes:

• Using rear index instead of front
• Adding 1 to front index incorrectly
• Assuming front is always zero

3. What will be the output of the following C code snippet?

int q[5] = {10, 20, 30, 40, 50};
int front = 2;
printf("%d", q[front]);

medium

A. 10

B. 20

C. 30

D. 40

Solution

1. Step 1: Identify the element at index front

   Index 2 in array q is the third element, which is 30.

2. Step 2: Confirm output of printf

   Printing q[front] prints 30.

3. Final Answer:

   30 -> Option C

4. Quick Check:

   q[2] = 30 [OK]

Hint: Array index starts at 0, so q[2] is third element [OK]

Common Mistakes:

• Confusing index 2 with value 20
• Printing q[front + 1] by mistake
• Assuming front is zero

4. Identify the error in this C code snippet that tries to peek the front element of a queue:

int q[3] = {5, 10, 15};
int front = 3;
printf("%d", q[front]);

medium

A. Queue array is empty

B. front index is out of bounds

C. printf syntax error

D. No error, code is correct

Solution

1. Step 1: Check front index validity

   Array q has indices 0 to 2. front = 3 is outside bounds.

2. Step 2: Understand consequences

   Accessing q[3] causes undefined behavior or runtime error.

3. Final Answer:

   front index is out of bounds -> Option B

4. Quick Check:

   front must be within 0 to 2 [OK]

Hint: Front index must be inside array bounds [OK]

Common Mistakes:

• Ignoring array bounds
• Assuming front can be equal to array size
• Thinking printf syntax is wrong

5. Given a circular queue implemented with array q[5], front index front = 4, and rear index rear = 2, which expression correctly peeks the front element?

hard

A. q[front]

B. q[rear]

C. q[(rear + 1) % 5]

D. q[(front + 1) % 5]

Solution

1. Step 1: Understand circular queue front

   In a circular queue, the front element is at index (front + 1) % size, because front points to the last dequeued position.

2. Step 2: Check modulo usage

   Modulo is used to wrap around the array indices correctly.

3. Final Answer:

   q[(front + 1) % 5] -> Option D

4. Quick Check:

   Peek front = q[(front + 1) % size] in circular queue [OK]

Hint: In circular queue, front points behind the front element [OK]

Common Mistakes:

• Using q[front] directly in circular queue
• Confusing rear with front
• Assuming front is always zero