Multiple Choice
The maximum number of records in a B-tree of degree 5 and height 2 is ______.
A) 10
B) 20
C) 24
D) 30
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q20: Random access file organization behaves like a
Q21: In a B-tree,all leaves must be at
Q22: A file is typically partitioned into individual
Q23: Suppose a B-tree of order 5 contains
Q24: When we access external data,a location that
Q25: In a 2-3 tree,if a node has
Q26: In the external mergesort algorithm,how many buffers
Q27: Name two advantages to storing a data
Q28: The technique of referencing an employee table
Q29: When we perform external hashing,we hash the