Problem Solving

An algorithm is an answer to a problem

True

False

POINTS (1)

Correct Answer

Explanation

For an algorithm designer, understanding the given problem is not always necessary

True

False

POINTS (1)

Correct Answer

Explanation

An instance of a problem that an algorithm will solve is considered

an input

an output

set of instructions

insignificant

POINTS (1)

Correct Answer

Explanation

A correct algorithm may work most of the time and acceptable to fail in some special cases

True

False

POINTS (1)

Correct Answer

Explanation

An algorithm designer may risk redoing his work if problem is not completely understood

True

False

POINTS (1)

Correct Answer

Explanation

Should I worry so much about computer speed when designing my algorithm?

Yes

It depends

POINTS (1)

Correct Answer

Explanation

Why would one opt for an approximation algorithm not an exact one?

Some problems cannot be solved exactly
The algorithm to find the exact solution may be unacceptably slow because of the complexity of the problem
It may be a part of a more sophisticated algorithm that solves a problem exactly

True

False

POINTS (1)

Correct Answer

Explanation

One does not have to pay close attention to choosing data structures appropriate for the operations performed by the algorithm

True

False

POINTS (1)

Correct Answer

Explanation

An algorithm can be described in words and in ________

Missing

POINTS (1)

Correct Answer

Explanation

Describing an algorithm in words using a natural language is always precise and clear

True

False

POINTS (1)

Correct Answer

Explanation

Pseudocode has a single form that everyone uses

True

False

POINTS (1)

Correct Answer

Explanation

A flowchart is a convenient way to represent a complex algorithm

True

False

POINTS (1)

Correct Answer

Explanation

Proving that an algorithm outputs a required result for every legitimate input in a finite amount of time is called

efficiency

effectiveness

correctness

none of the above

POINTS (1)

Correct Answer

Explanation

You need just a single instance of algorithm's input for which the algorithm fails in order to show that the algorithm is incorrect

True

False

POINTS (1)

Correct Answer

Explanation

Mathematical induction is commonly used to prove the correctness of an algorithm

True

False

POINTS (1)

Correct Answer

Explanation

Proving an approximation algorithm to be correct is decided if

all legitimate inputs exactly produce the required results

all legitimate inputs produce the required results within a predefined error boundary

POINTS (1)

Correct Answer

Explanation

Simplicity is a required characteristic in a good algorithm that can be mathematically verified

True

False

POINTS (1)

Correct Answer

Explanation

Generality is always a desired characteristic in an algorithm

True

False

POINTS (1)

Correct Answer

Explanation

It is expected to get the right algorithm from the first trial

True

False

POINTS (1)

Correct Answer

Explanation

Verifying a coded algorithm in a program is by _______

reading

consulting

testing

re-coding

POINTS (1)