2. What does it mean when we say an algorithm is effective?
3. What is meant by the word finite?
4. List three features of an algorithm.
5. What are the two decision constructs?
6. What is a proposition?
7. What is meant by the term null else?
8. What are the two repetition constructs?
9. List four ways of stating algorithms.
10. What is a variable?
11. Give some examples of variables in your every day life.
12. If variables can be of different types of data what is meant by the term data type?
13. List three data types which can be used in algorithms.
14. The lesson suggested a strategy for designing algorithms. What was
that strategy? Try devising a strategy of your own.
This publication is copyright David Beech and Learning Systems 1997-2002
and may not be reproduced by any means without the written permission of
David Beech.
9 Wyndella Street, Tasmania, Australia