Multiple Choice
The working set strategy
A) swaps out a process if OS cannot allocate enough pages to accommodate its working set.
B) swaps in a new process if there is enough memory available to accommodate its working set.
C) keeps the degree of multiprogramming as high as possible while preventing thrashing.
D) All of the above.
Correct Answer:
Verified
Correct Answer:
Verified
Q37: A reaper starts reclaiming pages as soon
Q38: Anonymous memory of a process refers to<br>A)
Q39: Optimal page replacement _.<br>A) is the page-replacement
Q40: Explain the sequence of events that happens
Q41: A sign of thrashing is<br>A) the CPU
Q43: Stack algorithms can never exhibit Belady's anomaly.
Q44: Explain the distinction between global allocation versus
Q45: Prepaging an executable program is much easier
Q46: Some operating systems keep a pool of
Q47: Lock bit is NOT used for which