Document page
Computer Science IGCSEPDF 81
142 pagesrevision 46930
PDF 81
Page image rendered from the stored file at 110 dpi; it sharpens as you zoom. Outlines are placed from each region’s stored position on the page (612 × 792 pt).
no text layerread by OCR (tesseract5-eng@250dpi)The text layer was unusable, so the page image was read by OCR. OCR text can contain misread characters.
Source of this text: read by OCR. The better of the embedded text and OCR is kept.
Candidates should be able to:
4 Understand standard methods of solution
5 (a) Understand the need for validation checks
to be made on input data and the different
types of validation check
(b) Understand the need for verification checks
to be made on input data and the different
types of verification check
6 Suggest and apply suitable test data
7 Complete a trace table to document a dry-run
of an algorithm
8 Identify errors in given algorithms and suggest
ways of correcting these errors
9 Write and amend algorithms for given problems
or scenarios, using: pseudocode, program
code and flowcharts
Notes and guidance
e Limited to:
— linear search
— bubble sort
- totalling
- counting
- finding maximum, minimum and average
values
e = Including:
- range check
- length check
— type check
— presence check
- format check
- check digit
e = Including:
- visual check
- double entry check
e Limited to:
— normal
- abnormal
- extreme
- boundary
e Extreme data is the largest/smallest acceptable
value
e Boundary data is the largest/smallest
acceptable value and the corresponding
smallest/largest rejected value
e = Including, at each step in an algorithm:
- variables
- outputs
user prompts
e Precision is required when writing algorithms,
ég.x > yis acceptable but
x is greater than yis not acceptable