Question # 1

If numbers 5,222,4,48 are inserted in queue,which one will be removed first?

Choose an answer

48

4

222

5

A complete binary tree of height 3 has between ________ nodes.

Choose an answer

8 to 14

8 to 15

8 to 16

8 to 17

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its __________ successor

Choose an answer

levelorder

Preorder

Inorder

Postorder

Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?

Choose an answer

post-order

level -order

in order

none of the above

Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?

Choose an answer

Elements in the first half of the array are less than or equal to elements in the second half of the array

None of the given options

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the array

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .

Choose an answer

N

N²

Nlog₂N

log₂N

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 ?

Choose an answer

144

145

143

148

If a complete binary tree has height h then its no. of nodes will be,

Choose an answer

Log (h)

2^h+1 - 1

Log (h) - 1

2^h - 1

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Choose an answer

4,6,7,5

6,7,5,4

4,5,6,7

4,6,5,7

Which one of the following is TRUE about iteration?

Choose an answer

Iteration extensively uses stack memory

Threaded Binary Trees use the concept of iteration.

Iterative function calls consumes a lot of memory.

Recursion is more efficient than iteration.

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Choose an answer

23

24

21

22 (n-1)

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer