cs502 solved quiz on 16 November, 2011

[Xpert]

Cs502 quiz on 16th November, 2011-11-16
The running time of quick sort depends heavily on the selection of
No of inputs
Arrangement of elements in array
Size o elements
Pivot element
In Quick sort algorithm,constants hidden in T(n lg n) are
Large
For the heap sort, access to nodes involves simple _______________ operations.
Arithmetic
Binary
Algebraic
Logarithmic
The analysis of Selection algorithm shows the total running time is indeed ________in n,

Sieve Technique can be applied to selection problem?
True
False
Theta asymptotic notation for T (n) :

Divide-and-conquer as breaking the problem into a small number of
Pivot
Sieve
smaller sub problems
Selection
We do sorting to,
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
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
n items
phases
pointers
constant
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:.
Merging the subarrays