A disk of size 512 M bytes is divided into blocks of 64 K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The link part of the last data block contains a NULL pointer (also of 4 bytes). Suppose a file of 1 M bytes needs to be stored in the disk. Assume, and . The amount of space in bytes that will be wasted due to internal fragmentation is ________. (Answer in integer)
GATE CS 2025 (Forenoon) — Question 51
Operating Systems (OS)File Systems Operations & Disk Scheduling OptimizationNAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on File Systems Operations & Disk Scheduling Optimization
- GATE CS 2026 (Forenoon) · Q59Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 mil…
- GATE CS 2026 (Afternoon) · Q53To keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked li…
- GATE CS 2024 (Forenoon) · Q54Consider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and each sector holds 1024 bytes of data. The number…
- GATE CS 2024 (Afternoon) · Q53Consider a disk with the following specifications: rotation speed of 6000 RPM, average seek time of 5 milliseconds, 500 sectors/track, 512…
- GATE CS 2022 (Forenoon) · Q63Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is alread…
- GATE CS 2021 (Forenoon) · Q25Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the fil…

