A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The maximum number of keys stored in a B-tree of order m and depth d is
a. m^d + 1 - 1
b. m^d+1 - 1/(m - 1)
c. (m - 1) (m^d + 1 - 1)
d. m^d-1

Similar Questions:

View All Questions on: Discrete Structures

Start The Conversation: