Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 287 |
A B-Tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place ?
| 5 | |
| 6 | |
| 4 | |
| 3 |
Question 287 Explanation:
Each node can contain maximum 4-1=3 elements. And if the 4th element comes to the node then it will get split.
Now let’s try to split the nodes maximum no. of times,
Insert 1,2,3,4
Now let’s try to split the nodes maximum no. of times,
Insert 1,2,3,4
Correct Answer: A
Question 287 Explanation:
Each node can contain maximum 4-1=3 elements. And if the 4th element comes to the node then it will get split.
Now let’s try to split the nodes maximum no. of times,
Insert 1,2,3,4
Now let’s try to split the nodes maximum no. of times,
Insert 1,2,3,4
Subscribe
Login
0 Comments