Question
Consider a B+-tree in which the maximum number of keys
in a node is 5. What is the minimum number of keys in any non-root node?ÂSolution
Assuming order of B+ tree as p, maximum number of keys will be (p – 1). As it is given that, p – 1 = 5 => p = 6 Therefore, minimum number of keys: ceil(p/2) – 1 = 2 Â
71, 79, 88, 152, ?, 393
17, 36, 65, 104, 153, ?
625, 125, 375, 75, 225, 45, ?
84, 63, ?, 283.5, 1701
12    48      192      ?      3072       12288
...What value should come in the place of (?) in the following number series?
71, 72, 76, 103, ?, 244What will come in place of the question mark (?) in the following series?
?, 65, 37, 73, 29, 81
Find the missing number in the given number series.
?, 26, 38, 70, 130, 226
14, 86, 150, ?, 254, 294
What value should come in the place of (?) in the following number series?
100, 115, ?, 190, 250, 325
