In which one of the following page replacement policies, Belady's anomaly may occur?
In computer storage, Bélády's anomaly is the phenomenon in which increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns. This phenomenon is commonly experienced when using the First in First Out (FIFO) page replacement algorithm.
So, ans is (A)FIFO
Page Replacement algorithms suffer from Belady’s anamoly if :
Since MRU, LRU & Optimal Replacement Algo follow Stack Algo, hence they are not affected by Belady's Anamoly.
If "Rounded to the nearest integer" is the ...