GATE CS 2015 Set 2 — Question 34

Numerical answer 1 mark Question 34 2015

Question 34

NAT 1 marks · no negative Databases

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 the block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2015 Databases

Source: GATE 2015 Computer Science and Information Technology, Set 2 (question number approximate)

All Databases questions