Prerequisite – FIFO (First-In-First-Out) 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.
Real life example:
LIFO is an abbreviation for Last in, first out is same as fist 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.
Real life example:
Below is a comparison of FIFO vs. 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.|
|The data structure that implements FIFO is Queue.||The data structure that implements LIFO is Stack.|
- LIFO (Last-In-First-Out) approach in Programming
- FIFO (First-In-First-Out) approach in Programming
- Print Bottom-Right View of a Binary Tree
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Bit manipulation | Swap Endianness of a number
- Introduction to Data Structures | 10 most commonly used Data Structures
- Count index pairs which satisfy the given condition
- Difference between data type and data structure
- Count distinct points visited on the number line
- Maximum number of leaf nodes that can be visited within the given budget
- Subroutine, Subroutine nesting and Stack memory
- Johnson’s algorithm for All-pairs shortest paths | Implementation
- Sentence that contains all the given phrases
- Check if two trees have same structure
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : RamanMittal