2 Algorithms and Solution Design Free Online FlashCards

What is an algorithm?

An algorithm is a finite, ordered set of precise steps that transforms input into the required output.

What is decomposition?

Decomposition divides a complex task into smaller subproblems that can be described and tested independently.

What should you do when first analyzing a problem?

Restate the problem in your own words, removing unnecessary details and identifying the central task.

What is an assumption in problem analysis?

An assumption is a condition accepted as true when the problem does not specify otherwise.

What are input and output?

Input is the information supplied to an algorithm; output is the result the algorithm produces.

What is a constraint?

A constraint is a limit or rule that the solution must obey, such as a data range, time limit, or business rule.

How does validation differ from processing?

Validation checks whether supplied data satisfies the constraints; processing calculates the result for data that is already valid.

What does it mean for an algorithm to be correct?

A correct algorithm produces the required output for every valid input.

What is selection in an algorithm?

Selection uses a condition to determine which instructions execute, such as an IF–ELSE decision.

What is iteration?

Iteration repeats instructions while or until a condition is satisfied.

What is pseudocode?

Pseudocode is a structured, language-independent description of an algorithm using ordinary language and programming concepts.

What is a dry run?

A dry run manually traces an algorithm with sample data to reveal incorrect conditions, missing assignments, or faulty loop behavior.