Tuesday, 31 October 2017

Net 50

CBSE NET JUNE 2015 Paper II

Q. A disk drive has 100 cylinders,numbered 0 to 99. Disk request come to the disk driver for cylinders 12,26,24,4,42,8,50 in that order. The driver is currently serving a request at cylinder 24. A seek takes 6msec per cylinder moved. How much seek time is needed for the shortest seek time first (sstf) algorithm?

A)0.984 sec         
B)0.396 sec         
C)0.738 sec                 
D)0.42 sec

Ans: (D)


Explanation:
SSTF, Shortest time first algorithm
Total cylinder head movements= 02+14+04+04+38+08=70.
Seek time needed=70 x 6 = 420=0.42 sec.

Related topics

Professor Jayesh video tutorial

Please use contact page in this website if you find anything incorrect or you want to share more information about the topic discussed above.