Intermediate
Operating Systems
Q47 / 100
What is the clock (second-chance) page replacement algorithm?
Correct! Well done.
Incorrect.
The correct answer is B) An LRU approximation using a circular buffer and reference bits — pages get a second chance if their reference bit is set
B
Correct Answer
An LRU approximation using a circular buffer and reference bits — pages get a second chance if their reference bit is set
Explanation
The clock algorithm traverses pages in circular order. If reference bit=1, clear it and move on (second chance). If 0, replace it. This approximates LRU efficiently.
Progress
47/100