Database-Management-System

Question 558

For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least ________ keys and every node can have at most ________ keys.

A	t – 1, 2t + 1
B	t + 1, 2t + 1
C	t – 1, 2t – 1
D	t + 1, 2t – 1

Database-Management-SystemB-and-B+-TreesUGC NET CS 2013 Dec-paper-2

Question 558 Explanation:

For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least t-1 keys and every node can have at most 2t-1 keys.

Correct Answer: C

Question 558 Explanation:

For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least t-1 keys and every node can have at most 2t-1 keys.