What an algorithm is and its four characteristics, how variables, constants and data types are used, and the three control structures: sequence, selection and repetition.
5 narrated scenes. Press play, listen and read along — the points appear as they are explained. Use ‹ Prev / Next › or the scene bar to jump to any scene.
A program remembers values in named boxes called variables. Understanding them and the three basic control structures is the foundation of every program.
Narration uses your device’s built-in voice. No sound? Switch to “Captions only” — the captions advance on their own.
Copy these into your notebook in your own words — that is how they stick.
Finite, ordered, unambiguous steps with input/output.
Changes while running / fixed value.
name ← expression stores a value.
Whole numbers / decimal numbers.
Text / one symbol / True or False.
In order.
IF…THEN…ELSE.
Loops.
3 quick games on this lesson. Earn XP and badges as you play — your best score for each game is saved. Games are for practice and do not change your exam readiness. More games in the Information Technology Arcade.
8 items modelled on real CSEC Paper 1 questions. Choose one answer for each, then check. Aim for 80% or better. Work each item on paper first.
Write full answers, then reveal the mark scheme and tick the points you earned (10 marks in total). Show all your working — method marks count. Your answers are saved on this device.
Question 1 [10 marks]
A program reads a pupil’s three marks and prints the average.
(a) (a) Define the term algorithm. [2]
(b) (b) Name suitable data types for (i) the marks, (ii) the pupil’s name and (iii) a variable that records whether the pupil passed. [3]
(c) (c) State one difference between a variable and a constant. [2]
(d) (d) Name the three control structures. [3]
Find these in your own past-paper booklets for extra timed practice. Items above are written in the style of these papers; any adapted from a specific question say so.