GATE Databases: File Organization and Indexing (B and B+ Trees) – Previous Year Questions
10 GATE previous year questions on File Organization and Indexing (B and B+ Trees) (Databases, Computer Science) with answers and explanations, from every paper.
- GATE 2015 CS Q32 – A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is…
- GATE 2019 CS Q24 – Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
- GATE 2026 CS (CS2) Q46 – An 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 sparse…
- GATE 2025 CS (CS2) Q57 – In 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, -), B = (7, 19,…
- GATE 2025 CS (CS1) Q21 – Consider 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. Which of the…
- GATE 2024 CS (CS2) Q26 – Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?
- GATE 2024 CS (CS1) Q21 – In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
- GATE 2023 CS Q62 – Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which…
- GATE 2021 CS Q57 – Consider a dynamic hashing approach for 4-bit integer keys: (1) There is a main hash table of size 4. (2) The 2 least significant bits of a key are…
- GATE 2020 CS Q64 – Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12…