In _____ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the request along the way. When the head reaches the…
In _____ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the request along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.
Show answerHide answer
Correct answer: (B) SCAN
Explanation
Note: returning to the beginning without serving requests on the return trip is the defining feature of C-SCAN (option d); the book keys (b). In the SCAN disk scheduling algorithm (as keyed by the book), the disk head moves from one end of the disk to the other, serving requests along the way, and then returns to the beginning without serving requests on the return trip.