recategorized by
121,519 views
19 votes
19 votes
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 70, 75, 23, 65$$
which of the two disk scheduling algorithms FCFS (First Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
recategorized by

1 Answer

Best answer
34 votes
34 votes

FCFS : $55 \rightarrow10 \rightarrow70 \rightarrow 75 \rightarrow 23 \rightarrow 65 \Rightarrow 45+60+5+52+42=204.$

SSTF : $55 \rightarrow 65 \rightarrow 70 \rightarrow 75 \rightarrow 23 \rightarrow 10 \Rightarrow  10+5+5+52+13=85$

Hence, SSTF.

edited by

Related questions

24 votes
24 votes
6 answers
4
Kathleen asked Oct 8, 2014
16,187 views
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:$2$$4$$8$None of the above