WorksheetsVCE FDP DAY-7 24 JAN 2024
Total questions: 15
Worksheet time: 8mins
Name
Class
Date
1.
Which of the following is false about a binary search tree?
a)
The left child is always lesser than its parent
b)
The right child is always greater than its parent
c)
The left and right sub-trees should also be binary search trees
d)
In order sequence gives decreasing order of elements
2.
What is the speciality about the inorder traversal of a binary search tree?
a)
It traverses in a non increasing order
b)
It traverses in an increasing order
c)
It traverses in a random fashion
d)
It traverses based on priority of the node
3.
What are the worst case and average case complexities of a binary search tree?
a)
O(n), O(n)
b)
O(logn), O(logn)
c)
O(logn), O(n)
d)
O(n), O(logn)
4.
Trie is also known as _________
a)
Digital Tree
b)
Treap
c)
Binomial Tree
d)
2-3 Tree
5.
What traversal over trie gives the lexicographical sorting of the set of the strings?
a)
postorder
b)
preorder
c)
inorder
d)
Level order
6.
Which of the following is the efficient data structure for searching words in dictionaries?
a)
BST
b)
Linked List
c)
Balanced BST
d)
Trie
7.
A program to search a contact from phone directory can be implemented efficiently using ______
a)
a BST
b)
a trie
c)
a balnced BST
d)
a binary tree
8.
Which of the following is the most widely used external memory data structure?
a)
AVL tree
b)
B-tree
c)
Red-black tree
d)
Both AVL tree and Red-black tree
9.
B-tree of order n is a order-n multiway tree in which each non-root node contains________
a)
at most (n – 1)/2 keys
b)
exact (n – 1)/2 keys
c)
at least 2n keys
d)
at least (n – 1)/2 keys
10.
A B-tree of order 4 and of height 3 will have a maximum of _______ keys.
a)
255
b)
63
c)
127
d)
188
11.
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
a)
14
b)
7
c)
11
d)
5
12.
What is the maximum number of children that a binary tree node can have?
a)
0
b)
1
c)
2
d)
3
13.
What is the traversal strategy used in the binary tree?
a)
depth-first traversal
b)
breadth-first traversal
c)
random traversal
d)
Priority traversal
14.
What is the time complexity of level order traversal?
a)
O(1)
b)
O(n)
c)
O(logn)
d)
O(nlogn)
15.
In a binary search tree, which of the following traversals would print the numbers in the ascending order?
a)
Level-order traversal
b)
Pre-order traversal
c)
Post-order traversal
d)
In-order traversal
100 %
