Cs 502 Midterm Online Quiz

For the sieve technique we solve the problem,

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

The analysis of Selection algorithm shows the total running time is indeed ________in n,

One of the clever aspects of heaps is that they can be stored in arrays without using any

Divide-and-conquer as breaking the problem into a small number of

We do sorting to,

Analysis of Selection algorithm ends up with,

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?

In which order we can sort?

The sieve technique is a special case, where the number of sub problems is just

Slow sorting algorithms run in,

The sieve technique works in ___________ as follows

For the sieve technique we solve the problem

For the heap sort, access to nodes involves simple _______________ operations.

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,

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?

In Sieve Technique we do not know which item is of interest

Divide-and-conquer as breaking the problem into a small number of

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

A heap is a left-complete binary tree that conforms to the ___________

Sieve Technique can be applied to selection problem?

Heaps can be stored in arrays without using any pointers; this is due to the ____________
nature of the binary tree,

We do sorting to,