[amp_mcq option1=”First come first served” option2=”Shortest Seek Time First (SSTE)” option3=”Scan” option4=”FIFO E. None of the above” correct=”option3″]
The correct answer is C. Scan.
First come first served (FIFO) is a disk scheduling algorithm in which requests are serviced in the order in which they are received. This is a simple and fair algorithm, but it can lead to long delays for requests that are far from the current position of the disk arm.
Shortest seek time first (SSTE) is a disk scheduling algorithm in which requests are serviced in the order of their seek time, which is the time it takes the disk arm to move from its current position to the requested track. This is a more efficient algorithm than FIFO, but it can lead to starvation for requests that are far from the current position of the disk arm.
Scan is a disk scheduling algorithm in which the disk arm moves back and forth across the disk surface, servicing all requests in its path. This is a simple and efficient algorithm, but it can lead to long delays for requests that are far from the beginning or end of the disk surface.
The other options are incorrect.