A data file consisting of 1,50,000 student-records is stored on a hard disk with block size of 4096 bytes. The data file is sorted on the primary key RollNo. The size of a record pointer for this disk is 7 bytes. Each student-record has a candidate key attributed called ANum of size 12 bytes. Suppose an index file with records consisting of two fields, ANum value and the record pointer to the corresponding student record, is built and stored on the same disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is _________.
GATE CS 2021 (Afternoon) — Question 31
Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)NAT1 markMedium
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 Organization & Indexing (e.g., B and B+ Trees)
- GATE CS 2026 (Afternoon) · Q46An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a s…
- GATE CS 2025 (Forenoon) · Q21Consider the following B + tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the B + tree.…
- GATE CS 2025 (Afternoon) · Q57In a B+ - tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: A = (49, 77, 83, –),…
- GATE CS 2024 (Forenoon) · Q21In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
- GATE CS 2024 (Afternoon) · Q26Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?
- GATE CS 2023 (Forenoon) · Q62Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes,…

