Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

FIFO Principle of Queue

FIFO stands for “First In, First Out”. This principle dictates that the first element added to the queue is the first one to be removed. Understanding the FIFO principle is crucial for anyone working in computer science, especially when dealing with queues.

It ensures that the first task or item you add to the queue is the first to be processed or removed. Whether you’re printing documents, managing tasks, or simulating real-world scenarios, FIFO helps maintain order and fairness.



In Queue Data Structure FIFO has two major operations, Let’s break it down:

Enqueue

When you add an element to the end of the queue, it’s called “enqueuing” that element. This is similar to a person joining the back of the line.



Dequeue

When you remove an element from the front of the queue, it’s called “dequeuing” that element. This is akin to the first person in line being served and leaving.

Why FIFO is Important

FIFO is crucial for many real-life and computer-based scenarios:

Simulating Real-Life Scenarios

Print Queue

Task Scheduling

Example of FIFO in a Queue

Let’s illustrate FIFO with a simple example:

  1. Start with an empty queue.
  2. We enqueue elements A, B, and C in that order.
    • Queue: A, B, C
  3. Now, let’s dequeue an element. As per FIFO, we remove A, the first one added.
    • Queue: B, C
  4. Next, we enqueue D.
    • Queue: B, C, D
  5. Dequeue again, and B is the one to go.
    • Queue: C, D

So, just like standing in line at your favourite coffee shop, remember that the first in line is the first to be served when you encounter queues in your programming journey.

To learn about Queue follow this link!!

Article Tags :
DSA
Queue
Recommended Articles
1. Should we declare as Queue or Priority Queue while using Priority Queue in Java?
2. FIFO (First-In-First-Out) approach in Programming
3. FIFO vs LIFO approach in Programming
4. FIFO Push Relabel Algorithm
5. Program for Page Replacement Algorithms | Set 2 (FIFO)
6. What is Priority Queue | Introduction to Priority Queue
7. Stack and Queue in Python using queue Module
8. Check if a queue can be sorted into another queue using a stack
9. Reversing a Queue using another Queue
10. Difference between Circular Queue and Priority Queue
11. Advantages of circular queue over linear queue
12. Difference between Queue and Deque (Queue vs. Deque)
13. Why can't a Priority Queue wrap around like an ordinary Queue?
14. Can we use Simple Queue instead of Priority queue to implement Dijkstra's Algorithm?
15. Turn a Queue into a Priority Queue
16. Why does Queue have front but Priority-queue has top in stl?
17. What is Circular Queue | Circular Queue meaning
18. Difference Between Linear Queue and Circular Queue
19. Inclusion Exclusion principle for Competitive Programming
20. LIFO Principle in Stack
21. Pigeonhole Principle for CP | Identification, Approach & Problems
22. Inclusion Exclusion principle and programming applications
23. Applications of Queue Data Structure
24. Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)
25. Data Structures | Queue | Question 1