File systems & disks formulas
File systems and disk scheduling. 12 formulas for GATE CS Operating Systems, each with when to use it. Each is explained in the topic notes.
IAE Academy: File systems and disk scheduling formulas (GATE CS)
All 12 File systems & disks formulas
LINKED ALLOCATION
Applies when each data block stores its own next-block pointer of bytes.
WIDTH OF A BLOCK ADDRESS
A pointer or FAT entry must be able to name every one of the blocks; questions usually round this up to whole bytes.
FAT SIZE
One entry per disk block; the entry must be wide enough to hold any block number.
POINTERS PER BLOCK
Number of block addresses that fit in one index (indirect) block.
LARGEST FILE WITH AN I-NODE
With direct, single, double and triple indirect pointers. Drop the terms for levels the i-node does not have. This is the limit imposed by the pointer scheme; a pointer width or file-size field can impose a smaller limit.
BIT VECTOR SIZE
One bit per block of size bytes.
DISK CAPACITY
Assumes the same number of sectors on every track.
LINEAR SECTOR NUMBER FROM (CYLINDER, HEAD, SECTOR)
heads (surfaces), sectors per track, and , , all numbered from 0, with sectors numbered across a whole cylinder before moving to the next cylinder. If sectors are numbered from 1, use in place of .
DISK ACCESS TIME
Add controller or queueing overhead only if the question gives it.
ROTATION TIME AND AVERAGE LATENCY
On average the wanted sector is half a turn away. If the question says worst case, use a full .
TRANSFER TIME
The head reads one full track per rotation, so time is the fraction of a track passed under the head times the rotation time.
DATA TRANSFER RATE
One track passes under the head per rotation.
Where this was asked: 2018 (1), 2020 (1), 2022 (1), 2025 (1), 2026 (2). See the 6 previous-year questions on File systems & disks. This shows what was asked, not what will be asked.