3 votes 3 votes A disk drive has $100$ cylinders, numbered $0$ to $99$. Disk requests come to the disk driver for cylinders $12, 26, 24, 4, 42, 8$ and $50$ in that order. The driver is currently serving a request at a cylinder $24$. A seek takes $6$ msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? $0.984$ sec $0.396$ sec $0.738$ sec $0.42$ sec Operating System ugcnetcse-june2015-paper2 operating-system disk-scheduling + – go_editor asked Jul 30, 2016 edited Jun 6, 2020 by go_editor go_editor 9.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes 12, 26, 24, 4, 42, 8 and 50 24-26-12-8-4-42-50 sequence of access Total (2+14+4+4+38+8) *6ms =( 70*6 /1000 )sec = 420/1000 = 0.42sec papesh answered Jul 31, 2016 selected Jan 5, 2017 by papesh papesh comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes seek time = 2 =(2 + 14 + 4 + 4 + 38 + 8) = 420 msec 1000 msec = 1 sec 420 msec = 0.42 sec So, option (D) is correct. Prasanjeet Ghosh answered Jun 25, 2018 Prasanjeet Ghosh comment Share Follow See all 0 reply Please log in or register to add a comment.