On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume that the head is initially at cylinder 123. Suppose the requests have arrived, forming the following disk queue:123, 874, 692, 475, 105, 376, 499, 542, 789, 645, 12, 923 (i) Perform the computation for the following disk scheduling algorithms: (a) FCFS (b) SSTF (c) SCAN (d) LOOK (ii) Depict the corresponding schemes in the form of a diagram
To compute the number of tracks the disk arm must move for each disk scheduling algorithm, we’ll follow these steps: …