Unit 4 Flashcards

1
Q

algorithm

A

An algorithm is a finite set of instructions that, if followed accomplish a particular task; a series of steps to accomplish a task. All algorithms must have: an input, output, clarity, finiteness and effectiveness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Input

A

An algorithm may accept zero or more inputs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Output

A

An algorithm should produce some result

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Clarity

A

Each step in an algorithm should be a clear and unambiguous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

finiteness

A

An algorithm should end after a finite number of steps; an algorithm cannot repeat forever(otherwise it doesn’t solve a problem).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

effectiveness

A

It should be possible for a person or a computer to fulfill each step in an algorithm and the algorithm should accomplish the given task.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

nomial case

A

a “normal” or typical input to an application

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

edge case

A

An input that is set at the extreme of the allowable range of inputs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

problem solving steps

A
  1. Understand the problem
  2. Explore examples
  3. Break down the problem
  4. Solve or reduce the problem
  5. Simplify/Refactor
How well did you know this?
1
Not at all
2
3
4
5
Perfectly