adplus-dvertising
frame-decoration

Question

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

a.

positioning time

b.

random access time

c.

seek time

d.

rotational latency

Posted under Operating System

Answer: (c).seek time

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

Q. The host controller is :

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

Q. The disk bandwidth is :

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

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

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 :

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

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

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

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

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.

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.

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.

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

Q. The data structue for a sector typically contains :

Q. The header and trailer of a sector contain information used by the disk controller such as _________ and _________

Q. The two steps the operating system takes to use a disk to hold its files are _______ and ________