A disc consists of ______, ______, ______.
Cylinder, Track and Sector
A storage disc, such as a hard disk drive platter or an older floppy disk, organizes data in a specific manner to allow for efficient reading and writing. The fundamental components that make up the organizational structure of a disc are the cylinder, the track, and the sector.
Let's look at each of these components:
Together, the cylinder, track, and sector provide a hierarchical addressing system for locating data on a disc. Data is identified by its cylinder number, track number (within that cylinder, often implied by surface number), and sector number (within that track).
| Component | Description |
|---|---|
| Track | A circular path on a disc surface where data is stored. |
| Sector | A subdivision of a track, the smallest addressable unit of storage. |
| Cylinder | The set of tracks at the same radius across all surfaces of a multi-platter disc. |
| Term | Relationship to Disc Storage |
|---|---|
| Cylinder | A vertical stack of tracks on multiple platters. |
| Track | A concentric circle on a single platter surface. |
| Sector | A division of a track; the basic unit for data storage. |
Understanding cylinders, tracks, and sectors is key to comprehending how traditional magnetic storage works. Here are a few related concepts:
These components and concepts explain the physical and logical organization of data on magnetic storage discs.
Disc is divided into several concentric circles called _______.
In _______ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.
The total storage capacity of a floppy disk having 80 tracks and storing 128 bytes/sector is 163.840 bytes. How many sectors does this disk have?
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to an adjacent one and Shortest Seek Time First (SSTF) algorithm is used ?