GATE 2017 CS (CS2) – Question 59

Databases · File Organization and Indexing (B and B+ Trees) · 2 marks · Numerical answer

A B+ tree has eight-byte search keys, 512-byte blocks and two-byte block pointers. Find its maximum order.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: 52.0 to 52.0

Explanation

For order p, an internal node stores p child pointers and p−1 keys. Thus $2p+8(p-1)\le512$, giving 10p≤520 and p≤52. Therefore maximum order is 52, under the conventional order definition as maximum children.

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

GATE 2013 CS (CS1) Q25 – An index is clustered if
GATE 2011 CS (CS1) Q49 – A large relation r has attributes A₁,…,Aₙ. Q₁ projects A₁,…,Aₙ after selecting Aₚ=c. Q₂…
GATE 2010 CS (CS1) Q28 – A B+ tree allows at most five keys per node. Find the minimum number of keys in any…
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…

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