Question

explain FIFO and LRU With example​

Answer 1

Explanation:

First In First Out (FIFO) –

This is the simplest page replacement algorithm. In this algorithm, the operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal.

LRU cache deletes entry that was accessed least recently if the cache is full