[discussion_vu] cs502 solution

A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:

heap
binary tree
binary search tree
array


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


The sieve technique works in ___________ as follows
Select correct option:

phases
numbers
integers
routines


For the heap sort, access to nodes involves simple _______________ operations.
Select correct option:

arithmetic
binary
algebraic
logarithmic


The sieve technique is a special case, where the number of sub problems is just
Select correct option:

5
many
1
few


In Sieve Technique we do not know which item is of interest
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


Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
Select correct option:

n items
phases
pointers
constant


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


In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Select correct option:

T
T(n / 2)
log n
n / 2 + n / 4


Any one have CS502 2nd solution???

--

                <<<<<<< sAd pAncHi >>>>>>>

             

--
You received this message because you are subscribed to the Google Groups "Virtual University of Pakistan" group.
To post to this group, send email to discussion_vu@googlegroups.com.
To unsubscribe from this group, send email to discussion_vu+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/discussion_vu?hl=en.