UGC NET CS 2012 June-Paper2
|
Question 11
|
B+ tree are preferred to binary tree in Database because
|
Disk capacity are greater than memory capacities
|
|
|
Disk access is much slower than memory access
|
|
|
Disk data transfer rates are much less than memory data transfer rate
|
|
|
Disks are more reliable than memory
|
Question 11 Explanation:
In B+ tree, each node can store multiple keys because of which number of disk access is less. While in binary tree each node can store only one key value so the number of disk access is greater than B+ tree. Since the disc access time is greater so it is better to have less number of disc accesses. So in that case B+ tree is preferred over binary tree.
Correct Answer: B
Question 11 Explanation:
In B+ tree, each node can store multiple keys because of which number of disk access is less. While in binary tree each node can store only one key value so the number of disk access is greater than B+ tree. Since the disc access time is greater so it is better to have less number of disc accesses. So in that case B+ tree is preferred over binary tree.
Subscribe
Login
0 Comments