# UGCNET-Oct2020-II: 16

20 views

Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the time taken to satisfy all the requests if it takes $2$ milliseconds to move from one cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used?

1. $240$ milliseconds
2. $96$ milliseconds
3. $120$ milliseconds
4. $112$ milliseconds

recategorized

Disk requests with head at 20

2  6 10  20  22  38  40

20--->22---->10--->6---->2------>38------>40 total head movements (2+12+4+4+36+2) =60

time= 60x2= 120ms option 3 is the ans

## Related questions

1
35 views
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page reference by an application. If $P$ and $Q$ are the number of page faults that the application ... respectively, then $(P,Q)=$ _______(Assuming enough space for storing $3$ page frames) $(11,10)$ $(12,11)$ $(10,11)$ $(11,12)$
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, and it takes $15$ nanoseconds to search the $TLB$, and $150$ nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds? $185$ $195$ $205$ $175$
Match $\text{List I}$ with $\text{List II}$ ... C-III, D-IVA-II, B-IV, C-III, D-IA-II, B-IV, C-I, D-IIIA-IV, B-III, C-II, D-I$Match$