Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Operating Systems CPU Scheduling Disk Scheduling
Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence:
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used?
1
119 ms
2
120 ms
3
142 ms
4
146 ms