7 Algorithm design and problem solving

analysis, design, coding, and testing

abstraction, decomposition of the problem, identification of the problem and requirements

decomposition, structure diagrams, flowcharts, pseudocode

writing program code and iterative testing

testing program code with the use of test data

inputs processes outputs storage

structure diagrams flowcharts pseudocode

linear search bubble sort totalling counting finding maximum, minimum, and average values

range check length check type check presence check format check check digit

checks that the value of a number is between an upper value and a lower vcalue

checks that the data entered is a reasonable number or an exact number of characters

checks that the data entered is of a given data type

checks to ensure that some data has been entered and the value has not been left blank

checks that the characters entered conform to a pre-defined pattern

visual check double entry check

a manual check to ensure the data on the screen is the same as the form

the data is entered twice and compared to ensure both entries are the same

normal abnormal extreme boundary

test data that is accepted and the algorithm is expected to work with

test data that is rejected by the algorithm as not suitable

at each boundary two values are required; one value is accepted and the other value is rejected

the largest and smallest values that normal data can take