Q. In _______ information is recorded magnetically on platters.

View solution

Q. The heads of the magnetic disk are attached to a _____ that moves all the heads as a unit.

View solution

Q. The set of tracks that are at one arm position make up a ___________

View solution

Q. The time taken to move the disk arm to the desired cylinder is called the :

View solution

Q. The time taken for the desired sector to rotate to the disk head is called :

View solution

Q. When the head damages the magnetic surface, it is known as _________

View solution

Q. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.

View solution

Q. The host controller is :

View solution

Q. ______ controller sends the command placed into it, via messages to the _____ controller.

View solution

Q. The disk bandwidth is :

View solution

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

View solution

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

View solution

Q. 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 :

View solution

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

View solution

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

View solution

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

View solution

Q. SSTF algorithm, like SJF __________ of some requests.

View solution

Q. 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.

View solution

Q. 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.

View solution

Q. 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.

View solution