Queue operations (enqueue, dequeue) in Data Structures Theory - Mini Project: Build & Apply

Queue operations (enqueue, dequeue)

📖 Scenario: Imagine you are managing a line of customers waiting to buy tickets at a movie theater. You need to keep track of who is in line and in what order they arrived.

🎯 Goal: You will build a simple queue system that can add customers to the line (enqueue) and remove customers from the line when they buy their tickets (dequeue).

📋 What You'll Learn

Create a list called queue to hold customer names.

Create a variable called max_size to limit the queue length.

Add a function called enqueue to add a customer to the queue if there is space.

Add a function called dequeue to remove the first customer from the queue.

💡 Why This Matters

🌍 Real World

Queues are used in many places like lines at stores, print job management, and customer service systems to keep things organized and fair.

💼 Career

Understanding queue operations is important for software developers, system administrators, and anyone working with data processing or task scheduling.

1

Create the initial queue list

Create an empty list called queue to represent the line of customers waiting.

Data Structures Theory

# Create an empty list called queue
# Your code here

Hint

Use square brackets [] to create an empty list in Python.

2

Set the maximum queue size

Create a variable called max_size and set it to 5 to limit how many customers can wait in line.

Data Structures Theory

queue = []
# Create a variable max_size and set it to 5
# Your code here

Hint

Just assign the number 5 to the variable max_size.

3

Add the enqueue function

Write a function called enqueue that takes a parameter customer. Inside the function, add the customer to the queue list only if the length of queue is less than max_size.

Data Structures Theory

queue = []
max_size = 5

# Define the enqueue function
# Your code here

Hint

Use len(queue) to check the current number of customers and queue.append(customer) to add a new one.

4

Add the dequeue function

Write a function called dequeue that removes and returns the first customer from the queue list if the queue is not empty.

Data Structures Theory

queue = []
max_size = 5

def enqueue(customer):
    if len(queue) < max_size:
        queue.append(customer)

# Define the dequeue function
# Your code here

Hint

Use queue.pop(0) to remove the first customer from the list.

Practice

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

easy

A. Adds an item to the rear of the queue

B. Removes an item from the front of the queue

C. Checks if the queue is empty

D. Returns the size of the queue

Solution

1. Step 1: Understand enqueue operation

   Enqueue means to add an element to the queue.

2. Step 2: Identify where enqueue adds

   In a queue, new items are added at the rear (end).

3. Final Answer:

   Adds an item to the rear of the queue -> Option A

4. Quick Check:

   Enqueue = Add rear [OK]

Hint: Enqueue always adds at the back of the queue [OK]

Common Mistakes:

• Confusing enqueue with dequeue
• Thinking enqueue removes items
• Assuming enqueue adds at the front

2. Which of the following is the correct syntax to remove an element from a queue in most programming languages?

easy

A. queue.dequeue()

B. queue.enqueue()

C. queue.pop()

D. queue.push()

Solution

1. Step 1: Identify the operation to remove from queue

   Removing an element from a queue is called dequeue.

2. Step 2: Match correct method name

   The standard method to remove is dequeue(), not pop() or push().

3. Final Answer:

   queue.dequeue() -> Option A

4. Quick Check:

   Remove from front = dequeue() [OK]

Hint: Dequeue removes from front, enqueue adds at rear [OK]

Common Mistakes:

• Using pop() which is for stacks
• Confusing enqueue and dequeue methods
• Using push() which adds to stack or queue

3. Consider a queue initially empty. After these operations:
enqueue(5), enqueue(10), dequeue(), enqueue(15), dequeue()
What is the next element to be dequeued?

medium

A. 5

B. 10

C. Queue is empty

D. 15

Solution

1. Step 1: Track queue after each operation

   Start empty: []
   enqueue(5): [5]
   enqueue(10): [5, 10]
   dequeue(): removes 5, queue is [10]
   enqueue(15): [10, 15]
   dequeue(): removes 10, queue is [15]

2. Step 2: Identify next element to dequeue

   Next element at front is 15.

3. Final Answer:

   15 -> Option D

4. Quick Check:

   Remaining front element = 15 [OK]

Hint: Follow FIFO order step-by-step [OK]

Common Mistakes:

• Forgetting to remove elements on dequeue
• Mixing order of enqueue and dequeue
• Assuming queue empties after two dequeues

4. What is wrong with this queue operation sequence?

queue = []
queue.dequeue()

medium

A. Nothing is wrong; it works fine

B. Dequeue on empty queue causes error

C. Queue should be a stack for dequeue

D. Enqueue is missing before dequeue

Solution

1. Step 1: Understand initial queue state

   The queue is empty: [].

2. Step 2: Analyze dequeue on empty queue

   Trying to dequeue when empty causes underflow or error because no element exists to remove.

3. Final Answer:

   Dequeue on empty queue causes error -> Option B

4. Quick Check:

   Empty dequeue = error [OK]

Hint: Never dequeue from an empty queue [OK]

Common Mistakes:

• Assuming dequeue returns null or zero
• Confusing queue with stack behavior
• Ignoring empty state checks

5. You have a queue with elements [2, 4, 6, 8]. You perform these operations:
dequeue(), enqueue(10), dequeue(), enqueue(12), dequeue()
What is the state of the queue after these operations?

hard

A. [4, 6, 8, 10, 12]

B. [6, 8, 10, 12]

C. [8, 10, 12]

D. [10, 12]

Solution

1. Step 1: Track queue after each operation

   Start: [2, 4, 6, 8]
   dequeue(): removes 2 -> [4, 6, 8]
   enqueue(10): add 10 -> [4, 6, 8, 10]
   dequeue(): removes 4 -> [6, 8, 10]
   enqueue(12): add 12 -> [6, 8, 10, 12]
   dequeue(): removes 6 -> [8, 10, 12]

2. Step 2: Confirm final queue state

   The queue now contains [8, 10, 12].

3. Final Answer:

   [8, 10, 12] -> Option C

4. Quick Check:

   Final queue after operations = [8, 10, 12] [OK]

Hint: Remove front, add rear stepwise [OK]

Common Mistakes:

• Not removing correct elements on dequeue
• Adding new elements at front instead of rear
• Losing track of queue order