File Organization, B-Trees and B+ Trees Indexing: GATE CS previous year questions (Databases)

GATE CS 2026 Set 2MCQ2 marksEasy (estimate)
GATE CS 2026 Set 2, Q.46
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 index. Consider the following tw...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2025 Set 1MSQ1 markMedium (estimate)
GATE CS 2025 Set 1, Q.21
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 following options(...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2025 Set 2NAT2 marksMedium (estimate)
GATE CS 2025 Set 2, Q.57
In a $B^{+}$ -tree where each node can hold at most four key values, a root to leaf path consists of the following nodes…
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2024 Set 1MCQ1 markEasy (estimate)
GATE CS 2024 Set 1, Q.21
In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2024 Set 2MSQ1 markEasy (estimate)
GATE CS 2024 Set 2, Q.26
Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2023NAT2 marksMedium (estimate)
GATE CS 2023, Q.62
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 the primary key occupies 15 b...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2021 Set 1MSQ2 marksHard (estimate)
GATE CS 2021 Set 1, Q.57 (CS Q.47)
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 is used to index into the main hash...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2021 Set 2NAT1 markMedium (estimate)
GATE CS 2021 Set 2, Q.31 (CS Q.21)
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 rec...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2020NAT2 marksMedium (estimate)
GATE CS 2020, Q.64 (CS Q.54)
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 bytes and the size of tree/di...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2019MCQ1 markEasy (estimate)
GATE CS 2019, Q.24 (CS Q.14)
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?
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2017 Set 2NAT2 marksMedium (estimate)
GATE CS 2017 Set 2, Q.49 (CS Q.49)
In a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B+ tree is
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2016 Set 2MCQ1 markEasy (estimate)
GATE CS 2016 Set 2, Q.31 (CS Q.21)
B+ Trees are considered BALANCED because
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2015 Set 1MCQ1 markEasy (estimate)
GATE CS 2015 Set 1, Q.34 (CS Q.24)
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 called:
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2015 Set 2NAT1 markMedium (estimate)
GATE CS 2015 Set 2, Q.16 (CS Q.6)
With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: "...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2015 Set 3NAT2 marksMedium (estimate)
GATE CS 2015 Set 3, Q.56 (CS Q.46)
Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of k...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2014 Set 2MCQ2 marksEasy (estimate)
GATE CS 2014 Set 2, Q.40 (CS Q.30)
Consider a join (relational algebra) between relations $r (R)$ and $s (S)$ using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which on...
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2013MCQ1 markEasy (estimate)
GATE CS 2013, Q.15 (CS Q.15)
An index is clustered, if
File Organization, B-Trees and B+ Trees Indexing
GATE CS 2011MCQ2 marksEasy (estimate)
GATE CS 2011, Q.39 (CS Q.39)
Consider a relational table $r$ with sufficient number of records, having attributes $A_{1}, A_{2}, \dots, A_{n}$ and let $1 \leq p \leq n$ . Two queries Q1 and Q2 are given below. Q1…
File Organization, B-Trees and B+ Trees Indexing

Questions

Other topics of Databases