3$*( 

3$*(

&+$37(5

3$*(
 3$*(

10

4 This section of program code may be used as a validation check.

1 PRINT "Input a value between 0 and 100 inclusive"

2 INPUT Value
3 WHILE Value < 0 OR Value > 100
4 PRINT "Invalid value, try again"
5 INPUT Value
6 ENDWHILE
7 PRINT "Accepted: ", Value

(a) Give a name for this type of validation check.

............................................................................................................................................. [1]

(b) Describe what is happening in this validation check.

...................................................................................................................................................

...................................................................................................................................................

...........................................
.........................................................................................................
...................................................................................................................................................

.......................................
................................................................................................................
...................................................................................................................................................

...........................
............................................................................................................................
...................................................................................................................................................

..
.......
................
. .....
.........................................
.......................
....................
..........
. ..............
....
......
......
.....................
................................................................................................................................................... . ......
................

.....
.....
...................................................................................................................................................
...................................................................................................................................................

......
....................
.......................................................................................................................... [2]
.............................................................................................................................................

(c) Complete the trace table for

o this program code using the test data: 200, 300, –1, 50, 60
or

Value OUTPUT

[3]

© UCLES 2019 2210/21/M/J/19

 3$*(

11

(d) Draw a flowchart to represent this section of program code.

[5]
© UCLES 2019 2210/21/M/J/19 [Turn over
 3$*(

Section B

2 (a) An algorithm has been written in pseudocode to input 100 numbers, select and print the
largest number and smallest number.

Count 1
INPUT Number
High Number
Low Count
REPEAT
INPUT Number
IF Number > High
THEN
High Number
ENDIF
IF Number > Low
THEN
Low Number
ENDIF
Count Count + 1
UNTIL Count > 99
PRINT "Largest
"Largeest
s Number is ", Number
PRINT "Smallest
"Sma
mall
ma ll
lest Number is ", Low

Find the fourr error

orss in
or
errors n the
the pseudocode
pseudocode and suggest
sugg
ggest a correction for each error.

Erro
Er rorr 1 ..
ro
Error ........
. .....
.........................................
.........
. ............
....................
.........
. ..............
....
......
......
......
.......................................
........................................................................................................................................

Cor
rrectiion
rrec
rr o ..................................................................................................................................
Correction ...................................................................................................................................

......
................
. ....
................................................................................................................................
...................................................................................................................................................

Error 2 ................................
..........................................................................................................
........................................................................................................................................

Correction ..........................
........................................................................................................
.................................................................................................................................

...................................................................................................................................................

Error 3 ........................................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................

Error 4 ........................................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................
[4]

© UCLES 2019 2210/22/M/J/19

 3$*(

(b) Show how you would change the corrected algorithm to total the numbers and print the total.
Use a variable Total.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [4]

© UCLES 2019 2210/22/M/J/19 [Turn over

 3$*(

10

3 This flowchart inputs the marks gained in an examination. An input of –1 ends the routine.

START

Total 0
Count 0
Distinction 0

INPUT Mark

Is Mark = –1 ? Yes
Total Total + Mark
Count Count + 1

No

No
o Is OUTPUT "Number of
Mark
M k >=
ark >= Dist
Di tinct
ctio
ions
Distinctions s ",
", Distinction
Dis
Di sti
inct
c ion
0?
80 OUT
OUTPUT
UT "Average
OUTPUT "Av
Aveerag
age
e Mark
Mark
rk "
Total/Count
Yes
Ye
es

Di
Distinction
n Distinction
Distinction + 1 END

Complete the trace table for the

emmark
ark input data: 50, 70, 65, 30, 95, 50, 55, 85, 65, 35, –1, 45

Total Count Distinction

Distin
nction Mark OUTPUT

[4]
© UCLES 2019 2210/22/M/J/19
 3$*(

11

4 For each of the fourr groups of statements in the table, place a tick in the correct column to show
whether it is an example of Selection or Repetition.

Statements Selection Repetition

FOR A 1 TO 100
B B + 1
NEXT A
CASE A OF
100: B A
200: C A
ENDCASE
IF A > 100
THEN
B A
ENDIF
REPEAT
A B * 10
UNTIL A > 100
[4]

5 Explain what is meant byy validation

va
alida
ation and verification.
Give an example for
fo
or each
ea
ach
ch one.

Valida
atitio
Validationon ..........................................................................................................................................
............
.......................................................................................................................................

...........
............
..........
. ..
. .......
...........................................................................................................................
..........................................................................................................................................................

...........
...
. ...........
..............................
.. ..........................................................................................................
..........................................................................................................................................................

....................................................
.......................................................................................................
..........................................................................................................................................................

Example .....................................
........................................................................................................
...........................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

Verification ........................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

Example ...........................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................
[6]

© UCLES 2019 2210/22/M/J/19 [Turn over

 3$*(

Section B

2 An algorithm has been written in pseudocode to select a random number using the function
RandInt(n), which returns a whole number between 1 and the argument n. The algorithm then
allows the user to guess the number.

Number RandInt(100)
TotalTry 1
REPEAT
PRINT "Enter your guess now, it must be a whole number"
INPUT Guess
IF TotalTry > Number
THEN
PRINT "Too large try again"
ENDIF
IF Guess > Number
THEN
PRINT "Too small try again"
ENDIF
TotalTry Guess + 1
UNTIL Guess <>> Number
TotalTry TotalTry
Tot
talTry - 1
PRINT "Number
"Numbeer of
of guesses ", TotalTry

Find the fourr errors in

n the
the pseudocode
pseu
udocode and suggest
sugg
gest a correction to remove each error.

Error 1 ...............................................................................................................................................
...................
..........................
. ...........
....................
.. . ...............
.......
.........
.....
. ...............................
. ....
. ......
. ......
................

Correcti
ion
on ..
Correction .............................................................................................................................................
.........................................................................................................................................

...........................................................................................................................................................
...............
. ..........
....
......................................................................................................................................

Error 2 ......................................
..........................................................................................................
..............................................................................................................................................

Correction ...................................
........................................................................................................
.........................................................................................................................................

..........................................................................................................................................................

Error 3 ..............................................................................................................................................

Correction .........................................................................................................................................

..........................................................................................................................................................

Error 4 ..............................................................................................................................................

Correction .........................................................................................................................................

..........................................................................................................................................................
[4]

© UCLES 2019 2210/22/O/N/19 [Turn over

 3$*(

3 (a) The flowchart checks the lengths of a batch of 10 ropes. For the batch to be accepted 90% of
the lengths need to be between 24.9 and 25.1 metres.

START

Reject 0
Count 0

Yes
Is Count =
10 ?
No
No
Count Count + 1 Is Reject
<= 1 ?
INPUT Length
Yes
OUTPUT "Batch
rejected"

Yes Is Length
Lengt
g h <
gt
25.1
5.1 AND
25 AND
Lengthh > 24.9
th 24.9?
4.9

No

Reject Reject + 1

OUTPUT "Batch
accepted"

END

© UCLES 2019 2210/22/O/N/19

 3$*(

Complete the trace table for the input data:

24.88, 25.01, 24.98, 25.00, 25.05, 24.99, 24.97, 25.04, 25.19, 25.07

Reject Count Length OUTPUT

[4]

(b) (i) It h
has been
as been
ee n decided to
ooonly
nly reject batches of rope that contain ropes that are too short.

Sttat
ate
Statee the
the change
cha
change required
requ
uired to the algorithm.

...........................................................................................................................................
...
.............................................................................................................................................

.....................................................................................................................................
................................................................................................. [1]
.....................................

(ii) algorith
th
hm to reject batches could be improved to make it more effective.
Explain how the algorithm

...........................................................................................................................................

...........................................................................................................................................

...........................................................................................................................................

..................................................................................................................................... [2]

© UCLES 2019 2210/22/O/N/19 [Turn over

 3$*(

10

4 Fourr validation checks and fourr descriptions are shown.

Draw a line to connect each validation check to the correct description.

Validation Check Description

Range check Checks that some data is entered.

Checks for a maximum number of characters

Presence check
in the data entered.

Checks that the characters entered are all

Length check
numbers.

Checks that the value entered is between an

Type check
upper value and a lower value.
[3]

5 A programmer writes a program

prog
pr og
gram
m to weigh baskets of fruit in grams, keeping a total of the weight
and counting the number
num
mbe er of
of baskets.
baske
kets.. The
ke Th total
tota
al weight
we
eig
ght iss stored
stor
sto ed in
n a variable
va
ari
riab
a le
e Tot la
Tota
Total nd tthe
and he number
number
of baskets
s iis
s st
stor
ored
ored
storedd in
n a vvariable
ariable
e BasketCount.
Bask
sket
sk et
tCo ounnt.

Explain, including
inc
ncludi
ludi
dinng examples
ng examples
xa programming statements, how totalling and counting could be used
of programming
in this program.
prog
prog
ogra
graam.

To
ota
tallling
Totallingg ..
.........
....
.........
.................................................................................................................................
.............................................................................................................................................

..................................................
..........................................................................................................
..........................................................................................................................................................

...................................................
........................................................................................................
..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

Counting ...........................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................
[4]

© UCLES 2019 2210/22/O/N/19

 3$*(

10

5 The algorithm performs an operation on the array named MyData

DIV means integer division, so only the whole number part of the result is returned
e.g. 7 DIV 2 returns a value of 3

First 0
Last 16
Found FALSE
INPUT UserIn
WHILE (First <= Last) AND (Found = FALSE) DO
Middle (First + Last) DIV 2
IF MyData[Middle] = UserIn
THEN
Found TRUE
ELSE
IF UserIn < MyData[Middle]
THEN
Last Middle - 1
ELSE
First Middle + 1
ENDIF
ENDIF
ENDWHILE
OUTPUT Found

This table
ble sshows
tab
ab h ws
ho ws tthe
he ccontents
ontents of
of the
eaarray:
rray:
rra a a e.g.
ay: MyData
MyDat
yDat e.g. MyD
yDat
ata[
at 2] stores
g. MyData[2]
a[2] oress tthe
stor he vvalue
a ue 5
al

MyData
Index [0]
[0] [1]
[1] [2]
[1 [2] [3]
[3] [4] [5]
5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]
[5
Value 2 3 5 6 8 10 0 12
12 13 14 16 18 20 25 27 29 34 36

(a) Complete the trace table for

o the input data: 10
or

First Last UserIn Middle Found OUTPUT

[6]

(b) Describe the function being performed by the algorithm.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]
© UCLES 2019 2210/23/O/N/19
 3$*(

11

6 Draw fourr different flowchart symbols and describe how they are used in a program flowchart.

Flowchart symbol Description of use

[4]

© UCLES 2019 2210/23/O/N/19 [Turn over

 3$*(

Section B

2 Tick (9) one box in each row to identify if the statement about structure diagrams is true or false.

True False
Statement
(9) (9)
A structure diagram is a piece of code that is available throughout the
structure of a program.
A structure diagram shows the hierarchy of a system.

A structure diagram is another name for an array.

A structure diagram shows the relationship between different components

of a system.
[2]

3 Programs can perform validation and verification checks when data is entered.

(a) Give the names of two different

difffe
erent validation checks and state the purpose of each one.

Check 1 .................
......
.... .............
.........................................................................................................
.....................................................................................................................................

Purp
rpos
rp osse ....
Purpose ....
....
. ........................
.............
........
. ....
..............
.........................
.............................
. ...................................
.....................................................................................................................................

.......
...................................................................................................................................................
...................................................................................................................................................

....................................................................................................................................................
...........
....
. ...........................................................................................................................................

Ch
hecck 2 .............................
Check ..........................................................................................................
.....................................................................................................................................

Purpose ..............................
........................................................................................................
.....................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................
[4]

(b) Give the name of one verification check.

............................................................................................................................................. [1]

(c) Describe the difference between validation and verification.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]

© UCLES 2020 2210/21/M/J/20

 3$*(

4 The pseudocode algorithm shown should allow numbers to be entered and should allow
50 numbers to be stored in an array.

Count 0 ĸ
REPEAT
INPUT Values[Count]
Count Count + 1 ĸ
UNTIL Count = 0

(a) Explain why the algorithm will never end.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]

(b) Re-write the original pseudocode

pseudo
d code so that it terminates correctly and also prevents numbers
do
sto
tore
tore
below 100 from being storeded in the array Values[ ]

...........................
........
....
.....................................................................................................................
...................................................................................................................................................

..
....
...................
. ....
................................................
. ...............................
.........
. ..............
....
...........
.....................
................................................................................................................................................... . ......
................

.....
...
. ...................................................................................................................................................
...................................................................................................................................................

......
................
. ....
................................................................................................................................
...................................................................................................................................................

...........................................
..........................................................................................................
...................................................................................................................................................

.............................................
........................................................................................................
...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [4]

(c) Describe how you could change your pseudocode in part (b) so that it prevents numbers
below 100 and above 200 from being stored in the array Values[ ]

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]

© UCLES 2020 2210/21/M/J/20 [Turn over

 3$*(

10

5 The flowchart represents an algorithm.

The predefined function DIV gives the value of the result of integer division,
for example, y ĸ 9 DIV 4 gives y a value of 2

An input value of –1 ends the algorithm.

START

INPUT
Value

IS Yes
Value =
-1 ?

No

Calc1
Calc
lc1 Value DIV 2

Calc2
Calc
lc2
lc Value DIV 3

IS
No Calc1 =
Value / 2 ?

Yes

IS
No Calc2 =
Value / 3 ?

Yes

OUTPUT
Value
END

© UCLES 2020 2210/21/M/J/20

 3$*(

11

(a) Complete the trace table for the input data:

50, 33, 18, 15, 30, –1, 45, 12, 90, 6

Value Calc1 Calc2 OUTPUT

[4]

(b) Describe the purpose

pur
urpo
pose
pose of the
e algorithm.
algo
go
ori
rith
thm.
th

...
........................
. ...............................................................................................................................
...................................................................................................................................................

....
........
.. ...
. ..........
. ..................................................................................................................................
...................................................................................................................................................

.........
...
...........
............................................................................................................................... [2]
.............................................................................................................................................

© UCLES 2020 2210/21/M/J/20 [Turn over

 3$*(

3 (a) An algorithm has been written in pseudocode to input the names and marks of 35 students.
The algorithm stores the names and marks in two arrays Name[ ] and Mark[ ]. The highest
mark awarded is found and the number of students with that mark is counted. Both of these
values are output.

01 HighestMark 100 ĸ
02 HighestMarkStudents 0 ĸ
03 FOR Count ĸ
1 TO 35
04 OUTPUT "Please enter student name"
05 INPUT Name[Count]
06 OUTPUT "Please enter student mark"
07 INPUT Mark[Counter]
08 IF Mark[Count] = HighestMark
09 THEN
10 HighestMarkStudents HighestMarkStudents – 1 ĸ
11 ENDIF
12 IF Mark[Count] > HighestMark
13 THEN
14 Mark[Count] HighestMark ĸ
15 HighestMarkStudents 1 ĸ
16 ENDIF
17 NEXT Count
18 Hig
i hestMarkStudents," with the highest mark of ",
OUTPUT "There are ", HighestMarkStudents,"
HighestMark

lin
Give linene numbers
numb
num er
mb e s where
where the
the fo
four
urr err
rro
rrors are
errors are to be
be found
f und in
fo n the
the pseudocode.
pse
seudoccod
ode. Suggest
Sug
uggest a
corr
correc
rre tition
ec
correctionon
on for
for each
eac
achh error.

Erro
ro
or 1 lilline
Error ine
n n umbe
um b r ...........
be
number ..........................................................................................................
...................................................................................................................

C orr
rrrec
e ti
tion
Correction n .....
...............................................................................................................................
.................................................................................................................................

...........................................
..........................................................................................................
...................................................................................................................................................

Error 2 line number .............

........................................................................................................
...................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................

Error 3 line number ...................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................

Error 4 line number ...................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................
[4]

© UCLES 2020 2210/22/M/J/20

 3$*(

(b) Explain how you could extend the algorithm to also find the lowest mark awarded, count the
number of students with that mark, and output both these values.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...........................................
.........................................................................................................
...................................................................................................................................................

.................................
.....................................................................................................................
...................................................................................................................................................

.............
........
....
....
....
. ...............................................
.. . ........................................................................
. ............
................................................................................................................................................... ................

........
.........
...........
.. . ..............................................................................................................................
...................................................................................................................................................

....................................................................................................................................................
......
.. .....................
. ..................................................................................................................................

.....
...
....
. ..
.. ....
..........................................................................................................................................
...................................................................................................................................................

.............................................
.......................................................................................................
...................................................................................................................................................

.............................................
........................................................................................................
...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [6]
© UCLES 2020 2210/22/M/J/20 [Turn over
 3$*(

10

4 This flowchart inputs the points won and the points lost when playing a game. The difference
between the points won and lost is calculated and depending on the result the player can: move
up to the next level, stay at the same level, or move down to the previous level. The flowchart
finishes when the input for points won is –1.

START

INPUT
PointsWon, PointsLost

IS
Yes END
PointsWon = –1 ?

No

Difference
PointsWon - PointsLost

OUTPUT
OUTP
OUTPUT
TP T IS
Yes
Ye
es
"Wel
"Well
el
"Welll done
done Difference > =
moove
ve up"
move up" 1000 ?

No

OUTPUT Yes IS
"Sorry move Difference < 0 ?
down"

No

OUTPUT
"Keep on trying"

© UCLES 2020 2210/22/M/J/20

 3$*(

11

(a) Complete a trace table for this set of input data:

5000, 4474, 6055, 2000, 7900, 9800, 3000, 2150, –1, 6700, 7615

PointsWon PointsLost Difference OUTPUT

[3]

(b) The flowchart needs to be changed. When the difference is more than 5000 the output
message is ‘Fantastic leap up two levels’.

Describe the changes that will need to be made to the flowchart.

will

....................................
..................................................................................................................
....
...................................................................................................................................................

.........................
........
.........................
....
. ..
.........................
... ............
....
....
. .................
........
......
................
. .........
................................................................................................................................................... ................

..
..........................................................................................................................................................
...................................................................................................................................................

.....
...
............................
..........................................................................................................................
...................................................................................................................................................

.....
.....
....
.......
..........................................................................................................................................
...................................................................................................................................................

...........................................
..........................................................................................................
...................................................................................................................................................

.............................................
........................................................................................................
...................................................................................................................................................

............................................................................................................................................. [3]

© UCLES 2020 2210/22/M/J/20 [Turn over

 3$*(

2 Describe the purpose of validation and verification checks during data entry.

Include an example for each.

Validation check ................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

Verification check ..............................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................
[4]

© UCLES 2020 2210/02/SP/23 [Turn over

 3$*(

3 Tick (9) one box to show the named section of a program that performs a specific task.

A file

B function

C parameter

D process
[1]

4 A satellite navigation system is an example of a computer system that is made up of sub-systems.

Part of a satellite navigation system:

x allows the user to enter details for a new destination or select a previously saved destination
x displays directions in the form of a visual map or as a list.

Draw a structure diagram for thi

hiis part of the satellite navigation system.
this

[4]

© UCLES 2020 2210/02/SP/23

 3$*(

5 An algorithm has been written in pseudocode to input some numbers. It only outputs any numbers
that are greater than or equal to 100. The number 999 is not output and stops the algorithm.

INPUT Number
WHILE Numbers <> 999 DO
IF Number > 100
THEN
OUTPUT Number
ENDIF
ENDWHILE
OUTPUT Number

(a) Identify the fourr errors in the pseudocode and suggest corrections.

Error 1 .......................................................................................................................................

Correction .................................................................................................................................

...................................................................................................................................................

Error 2 ...............................
.........................................................................................................
.......................................................................................................................................

Correction ....................
.........
.........................................................................................................
.................................................................................................................................

...........................
.............................................................................................................................
...................................................................................................................................................

Erro
Er ror 3 ........................................................................................................................................
ro
Error ...........
........................................
.. ........................
....................
.. .........
.. ..............
......
. ..
.. .....
...... .............................
.. ................

Cor
rrec
rr ectiion
Correctiono ..
..................................................................................................................................
........
..............................................................................................................................

......
..............
.. .......................................................................................................................................
...................................................................................................................................................

Error 4 ...............................
..........................................................................................................
.......................................................................................................................................

Correction ..........................
........................................................................................................
.................................................................................................................................

...................................................................................................................................................
[4]

(b) Write a pseudocode statement to change the corrected algorithm to output all numbers
between 100 and 200 inclusive.

You do not need to rewrite the whole algorithm

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [2]

© UCLES 2020 2210/02/SP/23 [Turn over

 3$*(

7 This flowchart represents an algorithm.

START

Flag m 0
Count m 1

IS Name[Count] Yes
> Name[Count + 1]? Temp m Name[Count]

No Name[Count] m Name[Count + 1]

Name[Count + 1] m Temp

Flag
Fl
F lag
g m 1

Count
Co
Couun
nt m Count
t + 1

No IS Count
=4?

Yes

No IS Flag
=0?

Yes

STOP

© UCLES 2020 2210/02/SP/23

 3$*(

(a) The array Name[1:4] used in the flowchart contains the following data:

Name[1] Name[2] Name[3] Name[4]

Jamal Amir Eve Tara

Complete the trace table using the data given in the array.

Flag Count Name[1] Name[2] Name[3] Name[4] Temp

Jamal Amir Eve Tara

[5]

(b) Describe what the algorithm represented by the flowchart is doing.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [2]

© UCLES 2020 2210/02/SP/23 [Turn over