Nielit Scientist-B CS 4-12-2016
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 771
|
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?
|
3
|
|
|
4
|
|
|
5
|
|
|
6
|
Question 771 Explanation:
Total 5 splitting will occur during 10 successive insertions.
Let’s take 10 successive key values as {1, 2, 3, … 10} which can cause maximum possible splits.
Let’s take 10 successive key values as {1, 2, 3, … 10} which can cause maximum possible splits.
Correct Answer: C
Question 771 Explanation:
Total 5 splitting will occur during 10 successive insertions.
Let’s take 10 successive key values as {1, 2, 3, … 10} which can cause maximum possible splits.
Let’s take 10 successive key values as {1, 2, 3, … 10} which can cause maximum possible splits.