GATE 2010 CS (CS1) – Question 28

Databases · File Organization and Indexing (B and B+ Trees) · 1 mark · Multiple choice

A B+ tree allows at most five keys per node. Find the minimum number of keys in any nonroot node.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) 2

Explanation

An internal node has at most six children and must have at least ceil(6/2)=3 children when nonroot. It therefore has at least three minus one = two separator keys. Leaf occupancy rules can impose a different minimum, but the smallest across all nonroot nodes is two, B.

More File Organization and Indexing (B and B+ Trees) questions

GATE 2015 CS (CS2) Q32 – For the B+ tree of order 1 shown, find the minimum number of index nodes, including the…
GATE 2015 CS (CS3) Q39 – A B+ tree has 12-byte search keys, 1024-byte blocks, 10-byte record pointers and 8-byte…
GATE 2021 CS (CS2) Q31 – A sorted data file has 150000 student records and 4096-byte blocks. Disk record pointers…
GATE 2026 CS (CS2) Q46 – An index in a DBMS is said to be dense if an index entry appears for every search-key…
GATE 2025 CS (CS1) Q21 – Consider the following B+ tree with 5 nodes, in which a node can store at most 3 key…
GATE 2025 CS (CS2) Q57 – In a B+-tree where each node can hold at most four key values, a root to leaf path…

All File Organization and Indexing (B and B+ Trees) questions →