GATE 2004
October 21, 2023UGC NET June-2019 CS Paper-2
October 21, 2023GATE 1999
|
Question 25
|
Which of the following is correct?
|
B-trees are for storing data on disk and B+ trees are for main memory.
|
|
|
Range queries are faster on B* trees.
|
|
|
B-trees are for primary indexes and B* trees are for secondary indexes.
|
|
|
The height of a B* tree is independent of the number of records.
|
Question 25 Explanation:
Range queries are faster on B+ trees.
Correct Answer: B
Question 25 Explanation:
Range queries are faster on B+ trees.