Cambridge International Examinations

Cambridge International General Certificate of Secondary Education

COMPUTER SCIENCE 0478/22

Paper 2 Algorithms, Programming and Logic February/March 2024

MARK SCHEME

Maximum Mark : 75

[Turn over
INSERT STANDARD FRONT PAGE
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 descriptors.

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:

Please also read the additional guidance in the mark scheme, it provides further information
about how to mark the question.
Please annotate your scripts. The number of ticks given must match the number of marks
given.
If you award a benefit of doubt (BOD) mark, this must also have a tick.
The sections in brackets in the mark scheme are not necessary in the candidates answer.
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 doesn’t 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.
Red text in the mark scheme is a response that we think it just about okay, but that will not
be published as a response.
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.
Please inform your team leader when you have submitted your standardisation scripts.
They may have many examiners that they are monitoring, so may not see your submission
immediately.
The mark scheme has been agreed at standardisation, so it is the AE’s responsibility to
apply it. You may have differing opinions on how the paper should be marked, but the mark
scheme is what has been agreed by a panel and AE’s are required to apply it.
Please mark your allocation at a steady rate. If you are not able to mark your allocation for
a number of days, inform your team leader, do not wait for them to have to chase you.
Please ensure that you meet the 40% deadline. If you are not close to or meeting this at the
40% deadline, some of your allocation may be reallocated. If you are going to struggle with
this deadline, you must inform your team leader ASAP.
There are blank pages at the start of the exam paper. These needs to be annotated with a
SEEN annotation, to indicate it has been checked for any further responses.
If a candidate writes outside the zoned area for the question, this must be linked to the
response, even if it is not awarded a mark. This demonstrates at EAR that you did read this
part of the response.
If a candidate has crossed out the final section of a response to a question and has not
written anything after the crossed-out work, the crossed-out work must be marked.
Mechanics of Marking:
Every mark given should have a corresponding tick on the script. The number of
ticks on each (part) question should match the number of marks awarded for that
(part) question. If giving Benefit of Doubt, the BOD must be accompanied by a tick.

If a candidate has not given a response or the response is in no way related to the
question, such as ‘don’t know’, NR (the Hash key) should be awarded rather than
zero.

Every part question must be annotated to show that it has been read even if
awarding NR. Please ensure that all part questions that are marked as NR are also
annotated with the SEEN icon. This is a requirement of RM3.

There are two blank pages at the start of each script that must be annotated with
the SEEN icon. ☹

NEW: Words or phrases that are underlined, must be present in the candidate’s
answer. Words or phrases that are emboldened indicate that the idea
represented by the bold text must be included.

Even though the comments box is visible at the bottom of the screen, please do not
put comments or question marks on the scripts. When scripts are returned to
centres all the annotations including comments, are visible.

If work has been crossed out and something written in its place, the replacement
work is marked even if the crossed-out work is correct. If the crossed-out work has
not been replaced, mark the crossed-out answer. Please also annotate the
unmarked work as SEEN, especially if the replacement answer is on a separate
sheet.

For single mark answers, mark the first answer on the line, unless there is a note to
the contrary on the mark scheme.

If a candidate writes something that is not enough (NE) for a mark, but is not
actually incorrect, continue reading, even if the mark scheme says, for example,
mark first two answers.
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

1 B 1
2(a) One mark for each correct line(s) from the test data type 4
Test data type Description

a value that is accepted

abnormal

a value that is the highest or lowest value to be accepted and

the corresponding lowest or highest value to be rejected
boundary

a value that is the highest or lowest value to be rejected

extreme
a value that is rejected

normal
a value that is the highest or lowest value to be accepted

2(b) One mark for each point: 4 Discuss FT at STM

 abnormal for example 31
 boundary 4 and 5 // 10 and 11
 extreme 5 // 10
 normal for example 6

Page 6 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION

Question Answer Marks Guidance

3(a) One mark for each point max four. 4 Discuss other solutions at STM
 input value, outside loop
 correct use of loop
 checking value input against contents of array …
 .. appropriate action
 correct outputs
Example
INPUT MyNumber
Found  0
FOR Index  1 TO 50
IF Values[Index] = MyNumber
THEN
Found  Index
ENDIF
NEXT
IF Found = 0
THEN
OUTPUT "Not found"
ELSE
OUTPUT Found
ENDIF

Page 7 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

3(b) One mark for each point max four. 4 Discuss solutions at STM
 use of inner and outer loop
 correct use of loops
 checking value adjacent values in array …
 ... swap if required
 correct stopping condition
Last  50
Repeat
Swap  FALSE
FOR Index  1 TO Last - 1
IF Values[Index] > Values[Index + 1]
THEN
Temp  Values[Index]
Values[Index]  Values[Index + 1]
Values[Index + 1]  Temp
Swap  TRUE
ENDIF
NEXT
Last  Last - 1
UNTIL NOT Swap or Last = 1
4 One mark for each point max three. 3 Discuss other data types at STM.
 integer Especially those used in Python,
 real Java and VB (recommend
 char languages).
 string
 Boolean

Page 8 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION

Question Answer Marks Guidance

5(a) One mark for each error identified and correction 3

 Line 05 OUTPUT should be INPUT
 Line 06 OR should be AND
 Line 10 NEXT should be ENDIF

5(b)(i) One mark for checking for < 0 or >= 0 3 Solutions are examples only
One mark for repeating input e.g. use of REPEAT WHILE or using existing loop
One mark for checking both inputs
For example
REPEAT
OUTPUT “Enter cost price “
INPUT Cost
UNTIL Cost >= 0
REPEAT
OUTPUT “Enter selling price “
INPUT Sell
UNTIL Sell >= 0
or
OUTPUT “Enter cost price “
INPUT Cost
WHILE Cost < 0
OUTPUT “Enter cost price “
INPUT Cost
ENDWHILE
OUTPUT “Enter selling price “
INPUT Sell
WHILE Sell < 0
OUTPUT “Enter selling price “
INPUT Sell
ENDWHILE

5(b)(ii) One mark for identifying validation check and one mark for accompanying description max four 4 Not range check as it is
 presence check (1) to check that values have been input (1) given in part g(i).
 type check (1) to check for numerical values (1)
Page 9 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

6 One mark for identifying a type of iteration, one mark for accompanying description max four 4 Allow FT for description if
 count controlled (1) number of iterations is pre-determined (1) code for loop is given l
 pre-condition (1) checks condition at start of loop // loop may not iterate (1) e.g. FOR.. NEXT
 post-condition (1) checks condition at end of loop // loop always iterates at least once(1) Discuss omission of pre/post
at STM

Page 10 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

7(a) One mark for each correct gate, with the correct input(s) as shown. 4 Allow 1 mark if two AND gates
reversed

7(b) 4
A B C X
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
4 marks for 8 correct outputs
3 marks for 6/7 correct outputs
2 marks for 4/5 correct outputs
1 mark for 2/3 correct outputs

Page 11 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

8 4
NumberGroups Total GroupSize Average OUTPUT

0 0

1 7 7

2 17 10

3 19 2

4 27 8

5 30 3

6 39 9

0 6 Average group size 6

One mark for each column Total, Average and OUTPUT

One mark for columns NumberGroups and GroupSize

Page 12 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks Guidance

9(a)(i) StorageID 1
9(a)(ii) It is a unique identifier 1
9(b) One mark for every two correct data types 2
Field Data type
SizeMetres Real
Position Char/Integer/Text
Hoist Boolean/Text
StorageID Text/Alphanumeric

9© One mark if two correct or two marks if completely correct 4 Fields can be in any order in
SELECT StorageID, PriceMonth, SizeMetres SELECT line.
One mark each point max two
FROM StorageUnits
WHERE Hoist = TRUE;
10 One mark for each point max six 6
 use comments …
 … to explain the purpose of each section of code
 …for example, logic / syntax
 use meaningful identifier names to …
 … clearly identify the purpose …
 … of variables, constants, arrays, procedures etc
 use procedures and functions …
 … to avoid repeated code
 … simplify logic
 use indentation and white space …
 … to make the program readable

Page 13 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
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 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 AO2 and AO3 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 shown underlined must match those given in the scenario
Arrays or lists StudentName, ScreenTime
Constant ClassSize could be variable

Requirements (techniques)
R1 allows a student to enter their weekly screen time and calculates the total number of minutes of screen time for each
student in the week (input, iteration and totalling)
R2 counts the number of days with more than 300 minutes screen time each day and calculates the average week’s
screen time for the whole class (selection, counting, iteration, calculating average)
R3 finds the student with the lowest weekly minutes. Outputs for each student: name, total week’s screen time in hours
and minutes, number of days with more than 300 minutes screen time, outputs the average weeks screen time for the
whole class and the name of the student with the lowest number of minutes (finding minimum value, output)

Page 14 of 17
 0478/22 Final Draft Qualification - Mark Scheme February/March 2024
PRE-STANDARDISATION
Question Answer Marks

Example 15 mark answer in pseudocode

WeekLength  5
LowestMinutes  1000
ClassTotal 0
FOR StudentCounter  1 to ClassSize // loop for each student
Total  0
DaysOver300  0
FOR DayCounter  1 to WeekLength // loop for each day
REPEAT
OUTPUT "Please enter number of minutes for day ", DayCounter
INPUT Minutes
UNTIL Minutes >= 0
ScreenTime[StudentCounter, DayCounter]  Minutes
Total  Total + Minutes
IF Minutes > 300
THEN
DaysOver300  DaysOver300 + 1
ENDIF
IF Minutes < LowestMinutes
THEN
LowestMinutes  Minutes
LowestIndex  StudentCounter
ENDIF
NEXT DayCounter
OUTPUT StudentName[StudentCounter]
OUTPUT "Screen time ", DIV(Total, 60), " hours ", MOD(Total, 60), " minutes "
OUTPUT "Days with more than 300 minutes screen time ", DaysOver300
ClassTotal  ClassTotal + Total
NEXT StudentCounter

OUTPUT "Average weekly screen time for class ", ClassTotal / ClassSize, " minutes "
OUTPUT "Lowest weekly time ", StudentNames[LowestIndex]

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

Page 16 of 17
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 commented
comments. comment(s).

Suitable identifiers with names meaningful

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

The solution contains parts that may be

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

The solution attempts at least one

The solution meets most of the The solution meets all the requirements
of the requirements.
requirements. given in the question.
Solution contains lines of code that
Solution contains lines of code that Solution performs all the tasks given in
attempt at least one task given in
perform most tasks given in the scenario. the scenario.
the scenario.

Page 17 of 17