Logical-Reasoning
March 27, 2024Question 1436 – ISRO-2017 December
March 28, 2024Database-Management-System
| Question 593 |
The upper bound and lower bound for the number of leaves in a B-tree of degree K with height h is given by :
| Kh and 2⌈K/2⌉h–1 | |
| K*h and 2⌊K/2⌋h–1 | |
| Kh and 2⌊K/2⌋h–1 | |
| K*h and 2⌈K/2⌉h–1 |
Question 593 Explanation:
→ The upper bound for the number of leaves in a B-tree of degree K with height h is Kh
→ The lower bound for the number of leaves in a B-tree of degree K with height h is 2⌈K/2⌉h–1
→ The lower bound for the number of leaves in a B-tree of degree K with height h is 2⌈K/2⌉h–1
Correct Answer: A
Question 593 Explanation:
→ The upper bound for the number of leaves in a B-tree of degree K with height h is Kh
→ The lower bound for the number of leaves in a B-tree of degree K with height h is 2⌈K/2⌉h–1
→ The lower bound for the number of leaves in a B-tree of degree K with height h is 2⌈K/2⌉h–1