CS502 Quiz No.1 Shared by Nazish, Spring 2014

Question # 1 of 10 ( Start time: 01:57:15 PM)

The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.

 Select correct option:

True

False   (p27)     [Divide and Conquer]

Question # 2 of 10 ( Start time: 01:58:29 PM)

In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

Select correct option:

Member

Minimal

Maximal        (p11)

Joint

Question # 3 of 10 ( Start time: 01:59:45 PM)

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

T(n)

T( log n)

T(n log n)

Question # 4 of 10 ( Start time: 02:00:46 PM)

An algorithm is a mathematical entity that is dependent on a specific programming language.

 Select correct option:

True 

False        (p7)

 Question # 5 of 10 ( Start time: 02:01:59 PM)

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

Select correct option:

T(n)

T(n / 2)

log n

n / 2 + n / 4

Question # 6 of 10 ( Start time: 02:03:12 PM)

The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.

Select correct option:

True

False       (p13)

Question # 7 of 10 ( Start time: 02:04:02 PM)

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

Select correct option:

Results

Variables

Size

Growth rates           (p23)

Question # 8 of 10 ( Start time: 02:04:56 PM)

8n2 + 2n - 3 will eventually exceed c2*(n) no matter how large we make c2.

Select correct option: 

True    (p25)

False

Question # 9 of 10 ( Start time: 02:05:45 PM)

If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

 Select correct option:

Fast

Slow

Expensive

Cheap          (p11)

Question # 10 of 10 ( Start time: 02:06:58 PM)

For the sieve technique we solve the problem,

 Select correct option:

recursively

mathematically

precisely

accurately