GATE 2026 DA – Question 32

Database Management and Warehousing · File organization and indexing · 1 mark · Numerical answer

In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records.

Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes.

The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is ________ . (*Answer in integer*)

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: 195

Explanation

A non-leaf node with $n$ node pointers holds $n - 1$ search keys, and it holds no data record pointers. So $10n + 11(n - 1) \le 4096$, which gives $21n \le 4107$ and $n \le 195.6$. The largest whole number is 195.