Question 11496 – APPSC-2012-DL CA
March 27, 2024Question 11498 – APPSC-2012-DL CA
March 27, 2024Question 11497 – APPSC-2012-DL CA
In which Disk scheduling algorithm starvation is possible?
Correct Answer: C
Question 27 Explanation:
In SSTF the request with largest seek time may suffer if a request of low seek time comes.
FCFS
SCAN
Shortest Seek Time First (SSTF)
C-SCAN
Subscribe
Login
0 Comments