Related InterviewSolutions

• Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node? (GATE CS 2010)(A) 1(B) 2(C) 3(D) 4
• B+ trees are preferred to binary trees in databases because (GATE CS 2000)(A) Disk capacities are greater than memory capacities(B) Disk access is much slower than memory access(C) Disk data transfer rates are much less than memory data transfer rates(D) Disks are more reliable than memory
• Which of the following is FALSE about B/B+ tree(A) B/B+ trees grow upward while Binary Search Trees grow downward.(B) Time complexity of search operation in B/B+ tree is better than Red Black Trees in general.(C) Number of child pointers in a B/B+ tree node is always equals to number of keys in it plus one.(D) A B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes.
• Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations?(A) Database relations have a large number of records(B) Database relations are sorted on the primary key(C) B-trees require less memory than binary search trees(D) Data transfer form disks is in blocks.