Algorithm review 6-B

We define an algorithm as a group/set of steps used to solve a problem or/and a result.

• True

• False

We can find algorithms only into the 'computing' field.

• True

• False

There are 4 stages to solve problem.

• True

• False

Choose the three stages to fix a problem.

• Creation of the algorithm (steps to follow)

• Ask someone if you have done it alright

• Veryficaction of the algorithm

• Deep analysis of the problem

Which one is not a characteristic of an algorithm?

• Finitude

• Neat

• Precision

• Determinism

Which is the defintion for 'Precision'?

• The algorithm, given a set of identical entrance data, it always should give you the same result.

• The algorithm, independently from its complexity, it should always be finite.

• The steps in an algorithm should be precised clearly

Which is the defintion for 'Determinism'?

• The algorithm, given a set of identical entrance data, it always should give you the same result.

• The algorithm, independently from its complexity, it should always be finite.

• The steps in an algorithm should be precised clearly

Which is the defintion for 'Finitude'?

• The algorithm, given a set of identical entrance data, it always should give you the same result.

• The algorithm, independently from its complexity, it should always be finite.

• The steps in an algorithm should be precised clearly

What are the three algorithm modules?

• Entrance data

• Data processing

• Data analysis

• Data printing

Which module shows you an output?

• Entrance data

• Data processing

• Data printing