Question

In the _______ algorithm, the disk head moves from one end to the other , servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK

Answer 1

The C-SCAN algorithm is used in disk scheduling to minimize average response time and prevent indefinite waiting for requests.

Step-by-step explanation:

The correct answer is C-SCAN.

In the C-SCAN algorithm, the disk head moves from one end to the other, servicing requests along the way. However, when the head reaches the other end, instead of immediately returning to the beginning of the disk, it moves to the other end again without servicing any requests.

This algorithm is often used in disk scheduling to minimize the average response time and prevent indefinite waiting for requests that are far from the current position of the disk head.