Database-Management-System
January 6, 2024GATE 2005
January 6, 2024Database-Management-System
|
Question 31
|
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:
|
5
|
|
|
4
|
|
|
3
|
|
|
2
|
Question 31 Explanation:
No. of nodes in a children of a node = no. of keys in parent node + 1
Here, the tree has 4 levels, then 4+1=5 nodes to be present in the newly created process.
Here, the tree has 4 levels, then 4+1=5 nodes to be present in the newly created process.
Correct Answer: A
Question 31 Explanation:
No. of nodes in a children of a node = no. of keys in parent node + 1
Here, the tree has 4 levels, then 4+1=5 nodes to be present in the newly created process.
Here, the tree has 4 levels, then 4+1=5 nodes to be present in the newly created process.