Question # 1

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

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Choose an answer

O(1) time because all lists take the same amount of time to sort

O(n) time because it has to perform n swaps to order the list.

O(n² ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.

O(n³ ) time, because the worst case has really random input which takes longer to sort.

I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last?

Choose an answer

(last % 1) + CAPACITY

last % (1 + CAPACITY)

(last + 1) % CAPACITY

last + (1 % CAPACITY)

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap:

Choose an answer

7 6 5 4 3 2 1

7 3 6 2 1 4 5

7 6 4 3 5 2 1

7 3 6 4 2 5 1

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Choose an answer

Inner node

Leaf node

Root node

None of the given options

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

Choose an answer

Equal to the small frequency

Equal to the greater

Equal to the sum of the two frequencies

Equal to the difference of the two frequencies

If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

Choose an answer

54

55

56

57

Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)

Choose an answer

Log₂(n+1)

Log₂(n+1) -1

1.44 Log₂n

1.66 Log₂n

"+” is a _________operator.

Choose an answer

Unary

Binary

Ternary

None of the above

In case of deleting a node from AVL tree,rotation could be prolong to the root node.

Choose an answer

yes

no

not sure

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

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