Students learn to design an algorithm to solve a problem and describe algorithms using flowcharts and structured English; for example, START, END, IF and UNTIL.
They trace algorithms for a given input, using desk checking, and develop test cases that correspond to the requirements of the specifications; for example, validating program behaviour on a range of valid and invalid user input.
Some people who are strong visual thinkers prefer to use flow charts to develop the basis for an algorithm.
Often, people start with structured English and/or a flowchart, convert it to pseudocode and then write executable code.
Explain that structured English avoids mathematical symbols and uses words wherever possible.
See Teacher Introduction for more information.
This will require the use of two 'Join' operators:
Note: Structured English is easier to use when many choices exist, as is the case here.
Here are some common errors and challenges:
(Students to test each of: following:
within each range, boundaries, equal to secret number, decimal entries, negative integers, out-of range integers, invalid entries such as words, null entry, etc)