Whenever a process needs I/O to or from a disk it issues a ______________

If a process needs I/O to or from a disk, and if the drive or controller is busy then ____________

Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67. Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

SSTF algorithm, like SJF __________ of some requests.

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.

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.

In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses direction immediately without going to the end of the disk.

The data structure for a sector typically contains ____________

The _______ program initializes all aspects of the system, from CPU registers to device controllers and the contents of main memory, and then starts the operating system.