Question 13839 – Validity-of-Arguments
March 27, 2024Question 1436 – ISRO-2017 December
March 28, 2024Question 4941 – Database-Management-System
The upper bound and lower bound for the number of leaves in a B-tree of degree K with height h is given by :
Correct Answer: A
Question 516 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
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
Subscribe
Login
0 Comments