Computer Science
Computer Science
The maximum total mark for this syllabus, after weighting has been applied, is 125.
The overall thresholds for the different grades were set as follows.
Combination of
Option A* A B C D E F G
Components
AX 11, 21 93 78 63 49 40 32 24 16
AY 12, 22 97 82 67 53 43 34 25 16
AZ 13, 23 93 78 63 49 40 32 24 16
Learn more! For more information please visit www.cambridgeinternational.org/igcse or contact Customer Services
on +44 (0)1223 553554 or email info@cambridgeinternational.org
Cambridge Assessment International Education
Cambridge International General Certificate of Secondary Education
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
1(a) Output 1
E 0 4
1 1 1 0 0 0 0 0 0 1 0 0
– Temperature (sensor)
– To monitor the temperature of the water
– Pressure (sensor)
– To monitor the level of water in the washing machine
– Motion (sensor)
– To monitor whether the drum is still in motion
– pH (sensor)
– To monitor the level of water hardness/detergent present in the water
2D
– (Scanner) shines a light onto the surface of a document // Light moves across document
– Reflected light is captured
– Uses mirrors and lenses
– Captured image is converted into a digital file
– Produces a 2D digital image
3D
– Scanners shines a laser (or light) over the surface of a 3D object
– Records measurements of the geometry/dimensions of the object
– Measurements are converted to digital file
– Produces a 3D digital model
true false
Statement
(9) (9)
Firewalls can monitor incoming and outgoing traffic. 9
Firewalls operate by checking traffic against a set of rules. 9
Firewalls cannot block access to a certain website. 9
Firewalls can be software and hardware. 9
Firewalls can act as intermediary servers. 9
Firewalls can block unauthorised traffic. 9
– Strong password
– To make it difficult to hack an account
– Biometric device
– To use data that is difficult to fake as a password
– TLS // Encryption
– To make data meaningless if intercepted
– To encrypt data that is exchanged (TLS only)
– More secure than SSL (TLS only)
– Anti-spyware (software)
– To find and remove any spyware that is installed on a computer
– To help stop key loggers recording key presses
– Firewall
– To help prevent unauthorised access to an account
– Blocks any requests that do not meet/match the criteria
– Proxy server
– To divert an attack away from the main system
– 1000 × 16
– 16000/8
– Primary stores boot up instructions and can hold data whilst being processed
– Secondary stores files/software
true false
Statement
(9) (9)
Assembly language uses mnemonic codes. 9
Assembly language programs do not need a translator to be executed. 9
Assembly language is a low-level programming language. 9
Assembly language is specific to the computer hardware. 9
Assembly language is machine code. 9
Assembly language is often used to create drivers for hardware. 9
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
9 – LEFT
1 – DOWN
C – OPEN
3 – CLOSE
F – UP
HDD – Secondary
RAM – Primary
ROM – Primary
CD-ROM – Off-line
SSD – Secondary
DVD-RAM – Off-line
• A binary number system has units/ placeholders/column headings that increase by the power of 2
• A denary number system has units/ placeholders/column headings that increase by the power of 10
• Binary has more digit for the same value// Denary has less digits for the same value
Serial 9 Simplex
Parallel Half-duplex
Duplex 9
Checksum
• A value is calculated from the data // Description of calculation
• Value is transmitted with data
• Value is recalculated after transmission
• If the values match the data is (more likely to be) accurate
Parity check
• A parity bit is transmitted with each byte of data
• Odd or even (parity can be used)
• Counts / checks number of 1’s // counts / checks to see if 1’s are even // counts / checks to see if 1’s are odd
• (Each byte is) checked after transmission to see if it matches the odd/even parity used
Echo (check)
• Copy of data is sent back to sender
• Data is compared to see if it matches
• If it does not match error detected
7 1 mark for each correct logic gate with the correct input(s) 7
8(a) 1 mark for correct calculation method, 1 mark for correct answer: 2
8(b) • Instructions/programs/data 2
• « currently in use
Moisture (sensor)
• To measure the water content of the soil
• To alert when the soil is too dry or too wet/needs watering
pH (sensor)
• To measure how acidic/alkaline the soil is
• To alert when there may be something polluting the soil
Light (sensor)
• To measure the brightness of the environment
• To alert when the fruit has too little/too much light
Temperature (sensor)
• To measure the temperature of the environment
• To alert when it is too hot/too cold for the fruit to grow
Gas (sensor)
• To measure the amount of CO2/oxygen present
• To alert when too much CO2/oxygen present
Humidity (sensor)
• To measure the water content in the air
• To alert when the air is too dry
• Plagiarism
• Free software
• Freeware
• Shareware
• Ethics
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
1(a) Output 1
E 0 4
1 1 1 0 0 0 0 0 0 1 0 0
– Temperature (sensor)
– To monitor the temperature of the water
– Pressure (sensor)
– To monitor the level of water in the washing machine
– Motion (sensor)
– To monitor whether the drum is still in motion
– pH (sensor)
– To monitor the level of water hardness/detergent present in the water
2D
– (Scanner) shines a light onto the surface of a document // Light moves across document
– Reflected light is captured
– Uses mirrors and lenses
– Captured image is converted into a digital file
– Produces a 2D digital image
3D
– Scanners shines a laser (or light) over the surface of a 3D object
– Records measurements of the geometry/dimensions of the object
– Measurements are converted to digital file
– Produces a 3D digital model
true false
Statement
(9) (9)
Firewalls can monitor incoming and outgoing traffic. 9
Firewalls operate by checking traffic against a set of rules. 9
Firewalls cannot block access to a certain website. 9
Firewalls can be software and hardware. 9
Firewalls can act as intermediary servers. 9
Firewalls can block unauthorised traffic. 9
– Strong password
– To make it difficult to hack an account
– Biometric device
– To use data that is difficult to fake as a password
– TLS // Encryption
– To make data meaningless if intercepted
– To encrypt data that is exchanged (TLS only)
– More secure than SSL (TLS only)
– Anti-spyware (software)
– To find and remove any spyware that is installed on a computer
– To help stop key loggers recording key presses
– Firewall
– To help prevent unauthorised access to an account
– Blocks any requests that do not meet/match the criteria
– Proxy server
– To divert an attack away from the main system
– 1000 × 16
– 16000/8
– Primary stores boot up instructions and can hold data whilst being processed
– Secondary stores files/software
true false
Statement
(9) (9)
Assembly language uses mnemonic codes. 9
Assembly language programs do not need a translator to be executed. 9
Assembly language is a low-level programming language. 9
Assembly language is specific to the computer hardware. 9
Assembly language is machine code. 9
Assembly language is often used to create drivers for hardware. 9
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
Many correct answers, they must be meaningful. These are examples only.
Array_2Seater[ ]
Array_4Seater[ ]
Array_Historic[ ]
• Name of variable
• Purpose of variable
• Name of constant
• Purpose of constant
Many correct answers, they must be meaningful. These are examples only.
Variable NumFlights
to store the number of flights in a day
Constant FlightCost2Seat30
to store the cost of a 30 minute flight in a 2 seater plane
Algorithm example:
CASE PlaneType of
1: Price30 Å 100; Price60 Å 150
2: Price30 Å 120; Price60 Å 200
3: Price30 Å 120; Price60 Å 500
OTHERWISE OUTPUT "Invalid type of plane"
ENDCASE
CASE FlightLength of
30: OUTPUT "Total Possible Income is ", Price30 * 10
60: OUTPUT "Total Possible Income is ", Price60 * 6
ENDCASE
1(c) 1 mark for each correct point related to the inputs for Task 1 4
• Input timeslot
• Check 3 types of plane
• Methodology for checking time slot
• Identify any planes available
• Output plane(s) available
• Output if no planes available
2 1 mark for each error identified plus suggested correction (the corrected 4
lines must be written in full)
• Verification checks that data entered is the data that was intended to be
entered // can be a human check // matches the source
Either
• Double Entry // suitable practical example
• the data will be entered twice
• compared by the computer or by a human
• if a discrepancy is found, the data entry operator is asked to re-enter
the data
Or
• Visual Verification // suitable practical example
• the data will be compared to the source ‘document’
• compared by a human
• if a discrepancy is found, the data is re-entered
Example algorithm:
Count Å 0
WHILE Count < 50 DO
OUTPUT Name[Count]
Count Å Count + 1
ENDWHILE
Example 1:
Field Name: SPECIESID
Data Type: Alphanumeric
Purpose: Primary key
Example Data: SP06583
Example 2:
Field name: NUMBER
Data Type: Integer
Purpose: To record how many of that species there are at the park
Example Data: 30
6(b) 4
Field: Species Classification Diet Legs
Table: LIVESTOCK LIVESTOCK LIVESTOCK LIVESTOCK
Sort: Ascending/
Descending
Show: ;
Criteria: “Mammal” “Herbivore” 4
or:
(1 Mark) (1 Mark) (1 Mark) (1 Mark)
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
1(a)(i) 1 mark for appropriate variable name, 1 mark for appropriate data type, 1 mark for appropriate use. 3
Many correct answers, they must be meaningful. These are examples only.
– HireTotal, integer, running total of money taken (for the day)
– HoursHired, real, running total of hours hired for the day
– Returned, real, hour and fraction of hour when next returned
1(a)(ii) 1 mark for appropriate constant name, 1 mark for appropriate value. 2
Many correct answers, they must be meaningful. These are examples only.
– HourPrice, 20.00
– HalfHourPrice 12.00
1(b) 1 mark for validation check, all checks must be different, 1 mark for the reason and 1 mark for the test data. 6
The only inputs for task 1 can be length of hire, money taken, time of hire and time of return.
There are many possible correct answers these are examples only.
Four from:
– Initialisation
– check HoursHired against MaxHoursHired «
« store the BoatNumber
« update MaxHoursHired if greater
– check if HoursHired = 0 …
… if so add 1 to NumberBoatsUnused
– update daily totals (for hours and money)
– output report with messages (including totals for hours and money, and number of boats unused and the most used
boat).
Max 4 marks
Example:
MaxHoursHired Å 0
TotalHoursHired Å 0
TotalMoney Å 0
NumberBoatsUnused Å 0
FOR BoatNumber Å 1 to 10
TotalMoney Å TotalMoney + Money(BoatNumber)
TotalHoursHired Å TotalHoursHired + HoursHired(BoatNumber)
IF HoursHired(BoatNumber) = 0
THEN NumberBoatsUnused Å NumberBoatsUnused + 1
ENDIF
IF HoursHired(BoatNumber) > MaxHoursHired
THEN
MostUsed Å BoatNumber
MaxHoursHired Å HoursHired(BoatNumber)
ENDIF
NEXT BoatNumber
PRINT "Boats were hired for ", TotalHoursHired, " hours"
PRINT "Total amount of money taken was ", TotalMoney
PRINT NumberBoatsUnused, " boats were not used"
Print "Boat number ", MostUsed, " was used most"
e.g.
Explanation (may include reference to program statements)
– check all boats for«
– « return time < current time // current booking slot available or return time > current time// current booking slot not
available
– keep a running total of those available
– display number of boats
Example:
FOR BoatNumber Å 1 to 10 loop to check for all boats
IF ReturnTime(BoatNumber) <= CurrentTime check return time against current time
THEN BoatsAvailable Å BoatsAvailable + 1 keep a running total
ENDIF
NEXT BoatNumber
PRINT "Number of boats available ", BoatsAvailable display number of boats
2 1 mark for each, there may be other solutions, award full marks for any working solution 6
Sample algorithm:
INPUT NumberCount
Total Å 0
FOR Count Å 1 TO NumberCount
INPUT Number
Total Å Total + Number
NEXT
Average Å Total/NumberCount
PRINT Total, Average
Identification:
CASE …
… OF … OTHERWISE … (ENDCASE)or
… OF … (OTHERWISE) … ENDCASE
Description:
– a statement that allows for multiple selections // not any of the above
Reason:
– to simplify pseudocode/ make pseudocode more understandable etc.
0 0 0
1 1 50.4
2 2 50.3
1 3 49.1
3 4 50.3
4 5 50.0
5 6 49.5
6 7 50.2
7 8 50.3
8 9 50.5
2 10 50.6 82
6(a) – 1 mark for each field suitable name, 1 mark for appropriate data type and appropriate data sample 6
The following are examples there are many different correct answers.
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 2017 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
Many correct answers, they must be meaningful. These are examples only.
Array_2Seater[ ]
Array_4Seater[ ]
Array_Historic[ ]
• Name of variable
• Purpose of variable
• Name of constant
• Purpose of constant
Many correct answers, they must be meaningful. These are examples only.
Variable NumFlights
to store the number of flights in a day
Constant FlightCost2Seat30
to store the cost of a 30 minute flight in a 2 seater plane
Algorithm example:
CASE PlaneType of
1: Price30 Å 100; Price60 Å 150
2: Price30 Å 120; Price60 Å 200
3: Price30 Å 120; Price60 Å 500
OTHERWISE OUTPUT "Invalid type of plane"
ENDCASE
CASE FlightLength of
30: OUTPUT "Total Possible Income is ", Price30 * 10
60: OUTPUT "Total Possible Income is ", Price60 * 6
ENDCASE
1(c) 1 mark for each correct point related to the inputs for Task 1 4
• Input timeslot
• Check 3 types of plane
• Methodology for checking time slot
• Identify any planes available
• Output plane(s) available
• Output if no planes available
2 1 mark for each error identified plus suggested correction (the corrected 4
lines must be written in full)
• Verification checks that data entered is the data that was intended to be
entered // can be a human check // matches the source
Either
• Double Entry // suitable practical example
• the data will be entered twice
• compared by the computer or by a human
• if a discrepancy is found, the data entry operator is asked to re-enter
the data
Or
• Visual Verification // suitable practical example
• the data will be compared to the source ‘document’
• compared by a human
• if a discrepancy is found, the data is re-entered
Example algorithm:
Count Å 0
WHILE Count < 50 DO
OUTPUT Name[Count]
Count Å Count + 1
ENDWHILE
Example 1:
Field Name: SPECIESID
Data Type: Alphanumeric
Purpose: Primary key
Example Data: SP06583
Example 2:
Field name: NUMBER
Data Type: Integer
Purpose: To record how many of that species there are at the park
Example Data: 30
6(b) 4
Field: Species Classification Diet Legs
Table: LIVESTOCK LIVESTOCK LIVESTOCK LIVESTOCK
Sort: Ascending/
Descending
Show: ;
Criteria: “Mammal” “Herbivore” 4
or:
(1 Mark) (1 Mark) (1 Mark) (1 Mark)
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (RW) 131976/2
© UCLES 2017 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
A small airfield operates a flying club where people can take a short flight to see if they would like flying
lessons. The owner of the airfield has asked you to write a program to organise the flight bookings. The
airfield operates three different planes and offers either a 30 minute or a 60 minute flight.
After each flight, 30 minutes must be allowed for refuelling and safety checks before the next flight can
take off. All planes offer both 30 minute and 60 minute flights, but, for the purpose of this activity, they
will not be mixed on a given day, e.g. the 2 seater will offer 30 minute flights ONLY on one day and
60 minute flights ONLY on another day.
• Your program must include appropriate prompts for the entry of data.
• 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.
Assume that the flights take place between 08:00 and 18:00. Write a program that will work out the
maximum income that can be generated by each plane in a day for each type of flight. The program
should allow you to:
Write a program to store bookings for each plane and to allow you to find which planes are available
at a given time slot during the day. The program should calculate the actual number of flights taken by
each plane in that day.
Modify TASK 2 so that it will calculate the total amount of money taken in a day for each plane, as well
as the overall daily total for all three planes, and output the results.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (CW) 132153/3
© UCLES 2017 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
The owner of a river boat hire company wants to calculate the daily profits from hiring out 10 rowing
boats on the river. Boats are numbered 1 to 10. Boats can be hired for use between 10:00 and 17:00
every day.
• Your program must include appropriate prompts for the entry of data.
• 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.
The cost of hiring a boat is $20 for one hour or $12 for half an hour. When a boat is hired the payment
is added to the money taken for the day. The running total of hours hired that day is updated and the
time when the boat must be returned is stored. At the end of the day the money taken and the total
hours hired is output.
No boat can be hired before 10:00 or returned after 17:00.
Extend TASK 1 to work for all 10 rowing boats. Use the data stored for each boat to find out how many
boats are available for hire at the current time. If no boats are available show the earliest time that a
boat will be available for hire.
TASK 3 – calculate the money taken for all the boats at the end of the day.
At the end of the day use the data stored for each boat to calculate the total amount of money taken
and the total number of hours boats were hired that day. Find out how many boats were not used that
day and which boat was used the most. Provide a report for the owner to show this information.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (LK) 150376
© UCLES 2017 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
A small airfield operates a flying club where people can take a short flight to see if they would like flying
lessons. The owner of the airfield has asked you to write a program to organise the flight bookings. The
airfield operates three different planes and offers either a 30 minute or a 60 minute flight.
After each flight, 30 minutes must be allowed for refuelling and safety checks before the next flight can
take off. All planes offer both 30 minute and 60 minute flights, but, for the purpose of this activity, they
will not be mixed on a given day, e.g. the 2 seater will offer 30 minute flights ONLY on one day and
60 minute flights ONLY on another day.
• Your program must include appropriate prompts for the entry of data.
• 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.
Assume that the flights take place between 08:00 and 18:00. Write a program that will work out the
maximum income that can be generated by each plane in a day for each type of flight. The program
should allow you to:
Write a program to store bookings for each plane and to allow you to find which planes are available
at a given time slot during the day. The program should calculate the actual number of flights taken by
each plane in that day.
Modify TASK 2 so that it will calculate the total amount of money taken in a day for each plane, as well
as the overall daily total for all three planes, and output the results.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH/SW) 134256/4
© UCLES 2017 [Turn over
2
One use of the display screen is to show an error code when a problem has occurred with a
washing cycle.
(a) State whether the display screen is an input, output or storage device.
...............................................................................................................................................[1]
E04
This error code means that the water will not empty out of the washing machine.
[3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[1]
(d) Identify three sensors that could be used in the washing machine.
Sensor 1 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
Sensor 2 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
Sensor 3 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
[6]
© UCLES 2017 0478/11/O/N/17
3
Complete the table by providing a suitable file format for each file type. The first one has been
done for you.
http://www.cie.org.uk/index.htm
Part 1 Part 2 Part 3
Part 1 ........................................................................................................................................
Part 2 ........................................................................................................................................
Part 3 ........................................................................................................................................
[3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Draw a line to match each component with the most suitable description.
Component Description
[5]
B X
[4]
(b) Draw the symbol for an XOR gate and explain the function of this logic gate.
Explanation ...............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
2D .....................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
3D .....................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
[6]
8 (a) Data is valuable. It needs to be kept secure and it can easily be damaged.
1 ................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
3 ................................................................................................................................................
...................................................................................................................................................
[3]
(b) The Secure Socket Layer (SSL) protocol can be used to securely transmit data in online
banking.
Application 1 .............................................................................................................................
Application 2 .............................................................................................................................
Application 3 .............................................................................................................................
[3]
Online banking can be a risk as it can raise a number of security issues. SSL can be used as
a security method to make online banking safer.
Identify and describe three other security methods that could be used to make online banking
safer.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(b) Kamil wants to store a 16-bit colour image file. The image size is 1000 pixels.
Working .....................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name on all the work you hand in.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH/SW) 138025/2
© UCLES 2017 [Turn over
2
UP 1 1 1 1
DOWN 0 0 0 1
LEFT 1 0 0 1
RIGHT 0 1 1 0
OPEN 1 1 0 0
CLOSE 0 0 1 1
9 1 C 3 F
Convert the values and write down the operation (e.g. RIGHT) carried out by the robot arm.
9 .............................................................................
1 .............................................................................
C .............................................................................
3 .............................................................................
F .............................................................................
[5]
2 Storage devices and storage media can be categorised as primary, secondary or off-line.
Write primary, secondary or off-line next to each storage device or medium to indicate its most
suitable category.
HDD ....................................................................................................................................
RAM ....................................................................................................................................
ROM ....................................................................................................................................
CD-ROM ....................................................................................................................................
SSD ....................................................................................................................................
DVD-RAM ....................................................................................................................................
[6]
3 (a) Explain the differences between the binary number system and the denary number system.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(b) Explain the process of converting the binary number 1010 into a denary number.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
© UCLES 2017 0478/12/O/N/17 [Turn over
4
Rory sends data from his computer to a file server that is approximately 100 metres away.
It is important that the data is transmitted accurately. Rory needs to be able to read data from and
write data to the file server at the same time.
(a) (i) Use ticks (3) to identify the most suitable data transmission methods for this application.
(ii) Explain why your answer to part (a)(i) is the most suitable data transmission.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[4]
(b) Identify and describe two methods of error checking that can be used to make sure that the
data stored after transmission is accurate.
Method 1 ...................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Method 2 ...................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
5 Raj is using the Internet to do some online shopping. He visits a website that tells him that it uses
cookies.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Example 1 .................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Example 2 .................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[2]
6 Selma writes the following four answers in her Computer Science examination.
“It is a signal. When the signal is received it tells the operating system that an event has occurred.”
“It takes source code written in a high level language and translates it into machine code. It
translates the whole of the source code at once.”
“The part of the central processing unit (CPU) that carries out calculations.”
“When data is transmitted, if an error is detected in the data received a signal is sent to ask for the
data to be retransmitted. This continues until the data received is correct.”
B X
[7]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
..............................GB [2]
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
1 ................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
3 ................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[3]
She has a system that monitors the conditions for growing the fruit.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(b) State two sensors that could be used in this system and describe how they could be used.
Sensor 1 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Sensor 2 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[3]
1 ................................................................................................................................................
2 ................................................................................................................................................
3 ................................................................................................................................................
[3]
11 Complete the paragraphs choosing the correct five terms from the list. Each term can only be
used once:
• Ethics
• Freeware
• Free Software
• Hacking
• Malware
• Plagiarism
• Shareware
• Virus
Taking another person’s work from the Internet and claiming it as your own is called
One product that people may want to protect is software. ............................................. does allow
a person to share, copy and change software freely, but ............................................. does not
allow a person to do this legally. Software that has a licence allowing free use for a trial period
............................................. .
[5]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (CE/SW) 152857
© UCLES 2017 [Turn over
2
One use of the display screen is to show an error code when a problem has occurred with a
washing cycle.
(a) State whether the display screen is an input, output or storage device.
...............................................................................................................................................[1]
E04
This error code means that the water will not empty out of the washing machine.
[3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[1]
(d) Identify three sensors that could be used in the washing machine.
Sensor 1 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
Sensor 2 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
Sensor 3 ...................................................................................................................................
Use ...........................................................................................................................................
...................................................................................................................................................
[6]
© UCLES 2017 0478/13/O/N/17
3
Complete the table by providing a suitable file format for each file type. The first one has been
done for you.
http://www.cie.org.uk/index.htm
Part 1 Part 2 Part 3
Part 1 ........................................................................................................................................
Part 2 ........................................................................................................................................
Part 3 ........................................................................................................................................
[3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Draw a line to match each component with the most suitable description.
Component Description
[5]
B X
[4]
(b) Draw the symbol for an XOR gate and explain the function of this logic gate.
Explanation ...............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
2D .....................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
3D .....................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
[6]
8 (a) Data is valuable. It needs to be kept secure and it can easily be damaged.
1 ................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
3 ................................................................................................................................................
...................................................................................................................................................
[3]
(b) The Secure Socket Layer (SSL) protocol can be used to securely transmit data in online
banking.
Application 1 .............................................................................................................................
Application 2 .............................................................................................................................
Application 3 .............................................................................................................................
[3]
Online banking can be a risk as it can raise a number of security issues. SSL can be used as
a security method to make online banking safer.
Identify and describe three other security methods that could be used to make online banking
safer.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(b) Kamil wants to store a 16-bit colour image file. The image size is 1000 pixels.
Working .....................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (CW/SW) 131978/2
© UCLES 2017 [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 small airfield operates a flying club where people can take a short flight to see if they would like
flying lessons. The owner of the airfield has asked you to write a program to organise the flight
bookings. The airfield operates three different planes and offers either a 30 minute or a 60 minute
flight.
After each flight, 30 minutes must be allowed for refuelling and safety checks before the next flight
can take off. All planes offer both 30 minute and 60 minute flights, but, for the purpose of this activity,
they will not be mixed on a given day, e.g. the 2 seater will offer 30 minute flights ONLY on one day
and 60 minute flights ONLY on another day.
• Your program must include appropriate prompts for the entry of data.
• 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 (a) All variables, constants and other identifiers should have meaningful names.
(i) Declare suitable arrays for each of the planes to store time slots booked.
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[3]
(ii) Name one variable and one constant you used for Task 1 and state the purpose of each
one.
Variable .............................................................................................................................
Purpose .............................................................................................................................
...........................................................................................................................................
Constant ............................................................................................................................
Purpose .............................................................................................................................
...........................................................................................................................................
[4]
(b) Write an algorithm to complete Task 1, using either pseudocode, programming statements
or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© UCLES 2017 0478/21/O/N/17
5
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
(c) Describe how you could validate and test the inputs for Task 1.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(d) Explain how your program checks and displays whether any of the planes are available at a
given time of the day (Task 2). Any programming statements used must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Section B
2 This section of program code asks for 80 numbers between 100 and 1000 to be entered. It checks
that the numbers are in the correct range, and stores them in an array. It counts how many of the
numbers are larger than 500 and then outputs the result when the program is finished.
1 Count = 0
2 FOR Index = 1 TO 80
3 INPUT 'Enter a number between 100 and 1000', Number
4 WHILE Number = 99 AND Number = 1001
5 INPUT 'This is incorrect, please try again', Number
6 ENDWHILE
7 Num[80] = Number
8 IF Number > 500 THEN Count = Count + 1
9 UNTIL Index = 80
10 PRINT Index
11 PRINT ' numbers were larger than 500'
State the line number for each error and write the correct code for that line.
3 (a) Explain the difference between a validation check and a verification check.
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(b) Describe, using an example, how data could be verified on data entry.
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
4 (a) Four pseudocode descriptions and five pseudocode statements are shown. Draw one line to
link each pseudocode description to the correct pseudocode statement. Not all pseudocode
statements will be used.
WHILE…DO…ENDWHILE
A loop that will iterate a set
number of times. CASE…OF…OTHERWISE…ENDCASE
[4]
(b) Write an algorithm in pseudocode, using a single loop, to print 50 names that have been
stored in an array.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[3]
START
Flag 0
Count 1
Is Name[Count] Yes
> Name[Count + 1]? Temp Name[Count]
No Name[Count] Name[Count + 1]
Name[Count + 1] Temp
Flag 1
Count Count + 1
No Is Count
= 4?
Yes
No Is Flag
= 0?
Yes
END
(a) The array used in the flowchart contains the following data:
Complete the trace table using the data given in the array.
[5]
...................................................................................................................................................
...............................................................................................................................................[2]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
6 A wildlife park has a database table, called LIVESTOCK, to classify and record its animal species.
Part of the database table is shown.
(a) Suggest another appropriate field that could be added to this database by stating its name
and data type. State its purpose and give an example of the data it could contain.
Purpose ....................................................................................................................................
...................................................................................................................................................
(b) Use the query-by-example grid below to provide a list of all four legged mammals that are
herbivores, sorted alphabetically by species, with only the species displayed.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (CW/FD) 132152/3
© UCLES 2017 [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
The owner of a river boat hire company wants to calculate the daily profits from hiring out 10 rowing
boats on the river. Boats are numbered 1 to 10. Boats can be hired for use between 10:00 and 17:00
every day.
• Your program must include appropriate prompts for the entry of data.
• 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.
The cost of hiring a boat is $20 for one hour or $12 for half an hour. When a boat is hired the payment
is added to the money taken for the day. The running total of hours hired that day is updated and the
time when the boat must be returned is stored. At the end of the day the money taken and the total
hours hired is output.
No boat can be hired before 10:00 or returned after 17:00.
Extend TASK 1 to work for all 10 rowing boats. Use the data stored for each boat to find out how
many boats are available for hire at the current time. If no boats are available show the earliest time
that a boat will be available for hire.
TASK 3 – calculate the money taken for all the boats at the end of the day.
At the end of the day use the data stored for each boat to calculate the total amount of money taken
and the total number of hours boats were hired that day. Find out how many boats were not used
that day and which boat was used the most. Provide a report for the owner to show this information.
1 (a) All variables, constants and other identifiers should have meaningful names.
(i) For one variable that you have used to record the information about a single boat in
Task 1, state the name, data type and its use.
Use ....................................................................................................................................
[3]
(ii) State one constant and its value that you could have used for Task 1.
Value .................................................................................................................................
[2]
(b) Give two different validation checks you could have used for data entry in Task 1. For each
check explain why it could be used and provide a set of data for testing.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[6]
(c) Write an algorithm to complete Task 3, using either pseudocode, programming statements
or a flowchart. You may assume Task 2 has been completed.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
© UCLES 2017 0478/22/O/N/17
5
(d) Explain how your program finds out how many boats are available for hire (Task 2).
Any programming statements used must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
© UCLES 2017 0478/22/O/N/17 [Turn over
6
Section B
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
......................................................................................................................................................[6]
3 The following diagram shows four data structures and four descriptions.
4 IF … THEN … ELSE … ENDIF is one type of conditional statement used when writing
pseudocode.
Identify and describe another type of conditional statement that you could use when writing
pseudocode. Give a reason why you would use this type of conditional statement.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Description .......................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Reason .............................................................................................................................................
..........................................................................................................................................................
[4]
5 (a) This flowchart checks a batch of 10 rice sacks for weight. Sacks should weigh 50 kilograms
each. Sacks weighing over 50.5 kilograms or less than 49.5 kilograms are rejected. The
number of sacks accepted and the number of sacks rejected is output.
START
Accept 0
Reject 0
Count 0
Is Count Yes
= 10?
OUTPUT
Accept Accept + 1 Accept,
No
Reject
Count Count + 1
END
INPUT
Sack
No
Is Sack
No > 50.5? Yes
50.4, 50.3, 49.1, 50.3, 50.0, 49.5, 50.2, 50.3, 50.5, 50.6
[5]
(b) The size of the batch has increased to 50 sacks. It has been decided to only reject sacks that
are underweight.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
6 A database table, TRAIN, is to be set up for a railway company to keep a record of the engines
available for use. Each engine has a unique number made up of 5 digits, nnnnn. The engines
are classified as freight (F) or passenger (P) together with a power classification that is a whole
number between 0 and 9, for example F8. The railway company keeps a record of the date of the
last service for each engine.
(a) Identify the three fields required for the database. Give each field a suitable name and data
type. Provide a sample of data that you could expect to see in the field.
(b) State the field that you should choose as the primary key.
...............................................................................................................................................[1]
(c) Using the query-by-example grid below, write a query to identify all passenger engines that
have not been serviced in the past 12 months. Only display the engine numbers.
Field:
Table:
Sort:
Show:
Criteria:
or:
[3]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
The syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (LK) 150377
© UCLES 2017 [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 small airfield operates a flying club where people can take a short flight to see if they would like
flying lessons. The owner of the airfield has asked you to write a program to organise the flight
bookings. The airfield operates three different planes and offers either a 30 minute or a 60 minute
flight.
After each flight, 30 minutes must be allowed for refuelling and safety checks before the next flight
can take off. All planes offer both 30 minute and 60 minute flights, but, for the purpose of this activity,
they will not be mixed on a given day, e.g. the 2 seater will offer 30 minute flights ONLY on one day
and 60 minute flights ONLY on another day.
• Your program must include appropriate prompts for the entry of data.
• 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 (a) All variables, constants and other identifiers should have meaningful names.
(i) Declare suitable arrays for each of the planes to store time slots booked.
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[3]
(ii) Name one variable and one constant you used for Task 1 and state the purpose of each
one.
Variable .............................................................................................................................
Purpose .............................................................................................................................
...........................................................................................................................................
Constant ............................................................................................................................
Purpose .............................................................................................................................
...........................................................................................................................................
[4]
(b) Write an algorithm to complete Task 1, using either pseudocode, programming statements
or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© UCLES 2017 0478/23/O/N/17
5
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
(c) Describe how you could validate and test the inputs for Task 1.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(d) Explain how your program checks and displays whether any of the planes are available at a
given time of the day (Task 2). Any programming statements used must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Section B
2 This section of program code asks for 80 numbers between 100 and 1000 to be entered. It checks
that the numbers are in the correct range, and stores them in an array. It counts how many of the
numbers are larger than 500 and then outputs the result when the program is finished.
1 Count = 0
2 FOR Index = 1 TO 80
3 INPUT 'Enter a number between 100 and 1000', Number
4 WHILE Number = 99 AND Number = 1001
5 INPUT 'This is incorrect, please try again', Number
6 ENDWHILE
7 Num[80] = Number
8 IF Number > 500 THEN Count = Count + 1
9 UNTIL Index = 80
10 PRINT Index
11 PRINT ' numbers were larger than 500'
State the line number for each error and write the correct code for that line.
3 (a) Explain the difference between a validation check and a verification check.
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(b) Describe, using an example, how data could be verified on data entry.
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
4 (a) Four pseudocode descriptions and five pseudocode statements are shown. Draw one line to
link each pseudocode description to the correct pseudocode statement. Not all pseudocode
statements will be used.
WHILE…DO…ENDWHILE
A loop that will iterate a set
number of times. CASE…OF…OTHERWISE…ENDCASE
[4]
(b) Write an algorithm in pseudocode, using a single loop, to print 50 names that have been
stored in an array.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[3]
START
Flag 0
Count 1
Is Name[Count] Yes
> Name[Count + 1]? Temp Name[Count]
No Name[Count] Name[Count + 1]
Name[Count + 1] Temp
Flag 1
Count Count + 1
No Is Count
= 4?
Yes
No Is Flag
= 0?
Yes
END
(a) The array used in the flowchart contains the following data:
Complete the trace table using the data given in the array.
[5]
...................................................................................................................................................
...............................................................................................................................................[2]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
6 A wildlife park has a database table, called LIVESTOCK, to classify and record its animal species.
Part of the database table is shown.
(a) Suggest another appropriate field that could be added to this database by stating its name
and data type. State its purpose and give an example of the data it could contain.
Purpose ....................................................................................................................................
...................................................................................................................................................
(b) Use the query-by-example grid below to provide a list of all four legged mammals that are
herbivores, sorted alphabetically by species, with only the species displayed.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
The maximum total mark for this syllabus, after weighting has been applied, is 125.
The overall thresholds for the different grades were set as follows.
Combination of
Option A* A B C D E F G
Components
AY 12, 22 104 89 74 59 50 42 34 26
Learn more! For more information please visit www.cambridgeinternational.org/igcse or contact Customer Services
on +44 (0)1223 553554 or email info@cambridgeinternational.org
Cambridge Assessment International Education
Cambridge International General Certificate of Secondary Education
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 2018 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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.
Free to download
Free software
Code can be modified
and redistributed
Freeware
Subject to copyright
legislation
1 mark for each ‘Type of software’ if correct lines are attached to it.
Use a firewall
Use of a proxy server
Do not use / download software / files from unknown sources
Do not share external storage devices / USB pens
Do not open / take care when opening attachments / link
Do not connect computer to network / use as stand-alone computer
Limiting access to the computer
6 1 mark for suitable example and 1 mark for suitable associated use. 6
Primary RAM
stores OS when running / data currently in use / instructions currently in use
ROM
stores boot instructions / BIOS
Cache
stores frequently used instructions
8(a) Method 3
Descriptions
Serial Parallel
Multiple bits are sent and received at
3 [1]
the same time.
Bits are sent one at a time in a single
3 [1]
direction.
Bits are sent using a single wire. Data
can be sent or received, but not at the 3 [1]
same time.
8(b) Type 3
Descriptions
Simplex Half-duplex Duplex
Multiple bits are sent and received at
3 [1]
the same time.
Bits are sent one at a time in a single
3 [1]
direction.
Bits are sent using a single wire. Data
can be sent or received, but not at the 3 [1]
same time.
9 Max 3 – 1 mark for correct answer and 2 marks for correct calculations. 3
16000 × 32
512000 / 1024
Or
16000 × 8
128000 × 32
4096000 / 8
512000 / 1024
Correct answer:
500 kB
10(a)(i) 10010 1
10(a)(ii) 11110001 1
11(a) Smaller file size reduces download / display time // reduces upload time 1
Fewer errors
no human input
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (LK/CGW) 161583/3 R
© UCLES 2018 [Turn over
2
Draw lines to link each description to a correct type of software. A description can be linked to
more than one type of software.
Free to download
Free software
Code can be
modified and
redistributed
Freeware
Subject to copyright
legislation
[2]
Task 1 .......................................................................................................................................
...................................................................................................................................................
Task 2 .......................................................................................................................................
...................................................................................................................................................
Task 3 .......................................................................................................................................
...................................................................................................................................................
[3]
(b) David is still concerned that his computer might get infected by a computer virus.
State three other ways in which David can reduce the risk of his computer getting a computer
virus.
1 ................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
3 ................................................................................................................................................
...................................................................................................................................................
[3]
3 Parity checks can be used to check for errors during data transmission.
...............................................................................................................................................[1]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[3]
Describe how the sensors and the microprocessor are used to control the temperature of the
hospital.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
......................................................................................................................................................[6]
(a) Complete the table to show the hexadecimal equivalent of the binary IP address.
The first number has already been converted.
Binary IP address
11000100 00010000 11111110 00001001
Hexadecimal
C4
[3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
Primary storage
Example ...........................................................................................................................................
Use ...................................................................................................................................................
..........................................................................................................................................................
Secondary storage
Example ...........................................................................................................................................
Use ...................................................................................................................................................
..........................................................................................................................................................
Off-line storage
Example ...........................................................................................................................................
Use ...................................................................................................................................................
..........................................................................................................................................................
[6]
X
B
Working space
A B C 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]
B X
[6]
(c) Complete the truth table for the logic statement given in part (b).
Working space
A B C 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]
8 (a) Three descriptions and two methods of data transmission are given.
Tick () the correct box to show the Method of data transmission for each description.
Description Method
Serial Parallel
Multiple bits are sent
and received at the
same time.
Bits are sent one
at a time in a single
direction.
Bits are sent using a
single wire. Data can
be sent or received, but
not at the same time.
[3]
(b) Three descriptions and three types of data transmission are given.
Tick () the correct box to show the Type of data transmission for each description.
Description Type
Simplex Half-duplex Duplex
Multiple bits are sent
and received at the
same time.
Bits are sent one
at a time in a single
direction.
Bits are sent using a
single wire. Data can
be sent or received, but
not at the same time.
[3]
9 A 32-second sound clip will be recorded. The sound will be sampled 16000 times a second.
Calculate the file size in kilobytes. You must show all of your working.
10 The table shows a segment of primary memory from a Von Neumann model computer.
Address Contents
10001 11001101
10010 11110001
10011 10101111
10100 10000110
10101 00011001
10110 10101100
(a) (i) State the data that will be placed in the memory address register (MAR).
.......................................................................................................................................[1]
(ii) State the data that will be placed in the memory data register (MDR).
.......................................................................................................................................[1]
(b) Describe the stored program concept when applied to the Von Neumann model.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
She will use lossy compression to reduce the file size of the photo to create the thumbnail image.
(a) State why a smaller file size is appropriate for this situation.
...................................................................................................................................................
...............................................................................................................................................[1]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
12 A hospital stores the results of medical tests on a computer system. Each patient is given a
wristband containing a unique barcode. The barcode is used every time the patient has a medical
test.
Benefit 1 ...................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Benefit 2 ...................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
Function 1 ........................................................................................................................................
..........................................................................................................................................................
Function 2 ........................................................................................................................................
..........................................................................................................................................................
Function 3 ........................................................................................................................................
..........................................................................................................................................................
Function 4 ........................................................................................................................................
..........................................................................................................................................................
[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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself 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 2018 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some Cambridge O Level
components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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(a)(i) 1 mark for name and 1 mark for appropriate data structure from Task 1 e.g. 2
name studentName
Data structure Array
1(a)(ii) 1 mark for name, 1 mark for appropriate value and 1 mark for appropriate use. From any task e.g. 6
1(b) 1 mark for changing the value of a variable/constant/ counter, 1 mark for change to the program e.g. 2
Value: Change the value of the variable/constant maxGroupSize in Task 2 to 25
Program change: Oversubscribed test will be changed to test for over 50 // second group starts at 26
Section B
2(b) One mark for both ends of the range and correct inequality symbols and one mark for the AND. 2
The test should be IF Number >= 100 AND Number <= 200
0 0
50 50 1
70 120 2
65 185 3
100 285 4
95 380 5
50 430 6
55 485 7
85 570 8
70 640 9 Lift overload, step out
5 2 marks for appropriate explanation, 1 mark example programming statements showing sequence, 1 mark example 4
programming statement(s) showing selection e.g.
Sequence is the concept of one statement being executed after another(1) whereas selection decides which statement(s) are
to be executed depending upon the result of a question (1)
sequence example (1)
PRINT X
PRINT Y
Selection example (1)
IF X > Y THEN PRINT X ELSE PRINT Y
6(a) 1 mark for appropriate field name and appropriate data type, then 1 mark for appropriate explanation. e.g. 8
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (LK) 148975/1
© UCLES 2018 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
Students in a school are allowed to choose extra subjects each year. Students provide the school
administrator with their names and their subject choices. Places in subject groups are allocated on a
‘first come, first served’ basis. There are two classes of 30 students and they can each choose two
extra subjects from:
• Physics
• Chemistry
• History
• Geography
• Computer Science
The maximum group size for each subject choice is 20 students and the minimum group size is 10
students. If more than 20 students choose a subject then that subject can be split into two groups.
Each subject can have no more than two groups. If less than 10 students choose a subject then it is
not available that year. A program is required to show a summary of the number of students who have
chosen each subject, identify subject group sizes, produce subject group lists and identify problems.
• Your program or programs must include appropriate prompts for the entry of data.
• 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 – Data entry and number of students who have chosen each subject.
The school administrator enters the data for each student. Write a program for TASK 1 to store this
data then calculate and output the number of students who have chosen each subject.
Using your results from TASK 1, allocate students to subject groups. Print out list(s) of student names
for each viable subject group. Identify any subjects that are over or undersubscribed, identify the
students who have been allocated to one subject group only and those who have not been allocated to
any group. Print out this information.
Using your results from TASK 2, print out the number of spare places for each subject. Any group that
has fewer than 20 students has spare places. Calculate the total number of spare places and the total
number of unallocated student choices. Show whether the number of spare places available is enough
to cover the unallocated choices.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (LK/CGW) 148974/2
© UCLES 2018 [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
Students in a school are allowed to choose extra subjects each year. Students provide the school
administrator with their names and their subject choices. Places in subject groups are allocated on a
‘first come, first served’ basis. There are two classes of 30 students and they can each choose two
extra subjects from:
• Physics
• Chemistry
• History
• Geography
• Computer Science
The maximum group size for each subject choice is 20 students and the minimum group size is 10
students. If more than 20 students choose a subject then that subject can be split into two groups.
Each subject can have no more than two groups. If less than 10 students choose a subject then it
is not available that year. A program is required to show a summary of the number of students who
have chosen each subject, identify subject group sizes, produce subject group lists and identify
problems.
• Your program or programs must include appropriate prompts for the entry of data.
• 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 – Data entry and number of students who have chosen each subject.
The school administrator enters the data for each student. Write a program for TASK 1 to store this
data then calculate and output the number of students who have chosen each subject.
Using your results from TASK 1, allocate students to subject groups. Print out list(s) of student
names for each viable subject group. Identify any subjects that are over or undersubscribed, identify
the students who have been allocated to one subject group only and those who have not been
allocated to any group. Print out this information.
Using your results from TASK 2, print out the number of spare places for each subject. Any group
that has fewer than 20 students has spare places. Calculate the total number of spare places and
the total number of unallocated student choices. Show whether the number of spare places available
is enough to cover the unallocated choices.
(i) State the name and data structure that you have used to record student names in Task 1.
Name .................................................................................................................................
(ii) State the name of one constant and the name of one variable that you could have used
in your programmed solution.
State the value that would be assigned to the constant. State the data type for the
variable. Explain what each one would be used for in your programmed solution.
Value .................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
[6]
(b) Explain how you would change your program for Task 2 if the maximum group size for each
subject is increased to 25.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(c) Write an algorithm to complete Task 1, using either pseudocode, programming statements
or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© UCLES 2018 0478/22/F/M/18
5
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
(d) Explain how your program calculates the total number of spare places in Task 3. Any
programming statements shown in your answer must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
Section B
2 An algorithm has been written in pseudocode to input some numbers and print out any numbers
that are greater than or equal to 100. The number 999 stops the algorithm.
INPUT Number
WHILE NUMBERS <> 999 DO
IF Number > 100 THEN PRINT Number ENDIF
ENDWHILE
PRINT Number
(a) Find the four errors in the pseudocode and suggest corrections.
Error 1 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 2 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 3 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
Error 4 .......................................................................................................................................
Correction .................................................................................................................................
...................................................................................................................................................
[4]
(b) Show, using pseudocode, how you would change the corrected algorithm to print out any
numbers between 100 and 200 inclusive.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
© UCLES 2018 0478/22/F/M/18 [Turn over
8
3 This flowchart inputs the weight in kilograms of a passenger stepping into a lift. The lift can take a
maximum of eight passengers or a maximum weight of 640 kilograms.
START
totalWeight 0
totalNumber 0
INPUT Weight
Is
Yes
totalWeight
> 640?
No
No Is
Yes
totalNumber
> 8?
OUTPUT 'Lift
overload, step
out'
END
[4]
Give, with reasons, two different values of test data that could be used for the baby’s weight.
Each reason must be different.
Value 1 .............................................................................................................................................
Reason .............................................................................................................................................
..........................................................................................................................................................
Value 2 .............................................................................................................................................
Reason .............................................................................................................................................
..........................................................................................................................................................
[4]
5 Explain the difference between the programming concepts of sequence and selection. Include
an example of a programming statement for each concept in your explanation.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
......................................................................................................................................................[4]
6 A database table, JEWEL, is used to keep a record of jewellery for sale in a shop. Each item of
jewellery can be made of silver, platinum or gold metal. The shop stocks rings, bracelets and
necklaces. The number in stock and the price is also stored.
(a) Identify the four fields required for the database. Give each field a suitable name and data
type. Explain why you chose the data type for each field.
Explanation ...............................................................................................................................
...................................................................................................................................................
Explanation ...............................................................................................................................
...................................................................................................................................................
Explanation ...............................................................................................................................
...................................................................................................................................................
Explanation ...............................................................................................................................
...................................................................................................................................................
[8]
(b) Explain why none of these fields could be used as a primary key.
...................................................................................................................................................
...............................................................................................................................................[1]
(c) Using the query-by-example grid below, write a query to identify the silver bracelets. Only
display the number in stock and the price.
Field:
Table:
Sort:
Show:
Criteria:
or:
[3]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
The maximum total mark for this syllabus, after weighting has been applied, is 125.
The overall thresholds for the different grades were set as follows.
Combination of
Option A* A B C D E F G
Components
AX 11, 21 95 77 59 41 33 25 17 9
AY 12, 22 90 73 56 40 32 24 16 8
AZ 13, 23 92 76 60 44 35 27 19 11
Learn more! For more information please visit www.cambridgeinternational.org/igcse or contact Customer Services
on +44 (0)1223 553554 or email info@cambridgeinternational.org
Cambridge Assessment International Education
Cambridge International General Certificate of Secondary Education
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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.
− analogue
− digital
− denary
− 10
− binary
− 2
− 42
− 257
− 542
− Register C
Lossy (compression)
Lossless (compression)
− Lossless (compression)
Component Description
Holds data and instructions when they are
Immediate access
loaded from main memory and are waiting
store (IAS)
to be processed.
Arithmetic logic
Carries out the calculations on data.
unit (ALU)
6(a) 1 mark for each correct logic gate (with the correct direction of input(s)) 6
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 0
1 0 1 1
1 1 0 1
1 1 1 1
7 Compiler 6
Any three from:
− Translates high-level language into machine code/low level language
− Translates (the source code) all in one go/all at once
− Produces an executable file
− Produces an error report
Interpreter
Any three from:
– Translates high-level language into machine code/low level language
− Translates (the source code) line by line/statement by statement
– Stops if it finds an error
– Will only continue when error is fixed
− domain (name)
− file name/webpage name
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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.
– nibble
– byte
– megabyte (MB)
– gigabyte (GB)
– Lossy
Hours 0 0 0 0 0 0 1 0
Minutes 0 0 0 1 1 1 1 1
Seconds 0 0 1 1 1 0 1 0
0 5 2 6 5 5
Hours Minutes Seconds
1 1 0 1 0 0 0 0 0 0 1 1
– Register Y
– fetches
– immediate access store // IAS
– program counter // PC
– memory address register // MAR
– memory data register // MDR
– executed
– arithmetic logic unit // ALU
– accumulator // ACC
7(a) 1 mark for each correct logic gate with correct direct of input(s): 6
A B C Working space X
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
– Compiler
10(b)(ii) Any two from e.g. (1 mark for method, 1 for expansion): 2
– She could use a (conductive) stylus«
– « this will allow the charge to be charged/disturbed
12(a)(i) Encryption 1
– ARQ
– uses acknowledgment and timeout
– A request is sent with data to acknowledge all data is received
– Acknowledgement sent back to say all data is received
– If no acknowledgement is received in a time frame an error in transmission detected / data automatically resent.
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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.
Application Sensor
Weighing a baby in a hospital Pressure
Turning off a kettle when it boils Temperature
Controlling an automatic door Infrared / Light / Pressure
Monitoring the air quality in an aeroplane Oxygen / Gas / Humidity
Counting cars crossing a bridge Pressure / Infrared / Magnetic
2 Term Applicaon 2
Half-duplex
A microphone that transmits data to a MIDI system.
Phishing
– Legitimate looking emails sent to use
– When user clicks on attachment / link sent to fraudulent website
– Asked to reveal/designed to steal sensitive information
Pharming
– Malicious code loaded on user hard drive
– Will redirect URL requests to fraudulent website
– Asked to reveal/designed to steal sensitive information
Spam
– Junk / unwanted email
– Sent to large numbers of people
– Used for advertising / spreading malware
– Fills up mail boxes
5(a) (0)1101011 1
5(c) B3 2
1 mark for each correct character
8(a) A B C X 4
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
8(b) 6
51 200 × 16
= 102 400
8
102 400
= 100
1024
Answer 100 kB
One mark for correct answer and two marks for correct calculations.
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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(a)(i) Many correct answers, they must be meaningful. The following is an example only: 4
Many correct answers, they must be meaningful. The following is an example only:
e.g. Three arrays containing string data with name, address and phone number – John Smith, Cambridge, 01223 123456
1(b) One mark for method, one mark for an extension or reason. 2
foundProc ← FALSE
count ← 1
WHILE NOT foundProc AND count <=3 DO
IF processor(estNo) = proc(count) AND stProc(count) > 0
THEN
foundProc ← TRUE
ENDIF
count ← count + 1
ENDWHILE
IF foundProc
THEN
foundRAM ← FALSE
IF RAM(estNO) = RAM1 AND stRAM1 >0
THEN
foundRAM ← TRUE
stRAM1 ← stRAM1 - 1
ENDIF
IF RAM(estNO) = RAM2 AND stRAM2 >0
THEN
foundRAM ← TRUE
stRAM2 ← stRAM2 - 1
ENDIF
ENDIF
IF NOT foundProc
THEN
OUTPUT "Processor out of stock"
ELSE
stProc(count) ← stProc(count) - 1
ENDIF
IF NOT foundRAM
THEN
OUTPUT "RAM out of stock"
ENDIF
Explanation
1 How the number of orders was calculated
2 Deal with the case where the estimate has not been turned into an order
3 Calculating the total number of each component sold
4 Details of method actually used to calculate numbers of components
5 How the total value of all the orders was calculated
6 Display summary
7 Display complete summary of number of orders, total number of components and total value of orders
Section B
zero ← 0
posCount ← 0
FOR count ← 1 TO 1000
INPUT number
IF number > 0
THEN posCount ← posCount + 1
ENDIF
IF number = 0
THEN zero ← zero + 1
ENDIF
NEXT
OUTPUT posCount, " positive numbers"
OUTPUT zero, " zeros"
2(b) Reduce the number of iterations to a manageable amount // Simulate the input (e.g. random generation) 1
3(a) Digit(1) Digit(2) Digit(3) Digit(4) Digit(5) Digit(6) Digit(7) Digit(8) Sum OUTPUT 5
5 7 0 1 2 3 4 6 44 GTIN-8
57012346
Digit(1) Digit(2) Digit(3) Digit(4) Digit(5) Digit(6) Digit(7) Digit(8) Sum OUTPUT
4 3 1 0 2 3 1 0 30 GTIN-8
43102310
Or
6(a) Fields 5 2
Records 8
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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(a)(i) Variable name, data type and use one mark, max two 2
Several correct answers, the names chosen must be meaningful. Variables must
relate to task 2
Example
Name totalMilk
Data type integer/real
Use to store the total volume of the milk for the week (to the nearest
whole litre) (1)
Name weeklyAverage
Data type integer/real
Use to store the average yield per week (1)
Example
A real array for each milking and an array of strings for the identity codes. There
would be 14 arrays for the milking e.g. mondayMorning, mondayEvening
Sample data for a cow could be 123, 23.5, 22.7
1(b) Entering/selecting the identity code (1) method to ensure it is not a duplicate (1) 2
Example
Enter new identity code number
Check if already in the list of code numbers
Sample answer
total ← 0
FOR counter ← 1 TO numCows
total ← total + mondayMorning(counter)
total ← total + mondayEvening(counter)
total ← total + tuesdayMorning(counter)
total ← total + tuesdayEvening (counter)
total ← total + wednesdayMorning(counter)
total ← total + wednesdayEvening (counter)
total ← total + thursdayMorning(counter)
total ← total + thursdayEvening (counter)
total ← total + fridayMorning(counter)
total ← total + fridayEvening (counter)
total ← total + saturdayMorning(counter)
total ← total + saturdayEvening (counter)
total ← total + sundayMorning(counter)
total ← total + sundayEvening(counter)
NEXT counter
Average ← ROUND(total/numCows)
OUTPUT "Total volume of milk for week ", ROUND(total)
OUTPUT "Average weekly yield ", average
1(d)(i) Explanation 5
Any five from:
1 Check each cow
2 Initialise day counter to zero
3 Check every day of the week
4 If daily yield is less than 12
5 add one to day counter
6 If day counter >= 4
7 identify/output identity code number(s)
1(d)(ii) Explanation 2
• Add new storage space to store code numbers for example new
array/table/list
• Add extra code to store these values if the condition was met
Section B
2(a) One mark per correct pair of actions, process, Input/Output, Tests (apart from 6
START and END) max 3
One mark complete Flowlines, one mark working flowlines, one mark correct use
flowchart symbols
START
Count ← 0
INPUT
Number
Is Yes
Number
= 0?
No
Yes Is
Number
< 0?
OUTPUT Count, "
No positive
numbers"
5 7 + 12 12
6 2 - 4 4
4 3 * 12 12
7 8 ? 0
0 0 / (0)
Any 3 from:
• The programmer could ask the contributor to type in each detail twice
• and then check that both values are equal
• If they are not equal then the input should be rejected
• The programmer could ask the contributor to check the details on the
screen
• and confirm that they are correct / same as the original
• or change them
4(b) One mark for email and one mark for password 2
Email – check for @ / format check / no spaces /valid characters // presence
check // length check (not more than 254 characters) // uniqueness check
Password – length check / numbers and letters etc. // uniqueness check not been
used before // presence check
6(a) Fields 5 1
6(b) One mark description of new code that will allow more than 1000 values 2
One mark for example matching candidate’s description
Example
Use a new character instead of N
TT345
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 2018 series for most
Cambridge IGCSE™, Cambridge International A and AS Level and Cambridge Pre-U components, and
some Cambridge O Level components.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
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(a)(i) One mark for any meaningful array name related to Task 1 × 2 e.g. 4
Tickets
EntryTime
One mark for correct data type AND use related to Task 1 × 2 e.g.
1(a)(ii) One mark for any meaningful name for a constant AND value related to Task 3 4
× 2 e.g.
MaxTime
8
MaxFine
100
1(d) One mark for each correct test data item and related reason for Task 1 2
(Answers MUST relate to pre-release task)
e.g.
Test data: 85
Reason: To check that normal ticket number data is accepted
Section B
2(a) One mark for description one mark for example e.g. 2
2(b) One mark for description one mark for example e.g. 2
To test if the data input is the same as the data that was intended to be input
A double entry check expects each item of data to be entered twice and
compares both entries to check they are the same.
Counter = 0
FOR Count = 1 TO 30
Total = Total + Number
NEXT Count
5(a) 3
Max Counter Num OUTPUT
–1000.00 0 6.30
6.30 1 18.62
18.62 2 50.01
50.01 3 3.13
50.01 4 2.05
50.01 5 50.10
50.10 6 40.35
50.10 7 30.69
50.10 8 0.85
50.10 9 17.30
50.10 10 50.10
Boxes 2, 4, 5, 8 Change the Max variable to something more suitable e.g. Min
20
CatNo
It is a unique identifier
CatNo Text
Title Text
Genre 1 Text
6(e) 4
Field: CatNo Title Genre 1 Genre 2 Stream
Sort: Ascending
Show: ; ;
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NF) 148542/1
© UCLES 2018 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
A computer shop will build a computer from components to meet a customer’s requirements. For each
request for a computer to be built, an estimate of the cost is produced. The component stock level is
checked; if all the components are in stock, a firm order to build the computer can be placed. A program
is required to work out the cost of the computer, update the stock levels and provide a daily summary
of orders for the shop owner.
Write and test a program or programs for the computer shop owner.
• Your program or programs must include appropriate prompts for the entry of data.
• 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.
Write a program for TASK 1 to calculate the cost of building a computer using these components:
The customer makes a choice for each component and an estimate is produced. The estimate must
show a unique estimate number, the components chosen and the price of each component. The
estimate must also show the total cost of the computer, which is calculated as the sum of the cost of
the components chosen plus 20%.
Using your estimate from TASK 1, check if the components required are in stock. If all the components
are in stock then update the stock levels. Add the unique estimate number to the list of order numbers.
Add the customer’s details and today’s date to the estimate details to finalise the order. Print two
copies of the order, one for the customer and one for the shop.
Extend TASK 2 to provide an end of day summary showing the number of orders made, the total
number of each component sold and the value of the orders.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH) 148632/2
© UCLES 2018 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
A farmer records the milk production of a herd of cows. Every cow has a unique 3-digit identity code.
Each cow can be milked twice a day, seven days a week. The volume of milk from each cow is recorded
in litres correct to one decimal place (yield) every time the cow is milked. The size of the herd is fixed.
At the end of the week the total and the average yield for each cow for that week is calculated.
The farmer identifies the cow that has produced the most milk that week. The farmer also identifies any
cows that have produced less than 12 litres of milk on four or more days that week.
A program is required to record the yield for each cow every time it is milked, calculate the total weekly
volume of milk for the herd and the average yield per cow in a week. The program must also identify
the cow with the best yield that week and identify any cows with a yield of less than 12 litres of milk for
four or more days that week.
• Your program or programs must include appropriate prompts for the entry of data.
• 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.
Write a program for TASK 1 to record the milk yields for a week. The program records and stores the
identity code number and the yield every time a cow is milked.
Using your recorded data from TASK 1, calculate and display the total weekly volume of milk for the
herd to the nearest whole litre. Calculate and display the average yield per cow in a week to the
nearest whole litre.
TASK 3 – Identify the most productive cow and cows that are producing a low volume of milk.
Extend TASK 2 to identify and display the identity code number and weekly yield of the cow that has
produced the most milk. Also identify and display the identity code numbers of any cows with a yield of
less than 12 litres of milk for four days or more in the week.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
This material should be given to the relevant teachers and candidates as soon as it has been received
at the Centre.
Candidates should use this material in preparation for the examination. Candidates should attempt the
practical programming tasks using their chosen high-level, procedural programming language.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH) 148634/3
© UCLES 2018 [Turn over
2
In preparation for the examination candidates should attempt the following practical tasks by writing
and testing a program or programs.
A car park has space for 100 cars and a barrier entrance and exit system. There is a display at the
entrance to show how many spaces are empty. Cars are issued a ticket with a unique number on entry
and the time of issue is stored. The car park charges $1.50 per hour and the fee is paid at a machine
before leaving the car park. At the machine, the ticket number and departure time are entered; the
fee is calculated by the machine and the amount due is paid by the ticket holder. Cars cannot stay
overnight; the system is reset at midnight.
Write and test a program or programs for the car park manager.
• Your program or programs must include appropriate prompts for the entry of data.
• 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 – Operating the car park.
The system is reset at midnight every day.
Set up a system using arrays and with suitable prompts that will carry out the following as cars enter or
leave the car park:
On Entry:
• display the number of empty car park spaces
• issue the next available ticket number
• store the current time and the ticket number
• display the updated number of empty car park spaces.
On Exit:
• input a ticket number and departure time
• output the amount of time the car stayed at the car park
• delete the ticket number from the array
• display the updated number of empty car park spaces.
TASK 2 – Working out the cost and daily takings.
Amend the program so that it will calculate the amount to be paid using a charge of $1.50 per hour, or
part of an hour (i.e. any amount of time into the next hour is charged for a whole hour). The amount to
be paid is displayed and is added to a running total for the day, before the ticket number is deleted from
the array. At the end of the day, the following information is displayed:
• total daily takings
• number of cars that have used the car park
• average charge per car
• average length of stay per car.
TASK 3 – Introducing parking restrictions.
The car park manager decides to restrict the length of stay to a maximum of eight hours, and will
charge an extra $100 if a car overstays. Modify your program to implement this change and ensure the
driver is aware of this extra charge. Output the number of cars that have overstayed in a day.
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (SR/SW) 163639/3 R
© UCLES 2018 [Turn over
2
Complete the sentences in Jane’s answer, using the list given. Not all items in the list need to be
used.
• 2
• 10
• 16
• analogue
• binary
• denary
• digital
• hexadecimal
process this type of data. For a computer to be able to process data it needs to be
Write the denary number for each of the three hexadecimal numbers:
2A ....................................................................................................
101 ...................................................................................................
21E ..................................................................................................
[3]
Working Space
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
3 The three binary numbers in the registers A, B and C have been transmitted from one computer to
another.
Parity bit
Register A 1 0 0 1 1 0 0 0
Register B 0 1 1 0 0 1 1 1
Register C 1 0 0 1 1 0 0 1
One binary number has been transmitted incorrectly. This is identified through the use of a parity bit.
Identify which register contains the binary number that has been transmitted incorrectly. Explain
the reason for your choice.
The binary number that has been transmitted incorrectly is in Register ..........................................
Explanation ......................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[4]
4 Michele wants to email a file to Elsa. The file is too large so it must be compressed.
(b) The file Michele is sending contains the source code for a large computer program.
Identify which type of compression would be most suitable for Michele to use.
Explanation ................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
5 Six components of the Von Neumann model for a computer system and six descriptions are given.
Component Description
Arithmetic logic
Carries out the calculations on data.
unit (ALU)
B X
[6]
(b) Complete the truth table for the given logic statement.
Working space
A B C 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]
7 Translators, such as a compiler and an interpreter, are used when writing and running computer
programs.
Compiler ...........................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Interpreter .........................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
(b) Explain how the barcode system could help the supermarket manage its stock.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[3]
(c) An infrared touch screen is used to view and navigate the supermarket stock system.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
© UCLES 2018 0478/11/M/J/18
9
(d) The supermarket uses secondary storage and off-line storage to store data about its stock.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
9 A business wants to use a biometric security system to control entry to the office.
Explain how the biometric security system will make use of the biometric device and the
microprocessor to control entry to the office.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
10 RockICT is a music business that has a website to allow customers to view and buy the products
it sells.
(a) Describe what is meant by HTML structure and presentation for a web page.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
https://www.rockict.net/index.htm
Part 1 Part 2
Part 1 ................................................................................................................................
Part 2 ................................................................................................................................
[2]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[2]
“RockICT makes use of cookies. By continuing to browse you are agreeing to our use of
cookies.”
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[2]
(d) The music company is concerned about the security of its website.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (SC/SW) 150229/2
© UCLES 2018 [Turn over
2
1 Different units of data can be used to represent the size of a file, as it changes in size.
• byte
• gigabyte (GB)
• megabyte (MB)
• nibble
Smallest bit
………………………………………………..
………………………………………………..
kilobyte (kB)
………………………………………………..
………………………………………………..
2 (a) Nancy has captured images of her holiday with her camera. The captured images are stored
as digital photo files on her camera.
Explain how the captured images are converted to digital photo files.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [4]
Many of the photos are very large files, so Nancy needs to reduce their file size as much as
possible.
Identify which type of compression would be most suitable for Nancy to use. Explain your
choice.
Explanation ...............................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
0 2 3 1 5 8
Hours Minutes Seconds
(a) Write the 8-bit binary numbers that are currently stored for the Hours, Minutes and Seconds.
Hours
Minutes
Seconds
[3]
Hours 0 0 0 0 0 1 0 1
Minutes 0 0 0 1 1 0 1 0
Seconds 0 0 1 1 0 1 1 1
Write the denary values that will now be shown on the stopwatch.
Jafar remembers that hexadecimal is often used to represent binary values in error codes.
Convert the hexadecimal number in the error message into 12-bit binary.
[3]
5 The three binary numbers in the registers X, Y and Z have been transmitted from one computer to
another.
Parity bit
Register X 1 0 0 1 0 0 1 0
Register Y 1 1 1 0 0 1 1 1
Register Z 1 1 1 0 1 0 0 1
Only one binary number has been transmitted correctly. This is identified through the use of a
parity bit.
Identify which register contains the binary number that has been transmitted correctly. Explain
the reason for your choice.
The binary number that has been transmitted correctly is in Register ............................................
Explanation ......................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[4]
6 Kelvin correctly answers an examination question about the Von Neumann model.
• accumulator (ACC)
• address bus
• arithmetic logic unit (ALU)
• control unit (CU)
• data bus
• executed
• fetches
• immediate access store (IAS)
• memory address register (MAR)
• memory data register (MDR)
• program counter (PC)
• saved
• transmits
Any calculations that are carried out on the data are done by the
B X
[6]
(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]
He needs to send just the machine code for the program to his friend, electronically.
Identify which translator will be most suitable for Dimitri to use. Explain your choice.
Explanation ......................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[4]
.............................................................................................................................................. [1]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [4]
© UCLES 2018 0478/12/M/J/18
9
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [4]
She presses an icon on her touch screen but her action is not registered.
(i) Explain why the touch screen will not register her touch.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
Explain how Alexandra could use her mobile device whilst still wearing gloves.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
11 A factory uses a security system to control a security light. The system uses a sensor and a
microprocessor.
Explain how the security system makes use of the sensor and the microprocessor to control the
security light.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..................................................................................................................................................... [6]
12 (a) Selma has some important personal information that she needs to email to her employer.
She wants to make sure that if the personal information is intercepted, it cannot be understood.
(i) State how Selma could email her personal data more securely.
...................................................................................................................................... [1]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [5]
(b) Selma wants to make sure that the information received is correct.
Describe another error detection method that can be used to check the information received
is correct.
Description ................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[3]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (SC/CGW) 148529/3
© UCLES 2018 [Turn over
2
Application Sensor
[5]
Term Application
3 Three security issues that could affect users online are phishing, pharming and spam.
Phishing ...........................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Pharming ..........................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
Spam ................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[6]
(a) Parity checks can be used to check for errors during data transmission.
(i) Tick (✓) to show for each of the received bytes whether they have been transmitted
correctly or transmitted incorrectly.
10001011
10101110
01011101
00100101
[4]
(ii) State one other method that could be used to check for transmission errors.
...................................................................................................................................... [1]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
...........................................................................................................................................
...................................................................................................................................... [1]
(iii) Explain why serial data transmission is normally used for transferring data over a long
distance.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(ii) Explain one method that could be used to increase the level of security provided by the
encryption.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
.............................................................................................................................................. [1]
(b) Represent the denary number 300 as it would be stored in a 12-bit binary register.
.............................................................................................................................................. [2]
.............................................................................................................................................. [2]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [2]
Device 1 ....................................................................................................................................
Device 2 ....................................................................................................................................
Device 3 ....................................................................................................................................
[3]
7 A train station uses large touch screens to allow passengers to search for train information and
buy tickets.
(a) State three benefits of using a touch screen in the train station.
Benefit 1 ...................................................................................................................................
...................................................................................................................................................
Benefit 2 ...................................................................................................................................
...................................................................................................................................................
Benefit 3 ...................................................................................................................................
...................................................................................................................................................
[3]
(b) The touch screens at the station use resistive touch technology.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [4]
B
X
(a) Complete the truth table for the given logic circuit.
Working space
A B C 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]
B X
[6]
Tick (✓) the appropriate boxes to show which statements apply to each type of translator.
10 Explain how an instruction is fetched in a computer based on the Von Neumann model.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..................................................................................................................................................... [6]
1 .......................................................................................................................................................
..........................................................................................................................................................
2 .......................................................................................................................................................
..........................................................................................................................................................
3 .......................................................................................................................................................
..........................................................................................................................................................
[3]
The image is 256 pixels high by 200 pixels wide with a 16-bit colour depth.
Calculate the file size of the image. You must show all of your working.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..................................................................................................................................................... [6]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NF) 148543/2
© UCLES 2018 [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 computer shop will build a computer from components to meet a customer’s requirements. For
each request for a computer to be built, an estimate of the cost is produced. The component stock
level is checked; if all the components are in stock, a firm order to build the computer can be placed.
A program is required to work out the cost of the computer, update the stock levels and provide a
daily summary of orders for the shop owner.
Write and test a program or programs for the computer shop owner.
• Your program or programs must include appropriate prompts for the entry of data.
• 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.
Write a program for TASK 1 to calculate the cost of building a computer using these components.
The customer makes a choice for each component and an estimate is produced. The estimate must
show a unique estimate number, the components chosen and the price of each component. The
estimate must also show the total cost of the computer, which is calculated as the sum of the cost of
the components chosen plus 20%.
Using your estimate from TASK 1, check if the components required are in stock. If all the
components are in stock then update the stock levels. Add the unique estimate number to the list
of order numbers. Add the customer’s details and today’s date to the estimate details to finalise the
order. Print two copies of the order, one for the customer and one for the shop.
Extend TASK 2 to provide an end of day summary showing the number of orders made, the total
number of each component sold and the value of the orders.
© UCLES 2018 0478/21/M/J/18
3
1 (a) All variables, constants and other identifiers should have meaningful names.
(i) You recorded information for the estimate of the cost of building a computer in Task 1.
Give a data structure that you created for Task 1, its name, data type and use.
Name .................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
[4]
(ii) Describe the data structures that you have used in Task 2 to record the customer details.
Include sample data in the description.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [4]
(b) Explain how your program for Task 1 produces a unique estimate number.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [2]
(c) Write an algorithm for part of Task 2 to check that the chosen processor and chosen RAM
are in stock, using either pseudocode, programming statements or a flowchart. Assume that
Task 1 has been completed. Do not check the other components or produce the order.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [5]
(d) Explain how your program completes Task 3. Any programming statements used in your
answer must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [5]
Section B
2 (a) Write an algorithm to input 1000 numbers. Count how many numbers are positive and how
many numbers are zero. Then output the results. Use either pseudocode or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [6]
© UCLES 2018 0478/21/M/J/18
7
(b) Give one change you could make to your algorithm to ensure initial testing is more
manageable.
...................................................................................................................................................
.............................................................................................................................................. [1]
3 The global trade item number (GTIN-8) barcode has seven digits and a check digit.
This pseudocode algorithm inputs seven digits and calculates the eighth digit, then outputs the
GTIN-8.
DIV(X,Y), finds the number of divides in division for example DIV(23,10) is 2.
MOD(X,Y), finds the remainder in division for example MOD(23,10) is 3.
FOR Count 1 TO 7
INPUT Number
Digit(Count) Number
NEXT
Sum (Digit(1)+Digit(3)+Digit(5)+Digit(7))*3+Digit(2)+Digit(4)+Digit(6)
IF MOD(Sum,10) <> 0
THEN Digit(8) DIV(Sum,10)*10 + 10 - Sum
ELSE Digit(8) 0
ENDIF
OUTPUT "GTIN-8"
FOR Count 1 TO 8
OUTPUT Digit(Count)
NEXT
Digit(1) Digit(2) Digit(3) Digit(4) Digit(5) Digit(6) Digit(7) Digit(8) Sum OUTPUT
Digit(1) Digit(2) Digit(3) Digit(4) Digit(5) Digit(6) Digit(7) Digit(8) Sum OUTPUT
[5]
(b) Explain how you would change the algorithm to input eight digits (seven digits and the check
digit) and output if the check digit entered is correct or not.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [3]
4 A programmer has written a routine to check that prices are below $10.00. These values are used
as test data.
10.00 ................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
9.99 ..................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
ten ....................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
[3]
5 Explain the difference between the programming concepts of counting and totalling.
Include an example of a programming statement for each concept in your explanation.
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..................................................................................................................................................... [4]
Fields ........................................................................................................................................
Records ....................................................................................................................................
[2]
(b) Give two validation checks that could be performed on the Show Number field.
...................................................................................................................................................
...................................................................................................................................................
[2]
(c) Using the query-by-example grid, write a query to identify jazz performances that are not sold
out. Only display the date and the title.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH) 148633/2
© UCLES 2018 [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 farmer records the milk production of a herd of cows. Every cow has a unique 3-digit identity
code. Each cow can be milked twice a day, seven days a week. The volume of milk from each cow
is recorded in litres correct to one decimal place (yield) every time the cow is milked. The size of the
herd is fixed. At the end of the week the total and the average yield for each cow for that week is
calculated.
The farmer identifies the cow that has produced the most milk that week. The farmer also identifies
any cows that have produced less than 12 litres of milk on four or more days that week.
A program is required to record the yield for each cow every time it is milked, calculate the total
weekly volume of milk for the herd and the average yield per cow in a week. The program must also
identify the cow with the best yield that week and identify any cows with a yield of less than 12 litres
of milk for four or more days that week.
• Your program or programs must include appropriate prompts for the entry of data.
• 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.
Write a program for TASK 1 to record the milk yields for a week. The program records and stores the
identity code number and the yield every time a cow is milked.
Using your recorded data from TASK 1, calculate and display the total weekly volume of milk for
the herd to the nearest whole litre. Calculate and display the average yield per cow in a week to the
nearest whole litre.
TASK 3 – Identify the most productive cow and cows that are producing a low volume of milk.
Extend TASK 2 to identify and display the identity code number and weekly yield of the cow that has
produced the most milk. Also identify and display the identity code numbers of any cows with a yield
of less than 12 litres of milk for four days or more in the week.
1 (a) All variables, constants and other identifiers should have meaningful names.
(i) State the name, the data type and the use of two variables that you have used in Task 2.
Use ....................................................................................................................................
Use ....................................................................................................................................
[2]
(ii) Describe, with the aid of some sample data, the data structures that you have used to
record the data for the cows in Task 1.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[4]
(b) Explain how your program for Task 1 ensures that each 3-digit identity code is unique.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(c) Write an algorithm for Task 2, using either pseudocode, programming statements or a
flowchart. Assume that Task 1 has been completed.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[5]
(d) (i) Explain how your program for Task 3 finds the cows with a daily yield of less than
12 litres of milk for four days or more in the week. Any programming statements used in
your answer must be fully explained.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[5]
(ii) Explain how you would extend your program for Task 3 to store the identity code
number(s) of those cows with a yield of less than 12 litres of milk for four days or more in
the week.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[2]
Section B
2 (a) Draw a flowchart for an algorithm to input numbers. Reject any numbers that are negative
and count how many numbers are positive. When the number zero is input, the process ends
and the count of positive numbers is output.
[6]
© UCLES 2018 0478/22/M/J/18
7
(b) Explain the changes you will make to your algorithm to also count the negative numbers.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
3 This pseudocode algorithm inputs two non-zero numbers and a sign, and then performs the
calculation shown by the sign. An input of zero for the first number terminates the process.
[3]
(b) Show how you could improve the algorithm written in pseudocode by writing an alternative
type of conditional statement in pseudocode.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[3]
4 A programmer has written a routine to store the name, email address and password of a contributor
to a website’s discussion group.
(a) The programmer has chosen to verify the name, email address and password.
Explain why verification was chosen and describe how the programmer would verify this data.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(b) The programmer has also decided to validate the email address and the password.
...................................................................................................................................................
...................................................................................................................................................
Password ..................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[2]
5 A program checks that the weight of a basket of fruit is over 1.00 kilograms and under
1.10 kilograms. Weights are recorded to an accuracy of two decimal places and any weight not in
this form has already been rejected.
Give three weights as test data and for each weight state a reason for choosing it. All your reasons
must be different.
Weight 1 ............................................................................................................................................
Reason ..............................................................................................................................................
..........................................................................................................................................................
Weight 2 ............................................................................................................................................
Reason ..............................................................................................................................................
..........................................................................................................................................................
Weight 3 ............................................................................................................................................
Reason ..............................................................................................................................................
..........................................................................................................................................................
[3]
6 A database table, TREES, is used to keep a record of the trees in a park. Each tree is given a
unique number and is examined to see if it is at risk of dying. There are over 900 trees; part of the
database table is shown.
...............................................................................................................................................[1]
(b) The tree numbering system uses TN followed by three digits. The numbering system will not
work if there are over 1000 trees.
Describe, with the aid of an example, how you could change the tree numbering system to
allow for over 1000 trees. Existing tree numbers must not be changed.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(c) Using the query-by-example grid, write a query to identify at risk trees over 100 years old.
Display only the type and the position on the map.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
© UCLES 2018 0478/22/M/J/18
12
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.
Write your Centre number, candidate number and name in the spaces at the top of this page.
Write in dark blue or black pen.
You may use an HB pencil for any diagrams, graphs or rough working.
Do not use staples, paper clips, glue or correction fluid.
DO NOT WRITE IN ANY BARCODES.
DO NOT ATTEMPT TASKS 1, 2 AND 3 in the pre-release material; these are for information only.
You are advised to spend no more than 40 minutes on Section A (Question 1).
No marks will be awarded for using brand names of software packages or hardware.
At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.
This syllabus is approved for use in England, Wales and Northern Ireland as a Cambridge International Level 1/Level 2 Certificate.
DC (NH/FC) 148635/3
© UCLES 2018 [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 car park has space for 100 cars and a barrier entrance and exit system. There is a display at the
entrance to show how many spaces are empty. Cars are issued a ticket with a unique number on entry
and the time of issue is stored. The car park charges $1.50 per hour and the fee is paid at a machine
before leaving the car park. At the machine, the ticket number and departure time are entered; the fee is
calculated by the machine and the amount due is paid by the ticket holder. Cars cannot stay overnight; the
system is reset at midnight.
Write and test a program or programs for the car park manager.
• Your program or programs must include appropriate prompts for the entry of data.
• 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 – Operating the car park.
The system is reset at midnight every day.
Set up a system using arrays and with suitable prompts that will carry out the following as cars enter or
leave the car park:
On Entry:
• display the number of empty car park spaces
• issue the next available ticket number
• store the current time and the ticket number
• display the updated number of empty car park spaces.
On Exit:
• input a ticket number and departure time
• output the amount of time the car stayed at the car park
• delete the ticket number from the array
• display the updated number of empty car park spaces.
TASK 2 – Working out the cost and daily takings.
Amend the program so that it will calculate the amount to be paid using a charge of $1.50 per hour, or
part of an hour (i.e. any amount of time into the next hour is charged for a whole hour). The amount to be
paid is displayed and is added to a running total for the day, before the ticket number is deleted from the
array. At the end of the day, the following information is displayed:
• total daily takings
• number of cars that have used the car park
• average charge per car
• average length of stay per car.
TASK 3 – Introducing parking restrictions.
The car park manager decides to restrict the length of stay to a maximum of eight hours, and will charge
an extra $100 if a car overstays. Modify your program to implement this change and ensure the driver is
aware of this extra charge. Output the number of cars that have overstayed in a day.
© UCLES 2018 0478/23/M/J/18
3
1 (a) All variables, constants and other identifiers should have meaningful names.
(i) State the name, data type and use of two arrays you created for Task 1.
Use ....................................................................................................................................
...........................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
[4]
(ii) State the name, value and use of two constants you could have created for Task 3.
Value .................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
Value .................................................................................................................................
Use ....................................................................................................................................
...........................................................................................................................................
[4]
(b) Write an algorithm to perform the set up and ‘On Entry’ part of Task 1, using either pseudocode,
programming statements or a flowchart.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[6]
(c) Explain how your program calculates if a car has overstayed the permitted parking time and
how the charge is calculated and output (part of Task 3). Any programming statements you
use in your answer must be fully explained.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[4]
(d) One of the inputs required ‘On Exit’ in Task 1 is ticket number. State two items of suitable test
data you could use to test your input validation and state why you chose them.
Reason .....................................................................................................................................
...................................................................................................................................................
Reason .....................................................................................................................................
...................................................................................................................................................
[2]
Section B
2 Describe, using an example, the purpose of the following checks during data entry.
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
3 This section of program code reads the contents of the array, totals the numbers and prints out the
sum and average of the numbers. Assume the array is full.
Complete the four missing items by writing them in the spaces provided in this code.
1 Numbers[1:30]
2 Total = 0
3 .............................................. = 0
5 Number = Numbers[Count]
7 Counter = Counter + 1
8 .................................................................................................. Count
INPUT Number
IF Number > 100
THEN OUTPUT ″The number is too large″
ELSE OUTPUT ″The number is acceptable″
ENDIF
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(b) (i) The algorithm only allows one attempt at inputting an acceptable value.
State how you would change the algorithm so that it continues until a suitable input is
supplied.
...........................................................................................................................................
.......................................................................................................................................[1]
(ii) Re-write the algorithm in full, using pseudocode, to implement your answer to part (b)(i).
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
.......................................................................................................................................[3]
5 The flowchart allows a set of 10 numbers to be entered; it finds and outputs the largest of these
numbers.
START
Max –1000.00
Counter 0
INPUT Num
No
Max Num
Counter Counter + 1
Is Counter Yes
< 10 ?
No
OUTPUT Max
END
6.30, 18.62, 50.01, 3.13, 2.05, 50.10, 40.35, 30.69, 0.85, 17.30
[3]
(b) Describe two different changes you should make to the flowchart to find the smallest number
instead of the largest number.
Change 1 ...................................................................................................................................
...................................................................................................................................................
Change 2 ...................................................................................................................................
...................................................................................................................................................
[2]
6 A shop that sells copies of movies to the public has set up a new database table called 2018MOV
to store some new releases. Part of this table is given, showing the catalogue number, title, genres
and available formats (Blu-ray, DVD or streaming) of each movie.
...............................................................................................................................................[1]
(b) (i) Give the name of the field that should be used for the primary key.
.......................................................................................................................................[1]
(ii) State the reason for choosing this field for the primary key.
...........................................................................................................................................
.......................................................................................................................................[1]
(c) Complete the table to show the most appropriate data type for each field based on the data
shown in the table at the start of question 6.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...............................................................................................................................................[2]
(e) Using the query-by-example grid, write a query to identify all the movies that are categorised
as Sci-Fi and available to stream. Only display the catalogue number and title of the film, with
the titles listed in alphabetical order.
Field:
Table:
Sort:
Show:
Criteria:
or:
[4]
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 International
Examinations Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download at www.cie.org.uk after
the live examination series.
Cambridge International Examinations is part of the Cambridge Assessment Group. Cambridge Assessment is the brand name of University of Cambridge Local
Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge.