1 1 vote A hard disk has $200$ tracks $($numbered $0$ to $199)$. The disk head is initially located at track $53$. The disk queue contains read/write requests for the following tracks in the order they arrived:$$98,183,37,122,14,124,65,67$$If the Shortest Seek Time First (SSTF) disk scheduling algorithm is used, what is the total number of head movements required to satisfy all requests? Operating System goclasses operating-system goclasses-cs-dpp goclasses-cs-dpp-day-180 goclasses-os-practice-questions numerical-answers + – GO Classes 261 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Movements:$53 \rightarrow 65$ $($Distance: $|65-53|=12)$ $65 \rightarrow 67$ $($Distance: $|67-65|=2)$ $67 \rightarrow 37$ $($Distance: $|37-67|=30) -$ Note$: 37$ is closer to $67$ than $98$ is $($diff $31)$. $37 \rightarrow 14$ $($Distance: $|14-37|=23)$ $14 \rightarrow 98$ $($Distance: $|98-14|=84)$ $98 \rightarrow 122$ $($Distance: $|122-98|=24)$ $122 \rightarrow 124$ $($Distance: $|124-122|=2)$ $124 \rightarrow 183$ $($Distance: $|183-124|=59)$ Total Head Movements: $12+2+30+23+84+24+2+59=\mathbf{2 3 6}$ tracks. GO Classes answered Jan 17 GO Classes comment Share Follow 0 reply Please log in or register to add a comment.
