4 4 votes Consider a disk with $200$ tracks $(0-199)$. The current position of the R/W head is at track $50$. The queue of pending requests is: $82,170,43,140,24,16$. If the SSTF (Shortest Seek Time First) algorithm is used, what is the total number of track movements required to satisfy all requests? Operating System goclasses operating-system goclasses-cs-dpp goclasses-cs-dpp-day-200 goclasses-os-practice-questions numerical-answers + – GO Classes 213 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Initial head position$: 50.$ Queue$: 16, 24, 43, 82, 140, 170.$SSTF moves to the nearest request:From $50$, the closest is $\mathbf{4 3}$ $($distance $7)$. Total$: 7$. From $43$, the closest is $\mathbf{2 4}$ $($distance $19)$. Total: $7+19=26$. From $24$, the closest is $\mathbf{1 6}$ $($distance $8)$. Total: $26+8=34$. From $16$, the closest remaining is $\mathbf{8 2}$ $($distance $66)$. Total: $34+66=100$. From $82$, the closest is $\mathbf{1 4 0}$ $($distance $58)$. Total: $\mathbf{1 0 0 + 5 8 = 1 5 8}$. From $140$, the closest is $\mathbf{1 7 0}$ $($distance 30). Total: $158+30=\mathbf{1 8 8}$. GO Classes answered Feb 19 GO Classes comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Explanation Prashant-G answered Jul 14 Prashant-G comment Share Follow 0 reply Please log in or register to add a comment.