# UGCNET-Dec2014-III: 51

1.8k views

Consider an imaginary disk with $40$ cylinders. A request come to read a block on cylinder $11$. While the seek to cylinder $11$ is in progress, new requests come in for cylinders $1, 36, 16, 34, 9$ and $12$ in that order. The number of arm motions using shortest seek first algorithm is

1. $111$ ​
2. $112$
3. $60$
4. $61$

recategorized

11-12-9-16-1-34-36 sequence of access..

So 1+3+7+15+33+2=61

selected
0
Can you please  tell me the solution  in detail.

## Related questions

1
655 views
Which of the following versions of Windows $O.S$. contain built-in partition manager which allows us to shrink and expand pre-defined drives ? Windows Vista Windows $2000$ Windows NT Windows $98$
1 vote
Monitor is an Interprocess Communication $(IPC)$ technique which can be described as It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package. It is a non-negative integer which apart ... implemented as system calls to block the process when they are not allowed to enter critical region to save $CPU$ time.
An operating system has $13$ tape drives. There are three processes $P1, P2$ & $P3$. Maximum requirement of $P1$ is $11$ tape drives, $P2$ is $5$ tape drives and $P3$ is $8$ tape drives. Currently, $P1$ is allocated $6$ tape drives, $P2$ is allocated $3$ tape ... is allocated $2$ tape drives. Which of the following sequences represent a safe state? $P2 P1 P3$ $P2 P3 P1$ $P1 P2 P3$ $P1 P3 P2$
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks