Cambridge IGCSE™: Computer Science 0478/22

www.dynamicpapers.
com
Cambridge IGCSE™
COMPUTER SCIENCE 0478/22

Paper 2 Algorithms, Programming and Logic May/June 2024
MARK SCHEME
Maximum Mark: 75
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 2024 series for most
Cambridge IGCSE, Cambridge International A and AS Level and Cambridge Pre-U components, and some
Cambridge O Level components.
This document consists of 16 printed pages.
© Cambridge University Press & Assessment 2024 [Turn over

0478/22 Cambridge IGCSE – Mark Scheme www.dynamicpapers.com
May/June 2024
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 descriptions 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.
Marks awarded are always whole marks (not half marks, or other fractions).
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.
Rules must be applied consistently, e.g. in situations where candidates have not followed instructions or in the application of generic level
descriptors.
© Cambridge University Press & Assessment 2024 Page 2 of 16

May/June 2024
PUBLISHED
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).
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.
Mark scheme abbreviations
/ separates alternative words / phrases within a marking point

// separates alternative answers within a marking point
underline actual word given must be used by candidate (grammatical variants accepted)
max indicates the maximum number of marks that can be awarded
( ) the word / phrase in brackets is not required, but sets the context
Note: No marks are awarded for using brand names of software packages or hardware.

May/June 2024
PUBLISHED
Question Answer Marks
1 C 1
2 One mark for each correct line 4

Logic function Standard symbol
AND
XOR
NAND
OR

May/June 2024
PUBLISHED
3 One mark for each correct answer max three 3

MP1 abstraction
MP2 decomposition
MP3 identification of problem
MP4 identification of requirements // outline of success criteria
4(a) One mark per mark point 6

MP1 length check …
MP2 … to ensure the product code entered is 6 characters in length
MP3 format check …
MP4 … to ensure the first two characters of the product code entered are “PD”
MP5 range check …
MP6 … to ensure that the value of the last four figures of the product code entered is between 1000 and 9999
4(b)(i) One mark for correct use of LENGTH operation, one mark for appropriate test 2
Example:
REPEAT
INPUT Product
UNTIL LENGTH(Product) = 6
4(b)(ii) One mark for correct use of SUBSTRING operation, one mark for appropriate test 2
Example:
REPEAT
INPUT Product
UNTIL SUBSTRING(Product, 1, 2) = "PD"

May/June 2024
PUBLISHED
5 One mark for each description, one mark for each example 6
 arithmetic – used in calculations (1) A  B + C (1)
 Boolean – used for operations with true or false values (1) IF B AND C (1)
 logical – used in comparisons/conditional statements/selection statements (1) IF B > C (1)
6(a) One mark for: 4

MP1 adding current value to total
One mark for each point max three.

MP2 input more than one number
MP3 setting total to zero before loop
MP4 correct use of loop including terminal condition
MP5 output total after loop
Example:
Total  0
INPUT Value
WHILE Value <> 9999.9
Total  Total + Value
INPUT Value
ENDWHILE
OUTPUT Total
Value  0
Total  0
REPEAT
Total  Total + Value
INPUT Value
UNTIL Value = 9999.9
OUTPUT Total

May/June 2024
PUBLISHED
6(b) One mark for each point 4

MP1 adding one to counter
MP2 correct use of selection, if current value > 100 THEN … ENDIF
One mark for each point, max two

MP3 input more than one number
MP4 setting counter to zero before loop
MP5 correct use of loop including terminal condition
MP6 output value of counter after loop
Example:
Counter  0
INPUT Value
WHILE Value <> 9999.9
IF Value > 100
THEN
Counter  Counter + 1
ENDIF
INPUT Value
ENDWHILE
OUTPUT Counter
7(a) 01//02//06//10 3
04(07) and/or 08
03(12)

May/June 2024
PUBLISHED
7(b) One mark for each error identified and corrected 3

Line 04 < should be >
Line 08 Count should be Counter
Line 11 ENDWHILE should be ENDIF
01 Max  List[1]
02 Min  List[1]
03 FOR Counter  2 TO 1000
04 IF List[Counter] > Max
05 THEN
06 Max  List[Counter]
07 ENDIF
08 IF List[Counter] < Min
09 THEN
10 Min  List[Counter]
11 ENDIF
12 NEXT Counter
13 OUTPUT "Maximum value is ", Max
14 OUTPUT "Minimum value is ", Min
8(a) X= 1 mark 3
(A AND B) // A AND B 1 mark
AND NOT C 1 mark
X = (A AND B) AND NOT C

May/June 2024
PUBLISHED
8(b) Four marks for 8 correct outputs 4

Three marks for 6/7 correct outputs
Two marks for 4/5 correct outputs
One mark for 2/3 correct outputs
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 0
1 1 0 1
1 1 1 0

May/June 2024
PUBLISHED
9(a) One mark for each of columns A, B and T 5

Two marks for columns List[1] to List[5] all entries correct or
One mark for columns List[1] to List[5] with one error
A B List[1] List[2] List[3] List[4] List[5] T

15 17 20 5 9
FALSE 1 17 15 15
TRUE 2 20 15 15
TRUE 3
TRUE 4 9 5 5
5
FALSE 1 20 17 17
TRUE 2
3
4
5
FALSE 1
2
3
4
5

May/June 2024
PUBLISHED
9(b) One mark for each point 2

MP1 (bubble) sort data in array
MP2 in descending order
10(a) ContractNumber 1
10(b) One mark for every two correct data types 2
Field Data type
ContractNumber text/alphanumeric
Months integer
EndDate date/time
Sport Boolean
10(c) One mark for each point 3

MP1 to find the total number of months for all contracts
MP2 to find the number of contracts
MP3 … that are subscribed to News
10(d) ContractNumber 2
News AND Sport // Sport AND News
Example answer:
SELECT ContractNumber
FROM Contract
WHERE News // News = TRUE AND Sport // Sport = TRUE ;

May/June 2024
PUBLISHED
11 Data Structures required with names as given in the scenario: 15

Arrays or lists Grid
Requirements (techniques)
R1 Set up game – generate random cell, clear all other cells in array, set player start position and start player moves
counter (iteration, use of arrays and library routines (round and random))
R2 Input and check move – is it valid? (input, output, iteration and selection)
R3 Decide outcome – has move found the X? If so, give appropriate output. If not increment counter and continue. If 10
moves exceeded, give appropriate output (use of arrays, iteration, selection and output).
Example 15-mark answer in pseudocode

// Set up game
FOR Row  1 TO 5
FOR Column  1 TO 5
Grid[Row, Column]  ''// set grid cells to be empty
NEXT Column
NEXT Row

May/June 2024
PUBLISHED
11 REPEAT // not in cell 1,1

XRow  ROUND ((RANDOM() * 4) + 1, 0) // Random row position between 1 and 5 in GRID
XColumn  ROUND ((RANDOM() * 4) + 1, 0) // Random column position between 1 and 5 in
GRID
UNTIL XRow <> 1 and XColumn <> 1 // not in cell 1,1
Grid [XRow, XColumn]  'X'

MaxMove  10
NumberMoves  0
PlayerRow  1
PlayerColumn  1
Win  FALSE
// during game
WHILE NumberMoves < MaxMove AND NOT Win
MoveError  FALSE
OUTPUT "Please enter your move, L – Left, R – Right, U – Up or D - Down"
INPUT UPPER(PlayerMove)
REPEAT
CASE OF PlayerMove
'L' : TempColumn  PlayerColumn – 1
'R' : TempColumn  PlayerColumn + 1
'U' : TempRow  PlayerRow – 1
'D' : TempRow  PlayerRow + 1
OTHERWISE MoveError  TRUE
ENDCASE
// check for out-of-range moves

IF TempColumn < 1 or TempColumn > 5
THEN
MoveError  TRUE
ELSE
PlayerColumn  TempColumn
ENDIF

May/June 2024
PUBLISHED
11 IF TempRow < 1 or TempRow > 5

THEN
MoveError  TRUE
ELSE
PlayerRow  TempRow
ENDIF
// check win if X Found

IF Grid [PlayerRow, PlayerColumn] = 'X'
THEN
OUTPUT "You Win"
Win  TRUE
ELSE
IF NOT MoveError
THEN
NumberMoves  NumberMoves + 1
ENDIF
ENDIF
UNTIL NOT MoveError
ENDWHILE
IF NOT Win
THEN
OUTPUT "You Lose"
ENDIF

May/June 2024
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
No creditable At least one programming Some programming techniques used are The range of programming techniques
response. 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
counting, totalling, input and the scenario, check the list of techniques been covered by the use of appropriate
output. needed. programming techniques, check the list of
techniques needed.
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
required. required.
Any use of variables or arrays or
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.

May/June 2024
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
No creditable Program seen without relevant Program seen with some relevant The program has been fully commented
response comments. comment(s).
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 Most of the data structures used have
have meaningful names. meaningful names. All of the data structures used have
meaningful names.
The solution is illogical. The solution contains parts that may be The program is in a logical order.
illogical
The solution is inaccurate in many The solution contains parts that are The solution is accurate.
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 syntax
with errors that attempt to perform some errors that logically perform tasks errors.
a task given in the scenario given in the scenario. Ignore minor
syntax errors.
The solution attempts at least one The solution attempts to meet most of The solution meets all the requirements
of the requirements. the 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 attempt most tasks given in the scenario. the scenario.
the scenario.

Cambridge IGCSE™: Computer Science 0478/22

Uploaded by

Copyright:

Available Formats

Cambridge IGCSE™: Computer Science 0478/22

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cambridge IGCSE™: Computer Science 0478/22

Uploaded by

Copyright:

Available Formats

www.dynamicpapers.

COMPUTER SCIENCE 0478/22

This document consists of 16 printed pages.

© Cambridge University Press & Assessment 2024 [Turn over

GENERIC MARKING PRINCIPLE 1:

Marks must be awarded in line with:

GENERIC MARKING PRINCIPLE 2:

GENERIC MARKING PRINCIPLE 3:

Marks must be awarded positively:

GENERIC MARKING PRINCIPLE 4:

© Cambridge University Press & Assessment 2024 Page 2 of 16

GENERIC MARKING PRINCIPLE 6:

Mark scheme abbreviations

/ separates alternative words / phrases within a marking point

© Cambridge University Press & Assessment 2024 Page 3 of 16

Question Answer Marks

2 One mark for each correct line 4

© Cambridge University Press & Assessment 2024 Page 4 of 16

3 One mark for each correct answer max three 3

Question Answer Marks

4(a) One mark per mark point 6

© Cambridge University Press & Assessment 2024 Page 5 of 16

Question Answer Marks

6(a) One mark for: 4

One mark for each point max three.

© Cambridge University Press & Assessment 2024 Page 6 of 16

6(b) One mark for each point 4

One mark for each point, max two

Question Answer Marks

© Cambridge University Press & Assessment 2024 Page 7 of 16

7(b) One mark for each error identified and corrected 3

Question Answer Marks

X = (A AND B) AND NOT C

© Cambridge University Press & Assessment 2024 Page 8 of 16

8(b) Four marks for 8 correct outputs 4

© Cambridge University Press & Assessment 2024 Page 9 of 16

9(a) One mark for each of columns A, B and T 5

A B List[1] List[2] List[3] List[4] List[5] T

© Cambridge University Press & Assessment 2024 Page 10 of 16

9(b) One mark for each point 2

Question Answer Marks

10(b) One mark for every two correct data types 2

Field Data type

10(c) One mark for each point 3

© Cambridge University Press & Assessment 2024 Page 11 of 16

11 Data Structures required with names as given in the scenario: 15

Example 15-mark answer in pseudocode

© Cambridge University Press & Assessment 2024 Page 12 of 16

11 REPEAT // not in cell 1,1

Grid [XRow, XColumn]  'X'

// check for out-of-range moves

© Cambridge University Press & Assessment 2024 Page 13 of 16

11 IF TempRow < 1 or TempRow > 5

// check win if X Found

© Cambridge University Press & Assessment 2024 Page 14 of 16

0 1–3 4–6 7–9

© Cambridge University Press & Assessment 2024 Page 15 of 16

AO3: Provide solutions to problems by:

0 1–2 3–4 5–6