To keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked lists. Consider that the linked list approach is used to keep track of free blocks in a file system. Assume that the disk size is 16 GB, block size is 2 KB, and block numbers used are 32-bit long. A single pointer of size 4 bytes is used in each block of the list to point to the next block of the list. The number of blocks required to hold the free disk block numbers is ________. (answer in integer)
Note: 1K = and 1G =
GATE CS 2026 (Afternoon) — Question 53
Operating Systems (OS)File Systems Operations & Disk Scheduling OptimizationNAT2 marksHard
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 2025 (Forenoon) · Q51A 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…
- 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…

