B-Trees on Data Structure and Algorithms related Questions and Answers - Page 2

Question 12 : What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
1. 3
2. 80
3. 27
4. 26
View Answer   Discuss with Members

Question 13 : Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
1. 14
2. 7
3. 11
4. 5
View Answer   Discuss with Members

Question 14 : B-tree of order n is a order-n multiway tree in which each non-root node contains __________
1. at most (n – 1)/2 keys
2. exact (n – 1)/2 keys
3. at least 2n keys
4. at least (n – 1)/2 keys
View Answer   Discuss with Members

Question 15 : Which one of the following data structures are preferred in database-system implementation?
1. AVL tree
2. B-tree
3. B+ -tree
4. Splay tree
View Answer   Discuss with Members

Question 16 : Which of the following data structure can provide efficient searching of the elements?
1. unordered lists
2. binary search tree
3. treap
4. 2-3 tree
View Answer   Discuss with Members

Question 17 : What is the best case height of a B-tree of order n and which has k keys?
1. logn (k+1) – 1
2. nk
3. logk (n+1) – 1
4. klogn
View Answer   Discuss with Members

Question 20 : A B-tree of order 4 and of height 3 will have a maximum of _______ keys.
1. 255
2. 63
3. 127
4. 188
View Answer   Discuss with Members


View 11 - 20 of 22 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter