CS502 Quiz
Fundamentals of Algorithms
Quiz#1

Question # 1
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Select correct option:
upper
lower
average
log n

Question # 2
For the heap sort we store the tree nodes in
Select correct option:
level-order traversal
in-order traversal
pre-order traversal
post-order traversal

Question # 3
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Select correct option:
There is explicit combine process as well to conquer the solutin.
No work is needed to combine the sub-arrays, the array is already sorted
Merging the subarrays
None of above.

Question # 4
In Sieve Technique we do not know which item is of interest
Select correct option:
True
False

Question # 5
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
Select correct option:
pointers
constants
variables
functions

Question # 6
The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

Question # 7
The number of nodes in a complete binary tree of height h is
Select correct option:
2^(h+1) – 1
2 * (h+1) – 1
2 * (h+1)
((h+1) ^ 2) – 1

Question # 8
A heap is a left-complete binary tree that conforms to the ___________
Select correct option:
increasing order only
decreasing order only
heap order
(log n) order

Question # 9
In which order we can sort?
Select correct option:
increasing order only
decreasing order only
increasing order or decreasing order
both at the same time

Question # 10
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines