FIFO vs LIFO approach in Programming

FIFO is an abbreviation for first in, first out. It is a method for handling data structures where the first element is processed first and the newest element is processed last. 

Prerequisite - FIFO (First-In-First-Out) approach in Programming 

Real-life example:

LIFO is an abbreviation for Last in, first out is the same as first in, last out (FILO). It is a method for handling data structures where the last element is processed first and the first element is processed last. 

A real-life example is shown below as follows:

Below is a comparison of FIFO vs. LIFO: 

FIFO	LIFO
It stands for First-In-First-Out approach in programming.	It stands for Last-In-First-Out approach in programming.
In this, the new element is inserted below the existing element, So that the oldest element can be at the top and taken out first.	In this, the new element is inserted above the existing element, So that the newest element can be at the top and taken out first.
Therefore, the first element to be entered in this approach, gets out First.	Therefore, the first element to be entered in this approach, gets out Last.
In computing, FIFO approach is used as an operating system algorithm, which gives every process CPU time in the order they arrive.	In computing, LIFO approach is used as a queuing theory that refers to the way items are stored in types of data structures.
Time complexity of inserting element in FIFO is O(1).	Time complexity of inserting element in LIFO is O(1).
The data structure that implements FIFO is Queue.	The data structure that implements LIFO is Stack.

My Personal Notes arrow_drop_up

Save