Cs502 quiz on 16th November, 2011-11-16View more random threads:
- cs507 quiz #2 16 November 2011
- sta301 mid term solve paper spring 2011
- CS502FundamentalsoAlgorithms solved quiz and mcq's for fall...
- cs504 quiz online fall 2010 semester 12/01/2011
- CS504 Software Engineering -I Quiz No. 04 Solution 2014 Due...
- Quizes of MGT111 for Final Term....
- mkt501 solve quiz april 2011
- mcm511 Theories of Communication solved quiz no 3 29/12/2010
- Online Virtual university Cs403 solved quiz online 13-1-2012
- cs101 Introduction to Computing solve mid term paper 2011
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
Sponsored Links
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
There are currently 1 users browsing this thread. (0 members and 1 guests)