Cambridge IGCSE™

COMPUTER SCIENCE 0478/23

Paper 2 Algorithms, Programming and Logic May/June 2023
MARK SCHEME
Maximum Mark: 50

Published

This mark scheme is published as an aid to teachers and candidates, to indicate the requirements of the
examination. It shows the basis on which Examiners were instructed to award marks. It does not indicate the
details of the discussions that took place at an Examiners’ meeting before marking began, which would have
considered the acceptability of alternative answers.

Mark schemes should be read in conjunction with the question paper and the Principal Examiner Report for
Teachers.

Cambridge International will not enter into discussions about these mark schemes.

Cambridge International is publishing the mark schemes for the May/June 2023 series for most
Cambridge IGCSE, Cambridge International A and AS Level and Cambridge Pre-U components, and some
Cambridge O Level components.

m
co
e.
at
-m
am
x
.e
w
w
w

This document consists of 19 printed pages.

© UCLES 2023 [Turn over

0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Generic Marking Principles

These general marking principles must be applied by all examiners when marking candidate answers. They should be applied alongside the
specific content of the mark scheme or generic level descriptors for a question. Each question paper and mark scheme will also comply with these
marking principles.

GENERIC MARKING PRINCIPLE 1:

Marks must be awarded in line with:

 the specific content of the mark scheme or the generic level descriptors for the question
 the specific skills defined in the mark scheme or in the generic level descriptors for the question
 the standard of response required by a candidate as exemplified by the standardisation scripts.

GENERIC MARKING PRINCIPLE 2:

Marks awarded are always whole marks (not half marks, or other fractions).

GENERIC MARKING PRINCIPLE 3:

Marks must be awarded positively:

 marks are awarded for correct/valid answers, as defined in the mark scheme. However, credit is given for valid answers which go beyond
the scope of the syllabus and mark scheme, referring to your Team Leader as appropriate
 marks are awarded when candidates clearly demonstrate what they know and can do
 marks are not deducted for errors
 marks are not deducted for omissions
 answers should only be judged on the quality of spelling, punctuation and grammar when these features are specifically assessed by the
question as indicated by the mark scheme. The meaning, however, should be unambiguous.

GENERIC MARKING PRINCIPLE 4:

Rules must be applied consistently, e.g. in situations where candidates have not followed instructions or in the application of generic level

m
co
descriptors.

e.
at
-m
am
x
.e
w
w
© UCLES 2023 Page 2 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
GENERIC MARKING PRINCIPLE 5:

Marks should be awarded using the full range of marks defined in the mark scheme for the question (however; the use of the full mark range may
be limited according to the quality of the candidate responses seen).

GENERIC MARKING PRINCIPLE 6:

Marks awarded are based solely on the requirements as defined in the mark scheme. Marks should not be awarded with grade thresholds or
grade descriptors in mind.

Please note the following further points:

The words in bold in the mark scheme are important text that needs to be present, or some notion of it needs to be present. It does not have to
be the exact word, but something close to the meaning.

If a word is underlined, this exact word must be present.

A single forward slash means this is an alternative word. A double forward slash means that this is an alternative mark point.

Ellipsis (…) on the end of one-mark point and the start of the next means that the candidate cannot get the second mark point without being
awarded the first one. If a mark point has an ellipsis at the beginning, but there is no ellipsis on the mark point before it, then this is just a follow-on
sentence and can be awarded without the previous mark point.

m
co
e.
at
-m
am
x
.e
w
w
© UCLES 2023 Page 3 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

1 B 1

Question Answer Marks

2 One mark per mark point, max four 4

MOD, max two

 To perform (integer) division when one number is divided by another
 … and find the remainder
 Allow example e.g. 7 MOD 2 = 1

RANDOM, max two

 To generate (pseudo) random numbers
 …(usually) within a specified range
 Allow example e.g. RANDOM() * 10 returns a random number between 0 and 10

Question Answer Marks

3 One mark per mark point, max three 3

MP1 A call statement is used in order to make use of a function // the function is called using its identifier
MP2 Parameters are / may be passed (from the main program) to the function (to be used within the function)
MP3 The function performs its task …
MP4 … and returns a value / values to the main program

Question Answer Marks

4(a) One mark per mark point, max two 2

 To ensure that data has been accurately copied // to ensure that changes have not been made to the values originally

m
co
intended when data is copied

e.
 … from one source to another

at
-m
am
x
.e
w
w
© UCLES 2023 Page 4 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

4(b) One mark for each appropriate verification check, max two 4
One mark for each correct accompanying use, max two

For example:

Verification check 1 – Visual check

Use – the user looks through the data that has been entered and confirms that no changes have been made.

Verification check 2 – Double data entry

Use – data is entered twice, the two entries are compared and if they do not match, a re-entry is requested.

Question Answer Marks

5(a) One mark for each correct line. 4

Description Check

to check that the data entered is an check digit

integer

format check
to check that some data has been
entered
length check
to check that the data entered has an
appropriate number of characters presence check

to check that an identification

type check

m
number contains no errors

co
e.
at
-m
am
x
.e
w
w
© UCLES 2023 Page 5 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

5(b) One mark per mark point, max three 3

 appropriate REPEAT / WHILE loop begin and end
 input of Length
 appropriate input prompt / error message
 correct loop exit/entry condition / selection

Example answers:

WHILE Loop

OUTPUT "Enter a number between 15 and 35 inclusive"

INPUT Length
WHILE Length <15 OR Length > 35 (DO)
OUTPUT "Your number must be between 15 and 35 inclusive
INPUT Length
ENDWHILE

REPEAT Loop

REPEAT
OUTPUT "Enter a number between 15 and 35 inclusive"
INPUT Length
UNTIL Length >= 15 AND LENGTH <= 35

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 6 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

6(a) One mark per mark point, max four 4

 Line 01 / Counter  100

should be Counter  0

 Line 03 / While Counter > 100 DO

should be While Counter < 100 DO

 Line 07 / Total  Total + Counter

should be Total  Total + Number

 Line 09 / ENDCASE
should be ENDIF

Correct algorithm
01 Counter  0
02 Total  0
03 WHILE Counter < 100 DO
04 INPUT Number
05 IF Number > 0
06 THEN
07 Total  Total + Number
08 Counter  Counter + 1
09 ENDIF
10 ENDWHILE
11 OUTPUT "The total value of your numbers is ", Total
12 OUTPUT "The average value of your numbers is ", Total / 100

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 7 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

6(b) One mark per mark point, max five 5

MP1 replace line 03
MP2 with FOR
MP3 … with limits 0 to 99 / 1 to 100
MP4 replace line 05 to check if Number is not positive
MP5 … (if Number is not positive) insert a validation and re-input routine between lines 06 and 07 …
MP6 … that will repeat until a positive value is entered
MP7 remove the counter update / line 08
MP8 replace line 10 / ENDWHILE with NEXT

m
co
e.
at
-m
xam
.e
w
w
© UCLES 2023 Page 8 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

7(a) One mark per mark point, max six 6

 correct Total column
 correct Value column
 correct Five1 column
 correct Five2 column
 correct Ten1 and Ten2 columns
 correct OUTPUT column

Total Value Five1 Five2 Ten1 Ten2 OUTPUT

5 1 1 0 0.5 Rejected

50 10 10 5 5

50 52 10 10.4 Rejected

555 111 111 55 55.5 Rejected

57 11 11.4 Rejected

500 100 100 50 50

550 –1 550

m
7(b) One mark per mark point, max two 2

co
 to find if an input is divisible by (both 5 and) 10

e.
at
 … add them together and output the total

-m
amx
.e
w
w
© UCLES 2023 Page 9 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

8(a) One mark for each correct gate, with the correct input(s) as shown. 4

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 10 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

8(b) Four marks for eight correct outputs. 4

Three marks for six or seven correct outputs.
Two marks for four or five correct outputs.
One mark for two or three correct outputs

A B C Z

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 0

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 0

Question Answer Marks

9(a) DECLARE Saying : STRING 1

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 11 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

9(b) One mark per mark point, max five 5

MP1 input a string into Saying
MP2 correct use of OPENFILE to write data
MP3 correct use of WRITEFILE to write Saying
MP4 correct use of CLOSEFILE
MP5 correct use of filename Quotations.txt throughout

For example:

INPUT Saying
OPENFILE "Quotations.txt" FOR WRITE
WRITEFILE "Quotations.txt", Saying
CLOSEFILE "Quotations.txt"

Question Answer Marks

10(a) One mark for each correct answer 2

Fields 5
Records 12

10(b) to uniquely identify a record 1

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 12 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

10(c) Two marks for four correct answers. 2

One mark for two or three correct answers.

Field Data type

Type Alphanumeric

Private Boolean

Rate$ Integer

NumberGuest Integer

10(d) One mark per mark point, max three 3

 data correctly extracted in any two rows
 data correctly extracted in third row
 data in correct order horizontally and vertically

Example answer:

Bay Lodge 10 1000

Coppice Lodge 12 1200
West Lodge 12 1200

m
co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 13 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

11 Read the whole answer: 15

Check if each requirement listed below has been met. Requirements may be met using a suitable built-in function from the
programming language used (Python, VB.NET or Java).
Mark SEEN on script if requirement met, cross if no attempt seen, NE if partially met (see marked scripts).
Use the tables for A02 and A03 below to award a mark in a suitable band using a best fit approach.
Then add up the total.
Marks are available for:
 AO2 (maximum 9 marks)
 AO3 (maximum 6 marks)

Data structures required:

The names underlined must match those given in the scenario:

Arrays or lists Contacts[]

Variables CurrentSize, Cont, Choice, NewContacts, Count, Count2, Flag

Requirements (techniques):
R1 Output menu and input choice, with validation (range check, output with messages, input with prompts).
R2 Input number of new entries, within limits, update current size of contacts, input new data and sort the array (range
check, totalling, iteration and bubble sort).
R3 Output array whole contents and delete contents of array (iteration, output with labelling/messages, array initialisation).

m
co
e.
at
-m
am
x
.e
w
w
© UCLES 2023 Page 14 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

11 Example 15 mark answer in pseudocode

// meaningful identifiers and appropriate data structures for

// all data required
DECLARE Contacts : ARRAY[1:100, 1:2] OF STRING
DECLARE CurrentSize : INTEGER
DECLARE Cont : BOOLEAN
DECLARE Choice : INTEGER
DECLARE NewContacts : INTEGER
DECLARE Count : INTEGER
DECLARE Count2 : INTEGER
DECLARE Flag : BOOLEAN
DECLARE Temp1 : STRING
DECLARE Temp2 : STRING

// the number of contacts in the array

CurrentSize  0

// to allow program to continue indefinitely

Cont  TRUE
WHILE Cont DO
// display menu
OUTPUT "Please choose one of the following: "
OUTPUT "Press 1 to enter new contacts "
OUTPUT "Press 2 to display your contacts "
OUTPUT "Press 3 to delete all contacts "
INPUT Choice
// validate choice as 1, 2 or 3
WHILE Choice = 1 AND CurrentSize = 100 DO
OUTPUT "Your contacts are full, please enter 2 or 3"
INPUT Choice

m
ENDWHILE

co
WHILE Choice < 1 OR Choice > 3 DO

e.
at
OUTPUT "Incorrect entry – please enter 1, 2, or 3"

-m
INPUT Choice

am
ENDWHILE

x
.e
w
w
© UCLES 2023 Page 15 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

11 // enter new contacts

IF Choice = 1
THEN
OUTPUT "How many contacts (1 to 5 only)?"
INPUT NewContacts
// validates new contacts input
WHILE NewContacts < 1 OR NewContacts > 5 DO
OUTPUT "You may only enter between 1 and 5 contacts. Please try again"
INPUT NewContacts
ENDWHILE
// checks the maximum size is not exceeded
WHILE CurrentSize + NewContacts > 100
OUTPUT "Not enough space in your contacts"
OUTPUT "The maximum number you may input is ", 100 – CurrentSize
INPUT NewContacts
ENDWHILE
FOR Count  CurrentSize + 1 TO CurrentSize + NewContacts
OUTPUT "Enter the contact name as last name, first name"
INPUT Contacts[Count, 1]
OUTPUT "Enter the telephone number"
INPUT Contacts[Count, 2]
NEXT Count
CurrentSize  CurrentSize + NewContacts
// bubble sort to sort array if it contains 2 or more contacts
IF CurrentSize >= 2
THEN
REPEAT
Flag  FALSE
FOR Count  1 TO CurrentSize-1
IF Contacts[Count + 1, 1] <
Contacts[Count, 1]

m
THEN

co
Flag  TRUE

e.
at
Temp1  Contacts[Count, 1]

-m
Temp2  Contacts[Count, 2]

am
x
.e
w
w
© UCLES 2023 Page 16 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Question Answer Marks

11 Contacts[Count, 1]  Contacts[Count + 1, 1]
Contacts[Count, 2]  Contacts[Count + 1, 2]
Contacts[Count + 1, 1]  Temp1
Contacts[Count + 1, 2]  Temp2

ENDIF
NEXT Count
UNTIL NOT Flag
ENDIF
ENDIF
// display all contacts
IF Choice = 2
THEN
IF CurrentSize > 0
THEN
OUTPUT "Name and Telephone Number"
FOR Count  1 TO CurrentSize
OUTPUT Contacts[Count, 1], " ", Contacts[Count, 2]
NEXT Count
ENDIF
ENDIF
// delete all contacts
IF Choice = 3
THEN
FOR Count  1 TO 100
FOR Count2  1 TO 2
Contacts[Count, Count2]  ""
NEXT Count2
NEXT Count
ENDIF

m
ENDWHILE

co
e.
at
-m
amx
.e
w
w
© UCLES 2023 Page 17 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED

Marking Instructions in italics

AO2: Apply knowledge and understanding of the principles and concepts of computer science to a given context, including the
analysis and design of computational or programming problems

0 1–3 4–6 7–9

At least one programming technique Some programming techniques used The range of programming techniques
has been used. are appropriate to the problem. used is appropriate to the problem.

Any use of selection, iteration, More than one technique seen applied All criteria stated for the scenario have
counting, totalling, input and output. to the scenario, check the list of been covered by the use of
techniques needed. appropriate programming techniques,
No creditable check the list of techniques needed.
response.
Some data has been stored but not Some of the data structures chosen The data structures chosen are
appropriately. are appropriate and store some of the appropriate and store all the data
data required. required.
Any use of variables or arrays or other
language dependent data structures More than one data structure used to The data structures used store all the
e.g. Python lists. store data required by the scenario. data required by the scenario.

m
co
e.
at
-m
am
x
.e
w
w
© UCLES 2023 Page 18 of 19

w
0478/23 Cambridge IGCSE – Mark Scheme May/June 2023
PUBLISHED
Marking Instructions in italics

AO3: Provide solutions to problems by:

 evaluating computer systems
 making reasoned judgements
 presenting conclusions

0 1–2 3–4 5–6

Program seen without relevant Program seen with some relevant The program has been fully
comments. comment(s). commented.

Some identifier names used are The majority of identifiers used are Suitable identifiers with names
appropriate. appropriately named. meaningful to their purpose have been
used throughout.
Some of the data structures used have Most of the data structures used have
meaningful names. meaningful names. All of the data structures used have
meaningful names.

The solution is illogical. The solution contains parts that may The program is in a logical order.
be illogical.
No creditable The solution is inaccurate in many The solution contains parts that are The solution is accurate.
response. places. inaccurate.
Solution logically performs all the tasks
Solution contains few lines of code Solution contains lines of code with given in the scenario. Ignore minor
with errors that attempt to perform a some errors that logically perform syntax errors.
task given in the scenario. tasks given in the scenario. Ignore
minor syntax errors.

The solution attempts at least one of The solution meets most of the The solution meets all the
the requirements. requirements. requirements given in the question.

m
Solution contains lines of code that Solution contains lines of code that Solution performs all the tasks given in

co
attempt at least one task given in the perform most tasks given in the the scenario.

e.
at
scenario. scenario.

-m
am
x
.e
w
w
© UCLES 2023 Page 19 of 19