Queue Concept and FIFO Principle in DSA Python - Build from Scratch

Queue Concept and FIFO Principle

📖 Scenario: Imagine a line of people waiting to buy tickets at a movie theater. The first person to get in line is the first person to get the ticket and leave the line. This is called FIFO - First In, First Out.

🎯 Goal: You will create a simple queue using a list in Python. You will add people to the queue and then remove them in the order they arrived, showing how FIFO works.

📋 What You'll Learn

Create a list called queue with three people in order: 'Alice', 'Bob', and 'Charlie'

Create a variable called new_person and set it to 'Diana'

Add new_person to the end of the queue

Remove the first person from the queue to simulate them getting the ticket

Print the final state of the queue showing the order of people still waiting

💡 Why This Matters

🌍 Real World

Queues are used in real life whenever people or things wait in line, like at banks, supermarkets, or call centers.

💼 Career

Understanding queues helps in programming tasks like managing tasks, handling requests, or processing data in order.

1

Create the initial queue

Create a list called queue with these exact people in order: 'Alice', 'Bob', and 'Charlie'

DSA Python

# Create the queue list with 'Alice', 'Bob', and 'Charlie'
# Your code here

Hint

Use square brackets [] to create a list and separate names with commas.

2

Add a new person to the queue

Create a variable called new_person and set it to 'Diana'

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
# Create a variable new_person and set it to 'Diana'
# Your code here

Hint

Use the equals sign = to assign the string 'Diana' to new_person.

3

Add the new person to the end of the queue

Use the append() method on queue to add new_person to the end

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
new_person = 'Diana'
# Add new_person to the end of queue
# Your code here

Hint

Use queue.append(new_person) to add the new person at the end.

4

Remove the first person from the queue and print the result

Remove the first person from queue using pop(0) to simulate them getting the ticket, then print the final queue

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
new_person = 'Diana'
queue.append(new_person)
# Remove the first person from queue and print the queue
# Your code here

Hint

Use queue.pop(0) to remove the first person, then print(queue) to show the remaining people.

Practice

1. What does FIFO stand for in the context of a queue?

easy

A. First In, Final Output

B. Fast Input, Fast Output

C. Fast In, Fast Out

D. First In, First Out

Solution

1. Step 1: Understand FIFO meaning

   FIFO means the first element added to the queue is the first one to be removed.

2. Step 2: Match the acronym

   First In, First Out exactly matches FIFO.

3. Final Answer:

   First In, First Out -> Option D

4. Quick Check:

   FIFO = First In, First Out [OK]

Hint: Remember queue removes items in order added [OK]

Common Mistakes:

• Confusing FIFO with LIFO
• Thinking FIFO means last in first out
• Mixing up acronym meanings

2. Which of the following is the correct way to add an element '5' to a queue named q in Python using the queue.Queue module?

easy

A. q.put(5)

B. q.push(5)

C. q.enqueue(5)

D. q.add(5)

Solution

1. Step 1: Recall queue.Queue methods

   The Python queue.Queue class uses put() to add elements.

2. Step 2: Identify correct method

   enqueue(), push(), and add() are not valid methods for queue.Queue.

3. Final Answer:

   q.put(5) -> Option A

4. Quick Check:

   Use put() to add in queue.Queue [OK]

Hint: Use put() to add items in Python queue.Queue [OK]

Common Mistakes:

• Using enqueue() which is not in queue.Queue
• Using push() from stack terminology
• Using add() which is not a queue method

3. What will be the output of the following Python code using a list as a queue?

q = []
q.append(10)
q.append(20)
q.append(30)
print(q.pop(0))
print(q)

medium

A. 10
[20, 30]

B. 30
[10, 20]

C. 10
[30, 20]

D. 20
[10, 30]

Solution

1. Step 1: Understand list as queue

   Appending adds to the end: q = [10, 20, 30].

2. Step 2: pop(0) removes first element

   pop(0) removes and returns 10, leaving q = [20, 30].

3. Final Answer:

   10 [20, 30] -> Option A

4. Quick Check:

   pop(0) removes first = 10 [OK]

Hint: pop(0) removes first item in list acting as queue [OK]

Common Mistakes:

• Thinking pop() removes last item
• Confusing append with insert
• Expecting pop(0) to remove last element

4. Identify the error in the following code snippet that tries to implement a queue using a list:

q = []
q.pop()
q.append(1)
print(q)

medium

A. pop() removes last element but queue removes first

B. pop() on empty list causes error

C. append() should be before pop()

D. print() syntax is incorrect

Solution

1. Step 1: Check pop() on empty list

   Initially q is empty, so q.pop() causes IndexError.

2. Step 2: Confirm other statements

   append(1) and print(q) are correct syntax and order does not fix pop on empty.

3. Final Answer:

   pop() on empty list causes error -> Option B

4. Quick Check:

   pop() empty list = IndexError [OK]

Hint: Don't pop from empty list; causes error [OK]

Common Mistakes:

• Ignoring empty list before pop
• Thinking pop() removes first element
• Assuming append order fixes error

5. You have a queue that initially contains [1, 2, 3]. You perform these operations:

q.append(4)
first = q.pop(0)
q.append(first * 10)
print(q)

What is the final state of the queue?

hard

A. [1, 2, 3, 4, 10]

B. [2, 3, 4, 40]

C. [2, 3, 4, 10]

D. [2, 3, 4, 1]

Solution

1. Step 1: Initial queue and append

   Start with q = [1, 2, 3]. After q.append(4), q = [1, 2, 3, 4].

2. Step 2: pop(0) removes first element

   first = q.pop(0) removes 1, so first = 1 and q = [2, 3, 4].

3. Step 3: append first * 10

   q.append(1 * 10) adds 10, so q = [2, 3, 4, 10].

4. Final Answer:

   [2, 3, 4, 10] -> Option C

5. Quick Check:

   Remove first, add 10 times it at end [OK]

Hint: Pop first, multiply, append result at end [OK]

Common Mistakes:

• Appending before popping first
• Multiplying wrong element
• Not updating queue after pop