Question

_________ states that, on a page fault, the frame that has been in memory the longest is replaced.

(a) Belady’s anomaly

(b) Second chance algorithm

(c) Partial second chance algorithm

(d) LRU replacement algorithm

I have been asked this question by my college professor while I was bunking the class.

The above asked question is from Page Replacement Algorithms topic in portion Page Replacement Algorithms of Data Structures & Algorithms II

Answer 1

The correct choice is (a) Belady’s anomaly

Easiest explanation - Belady’s anomaly states that, on a page fault, the frame that has been in memory the longest is replaced. It occurs in FIFO algorithm.