Question 1 |
If a node has K children in B tree, then the node contains exactly _____ keys.
K^{2} | |
K-1 | |
K+1 | |
\sqrt{K} |
Question 1 Explanation:
Question 2 |
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 2 Explanation:
Question 3 |
Consider the following 2-3-4 tree (i.e., B-tree with a minimum degree of two) in
which each data item is a letter. The usual alphabetical ordering of letters is used
in constructing the tree
What is the result of inserting G in the above tree ?
What is the result of inserting G in the above tree ?
A | |
B | |
C | |
None of the above |
Question 3 Explanation:
Question 4 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
A 2-3 tree is such that
a. All internal nodes have either 2 or 3 children
b. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be
A 2-3 tree is such that
a. All internal nodes have either 2 or 3 children
b. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be
4 | |
5 | |
6 | |
7 |
Question 4 Explanation:
There are 4 questions to complete.
Sir, Please check the option b of 3rd question, there “b” is written in 2 nodes.
In option B only one node store B as per figure shown.
please correct option B in question 3 in place of G L there must be HL
We have updated the option.
Thank You.