Computer Science · Oct / Nov 2025 · Paper 21 · Question 7
0478
As printed in the paper
The question as text
The flowchart represents an algorithm. {xox {xn» u¹º « w»vx w¹ÄÅ´¾ w t´½ ¹´ u¹º Æ w¹ÄÅ´¾ { ¹´ Ç© ¡«« È u¹º u¹º É ¡ nvx»vx u¹º u¹º u¹º Á ¡
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
7(a)[4]
One mark per column across both tables:
Input data: 20
Count
Number
Value
Output
0
20
0
1
20
2
40
3
60
4
80
5
100
6
120
5
5
Input data: 110
Count
Number
Value
Output
0
110
0
1
110
0
0
7(b)[1]
One mark from:
DIV algorithmInteger divisionto find how many times the number goes into 1007(c)[1]
Integer
7(d)[4]
One mark per point:
Either
declare Countinitialise Countuse of DIV… with correct parametersOr
declare Countuse of while/repeat… with correct conditionoutput of correct countExamples:
DECLARE Count : INTEGER
Count ← 0
INPUT Number
Value ← Count * Number
WHILE Value <= 100 DO
Count ← Count + 1
Value ← Count * Number
ENDWHILE
Count ← Count – 1
OUTPUT Count
Or
DECLARE Count : INTEGER
(Count ← 0)
INPUT Number
Count ← DIV(100, Number)
OUTPUT Count
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.