Queue Concept and FIFO Principle in DSA C++ - Build from Scratch

Queue Concept and FIFO Principle

📖 Scenario: Imagine a line at a coffee shop where customers wait their turn. The first customer to arrive is the first to be served. This is called FIFO - First In, First Out. We will create a queue to simulate this line.

🎯 Goal: Build a simple queue using a list to add customers in order and remove them in the same order, demonstrating the FIFO principle.

📋 What You'll Learn

Create a queue using a std::vector<std::string> named queue with initial customers

Add a new customer to the end of the queue

Remove the first customer from the queue to simulate serving

Print the queue after serving to show the order of remaining customers

💡 Why This Matters

🌍 Real World

Queues are used in real life to manage lines, like in banks, supermarkets, or call centers, ensuring fairness by serving in order.

💼 Career

Understanding queues is important for software jobs involving task scheduling, resource management, and handling requests in the order they arrive.

1

Create the initial queue

Create a std::vector<std::string> called queue with these exact customers in order: "Alice", "Bob", "Charlie".

DSA C++

#include 
#include 
#include 

int main() {

    // Create the queue vector with Alice, Bob, Charlie
    // Your code here

    return 0;
}

Hint

Use std::vector<std::string> queue = {"Alice", "Bob", "Charlie"}; to create the queue.

2

Add a new customer to the queue

Add a new customer named "Diana" to the end of the queue using the push_back method.

DSA C++

#include 
#include 
#include 

int main() {
    std::vector queue = {"Alice", "Bob", "Charlie"};

    // Add Diana to the queue
    // Your code here

    return 0;
}

Hint

Use queue.push_back("Diana"); to add Diana at the end.

3

Serve the first customer

Remove the first customer from the queue to simulate serving them. Use queue.erase(queue.begin()) to remove the first element.

DSA C++

#include 
#include 
#include 

int main() {
    std::vector queue = {"Alice", "Bob", "Charlie"};
    queue.push_back("Diana");

    // Remove the first customer from the queue
    // Your code here

    return 0;
}

Hint

Use queue.erase(queue.begin()); to remove the first customer.

4

Print the queue after serving

Use a for loop with variable customer to iterate over queue and print each customer followed by " -> ". After the loop, print "null" to show the end of the queue.

DSA C++

#include 
#include 
#include 

int main() {
    std::vector queue = {"Alice", "Bob", "Charlie"};
    queue.push_back("Diana");
    queue.erase(queue.begin());

    // Print the queue
    // Your code here

    return 0;
}

Hint

Use a for loop to print each customer followed by " -> ", then print "null".

Practice

1. What does the FIFO principle mean in the context of a queue?

easy

A. Last In, First Out - the last element added is the last removed

B. First In, First Out - the last element added is the first removed

C. Last In, First Out - the first element added is the last removed

D. First In, First Out - the first element added is the first removed

Solution

1. Step 1: Understand FIFO principle

   FIFO means the first element that enters the queue is the first one to leave.

2. Step 2: Match FIFO with queue behavior

   Queues follow FIFO, so the first added element is removed first.

3. Final Answer:

   First In, First Out - the first element added is the first removed -> Option D

4. Quick Check:

   FIFO = First In, First Out [OK]

Hint: Remember queue = line; first come, first served [OK]

Common Mistakes:

• Confusing FIFO with LIFO
• Thinking last added is removed first
• Mixing queue with stack behavior

2. Which of the following is the correct way to declare a queue of integers in C++ using STL?

easy

A. queue<int> q();

B. queue q<int>;

C. queue<int> q;

D. queue<int> q[];

Solution

1. Step 1: Recall STL queue syntax

   The correct syntax to declare a queue of integers is queue<int> q; without parentheses or brackets.

2. Step 2: Analyze options

   queue<int> q; matches correct syntax. queue q<int>; has wrong order. queue<int> q(); looks like a function declaration. queue<int> q[]; uses array syntax incorrectly.

3. Final Answer:

   queue<int> q; -> Option C

4. Quick Check:

   Correct STL queue declaration = queue<int> q; [OK]

Hint: Use template syntax: queue<Type> name; [OK]

Common Mistakes:

• Adding parentheses like a function
• Using brackets as if declaring array
• Swapping template and variable names

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

std::queue<int> q;
q.push(10);
q.push(20);
q.push(30);
int x = q.front();
q.pop();
int y = q.front();
std::cout << x << " " << y << std::endl;

medium

A. 10 20

B. 20 30

C. 30 20

D. 10 30

Solution

1. Step 1: Trace queue operations

   Elements pushed in order: 10, 20, 30. Front is 10 initially.

2. Step 2: After pop and front calls

   After q.pop(), 10 is removed. New front is 20. So x=10, y=20.

3. Final Answer:

   10 20 -> Option A

4. Quick Check:

   First out is 10, next front is 20 [OK]

Hint: front() shows first element; pop() removes it [OK]

Common Mistakes:

• Assuming pop() returns value
• Mixing front() and back() values
• Confusing order of elements

4. Identify the error in the following C++ code snippet using queue:

std::queue<int> q;
q.push(5);
q.pop();
int val = q.front();
std::cout << val << std::endl;

medium

A. Accessing front() on an empty queue causes undefined behavior

B. pop() does not remove element from queue

C. push() is used incorrectly

D. Missing include for queue header

Solution

1. Step 1: Analyze queue state after operations

   After push(5), queue has one element. pop() removes it, queue becomes empty.

2. Step 2: Check front() call on empty queue

   Calling front() on empty queue is undefined and causes runtime error.

3. Final Answer:

   Accessing front() on an empty queue causes undefined behavior -> Option A

4. Quick Check:

   front() on empty queue = error [OK]

Hint: Never call front() if queue might be empty [OK]

Common Mistakes:

• Ignoring empty queue before front()
• Thinking pop() returns value
• Assuming push() syntax is wrong

5. You have a queue with elements 1, 2, 3, 4 (front to back). You perform these operations:
q.pop(); q.push(5); q.pop(); q.push(6);
What is the final order of elements in the queue from front to back?

hard

A. 2 -> 3 -> 4 -> 5 -> 6

B. 3 -> 4 -> 5 -> 6

C. 1 -> 2 -> 3 -> 4 -> 5 -> 6

D. 4 -> 5 -> 6

Solution

1. Step 1: Initial queue and first operations

   Queue: 1(front),2,3,4(back). q.pop() removes 1. Queue: 2,3,4. q.push(5) adds 5 at back: 2,3,4,5.

2. Step 2: Remaining operations and final queue

   q.pop() removes 2. Queue: 3,4,5. q.push(6) adds 6 at back: 3,4,5,6.

3. Final Answer:

   3 -> 4 -> 5 -> 6 -> Option B

4. Quick Check:

   After pops and pushes, queue front to back = 3,4,5,6 [OK]

Hint: Pop removes front; push adds to back, track stepwise [OK]

Common Mistakes:

• Forgetting pop removes front element
• Adding push elements at front instead of back
• Not updating queue after each operation