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

Question

Quizplus · Accepted Answer

The second-chance page-replacement strategy involves moving pages with the referenced bit turned on from the head to the tail of the FIFO queue, giving them a "second chance" before being replaced.

The Second-Chance Page-Replacement Strategy ________