Problem Solving

An algorithm is an answer to a problem

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

an input

an output

set of instructions

insignificant

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

Yes

No

It depends

note_alt Add notes

flag Flag

Correct Answer

Explanation

One may opt for an approximation algorithm for the following reasons

1 pts

volume_mute

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

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

An algorithm can be described in words and in ________

1 pts

Missing

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

Pseudocode has a single form that everyone uses

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

A flowchart is a convenient way to represent a complex algorithm

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

efficiency

effectiveness

correctness

none of the above

note_alt Add notes

flag Flag

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

Proving an approximation algorithm to be correct is decided if

1 pts

volume_mute

all legitimate inputs exactly produce the required results

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

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

Generality is always a desired characteristic in an algorithm

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

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

1 pts

volume_mute

True

False

note_alt Add notes

flag Flag

Correct Answer

Explanation

Verifying a coded algorithm in a program is by _______

1 pts

volume_mute

reading

consulting

testing

re-coding

note_alt Add notes

flag Flag

An algorithm is an answer to a problem

Correct Answer

Explanation

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

Correct Answer

Explanation

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

Correct Answer

Explanation

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

Correct Answer

Explanation

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

Correct Answer

Explanation

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

Correct Answer

Explanation

One may opt for an approximation algorithm for the following reasons

Correct Answer

Explanation

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

Correct Answer

Explanation

An algorithm can be described in words and in ________

Correct Answer

Explanation

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

Correct Answer

Explanation

Pseudocode has a single form that everyone uses

Correct Answer

Explanation

A flowchart is a convenient way to represent a complex algorithm

Correct Answer

Explanation

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

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

Correct Answer

Explanation

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

Correct Answer

Explanation

Proving an approximation algorithm to be correct is decided if

Correct Answer

Explanation

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

Correct Answer

Explanation

Generality is always a desired characteristic in an algorithm

Correct Answer

Explanation

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

Correct Answer

Explanation

Verifying a coded algorithm in a program is by _______

Correct Answer

Explanation

Quran Recitation