Which of the following disk scheduling strategies is likely to give the best throughput?
Farthest cylinder next
Nearest cylinder next
First come first served
Elevator algorithm
Option (B) and (D) both are acceptable. For more details please check comment of @Vicky rix ji.
@tusharp It should be minimum head movements not maximum as overall seek latency is minimum when head movements are minimum thus maximum throughput.
Correct Answer: $B$
Both B AND D are correct.
D is also correct(see @Vicky rix comment ) and as it's a GATE 1999 question multiple options are possible as answers.
I dont think there can be 2 correct answers for this as it is asking for the BEST, how can two strategies be best simultaneously. What to write if it appears in the exam now…. Other sites like GFG have also given B
Abhineet Singh see question is asking- likely to give the best throughput hence Nearest cylinder next is better option for exam
The only catch in the question is that they are asking for the most likely to give the best throughput.
Even if for some cases SCAN can have better results but the most likely to result the best throughput is Nearest cylinder Algo ;)
64.3k questions
77.9k answers
244k comments
80.0k users