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

• A. The request will be placed in the queue of pending requests for that drive
• B. The request will not be processed and will be ignored completely
• C. The request will be not be placed
• D. None of the mentioned

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?

• A. 600
• B. 620
• C. 630
• D. 640

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?

• A. 224
• B. 236
• C. 245
• D. 240

Random access in magnetic tapes is _________ compared to magnetic disks.

• A. Fast
• B. Very fast
• C. Slow
• D. Very slow

Magnetic tape drives can write data at a speed ________ disk drives.

• A. Much lesser than
• B. Comparable to
• C. Much faster than
• D. None of the mentioned

On media that use constant linear velocity (CLV), the _____________ is uniform.

• A. Density of bits on the disk
• B. Density of bits per sector
• C. The density of bits per track
• D. None of the mentioned

SSTF algorithm, like SJF __________ of some requests.

• A. May cause starvation
• B. Will cause starvation
• C. Does not cause starvation
• D. Causes aging

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.

• A. Look
• B. Scan
• C. C-scan
• D. C-look

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.

• A. Look
• B. Scan
• C. C-scan
• D. C-look

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.

• A. Look
• B. Scan
• C. C-scan
• D. C-look