Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 537 |
The number of disk accesses performed by insertion operation in B-tree of height ‘h’ is
| O(1) | |
| O(lgh) | |
| O(h) | |
| None of these |
Question 537 Explanation:
The number of disk accesses performed by insertion operation in B-tree of height ‘h’ is O(h).
Correct Answer: C
Question 537 Explanation:
The number of disk accesses performed by insertion operation in B-tree of height ‘h’ is O(h).
Subscribe
Login
0 Comments