I have a system where disk requests come to a disk drive for cylinders in the order 10, 22, 20, 2, 40, and 38 at a time when the disk drive is reading from cylinder 20. The seek time is 6ms per cylinder. I have to find total seek time if the disk scheduling algorithm is First-Come-First-Serve (FCFS).
To find the answer I used a formula:
total seek time=0.254*sqrt(d)(for each cylinder and sum them)
But that gave the incorrect result. What formula(s) should I be using to handle questions like this?