Queue vs Stack When to Use Which in DSA Python - Build Both Approaches

Queue vs Stack: When to Use Which

📖 Scenario: Imagine you are managing a line at a coffee shop and a stack of plates in the kitchen. You want to understand how to use a queue and a stack to organize these tasks properly.

🎯 Goal: You will create a queue and a stack using Python lists, add items to each, and then remove items to see how they behave differently. This will help you understand when to use a queue or a stack.

📋 What You'll Learn

Create a queue list with specific customers in order

Create a stack list with specific plates in order

Add a new customer to the queue and a new plate to the stack

Remove one customer from the queue and one plate from the stack

Print the final state of both the queue and the stack

💡 Why This Matters

🌍 Real World

Queues are used in real life when people wait in line, like at a coffee shop or bank. Stacks are used when you stack plates or books and take from the top.

💼 Career

Understanding queues and stacks helps in programming tasks like managing tasks, undo features, and breadth-first or depth-first searches.

1

Create the initial queue and stack

Create a list called queue with these exact customers in order: 'Alice', 'Bob', 'Charlie'. Also create a list called stack with these exact plates in order: 'Plate1', 'Plate2', 'Plate3'.

DSA Python

# Create the queue and stack lists with the given items
# Your code here

Hint

Use square brackets to create lists and separate items with commas.

2

Add a new customer to the queue and a new plate to the stack

Add 'David' to the end of the queue list using the append() method. Also add 'Plate4' to the end of the stack list using the append() method.

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
stack = ['Plate1', 'Plate2', 'Plate3']
# Add 'David' to queue and 'Plate4' to stack
# Your code here

Hint

Use list.append(item) to add an item to the end of a list.

3

Remove one customer from the queue and one plate from the stack

Remove the first customer from the queue list using pop(0). Remove the last plate from the stack list using pop() without arguments.

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
stack = ['Plate1', 'Plate2', 'Plate3']
queue.append('David')
stack.append('Plate4')
# Remove first customer from queue and last plate from stack
# Your code here

Hint

Use pop(0) to remove the first item from a list (queue behavior) and pop() to remove the last item (stack behavior).

4

Print the final state of the queue and stack

Print the queue list and then print the stack list to show their final states after the removals.

DSA Python

queue = ['Alice', 'Bob', 'Charlie']
stack = ['Plate1', 'Plate2', 'Plate3']
queue.append('David')
stack.append('Plate4')
queue.pop(0)
stack.pop()
# Print the final queue and stack
# Your code here

Hint

Use print() to display the lists.

Practice

1. Which data structure should you use when you want to process items in the exact order they arrive, like people standing in a line at a ticket counter?

easy

A. Queue

B. Stack

C. Tree

D. Graph

Solution

1. Step 1: Understand the order of processing

   People in line are served in the order they arrive, which is First In First Out (FIFO).

2. Step 2: Match the data structure to FIFO

   A Queue follows FIFO, so it fits this scenario perfectly.

3. Final Answer:

   Queue -> Option A

4. Quick Check:

   FIFO = Queue [OK]

Hint: Use Queue for FIFO order, like lines [OK]

Common Mistakes:

• Confusing Stack with Queue
• Thinking Stack processes in arrival order
• Choosing Tree or Graph for simple order

2. Which of the following is the correct way to add an element to a stack in Python using a list named stack?

easy

A. stack.enqueue(element)

B. stack.push(element)

C. stack.append(element)

D. stack.insert(0, element)

Solution

1. Step 1: Recall Python list methods for stack

   Python lists use append() to add elements at the end, simulating stack push.

2. Step 2: Check other options

   enqueue() and push() are not list methods; insert(0, element) adds at front, not top of stack.

3. Final Answer:

   stack.append(element) -> Option C

4. Quick Check:

   Stack push = append() in Python [OK]

Hint: Use append() to push on Python list stack [OK]

Common Mistakes:

• Using enqueue() which is for queues
• Using push() which is not a Python list method
• Inserting at index 0 which is queue front

3. What will be the output of the following Python code?

from collections import deque
q = deque()
q.append(10)
q.append(20)
q.popleft()
print(list(q))

medium

A. [20]

B. [10, 20]

C. [10]

D. []

Solution

1. Step 1: Trace the queue operations

   Append 10 and 20 to the right end: queue = [10, 20].

2. Step 2: Remove from left with popleft()

   popleft() removes 10, queue becomes [20].

3. Final Answer:

   [20] -> Option A

4. Quick Check:

   popleft removes first item, leaving [20] [OK]

Hint: popleft() removes from front in deque [OK]

Common Mistakes:

• Thinking popleft() removes from end
• Confusing append() with appendleft()
• Expecting both elements after popleft()

4. The following code is intended to implement a stack using a Python list. What is the error?

stack = []
stack.push(5)
stack.push(10)
print(stack)

medium

A. stack must be initialized with None

B. stack should be a deque, not list

C. print statement syntax error

D. push() is not a valid list method

Solution

1. Step 1: Check list methods for adding elements

   Python lists do not have a push() method; they use append().

2. Step 2: Verify other options

   Using list is fine for stack; print syntax is correct; initialization with None is unnecessary.

3. Final Answer:

   push() is not a valid list method -> Option D

4. Quick Check:

   List push() error = use append() [OK]

Hint: Use append() to push on list, not push() [OK]

Common Mistakes:

• Using push() instead of append()
• Thinking deque is required for stack
• Assuming print syntax is wrong

5. You need to design a system that tracks the most recent 5 user actions and allows undoing the last action. Which data structure is best and why?

hard

A. Queue, because it processes actions in order

B. Stack, because it allows undoing the last action first

C. Graph, because it stores complex relationships

D. Set, because it avoids duplicate actions

Solution

1. Step 1: Understand the undo requirement

   Undo means reversing the last action first, which is Last In First Out (LIFO).

2. Step 2: Match data structure to LIFO

   A Stack follows LIFO, so it is ideal for undo functionality.

3. Step 3: Check other options

   Queue is FIFO, not suitable; Graph and Set do not fit undo order needs.

4. Final Answer:

   Stack, because it allows undoing the last action first -> Option B

5. Quick Check:

   Undo = LIFO = Stack [OK]

Hint: Undo needs LIFO, so use Stack [OK]

Common Mistakes:

• Choosing Queue for undo
• Confusing Set or Graph for order
• Ignoring LIFO requirement