n $\_\_\_\_$ disk scheduling algorithm, the disk head moves from one end to the other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the begining of the disk without serving any requests on the return trip.

Shortest$-$position$-$time first $($SPTF$)$

Shortest$-$seek time first $($SSTF$)$

Scan

C$-$Scan