Algorithm Exam

In divide and conquer approach, the problem in hand, is divided into smaller sub-problems and then each problem is solved independently.

• True

• False

In Conquer/Solve step generally takes a recursive approach to divide the problem until no sub-problem is further divisible.

• True

• False

Generally, at Conquer/Solve level, the problems are considered 'solved' on their own.

• True

• False

Quick Sort is an example of computer algorithm based on divide-and-conquer programming approach

• True

• False

Closest Pair (points) is an example of computer algorithm based on divide-and-conquer programming approach

• True

• False

Since Divide and Conquer allows us to solve the subproblems dependently to a bigger one, this allows for execution in multiprocessor machines

• True

• False

Algorithm analysis

helps us to determine which algorithm is most efficient in terms of time and money consumed

• True

• False

Running Time Analysis is the process of determining how processing time increases as the size of the problem (input size) increases

• True

• False

Array is a container which can hold a fix number of items and these items should be of the same type

• True

• False

Rate of Growth is the rate at which the running time increases as a function of output

• True

• False