Assertion (A): The Second-Chance (Clock) page replacement algorithm approximates LRU behavior using a simple reference bit.
Reason (R): When a page is chosen, the Clock algorithm inspects the reference bit; if it is 1, it clears the bit to 0 and gives the page a second chance instead of replacing it immediately.
Assertion (A) is True: The Second-Chance (Clock) algorithm is a well-known page replacement strategy designed to approximate LRU behavior using a single reference bit per page.
Reason (R) is True: During execution, the algorithm inspects the reference bit of the candidate page; if it is 1, it resets the bit to 0 and spares the page, moving on to check the next one.
Explanation: This operational mechanism directly implements the second-chance policy to approximate LRU, making Reason (R) the correct explanation for Assertion (A).
Correct Answer: (a) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).