(Choose 1 answer)
The second-chance page-replacement algorithm
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 other choices
Exit 2
