(a) Consider a set of disk requests to read data from tracks $$32, 7, 45, 5$$ and $$10.$$ Assuming that the elevator algorithm is used to schedule disk requests, and the head is initially at track $$25$$ moving up (towards larger track numbers),
what is the total seek time for servicing the requests?
(b) Consider an initial set of $$100$$ arbitrary disk requests and assume that no new disk requests arrive while servicing these requests. If the head is initially at track $$0$$ and the elevator algorithm is used to schedule disk requests, what is the worst case time to complete all the requests?
(a) What is the total capacity of the disk?
(b) What is the data transfer rate?
(c) What is the percentage of time the $$CPU$$ is required for this disk $${\rm I}/O$$ for byte-wise interrupts driven transfer?
(d) What is the maximum percentage of time the $$CPU$$ is held up for this disk $${\rm I}/O$$ for cycle-stealing $$DMA$$ transfer ?
GATE CSE Papers
All year-wise previous year question papers