Queue operations (enqueue, dequeue) in Data Structures Theory - Step-by-Step Execution

Concept Flow - Queue operations (enqueue, dequeue)

Start

↓

Check if enqueue

↓

Add item at rear

↓

Update rear pointer

↓

Update front pointer

↓

End

This flow shows how items are added to the rear of the queue (enqueue) and removed from the front (dequeue), updating pointers accordingly.

Execution Sample

Data Structures Theory

queue = []
queue.append(10)  # enqueue 10
queue.append(20)  # enqueue 20
item = queue.pop(0)  # dequeue
print(item)

This code adds two items to the queue and then removes one from the front, printing the removed item.

Analysis Table

Step	Operation	Queue State	Front Index	Rear Index	Action Description
1	Start	[]	N/A	N/A	Queue is empty, front and rear undefined
2	Enqueue 10	[10]	0	0	Add 10 at rear, front and rear point to index 0
3	Enqueue 20	[10, 20]	0	1	Add 20 at rear, rear moves to index 1
4	Dequeue	[20]	1	1	Remove item at front (10), front moves to index 1
5	End	[20]	1	1	Queue has one item left, front and rear at index 1

💡 No more operations; queue has one item left at index 1

State Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	Final
queue	[]	[10]	[10, 20]	[20]	[20]
front	N/A	0	0	1	1
rear	N/A	0	1	1	1

Key Insights - 3 Insights

Why does dequeue remove the item at the front (index 0) and not the rear?

Because a queue follows FIFO (First In First Out), so the oldest item at the front is removed first, as shown in step 4 of the execution_table.

What happens to front and rear pointers when the first item is enqueued?

Both front and rear point to the same index (0) because the queue has only one item, as shown in step 2 of the execution_table.

Why does the queue state shrink after dequeue?

Because dequeue removes the front item, the queue list removes the first element, shrinking the list, as seen in step 4 where [10, 20] becomes [20].

Visual Quiz - 3 Questions

Look at the execution_table at step 3. What is the rear index after enqueueing 20?

A 0

B 1

C 2

D N/A

💡 Hint

Check the 'Rear Index' column in execution_table row for step 3.

At which step does the queue first contain only one item?

A Step 3

B Step 4

C Step 2

D Step 1

💡 Hint

Look at the 'Queue State' column to see when the queue has one item.

If we dequeue again after step 4, what will happen to the queue?

A Queue becomes empty, front and rear become undefined

B Queue still has one item

C Queue adds a new item

D Queue state does not change

💡 Hint

Consider what happens when the last item is removed from the queue.

Concept Snapshot

Queue operations:
- Enqueue: add item at rear
- Dequeue: remove item from front
- Follows FIFO order
- Front and rear track positions
- Queue shrinks/grows as items removed/added

Full Transcript

A queue is a data structure where items are added at the rear and removed from the front, following First In First Out (FIFO) order. Enqueue operation adds an item at the rear, updating the rear pointer. Dequeue removes the item at the front, updating the front pointer. Initially, when the queue is empty, front and rear are undefined. When the first item is enqueued, both front and rear point to index 0. Each enqueue adds an item at the rear, increasing the rear index. Each dequeue removes the front item, increasing the front index and shrinking the queue. This process continues until the queue is empty again.