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
I have been asked this question at a job interview.
The doubt is from Disk Scheduling topic in chapter Mass-Storage Structures of Operating System