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.

Related MCQs

• 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.
• Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
• SSTF algorithm, like SJF                      of some requests.
• 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 time taken to move the disk arm to the desired cylinder is called the                          
• The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is                          
• The heads of the magnetic disk are attached to a            that moves all the heads as a unit.
• The set of tracks that are at one arm position make up a                        
• An SJF algorithm is simply a priority algorithm where the priority is                          
•                          storage is a system where a robotic arm will connect or disconnect off- line mass storage media according to the computer operating system demands.