In the                algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

Related MCQs

• In the              algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.
• The process of dividing a disk into sectors that the disk controller can read and write, before a disk can store data is known as
• The heads of the magnetic disk are attached to a            that moves all the heads as a unit.
• Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
• Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
• SSTF algorithm, like SJF                      of some requests.
• The                    determines the cause of the interrupt, performs the necessary processing and executes a return from the interrupt instruction to return the CPU to the execution state prior to the interrupt.
• An SJF algorithm is simply a priority algorithm where the priority is                          
• When one thread immediately terminates the target thread, it is called                          
• The time taken for the desired sector to rotate to the disk head is called