Kizspy | Question: 21 (Choose 1 answer)
Which scenario would the FIFO (First-In-First-Out) page replacement algorithm suffer from the "Belady'sAnomaly"?
A. When the number of frames allocated to a process exceeds the number of pages
B. When the number of frames allocated to a process is less than the number of pages
C. When the number of frames allocated to a process remains constant over time
D. When the number of frames allocated to a process varies randomly
