Consider a disk queue holding requests to the followingcylinders in the listed order: 116, 22, 3, 11, 75, 185, 99, 87.Using the C-SCAN scheduling algorithm, what is the order in
which the requests are serviced, assuming the disk head is atcylinder 85 and moving upward through the cylinders? The cylindersare 0 to 199.
Use the graph below for a diagram. Assume each column includes10 cyclinders (i.e first one included 0- 9 etc)
Consider A Disk Queue Holding Requests To The Following Cylinders In The Listed Order 116 22 3 11 75 185 99 87 1 (40.36 KiB) Viewed 51 times