Data Structure I Mock Test 6

10%

Question 1 of 10

1. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?

Question 1 of 10

Question 2 of 10

2. Is tango tree represented as a tree of trees.

True

False

Question 2 of 10

Question 3 of 10

3. Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?

because they are balanced

because of resizing issues of hash table and better ordering in redblack trees

no they are not preferred

because they can be implemented using trees

Question 3 of 10

Question 4 of 10

4. Which is the simplest of all binary search trees?

Treap

AVL tree

Splay tree

Binary heap

Question 4 of 10

Question 5 of 10

5. Which of the following is an application of Red-black trees and why?

can be used in process schedulers, maps, sets

for efficient sorting

used to store strings efficiently

used to store integers efficiently

Question 5 of 10

Question 6 of 10

6. Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

log3/2 n

log3 n

log4/3 n

log2 n

Question 6 of 10

Question 7 of 10

7. AVL trees provide better insertion the 2-3 trees.

False

True

Question 7 of 10

Question 8 of 10

8. Which property makes top tree a binary tree?

All of the mentioned

Leaves as Edges

Root is Tree Itself

Nodes as Cluster

Question 8 of 10

Question 9 of 10

9. 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.

Statement 1 is true but statement 2 is false

Both the statements are false

Both the statements are true

Statement 2 is true but statement 1 is false

Question 9 of 10

Question 10 of 10

10. Which of the following is true?

B + tree allows rapid random access and slower sequential access

B + tree allows rapid random access as well as rapid sequential access

B + tree allows only the rapid random access

B + tree allows only the rapid sequential access

Question 10 of 10