Q1. Explain Belady’s Anomaly.
Ans. It was assumed that increasing the number of page frames in the memory will have the fever page faults in a program. But surprisingly, this is not always the case. The most common example is the FIFO algorithm in which for a particular string the numbers of page faults in 4 frames are more than the number of page faults in 3 frames. This anomalous situation is called as Belady’s Anomaly.