Algorithm design and problem-solving

Decomposition, abstraction, pattern recognition and describing an algorithm step by step.

The standard flowchart symbols and drawing an algorithm as a flowchart.

Writing algorithms in Cambridge-style pseudocode.

Following an algorithm line by line and recording the values of its variables.

Linear search, bubble sort, totalling, counting, finding the minimum, maximum and average.

Checking that data is reasonable and that it was entered correctly.

Choosing normal, abnormal, extreme and boundary data, and finding and fixing errors in an algorithm.