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)
GATE DA 2026 — Question 32
Database Management and Warehousingfile organization, indexingNAT1 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
- GATE DA 2026 · Q41Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-leaf node i…
- GATE DA 2024 · Q55An OTT company is maintaining a large disk-based relational database of different movies with the following schema: Movie(ID, CustomerRatin…

