Question 15 What is the maximum number of keys in a B-tree of order 5 and height 4?
Ukg technical mcq question, verified with a worked answer. Free to practise - no sign-up.
What is the maximum number of keys in a B-tree of order 5 and height 4?
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. B Tree is a specialized m-way tree that is widely used for disk access.
Pick ONE option
Show answer & explanation
Answer: A. A) 3124
Accurate technical and quantitative evaluation based on foundational principles.
Step-by-step Derivation:
Step 1: Formulate problem conditions.
Step 2: Apply logical deduction.
Step 3: Conclude correct option.