Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. Thedrive is
Chapter 10, Problem 10.11(choose chapter or problem)
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. Thedrive is currently serving a request at cylinder 2,150, and the previousrequest was at cylinder 1,805. The queue of pending requests, in FIFOorder, is:2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681Starting from the current head position, what is the total distance (incylinders) that the disk arm moves to satisfy all the pending requestsfor each of the following disk-scheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer