Question

on Prove the Belady's Anomaly in FIFO page replacement algorithm, assuming
that the number of frames is increased from 3 to 4; For the page reference
strings
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5​

Answer 1

Answer:

While in FIFO, if a page named b came into physical memory before a page – a then priority of replacement of b is greater than that of a, but this is not independent of the number of page frames and hence, FIFO does not follow a stack page replacement policy and therefore suffers Belady's Anomaly.