Shortest seek time first (SSTF) – Operating System
| Question 1 UGC NET June-2020 Â Â Â Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders 10, 22, 20, 2, 40, 6 and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used? |
| A – 240 milliseconds |
| B – 96 milliseconds |
| C – 120 milliseconds |
| D – 112 milliseconds |