Algorithms
November 19, 2023GATE 2014 [Set-3]
November 19, 2023GATE 2008
|
Question 41
|
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 41 Explanation:
Let’s take 10 successive key values,
{1,2,3,…,10} which can cause maximum possi ble splits.
1, 2, 3 →
4 →
5 →
6 →
7 →
8 →
9 →
10 →
{1,2,3,…,10} which can cause maximum possi ble splits.
1, 2, 3 →
4 →
5 →
6 →
7 →
8 →
9 →
10 →
Correct Answer: C
Question 41 Explanation:
Let’s take 10 successive key values,
{1,2,3,…,10} which can cause maximum possi ble splits.
1, 2, 3 →
4 →
5 →
6 →
7 →
8 →
9 →
10 →
{1,2,3,…,10} which can cause maximum possi ble splits.
1, 2, 3 →
4 →
5 →
6 →
7 →
8 →
9 →
10 →