CS502 Quiz No.1 Shared by Fairy, Spring 2014

1. Brute-force algorithm uses no intelligence in pruning out decisions.

    True

   False

2. f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

Results

Variables

Size

Growth rates

3. In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

True

False

4. Efficient algorithm requires less computational…….

Memory

Running Time

Memory and Running Time

Energy

5. The O-notation is used to state only the asymptotic ________bounds.

Two

Lower

Upper

Both lower & upper

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

left-complete

right-complete

tree nodes

tree leaves

7. ........of reference is an important fact of current processor technology.

Defining

Assigning

Formality

Locality

8. In the analysis of Selection algorithm, we get the convergent ______________ series.

Harmonic

Linear

Arithmetic

Geometric 

9. Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Two
Some
Most
All 

10. In ____________ we have to find rank of an element from given input.
Merge sort algorithm
Selection problem  
Brute force technique
Plane Sweep algorithm