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
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
Computer Science & Information Technology
You might also like to view...
When entering text on a slide, you should avoid leaving a single word hanging on a line on its own
Indicate whether the statement is true or false
Computer Science & Information Technology
Evidence need not be locked if it is at a police station.
a. true b. false
Computer Science & Information Technology