Multiple Choice
The second-chance page-replacement strategy ________.
A) moves pages found at the head of a FIFO queue with the referenced bit turned on back to the tail of the queue to avoid replacing them
B) searches through a circular list of pages and replaces the first page it encounters that has the referenced bit turned off
C) relies on a modified bit to determine which page to replace
D) none of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q15: Which one of the following statements about
Q16: LRU replaces the page that has spent
Q17: The least-frequently-used (LFU) page-replacement strategy can be
Q18: The average interfault time _ as the
Q19: Which of the following statements about page
Q21: The page-fault-frequency (PFF) strategy adjusts the process's
Q22: Which of the following computer operations involves
Q23: A FIFO page-replacement strategy can be implemented
Q24: NUR is based on the idea that
Q25: The global LRU (gLRU) page-replacement strategy replaces