# Problem Solving

Fundamentals of Algorithmic Problem Solving

Questions #: 20
Pass Score: 80.0%

True
False

True
False

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

an input
an output
set of instructions
insignificant

True
False

True
False

Yes
No
It depends

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

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

True
False

Missing

True
False

True
False

True
False

#### 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

True
False

True
False

#### 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

True
False

True
False

True
False