Question 1257 – Nielit STA [02-12-2018]
December 10, 2023Transactions
December 10, 2023Database-Management-System
|
Question 788
|
Consider a B+ tree in which the maximum number of child nodes is 6. What is the minimum and maximum number of keys in such a tree?
|
3 and 4
|
|
|
2 and 5
|
|
|
2 and 4
|
|
|
3 and 5
|
Question 788 Explanation:
→ B+ tree in which the maximum number of child nodes is 6. Maximum number of keys 5.
→ Order is Key(5)+1=6.
→ Minimum children that a node can have would be ⌈6/2⌉ =3.
→ Minimum number of keys that a node can have becomes 3-1=2.
→ Order is Key(5)+1=6.
→ Minimum children that a node can have would be ⌈6/2⌉ =3.
→ Minimum number of keys that a node can have becomes 3-1=2.
Correct Answer: B
Question 788 Explanation:
→ B+ tree in which the maximum number of child nodes is 6. Maximum number of keys 5.
→ Order is Key(5)+1=6.
→ Minimum children that a node can have would be ⌈6/2⌉ =3.
→ Minimum number of keys that a node can have becomes 3-1=2.
→ Order is Key(5)+1=6.
→ Minimum children that a node can have would be ⌈6/2⌉ =3.
→ Minimum number of keys that a node can have becomes 3-1=2.