Question 1 : The height of 2-3 tree with n elements is ______
1. between (n/2) and (n/3)
2. (n/6)
3. between (n) and log2(n + 1)
4. between log3(n + 1) and log2(n + 1)
View Answer   Discuss with Members

Question 2 : 2-3 tree is a specific form of _________
1. B – tree
2. B+ – tree
3. AVL tree
4. Heap
View Answer   Discuss with Members

Question 3 : Which of the following is the most widely used external memory data structure?
1. AVL tree
2. B-tree
3. Red-black tree
4. Both AVL tree and Red-black tree
View Answer   Discuss with Members

Question 4 : Efficiency of finding the next record in B+ tree is ____
1. O(n)
2. O(log n)
3. O(nlog n)
4. O(1)
View Answer   Discuss with Members

Question 5 : 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.
1. AVL
2. AA
3. 2-3
4. Red-Black
View Answer   Discuss with Members

Question 6 : A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
1. 6
2. 3
3. 4
4. 7
View Answer   Discuss with Members

Question 7 : Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
1. Statement 1 is true but statement 2 is false
2. Statement 2 is true but statement 1 is false
3. Both the statements are true
4. Both the statements are false
View Answer   Discuss with Members

Question 8 : B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 9 : Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 10 : Which of the following the BST is isometric with the 2-3 tree?
1. Splay tree
2. AA tree
3. Heap
4. Red – Black tree
View Answer   Discuss with Members