An algorithm is a plan for solving a problem by following a sequence of instructions.

1.   ?    True
2.   ?    False

Breaking down an abstract algorithm into a more detailed one is called stepwise refinement.

1.   ?    True
2.   ?    False

Programmers always have to write every instruction that forms part of their final program.

1.   ?    True
2.   ?    False

Parameters are a way of making sub-programs more generally applicable and useful.

1.   ?    True
2.   ?    False

English is always an appropriate language in which to express algorithms.

1.   ?    True
2.   ?    False

A question can be a boolean expression.

1.   ?    True
2.   ?    False

'It is raining' is a boolean expression.

1.   ?    True
2.   ?    False

The following loop construct will execute forever.
WHILE you haven't scored a goal
Get a ball
Kick the ball into the stands

1.   ?    True
2.   ?    False

The instruction 'Eat the grass' will never be executed in the following IF statement:

IF the grass is red
Eat the grass
ELSE
Mow the grass

1.   ?    True
2.   ?    False

It is important to test and evaluate a computer program.

1.   ?    True
2.   ?    False