# CS502 VU Solved Quiz No. 1 Spring 2012

We do sorting to,
Select correct option:

keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order

Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Select correct option:

left-complete
right-complete
tree nodes
tree leaves

Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1
Sieve Technique can be applied to selection problem?
Select correct option:

True
False

Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1
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 # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:

heap
binary tree
binary search tree
array

Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1
Divide-and-conquer as breaking the problem into a small number of
Select correct option:

pivot
Sieve
smaller sub problems
Selection

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1
In Sieve Technique we do not know which item is of interest
Select correct option:

True
False

Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1
The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:

16
10
32
31

Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:

linear
arithmetic
geometric
exponent

Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1
For the heap sort, access to nodes involves simple _______________ operations.
Select correct option:
arithmetic
binary
algebraic
logarithmic