Document page
Computer Science IGCSEPDF 98
142 pagesrevision 46930
PDF 98
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.
8.1 Programming concepts
Candidates should be able to:
1
2
3
4
Declare and use variables and constants
Understand and use basic data types
Understand and use input and output
{a) Understand and use the concept of
sequence
(b) Understand and use the concept of
selection
{c) Understand and use the concept of
iteration
{d) Understand and use the concepts of
totalling and counting
(e) Understand and use the concept of string
handling
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
Including:
- integer
- real
- char
string
Boolean
Including:
- IF statements
- CASE statements
Including:
- count-controlled loops
- pre-condition loops
— post-condition loops
Including:
- length
- substring
— upper
— lower
The first character of the string can be position
zero or one
Boundary data is the largest/smallest
acceptable value and the corresponding
smallest/largest rejected value
Including, at each step in an algorithm:
- variables
- outputs
— user prompts
Precision is required when writing algorithms,
é.g. x > yis acceptable but
x is greater than y isnot acceptable
See section 4 for flowchart symbols
See section 4 for pseudocode