GATE | GATE-CS-2004 | Question 12
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give 50% better benchmark results, what is the expected improvement in the I/O performance of user programs?
(A) 50%
(B) 40%
(C) 25%
(D) 0%
Answer: (D)
Explanation: Since Operating System can execute a single sequential user process at a time, the disk is accessed in FCFS manner always. The OS never has a choice to pick an IO from multiple IOs as there is always one IO at a time
Quiz of this Question
Recommended Posts:
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 1
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 5
- GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 2
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 42
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 55
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 56
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 57
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 58
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 59
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 60
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 61
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 62
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 63
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 64
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 54
