1
GATE CSE 2016 Set 2
+1
-0.3
B+ Trees are considered BALANCED because
A
the lengths of the paths from the root to all leaf nodes are all equal.
B
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
C
the number of children of any two non-leaf sibling nodes differ by at most 1.
D
the number of records in any two leaf nodes differ by at most 1.
2
GATE CSE 2015 Set 1
+1
-0.3
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
A
Dense
B
Sparse
C
Clustered
D
Unclustered
3
GATE CSE 2015 Set 2
Numerical
+1
-0
With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: “Get all records with a search key greater than or equal to 7 and less than 15” is _________
4
GATE CSE 2010
+1
-0.3
Consider a B+- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
A
1
B
2
C
3
D
4
GATE CSE Subjects
EXAM MAP
Medical
NEET