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.
Belady’s anomaly is the name given to the phenomenon where increasing the number of page frames results in an increase in the number of page faults for a given memory access pattern.
LRU Page Replacement Algorithm works on a prediction that the pages that have been used more times in the last few instructions will probably be used again and again.
In optimal page replacement algorithm, the page that is not used for a long time in the future is replaced.
Random replacement algorithm replaces a random page in memory. This eliminates the overhead cost of tracking page references.
