The second$-$chance page$-$replacement strategy

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 searches through a circular list of pages and replaces the first page it encounters that has the referenced bit turned off relies on a modified bit to determine which page to replace

none of the above