242 views
0 votes
0 votes

image 

A.330 

B.388 

C.279 

D.389

Can someone please give detailed solution to this?

1 Answer

1 votes
1 votes

The header in sorted

17 38 51 67 68 91 121 129 175

Current head is at 51

So seek time = (51-38) + (38-17) + (17-0) + (67-0) + (68-67) + (91-68) + (121-91) + (129-121) + (175-129)

Seek time = 13 + 21 + 17+ 67+ 1+ 23 + 30 + 8 +46 

Seek time = 226

Related questions

430
views
0 answers
0 votes
HeadShot asked Dec 11, 2018
430 views
Answer : Option A Doubt : 0 repeated n-1 times and a single 1 , then how <0,n> ?
406
views
2 answers
0 votes
HeadShot asked Dec 11, 2018
406 views
Why 50 * 3 and not 50+3 ?Does every Byte requires different instruction ?
382
views
0 answers
0 votes
HeadShot asked Dec 11, 2018
382 views
Answer : Option C Please explain ( Why do we need to assume that there were seperate tables related to customer and store ? )
440
views
1 answers
1 votes
HeadShot asked Dec 11, 2018
440 views
Prove S1 without using venn -diagram ( using boolean algebra )