CS-301 Final Term Exams Preparation Virtual University With Answers

image
image
image

CS-301 Final Term Exams Preparation Virtual University

Sr. # Questions Answers Choice
1 Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree) Log<sub>2</sub>(n+1) Log<sub>2</sub>(n+1) -1 1.44 Log<sub>2</sub>n 1.66 Log<sub>2</sub>n
2 Every AVL is Binary tree Complete tree None of these Binary Search tree
3 Select the FALSE statement binary tree. Every binary tree has at least one node. Every non-empty tree has exactly one root node. Every node has at most two children. Every non-root node has exactly one parent.
4 _____ only removes items in reserve order as they were entered Stack Queue Both of these None of these
5 In case of deleting a node from AVL tree,rotation could be prolong to the root node. yes no not sure
6 Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest). 0 3 8 9 1 7 5 2 6 4 2 6 4 0 3 8 9 1 7 5 2 6 4 9 1 7 0 3 8 5 0 3 8 2 6 4 9 1 7 5
7 Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ? 144 145 143 148
8 We are given N items to build a heap ,this can be done with ______ successive inserts. N-1 N N+1 N+2
9 In complete binary tree the bottom level is filled from________ Left to right Right to left Not filled at all None of the given option
10 The maximum number of external nodes for a binary tree of Height H is ____ 2<sup>h</sup> 2<sup>h</sup>+1 2<sup>h</sup>+2 2<sup>h</sup>+3
Download This Set
×