Question 11496 – APPSC-2012-DL CA
March 27, 2024
Question 11498 – APPSC-2012-DL CA
March 27, 2024
Question 11496 – APPSC-2012-DL CA
March 27, 2024
Question 11498 – APPSC-2012-DL CA
March 27, 2024

Question 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.
A
FCFS
B
SCAN
C
Shortest Seek Time First (SSTF)
D
C-SCAN

Leave a Reply

Your email address will not be published. Required fields are marked *