Question 19
Consider the scenario given below in which the requests are serviced by C-SCAN disk scheduling algorithm.
Start: 12, tracks requested: [11, 0, 3, 4, 14, 8, 17, 9, 1].
Assume there are only 21 tracks in the disk numbered from 0 to 20.
What is the total number of head movements required to service all the requests using the C- SCAN algorithm?