Multiple Choice
Optimal page replacement ____.
A) is the page-replacement algorithm most often implemented
B) is used mostly for comparison with other page-replacement schemes
C) can suffer from Belady's anomaly
D) requires that the system keep track of previously used pages
Correct Answer:
Verified
Correct Answer:
Verified
Q34: The dirty (modify) bit identifies<br>A) a page
Q35: Explain the concept behind prepaging.
Q36: The current best practice to avoid thrashing
Q37: A reaper starts reclaiming pages as soon
Q38: Anonymous memory of a process refers to<br>A)
Q40: Explain the sequence of events that happens
Q41: A sign of thrashing is<br>A) the CPU
Q42: The working set strategy<br>A) swaps out a
Q43: Stack algorithms can never exhibit Belady's anomaly.
Q44: Explain the distinction between global allocation versus