MADE EASY TEST SERIES

Question

Which of the following statement false for B-tree and B⁺  tree index.

1> B+ tree index faster for range queries compare to B tree index.

2> If disk block allocated for B+ tree index and same size disk block allocated for B tree index. Then number of index blocks and        I/O cost of B+ tree index less than or equal to B tree index for given distinct keys.

3> If disk block allocated for B+ tree index and same size disk block allocated for B tree index. Then B tree index access cost less     than or equal to B+ tree index for given distinct keys.

4> If number of keys that can store in B tree and B+ tree index is same then I/O cost of B tree index less than equal to I/O cost of     B+ tree index for random access of some key from set of distinct keys.

Comments

Is C) false???

Answer 1

I think 3 is false, because if disk block allocated is same then B tree will have more levels than B+ Tree.

Confirm the answer!