Consider a disk with the 100100 tracks numbered from 00 to 99 rotating at 3000 rpm. The number of sectors per track is 100 and the time to move the head between two successive tracks is 0.2 milliseconds. Consider an initial set of 100100 arbitrary disk requests and assume that no new disk requests arrive while servicing these requests. If the head is initially at track 00 and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
Answers
Answered by
0
Answer:
tyxdtujhxsedtyuhjndxthuyjyf
Explanation:
Similar questions