FIFO

Difference Between Stack and Queue

A stack is a LIFO (Last In, First Out) structure where the last element added is the first removed, while a queue is a FIFO (First In, First Out) structure whe…

How Would You Implement a Stack Using Queues?

A stack (LIFO) can be built from one or two FIFO queues by rotating the queue after every push so the newest element sits at the front, which makes push O(n) a…

How Would You Implement a Queue Using Stacks?

A queue (FIFO) can be built from two stacks: an 'in' stack absorbs every enqueue in O(1), and an 'out' stack is refilled by popping everything off 'in' and pus…

What is the FIFO Page Replacement Algorithm?

First-In-First-Out (FIFO) page replacement evicts the page that has been resident in memory the longest, regardless of how recently or frequently it has actual…

What is Belady’s Anomaly?

Belady’s Anomaly is the counter-intuitive situation where increasing the number of page frames available to a process actually increases the number of page fau…

What is a Named Pipe (FIFO)?

A named pipe, or FIFO, is a special filesystem entry that behaves like an anonymous pipe but has a persistent path name, allowing entirely unrelated processes…

What Are Cache Eviction Policies?

A cache eviction policy is the rule a fixed-size cache uses to decide which entry to remove once it is full and a new item needs to be stored, and the choice o…