Shortest Seek Time First (SSTF), a disk scheduling algorithm, is referred to as SSTF.
Before moving the head aside to handle other requests, it chooses the request that is closest to the position of the head at that moment. There are 500 tracks total. 100 sectors per track are needed. 500 bytes each sector are used. The head moves from one track to the adjacent track in 1 ms. 600 rpm is the rotation speed. The disk I/O request that requires the least amount of disk arm movement from its current position, regardless of direction, is chosen by the algorithm known as "shortest seek time first" (SSTF). Compared to FCFS, it decreases the overall seek time. The head can then move to the quickest track in the service line as a result.
Learn more about decreases here-
https://brainly.com/question/15224197
#SPJ4