Question:

Which disk scheduling algorithm looks for the track closest to the current head position?

Show Hint

SSTF minimizes the seek time by choosing the closest track to the current position of the disk head.
Updated On: Sep 25, 2025
  • LOOK
  • SSTF
  • FCFS
  • SCAN
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation


Step 1: Definition of SSTF.
The SSTF (Shortest Seek Time First) disk scheduling algorithm selects the track that is closest to the current head position, thus minimizing the seek time for each disk access.

Step 2: Analysis of other options.
- (1) LOOK: This algorithm moves the head towards the end of the disk and reverses direction when the end is reached, searching for the requested track.
- (3) FCFS: First Come First Serve simply services requests in the order they arrive, without considering the track location.
- (4) SCAN: Similar to LOOK, it moves the head in one direction until it reaches the end, then reverses direction.

Step 3: Conclusion.
The correct answer is **SSTF**, which looks for the track closest to the current head position.

Was this answer helpful?
0
0

Questions Asked in CUET PG exam

View More Questions