Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 529 |
For a B-tree of height h and degree t, the total CPU time used to insert a node is
| O(h log t) | |
| O(h log t) | |
| O(t2h) | |
| O(th) |
Question 529 Explanation:
→ For a B-tree of height h and degree t, the total CPU time used to insert a node is O(th).
→ The number of disk pages accessed by B-tree search is therefore O(h) = O(logt n), where ‘h’ is the height of the B-tree and ‘n’ is the number of keys in the B-tree.
→ The time taken by each node is O(t), and the total CPU time is O(th) = O(t logt n).
→ The number of disk pages accessed by B-tree search is therefore O(h) = O(logt n), where ‘h’ is the height of the B-tree and ‘n’ is the number of keys in the B-tree.
→ The time taken by each node is O(t), and the total CPU time is O(th) = O(t logt n).
Correct Answer: D
Question 529 Explanation:
→ For a B-tree of height h and degree t, the total CPU time used to insert a node is O(th).
→ The number of disk pages accessed by B-tree search is therefore O(h) = O(logt n), where ‘h’ is the height of the B-tree and ‘n’ is the number of keys in the B-tree.
→ The time taken by each node is O(t), and the total CPU time is O(th) = O(t logt n).
→ The number of disk pages accessed by B-tree search is therefore O(h) = O(logt n), where ‘h’ is the height of the B-tree and ‘n’ is the number of keys in the B-tree.
→ The time taken by each node is O(t), and the total CPU time is O(th) = O(t logt n).
Subscribe
Login
0 Comments