Comp SC 2021
Comp SC 2021
* 0 8 0 3 7 2 8 9 4 0 *
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 75.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (PQ/SG) 202679/4
© UCLES 2021 [Turn over
2
1 A hockey club records the number of people that watch each match. An 8-bit binary register is
used to store this value.
(a) 46 people watch the first match and 171 people watch the second match.
Show how the registers would store these denary values as 8-bit binary.
Denary
8-bit binary
value
46
171
[2]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
(b) Give the largest denary value that can be stored in the 8-bit binary register.
............................................................................................................................................. [1]
(c) The hockey club wants to increase the number of people that can watch each match to 2000.
The 8-bit binary register may no longer be able to store the value.
Give the smallest number of bits that can be used to store the denary value 2000.
............................................................................................................................................. [1]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
(d) Electronic data about the final score for the match is transmitted to a central computer
30 kilometres away, using serial transmission.
(i) Explain why serial transmission is more appropriate than parallel transmission in this
scenario.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [3]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [2]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [3]
2 Gurdeep takes high definition photographs using a digital camera. She has set up a website where
users can view thumbnails of her photographs. A thumbnail is a small version of the high definition
photograph.
(a) Gurdeep compresses the high definition photographs to create the thumbnails. She uses
lossy compression.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
(b) Gurdeep sets up a web server to host her website. She reads about an Internet Protocol (IP)
address, a Media Access Control (MAC) address and a Uniform Resource Locator (URL).
Term Example
IP address 192.168.0.255
URL 00:15:E9:2B:99:3C
[2]
(c) Users can buy the high definition photographs from the website. When a user buys a high
definition photograph, a Secure Socket Layer (SSL) connection is created.
...........................................................................................................................................
..................................................................................................................................... [1]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [4]
3 The given table shows the name or description of four devices. The table is incomplete.
...............................................................................................
...............................................................................................
Actuator
...............................................................................................
...............................................................................................
...............................................................................................
...............................................................................................
Mouse
...............................................................................................
...............................................................................................
[4]
(a) Explain how the barcode is read at the supermarket checkout and how the price of the product
is found.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
(b) The supermarket stores data using a Solid State Drive (SSD).
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [3]
(ii) One advantage of an SSD rather than a Hard Disk Drive (HDD) is that it has no moving
parts, so it is more durable.
State one other advantage of the supermarket using SSD rather than HDD.
...........................................................................................................................................
..................................................................................................................................... [1]
(a) State the single logic gate that produces each truth table.
A B Output
0 0 1
0 1 1 ...................................................................................
1 0 1
1 1 0
A B Output
0 0 0
0 1 1 ...................................................................................
1 0 1
1 1 0
A B Output
0 0 1
0 1 0 ...................................................................................
1 0 0
1 1 0
[3]
(b) An aeroplane has a warning system that monitors the height of the aeroplane above the
ground, whether the aeroplane is ascending or descending, and the speed of the aeroplane.
The warning system will produce an output of 1 that will sound an alarm (W) when either of
these conditions apply:
or
A W
[5]
6 Hacking is one type of Internet risk used to obtain personal data that is stored on a computer.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
(b) Identify and describe two other types of internet risk that are used to obtain personal data.
Description ................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Description ................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
(b) Adeel uses an interpreter while developing and testing the application.
Adeel uses a compiler when the application is ready to be shared with others.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [5]
© UCLES 2021 0478/12/F/M/21 [Turn over
12
...................................................................................................................................................
............................................................................................................................................. [1]
...................................................................................................................................................
............................................................................................................................................. [1]
8 The Von Neumann model, for a computer system, uses the stored program concept.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
(b) The fetch-execute cycle of a Von Neumann model, for a computer system, uses registers and
buses.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [2]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [2]
(c) Computers based on the Von Neumann model, for a computer system, use interrupts.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
BLANK PAGE
BLANK PAGE
BLANK PAGE
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 March 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.
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.
• 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 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.
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.
46 0 0 1 0 1 1 1 0
171 1 0 1 0 1 0 1 1
1(b) − 255 1
1(c) − 11 1
IP address 192.168.0.255
URL 00:15:E9:2B:99:3C
5(a) 3
Truth table Logic gate
NAND [1]
A B Output
0 0 1
0 1 1
1 0 1
1 1 0
0 0 0
0 1 1
1 0 1
1 1 0
NOR [1]
A B Output
0 0 1
0 1 0
1 0 0
1 1 0
5(b) One mark for each logic gates with correct inputs 5
− NOT A
− NOT S
− H AND NOT A
− NOT A AND NOT S
− Final OR
− Phishing
− Legitimate looking email sent to user
− Clicking on link/attachment takes user to fake website
− Pharming
− Software is installed on user’s computer
− Redirects (correct URL) to different/fraudulent website
− Interpreter translates one line at a time // checks one line and then runs it
− Compiler translates whole code in one go // checks all code and then runs
it
− Shareware normally allows a trial period for the end user // shareware has
limited features to start with
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Do not attempt Tasks 1, 2 and 3 in the copy of the pre-release material on page 2; these are for
information only.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 50.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (CE/SG) 202680/2
© UCLES 2021 [Turn over
2
Section A
You are advised to spend no longer than 40 minutes answering this section.
Use the pre-release material and your experience from attempting the tasks before the examination to
answer Question 1.
Pre-release material
A program is needed for a quiz to help younger students to practise their multiplication tables. There
needs to be two ways of using the quiz; testing and learning.
Testing: the student is given one attempt at answering each question and the score is calculated for
the whole test.
Learning: the student is given up to three attempts to get their answer to each question correct. There
is no scoring.
A student can choose which multiplication table, from 2 to 12, to use for the quiz. There are five
questions in each quiz, each question must use the chosen multiplication table and a different whole
number (from 1 to 12) as the multiplier.
Write and test a program or programs for a multiplication tables quiz.
• Your program or programs must include appropriate prompts for the entry of data; data must be
validated on entry.
• Error messages and other output need to be set out clearly and understandably.
• All variables, constants and other identifiers must have meaningful names.
You will need to complete these three tasks. Each task must be fully tested.
Task 1 – Testing a student
Students enter their name and choice of multiplication table. Each question is displayed on the screen
one at a time, for example:
Question 1
2X7=
Students enter their answer and move on to the next question. A running total of correct answers
(score) is kept. At the end of the quiz the student’s name and score are displayed with a personalised
message related to the score, for example:
Up to three attempts are offered to get each answer correct. After the third incorrect attempt, the correct
answer is displayed and the quiz moves on to the next question.
Task 3 – Varying the quiz
Modify Task 1 to allow students to choose how many questions they would like in the test and if they
would like a ‘mixed’ set of questions. A ‘mixed’ set means that each question can be from a different
multiplication table; from 2 to 12.
© UCLES 2021 0478/22/F/M/21
3
1 All variables, constants and other identifiers must have meaningful names.
(a) Identify the variable that you used to store the student’s answer in Task 1. Give the most
appropriate data type for this variable. Explain how your program ensured that any data
entered for the answer was valid.
Variable .....................................................................................................................................
Validation ..................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
(b) Identify and give the data type of a different variable, that you could have used in Task 2.
State the use of this variable in Task 2.
Variable .....................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
[3]
(c) Write an algorithm for Task 1, using either pseudocode, programming statements or a
flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
© UCLES 2021 0478/22/F/M/21 [Turn over
6
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
(e) Explain how you could alter Task 1 to change the quiz to:
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
Section B
01 A ←0
O2 B ←0
03 C ←0
04 REPEAT
05 REPEAT
06 INPUT D
07 UNTIL D > 0 AND D < 100 AND D = INT(D)
08 IF D > B
09 THEN
10 B D ←
11 ENDIF
12 C ← C + D
13 A ← A + 1
14 UNTIL A >= 25
15 E ←C / A
16 OUTPUT "Largest number is ", B
17 OUTPUT "Average is ", E
Totalling ....................................................................................................................................
Counting ...................................................................................................................................
(b) State an example for each type of test data needed to test the input of the number:
(c) The algorithm needs to be changed to include finding and outputting the smallest number input.
Describe how you would change the algorithm.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
Draw a line from each pseudocode statement to its correct flowchart symbol.
IF X > 12
INPUT X
X Y + Z
OUTPUT X
[4]
4 This algorithm accepts weights of bags of cookies. Any cookie bag weighing between 0.9 and
1.1 kilograms inclusive is acceptable. Underweight bags weigh less than 0.9 kilograms and
overweight bags weigh more than 1.1 kilograms. An input of a negative number stops the process.
Then the total number of bags, the number of overweight bags and the number of underweight
bags weighed are output.
Accept← 0
Over ← 0
Under← 0
OUTPUT "Enter weight of first cookie bag"
INPUT BagWeight
WHILE BagWeight > 0
IF BagWeight > 1.1
THEN
Error ← 1
ELSE
IF BagWeight < 0.9
THEN
Error ← 2
ELSE
Error ← 0
ENDIF
ENDIF
CASE Error OF
0 : Accept ← Accept + 1
1 : Over ← Over + 1
2 : Under ← Under + 1
ENDCASE
OUTPUT "Weight of next bag?"
INPUT BagWeight
ENDWHILE
Total ← Accept – Over – Under
OUTPUT "Number of bags weighed ", Total
OUTPUT "Number overweight ", Over
OUTPUT "Number underweight ", Under
(a) Complete a trace table for the given algorithm using this input data:
1.05, 0.99, 1.2, 0.85, 1.1, 0.9, 1.5, 0.95, 1.05, 1.00, 1.07, 0.89, –10
[7]
Error ..........................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
[2]
5 A database table, CHOCBAR, is used to keep a record of chocolate bars sold. Chocolate bars are
categorised by:
(a) Select the most appropriate data type for these three fields from the four data types shown.
Each data type must be different. State the reason why you chose the data type.
Reason .....................................................................................................................................
...................................................................................................................................................
Reason .....................................................................................................................................
...................................................................................................................................................
Reason .....................................................................................................................................
...................................................................................................................................................
[3]
(b) Complete the query-by-example grid below to display only the price, filling and number sold
of small chocolate bars that have sold fewer than 10 bars.
Field:
Table:
Sort:
Show:
Criteria:
or:
[3]
BLANK PAGE
BLANK PAGE
BLANK PAGE
BLANK PAGE
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 March 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.
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.
• 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 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.
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.
Section A
1(d) Explanation 4
One mark per mark point illustrated with a suitable programming statement, max
four
MP1 extra prompt and input to choose the number of questions and/or
mixed set
MP2 method of choosing number of questions and/or mixed set
MP3 extra prompt and input for number of questions
MP4 explanation of validation for either input
MP5 how the end value for the question loop was changed if required
MP6 how the program was changed to allow for mixed tables
MP7 … how the program ensured that the test used more than one
multiplication table
1(e) Explanation 3
One mark per mark point, max three
MP1 how to provide 3 answers, including the correct one
MP2 how to ensure that all 3 answers are different
MP3 how 3 answers are displayed e.g. output all 3 answers as a numbered
list
MP4 how to select the correct answer e.g. input the number of the correct
answer
MP5 how to ensure that the correct answer is not always in the same
position
Section B
2(a) – 12 4
– 13
– 07
– 15
2(b) – 27 (example many correct answers any whole number 1-99 inclusive) 3
– 106 (example many correct answers)
– 99/1
IF X > 12
INPUT X
X ← Y + Z
OUTPUT X
Two marks for two single lines from INPUT X and OUTPUT X to output box
OR
One mark for a single line from INPUT X or OUTPUT X to output box // two
single lines from INPUT X and OUTPUT X to process box
5(b) 3
Field: SIZE FILLING PRICE NUMBERSOLD
Sort:
Show:
or:
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 75.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (DH/SG) 202677/4
© UCLES 2021 [Turn over
2
(a) Complete the table to show the hexadecimal and 8-bit binary values of the given denary
values.
49
123
200
[6]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Benefit 1 ....................................................................................................................................
...................................................................................................................................................
Benefit 2 ....................................................................................................................................
...................................................................................................................................................
[2]
(c) Hexadecimal is used to represent Hypertext Markup Language (HTML) colour codes in
computer science.
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
Tick (3) to show if the statement applies to magnetic, solid state or optical storage. Some
statements may apply to more than one type of storage.
..................................................................................................................................... [1]
..................................................................................................................................... [1]
(iii) Identify which type of storage would be the most suitable for use in a web server and
justify your choice.
Justification ........................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
[3]
(c) Describe the operation of USB flash memory and how it stores data.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
Do not attempt to simplify the statement. All logic gates must have a maximum of two inputs.
B X
[6]
(b) Consider the completed truth table for the given logic statement.
2 0 0 1 1
3 0 1 0 1
4 0 1 1 0
5 1 0 0 1
6 1 0 1 0
7 1 1 0 1
8 1 1 1 1
There are four errors in the truth table in the output (X) column.
Row .......................
Row .......................
Row .......................
Row .......................
[4]
4 Three types of Internet security risk are virus, spyware and denial of service (DoS) attack.
Tick (3) to show whether the statement applies to virus, spyware or denial of service. Some
statements may apply to more than one Internet security risk.
Denial of
Statement Virus Spyware service
(3) (3) (3)
captures all data entered using a keyboard
is self-replicating
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
(c) Some Internet security risks can maliciously damage data. Data can also be damaged
accidentally.
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
5 A security light system is used by a factory. The light only comes on when it is dark and when
movement is detected. The light will stay on for 1 minute before switching off.
Sensors and a microprocessor are used to control the security light system.
(a) Identify two sensors that would be used in the security light system.
Sensor 1 ...................................................................................................................................
Sensor 2 ...................................................................................................................................
[2]
(b) Describe how the sensors and the microprocessor control the security light system.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [8]
6 Cookies can be used to store a user’s personal data and online browsing habits.
(a) A cookie could be used to automatically enter a user’s payment details when the user makes
a purchase online.
Describe how cookies can be used to store and automatically enter a user’s payment details.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
(b) Explain why a user may be concerned about their personal data and online browsing habits
being stored in cookies.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
7 Jolene uses HTML to create a website. She separates the HTML into structure and presentation.
..................................................................................................................................... [1]
1 ........................................................................................................................................
2 ........................................................................................................................................
[2]
(b) Explain why Jolene separates the HTML into structure and presentation.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
8 A keyboard is a type of input device that can be used to enter data into a computer.
Complete the paragraph that describes one method of operation for a keyboard, using the most
appropriate terms from the given list. Not all terms in the list need to be used.
• Binary
• Breaks
• Calculated
• Character
• Circuit
• Current
• Information
• Network
• Press
• Processor
• Signal
• Switch
A keyboard has a key matrix underneath the keys. When a key is pressed, it presses a
............................................. map to find the ............................................. value for the key that
BLANK PAGE
BLANK PAGE
BLANK PAGE
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.
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.
• 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 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.
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.
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.
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 MP has ellipsis at the beginning,
but there is no ellipsis on the MP before it, then this is just a follow-on sentence and can be
awarded without the previous mark point.
49 31 00110001
123 7B 01111011
200 C8 11001000
2(b)(iii) One for type of storage, two for matching justification from: 3
− Magnetic // HDD
− (Web server) is likely to receive many requests a day
− (Web server) will likely need to store a lot of data and magnetic is high
capacity
− Magnetic is cheaper to buy for storage per unit than solid state
− Magnetic is capable of more of read/write requests over time // has more
longevity // SSD has more limited number of read/write requests (before
it is no longer usable)
− No requirement for it to be portable, so moving parts does not matter
− Solid-state // SSD
− (Web server) is likely to receive many requests a day
− (Web server) will likely need to store a lot of data and solid-state is high
capacity
− Solid-state is more energy efficient
− Solid-state runs cooler so will not overheat
− Solid state has faster read/write speeds to handle volume of traffic
3(a) One mark for each correct logic gate with correct input. 6
is self-replicating
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Do not attempt Tasks 1, 2 and 3 in the copy of the pre-release material on page 2; these are for
information only.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 50.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (LK) 202758/1
© UCLES 2021 [Turn over
2
Section A
You are advised to spend no longer than 40 minutes answering this section.
Use the pre-release material and your experience from attempting the tasks before the examination to
answer Question 1.
Pre-release material
An electric mountain railway makes four return trips every day. In each trip the train goes up the
mountain and back down. The train leaves from the foot of the mountain at 09:00, 11:00, 13:00 and
15:00. The train returns from the top of the mountain at 10:00, 12:00, 14:00 and 16:00. Each train
has six coaches with eighty seats available in each coach. Passengers can only purchase a return
ticket; all tickets must be purchased on the day of travel. The cost is $25 for the journey up and
$25 for the journey down. Groups of between ten and eighty passengers inclusive get a free ticket
for every tenth passenger, provided they all travel together (every tenth passenger travels free).
Passengers must book their return train journey, as well as the departure train journey, when they
purchase their ticket. Passengers can return on the next train down the mountain or a later train.
The last train from the top of the mountain has two extra coaches on it.
The train times are displayed on a large screen, together with the number of tickets still available
for each train. Every time a ticket is booked the display is updated. When a train is full, the word
‘Closed’ is displayed instead of the number of tickets available.
Write and test a program or programs for the electric mountain railway.
• Your program or programs must include appropriate prompts for the entry of data; data must
be validated on entry.
• Error messages and other output need to be set out clearly and understandably.
• All variables, constants and other identifiers must have meaningful names.
You will need to complete these three tasks. Each task must be fully tested.
1 All variables, constants and other identifiers must have meaningful names.
(a) Identify and give the data type and use of one array that you could have used for Task 1.
Array .........................................................................................................................................
Use ...........................................................................................................................................
[3]
(b) Describe two validation checks that could be used when inputting the number of tickets to
buy for Task 2. For each validation check give one example of normal data and one example
of erroneous data.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
(c) Write an algorithm for the part of Task 2 that inputs the tickets required, calculates the total
price for the ticket(s) purchased by a passenger including a group discount (if applicable) and
updates the data structures used for the totals.
Use either pseudocode, programming statements or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© UCLES 2021 0478/22/M/J/21
5
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
(d) Explain how your program completed Task 3. Include any programming statements that you
have used and fully explain the purpose of each statement.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [5]
Section B
2 (a) Write an algorithm in pseudocode to input 500 positive whole numbers. Each number input
must be less than 1000. Find and output the largest number input, the smallest number input
and the range (difference between the largest number and smallest number).
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
(b) Describe how the algorithm could be changed to make testing less time-consuming.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
3 (a) Draw the most appropriate flowchart symbol for each pseudocode statement.
IF Number = 20
PRINT Number
Number ← Number + 1
[3]
(b) State the type of each pseudocode statement. For example, X ← X + Y is totalling.
IF Number = 20 ...................................................................................................................
• Each password must be 8 or more characters in length; the predefined function Length
returns the number of characters.
• Each password is entered twice, and the two entries must match.
• Either Accept or Reject is output.
• An input of 999 stops the process.
REPEAT
OUTPUT "Please enter password"
INPUT Password
IF Length(Password) >= 8
THEN
INPUT PasswordRepeat
IF Password <> PasswordRepeat
THEN
OUTPUT "Reject"
ELSE
OUTPUT "Accept"
ENDIF
ELSE
OUTPUT "Reject"
ENDIF
UNTIL Password = 999
(a) Complete the trace table for the algorithm using this input data:
Secret, Secret, VerySecret, VerySecret, Pa55word, Pa55word, 999, 888
[3]
(b) Explain how the algorithm could be extended to allow three attempts at inputting the matching
password. Any pseudocode statements used in your answer must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................ [4]
(a) Write a pseudocode routine that sets each element to zero. Use the most suitable loop
structure.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
...................................................................................................................................................
............................................................................................................................................. [1]
6 A database table, PLANT, is used to keep a record of plants sold by a nursery. The table has these
fields:
• NAME – name of plant
• FLOWER – whether the plant flowers (True) or not (False)
• POSITION – shade, partial shade or sun
• SIZE – small, medium or large
• PRICE – price in $
• NUMBERSOLD – how many sold
A query-by-example grid has been completed to display only the price, name and number sold of
small plants that do not flower.
Table: PLANT
Sort:
Show: 3 3 3
Criteria: = "shade"
or:
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Field:
Table:
Sort:
Show:
Criteria:
or:
[5]
BLANK PAGE
BLANK PAGE
BLANK PAGE
BLANK PAGE
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.
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.
• 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 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.
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.
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.
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 MP has ellipsis at the beginning, but there is no ellipsis on the MP before it, then this is just a follow-on sentence and can
be awarded without the previous mark point.
Section A
1(b) One mark for description, one mark for normal data and one mark for erroneous data for two checks 6
Validation check (type check) to check that the number entered is a whole number / integer
Normal data 34
Erroneous data two // 1.5
Validation check (range check) to check that the value of the number entered is between 1 and 80 / 480 inclusive
Normal data 34
Erroneous data 99 // 500
Validation check (presence check) to check that a value has been entered
Normal data 34 // any data entered
Erroneous data “” // blank // no data entered
Validation check (length check) to check that a value has 3 digits or fewer // between 1 and 3 digits
Normal data 345
Erroneous data 3456
Example answers
OUTPUT "How many tickets"
INPUT NoTickets
OUTPUT "Which Train up the mountain? 1, 2, 3 or 4"
INPUT UpNumber
OUTPUT "Which Train down the mountain? 1, 2, 3 or 4"
INPUT DownNumber
IF (DownNumber = 4 AND TrainUp[UpNumber] + NoTickets <= 480 AND TrainDown[DownNumber] +
NoTickets <= 640) OR (TrainUp[UpNumber] + NoTickets <= 480 AND TrainDown[DownNumber] +
NoTickets <= 480)
THEN
Cost ← (NoTickets – NoTickets DIV 10) * 50
TrainUp[UpNumber] ← TrainUp[UpNumber] + NoTickets
TrainDown[DownNumber] ← TrainUp[DownNumber] + NoTickets
TrainUpTotal[UpNumber] ← TrainUpTotal[UpNumber] + Cost / 2
TrainDownTotal[DownNumber] ← TrainDownTotal[DownNumber] + Cost / 2
ENDIF
1(c)
START
OUTPUT "Tickets"
INPUT Tickets
Is Tickets <= No
UpTickets[UpNo] AND
Tickets <=
DownTickets[DownNo]?
Yes
END
1(d) Explanation 5
Any five from:
MP1 How the program displayed the number of passengers for a journey ...
MP2 … how completed for all trains
MP3 How the program displayed the amount of money taken for a journey …
MP4 … how completed for all trains
MP5 How the program calculated the total number of passengers
MP6 How the program calculated the total money taken
MP7 How the program attempted to select the train journey with the most passengers
MP8 How the program attempted to dealt with more than one train being the most popular
MP9 How the program displayed the results with suitable messages
Section B
2(b) One mark for action required and one mark for method used 2
3(a) 3
Pseudocode statement Flowchart symbol
IF Number = 20
PRINT Number
Number ← Number + 1
Secret Reject
Secret Reject
999 Reject
Sort:
Show:
or:
OR
Sort:
Show:
or:
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 75.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (KS/FC) 202713/4
© UCLES 2021 [Turn over
2
Tick (✓) one box to show whether denary is a base-2, base-10 or base-16 number system.
Tick
(✓)
Base-2
Base-10
Base-16
[1]
05 ......................................................
20 ......................................................
1A ......................................................
AB ......................................................
[4]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Tick (✓) one box to show the correct 8-bit binary value for each hexadecimal value.
Tick
(✓)
00011001
00100101
10100001
[1]
Tick
(✓)
00011011
10110001
00011010
[1]
(d) (i) Give one way that hexadecimal is used in website development.
..................................................................................................................................... [1]
..................................................................................................................................... [1]
2 A train company wants to install a self-service ticket machine system for its train stations. When
the customer has purchased their tickets, the machine will provide a paper ticket.
(a) One output device that is used in the ticket machine is a display screen.
Identify one other output device that is used in the ticket machine system.
............................................................................................................................................. [1]
(b) The train company does not want users to use a keyboard or a mouse to enter their data,
when buying a ticket. The company is worried that they may be stolen or get too dirty.
Identify one other input device that would be suitable for use in the ticket machine system, to
allow users to enter their data.
............................................................................................................................................. [1]
Tick (✓) to show if each statement applies to serial simplex, parallel simplex, parallel
half-duplex or serial duplex data transmission. Some statements may apply to more than one
data transmission method.
(b) A Universal Serial Bus (USB) connection can be used to transmit data from a mobile device
to a computer.
Benefit 1 ...................................................................................................................................
...................................................................................................................................................
Benefit 2 ...................................................................................................................................
...................................................................................................................................................
Benefit 3 ...................................................................................................................................
...................................................................................................................................................
[3]
Complete the paragraph using the list of terms. Not all terms in the list need to be used.
• capacitive
• change
• circuit
• conductive
• coordinates
• grid
• heat
• infra-red
• insulating
• light
• manufacture
• pressure
• resistive
top layer of the screen and makes it connect with the bottom layer to complete a
............................................................................ .
5 Sammi works for a finance company and has a laptop that he uses for his work. He has confidential
data about his customers stored on his laptop.
(a) Sammi is concerned about his customers’ confidential data being viewed by other people in
his office.
Identify three other methods Sammi could use to prevent his customers’ confidential data
being viewed.
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
(b) Sammi creates videos for the finance company website that give customers advice about
their finances.
He uses lossy compression to reduce the file size of the videos for the website.
(i) Give three ways that lossy compression can reduce the file size of the videos.
1 ........................................................................................................................................
...........................................................................................................................................
2 ........................................................................................................................................
...........................................................................................................................................
3 ........................................................................................................................................
...........................................................................................................................................
[3]
(ii) Give one drawback of using lossy compression to reduce the file size of the videos.
...........................................................................................................................................
..................................................................................................................................... [1]
(c) Sammi could have used lossless compression to compress the videos for the website.
(i) Give one reason why he would use lossless compression, rather than lossy compression,
for the videos.
...........................................................................................................................................
..................................................................................................................................... [1]
(ii) Give two disadvantages of Sammi using lossless compression, rather than lossy
compression, for the videos.
Disadvantage 1 .................................................................................................................
...........................................................................................................................................
Disadvantage 2 .................................................................................................................
...........................................................................................................................................
[2]
6 A programmer can use translators, such as an interpreter and a compiler, when developing a
computer program.
...................................................................................................................................................
............................................................................................................................................. [1]
Difference 1 ..............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Difference 2 ..............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
............................................................................................................................................. [1]
Tick (✓) to show if each statement applies to a 3D scanner, barcode reader or a Quick Response
(QR) code reader. Some statements may apply to more than one type of device.
3D Barcode QR code
Statement scanner reader reader
(✓) (✓) (✓)
uses position and alignment markers for orientation
when scanning
8 An electronic game has three square mats that are coloured red, green and blue.
The player will see a colour displayed on a screen and has 1 second to hit the mat that matches
the colour. If the player hits the correct mat, within 1 second, a counter is incremented. When a
player hits an incorrect mat, the game ends.
The game uses sensors and a microprocessor to determine if the player hits the correct mat within
1 second.
Explain how the game uses sensors and a microprocessor to count the number of times a player
hits a correct mat within 1 second.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
.................................................................................................................................................... [7]
An interrupt is generated to inform the Central Processing Unit (CPU) that the application has
been opened.
(a) Give three other examples of when an interrupt signal could be generated.
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
(b) State what would happen if interrupt signals were not used in a computer.
...................................................................................................................................................
............................................................................................................................................. [1]
10 Jermain uses the Secure Socket Layer (SSL) protocol for secure transmission when sending data
using the internet.
(a) Explain how the SSL protocol secures the data for transmission.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
(b) Identify an alternative protocol that could be used for secure transmission of data using the
internet.
............................................................................................................................................. [1]
(c) Give two ways that a user can identify if a website uses secure data transmission.
1 ................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
[2]
© UCLES 2021 0478/12/O/N/21 [Turn over
10
Do not attempt to simplify the logic statement. All logic gates must have a maximum of two
inputs.
B X
[5]
(b) Complete the truth table for the given logic statement.
A B C Working space X
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
[4]
(c) Identify two logic gates that are not included in the given logic statement.
BLANK PAGE
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 October/November 2021 series for most
Cambridge IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level
components.
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.
• 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 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.
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.
1(a) − Base-10 1
1(b) − 5 4
− 32
− 26
− 171
1(c)(i) − 00100101 1
1(c)(ii) − 00011011 1
6(c) − Assembler 1
can often be built into an Electronic Point Of Sale (EPOS) terminal, for ()
example, a supermarket checkout
8 Seven from: 7
− Timer is started
− Pressure sensor (within each mat)
− Sensor sends data to microprocessor
− Analogue data is converted to digital (using ADC)
− Microprocessor compares data to stored value(s)
− If data matches / in/out range microprocessor stops timer
− If data matches / in/out range microprocessor checks if data has come from correct colour mat sensor
− If data matches / in/out range microprocessor checks to see if timer is stopped at less than 1 second
− If data matches / in/out range microprocessor increments counter if timer is less than 1 second and colour/mat is
correct
− If correct colour/mat is hit, timer is reset and the whole process is repeated
− If data has not come from the correct colour mat sensor the game ends
NOTE: If three suitable different errors are described, this can be awarded three marks.
10(a) − Enables an encrypted link (between the browser and the web server) // It encrypts the data 2
− … based on the authentication of an (SSL) certificate // and will only send it if the certificate is authentic
11(a) One mark per each correct logic gate with correct input(s) 5
B X
A B C Working space X
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
11(c) − NOR 2
− XOR / EOR
1 hour 45 minutes
INSTRUCTIONS
● Answer all questions.
● Do not attempt Tasks 1, 2 and 3 in the copy of the pre-release material on page 2; these are for
information only.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.
INFORMATION
● The total mark for this paper is 50.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.
DC (LK/FC) 202711/3
© UCLES 2021 [Turn over
2
Section A
You are advised to spend no longer than 40 minutes answering this section.
Use the pre-release material and your experience from attempting the following tasks before the
examination to answer Question 1.
Pre-release material
An integrated transport system has been designed to reduce the need for privately owned vehicles.
A vehicle is booked to take a passenger from home to a start station, from where they will travel to
an end station. A vehicle at the end station will take the passenger to their destination. Each stage
of the journey has a price code to represent the distance travelled. The prices for each stage are
shown:
Write and test a program or programs for the integrated transport booking system.
• Your program or programs must include appropriate prompts for the entry of data; data must
be validated on entry.
• Error messages and other output need to be set out clearly and understandably.
• All variables, constants and other identifiers must have meaningful names.
You will need to complete these three tasks. Each task must be fully tested.
1 All variables, constants and other identifiers must have meaningful names.
(a) (i) Identify one variable you could have used for Task 2 and state its use.
Variable .............................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
[2]
(ii) Describe the arrays you could have used in Task 1. Include the name, data type, use
and sample data for each array.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [5]
(b) Describe how you could validate the data entry for the input of the codes for the different
stages of the journey in Task 2.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [3]
(c) Write an algorithm to show how your program carries out Task 3, using either pseudocode,
programming statements or a flowchart. Assume Tasks 1 and 2 have already been completed.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
(d) Explain how your program could be changed to count and store the number of bookings
made by each passenger. Then, after ten bookings have been made by a passenger, apply
an additional 10% discount to every future booking. Any programming statements used in
your answer must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
© UCLES 2021 0478/22/O/N/21
7
Section B
2 Tick (3) one box in each row to identify if the statement is about validation, verification or neither.
[3]
3 A program checks that the data entered is between 1 and 100 inclusive.
Identify one piece of normal, extreme and erroneous test data for this program, and give a reason
for each.
Reason .............................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Reason .............................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Reason .............................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
4 The pseudocode algorithm should work as a calculator and output the result.
1 Continue 1
2 WHILE Continue = 0
3 OUTPUT "Enter 1 for +, 2 for -, 3 for * or 4 for /"
4 INPUT Operator
5 OUTPUT "Enter the first value"
6 INPUT Value1
7 OUTPUT "Enter the second value"
8 OUTPUT Value2
9 IF Operator
10 1: Answer Value1 + Value2
11 2: Answer Value1 - Value2
12 3: Answer Value1 * Value2
13 4: Answer Value1 / Value2
14 ENDCASE
15 OUTPUT "The answer is ", Value1
16 OUTPUT "Do you wish to enter more values (Yes or No)?"
17 INPUT MoreValues
18 IF MoreValues = "No"
19 THEN
20 Continue 1
21 ENDIF
22 UNTIL Continue = 0
(a) Find the five errors in the pseudocode and suggest a correction for each error.
Error 1 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 2 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 3 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 4 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 5 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
[5]
© UCLES 2021 0478/22/O/N/21
9
(b) The algorithm needs changing to allow only the numbers 1, 2, 3, or 4 to be entered for the
input variable Operator.
Write the pseudocode to perform this task and state where in the algorithm it would be
located.
Pseudocode ..............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[5]
START
List1 ←0
List2 ←0
INPUT
List
Yes IS
List = –1 ?
No
INPUT
Value
IS
List = 1 ?
Yes
List1 ← List1 + Value
No
IS
List = 2 ?
Yes
List2 ← List2 + Value
OUTPUT
"List 1 = ", List1
No
OUTPUT OUTPUT
"List 2 = ", List2 "Input Error"
IS Yes
List1 > List2 ?
No
OUTPUT
"List 1 is greatest"
OUTPUT
"List 2 is greatest"
END
Complete the trace table for the algorithm using this input data:
[5]
6 A pet supplier uses the database table, STOCK, to keep records of its products for pets.
(a) (i) Identify the field that could have a Boolean data type.
..................................................................................................................................... [1]
(ii) Identify the field that should be used as the primary key.
..................................................................................................................................... [1]
(b) Complete the query-by-example grid to output the products intended for a cat that are in
stock. Display only the primary key and the name of the products. The output should be
sorted by the primary key.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.
To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.
Cambridge Assessment International Education is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of the University of
Cambridge Local Examinations Syndicate (UCLES), which itself is a department of the University of Cambridge.
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 October/November 2021 series for most
Cambridge IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level
components.
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.
• 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 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.
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.
Section A
Section B
an automatic check to make sure the data entered has the correct
number of characters
4(a) One mark for error identified and suggested correction (Max three) 5
One mark for error identified and suggested correction (Max two)
Method 1
Line 1 Continue ← 1 should be Continue ← 0
Line 22 UNTIL Continue = 0 should be ENDWHILE // Line 2 WHILE Continue = 0 should be REPEAT and Line
22 UNTIL Continue = 0 should be Until Continue = 1
OR
Method 2
Line 2 WHILE Continue = 0 should be REPEAT
Line 20 Continue ← 1 should be Continue ← 0 // Line 1 Continue ← 1 should be Continue ← 0 and Line
22 UNTIL Continue = 0 should be Until Continue = 1
OR
Method 3
Line 2 WHILE Continue = 0 should be WHILE Continue = 1
Line 20 Continue ← 1 should be Continue ← 0 and Line 22 UNTIL Continue = 0 should be ENDWHILE
Alternative answer
REPEAT
IF Operator < 1 OR Operator > 4
THEN
OUTPUT "Enter 1, 2, 3 or 4"
INPUT Operator
ENDIF
UNTIL Operator >= 1 AND Operator <= 4
One mark
0 0
77 77
16 93
35 35
-7 86
18 Input Error
11 46
12 58
20 106
-1 List 1 = 58
List 2 = 106
List 2 is greatest
6(a)(i) InStock 1
6(a)(ii) ProductID 1
Sort: Ascending
Show:
or: