Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 512 |
In a B tree of order 5, the following keys are inserted as follows :
7, 8, 1, 4, 13, 20, 2, 6 and 5
How many elements are present in the root of the tree ?
| 1 | |
| 2 | |
| 3 | |
| 4 |
Question 512 Explanation:
Since order of B-tree is 5.
⇒ Then maximum no. of key that can be present in a node =5-1=4keys
⇒ Minimum no. keys that can be present in a node =⌈52⌉-1=2 keys
⇒ Now 7, 8, 1, 4 are inserted in a node
⇒ Then maximum no. of key that can be present in a node =5-1=4keys
⇒ Minimum no. keys that can be present in a node =⌈52⌉-1=2 keys
⇒ Now 7, 8, 1, 4 are inserted in a node
Correct Answer: B
Question 512 Explanation:
Since order of B-tree is 5.
⇒ Then maximum no. of key that can be present in a node =5-1=4keys
⇒ Minimum no. keys that can be present in a node =⌈52⌉-1=2 keys
⇒ Now 7, 8, 1, 4 are inserted in a node
⇒ Then maximum no. of key that can be present in a node =5-1=4keys
⇒ Minimum no. keys that can be present in a node =⌈52⌉-1=2 keys
⇒ Now 7, 8, 1, 4 are inserted in a node