Post on 21-Mar-2020
Specimen paper 1CP1/02Pearson Edexcel Level 1/Level 2 GCSE (9 - 1) in Computer Science (1CP1)
GCSE (9-1)Computer Science
Contents
Introduction 1
General marking guidance 3
Paper 5
Mark scheme 27
Introduction
These specimen papers have been produced to complement the sample assessment materials for Pearson Edexcel Level 1/Level 2 GCSE (9-1) in Computer Science and are designed to provide extra practice for your students. The specimen papers are part of a suite of support materials offered by Pearson.
The specimen papers do not form part of the accredited materials for this qualification.
General marking guidance
· All candidates must receive the same treatment. Examiners must mark the last candidate in exactly the same way as they mark the first.
· Mark schemes should be applied positively. Candidates must be rewarded for what they have shown they can do rather than penalised for omissions.
· Examiners should mark according to the mark scheme not according to their perception of where the grade boundaries may lie.
· All the marks on the mark scheme are designed to be awarded. Examiners should always award full marks if deserved. Examiners should also be prepared to award zero marks if the candidate’s response is not worthy of credit according to https://www.ncetm.org.uk/news/46870 mark scheme.
· Brackets around parts of words/phrases in this mark scheme indicate the possible additional words/phrases candidates may write as their answer. They must not be awarded twice for an answer relating to one bullet point
· Where a word is underlined, that word must be included in the answer to be awarded a mark for that point
· When examiners are in doubt regarding the application of the mark scheme to a candidate’s response, the team leader must be consulted.
· Crossed-out work should be marked unless the candidate has replaced it with an alternative response.
Introduction
These specimen papers have been produced to complement the sample assessment materials for Pearson Edexcel Level 1/Level 2 GCSE (9-1) in Computer Science and are designed to provide extra practice for your students. The specimen papers are part of a suite of support materials offered by Pearson.
The specimen papers do not form part of the accredited materials for this qualification.
General marking guidance
· All candidates must receive the same treatment. Examiners must mark the last candidate in exactly the same way as they mark the first.
· Mark schemes should be applied positively. Candidates must be rewarded for what they have shown they can do rather than penalised for omissions.
· Examiners should mark according to the mark scheme not according to their perception of where the grade boundaries may lie.
· All the marks on the mark scheme are designed to be awarded. Examiners should always award full marks if deserved. Examiners should also be prepared to award zero marks if the candidate’s response is not worthy of credit according to https://www.ncetm.org.uk/news/46870 mark scheme.
· Brackets around parts of words/phrases in this mark scheme indicate the possible additional words/phrases candidates may write as their answer. They must not be awarded twice for an answer relating to one bullet point
· Where a word is underlined, that word must be included in the answer to be awarded a mark for that point
· When examiners are in doubt regarding the application of the mark scheme to a candidate’s response, the team leader must be consulted.
· Crossed-out work should be marked unless the candidate has replaced it with an alternative response.
1Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
Introduction
These specimen papers have been produced to complement the sample assessment materials for Pearson Edexcel Level 1/Level 2 GCSE (9-1) in Computer Science and are designed to provide extra practice for your students. The specimen papers are part of a suite of support materials offered by Pearson.
The specimen papers do not form part of the accredited materials for this qualification.
General marking guidance
· All candidates must receive the same treatment. Examiners must mark the last candidate in exactly the same way as they mark the first.
· Mark schemes should be applied positively. Candidates must be rewarded for what they have shown they can do rather than penalised for omissions.
· Examiners should mark according to the mark scheme not according to their perception of where the grade boundaries may lie.
· All the marks on the mark scheme are designed to be awarded. Examiners should always award full marks if deserved. Examiners should also be prepared to award zero marks if the candidate’s response is not worthy of credit according to https://www.ncetm.org.uk/news/46870 mark scheme.
· Brackets around parts of words/phrases in this mark scheme indicate the possible additional words/phrases candidates may write as their answer. They must not be awarded twice for an answer relating to one bullet point
· Where a word is underlined, that word must be included in the answer to be awarded a mark for that point
· When examiners are in doubt regarding the application of the mark scheme to a candidate’s response, the team leader must be consulted.
· Crossed-out work should be marked unless the candidate has replaced it with an alternative response.
2 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
Introduction
These specimen papers have been produced to complement the sample assessment materials for Pearson Edexcel Level 1/Level 2 GCSE (9-1) in Computer Science and are designed to provide extra practice for your students. The specimen papers are part of a suite of support materials offered by Pearson.
The specimen papers do not form part of the accredited materials for this qualification.
General marking guidance
· All candidates must receive the same treatment. Examiners must mark the last candidate in exactly the same way as they mark the first.
· Mark schemes should be applied positively. Candidates must be rewarded for what they have shown they can do rather than penalised for omissions.
· Examiners should mark according to the mark scheme not according to their perception of where the grade boundaries may lie.
· All the marks on the mark scheme are designed to be awarded. Examiners should always award full marks if deserved. Examiners should also be prepared to award zero marks if the candidate’s response is not worthy of credit according to https://www.ncetm.org.uk/news/46870 mark scheme.
· Brackets around parts of words/phrases in this mark scheme indicate the possible additional words/phrases candidates may write as their answer. They must not be awarded twice for an answer relating to one bullet point
· Where a word is underlined, that word must be included in the answer to be awarded a mark for that point
· When examiners are in doubt regarding the application of the mark scheme to a candidate’s response, the team leader must be consulted.
· Crossed-out work should be marked unless the candidate has replaced it with an alternative response.
3Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
4 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
Centre Number Candidate Number
Write your name hereSurname Other names
Total Marks
Paper Reference
Turn over
*S53445A0121*S53445A©2016 Pearson Education Ltd.
1/1
You must have:Booklet containing pseudo commands
1CP1/02Specimen PaperTime: 2 hours
Computer SciencePaper 2: Application of Computational Thinking
Pearson Edexcel Level 1/Level 2 GCSE
Instructions
• Use black ink or ball-point pen.• Fill in the boxes at the top of this page with your name, centre number and candidate number.• Answer all questions.• Answer the questions in the spaces provided
– there may be more space than you need.• You are not allowed to use a calculator.
Information
• The total mark for this paper is 80. • The marks for each question are shown in brackets
– use this as a guide as to how much time to spend on each question.
Advice
• Read each question carefully before you start to answer it.• Try to answer every question.• Check your answers if you have time at the end.
5Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0221*2
Answer ALL questions. Write your answers in the spaces provided.
Scenario – The HappyPetBox Company
The HappyPetBox Company sells boxes for cats and dogs. The boxes contain healthy treats, toys, supplements, and grooming products.
The boxes are supplied monthly and are purchased online by subscription. The subscriptions are for one, three, six or 12 months.
There are four types of box: cat; and standard, medium and large for dogs.
1 Computer programs are used to store data and monitor efficiency.
(a) Identify two variables from the scenario that need to be created to store data for each subscription.
(2)
1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) Standard dog boxes contain 6 items. Medium dog boxes contain 9 items. Packers can pack 12 standard dog boxes in one hour.
Construct a general expression showing the number of medium dog boxes that can be packed in h hours.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0221*2
Answer ALL questions. Write your answers in the spaces provided.
Scenario – The HappyPetBox Company
The HappyPetBox Company sells boxes for cats and dogs. The boxes contain healthy treats, toys, supplements, and grooming products.
The boxes are supplied monthly and are purchased online by subscription. The subscriptions are for one, three, six or 12 months.
There are four types of box: cat; and standard, medium and large for dogs.
1 Computer programs are used to store data and monitor efficiency.
(a) Identify two variables from the scenario that need to be created to store data for each subscription.
(2)
1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) Standard dog boxes contain 6 items. Medium dog boxes contain 9 items. Packers can pack 12 standard dog boxes in one hour.
Construct a general expression showing the number of medium dog boxes that can be packed in h hours.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
*S53445A0321* Turn over
3
(c) A computer program can be used to help plan the processing of orders for the boxes.
Complete the table to identify the process required at each stage in the packing system. Stage 1 repeats for each box to be processed in one day.
(3)
Stage Input Process Output
1 Box type Total of each box type to be packed
2
Number of standard, medium, and large dog boxes needed today
Number of packers required today
3 Number of packers available
Message – spare capacity / more packers required
(Total for Question 1 = 7 marks)
7Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0421*4
2 The HappyPetBox Company offers discounts based on the type of box ordered and the length of the subscription selected.
(a) Complete the table to show the output of the discount algorithm, based on the given inputs.
(3)
InputDiscount
subscriptionLen boxType
12 Standard
6 Large
1 Medium
(b) The algorithm needs to be tested thoroughly.
Complete the table to show boundary test data to meet the requirements.(3)
RequirementsInput
subscriptionLen boxType
A condition generating a bronze star discount
Smallest subscription qualifying for a gold star discount
Largest subscription qualifying for no discount
(Total for Question 2 = 6 marks)
8 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0421*4
2 The HappyPetBox Company offers discounts based on the type of box ordered and the length of the subscription selected.
(a) Complete the table to show the output of the discount algorithm, based on the given inputs.
(3)
InputDiscount
subscriptionLen boxType
12 Standard
6 Large
1 Medium
(b) The algorithm needs to be tested thoroughly.
Complete the table to show boundary test data to meet the requirements.(3)
RequirementsInput
subscriptionLen boxType
A condition generating a bronze star discount
Smallest subscription qualifying for a gold star discount
Largest subscription qualifying for no discount
(Total for Question 2 = 6 marks)
*S53445A0521* Turn over
5
BLANK PAGE
9Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0621*6
3 A computer programmer uses a programming language to write a stock control program for The HappyPetBox Company.
(a) State two benefits to the programmer of using subprograms within a program.(2)
1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) Here is a pseudo-code algorithm that identifies which product has the fewest sales in the month.
(i) Complete the table to identify line numbers for each feature of the program.(4)
Program feature Line number(s)
Indentation
Iteration
Comments
Data structure
10 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0621*6
3 A computer programmer uses a programming language to write a stock control program for The HappyPetBox Company.
(a) State two benefits to the programmer of using subprograms within a program.(2)
1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) Here is a pseudo-code algorithm that identifies which product has the fewest sales in the month.
(i) Complete the table to identify line numbers for each feature of the program.(4)
Program feature Line number(s)
Indentation
Iteration
Comments
Data structure
*S53445A0721* Turn over
7
(ii) Complete the trace table to show the execution of the pseudo-code. You may not need to fill in all the rows in the table.
(5)
count sales[count] lowest boxID
(Total for Question 3 = 11 marks)
11Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0821*8
4 The HappyPetBox Company issues money off vouchers as part of its sales strategy.
(a) An error at line 12 was discovered during testing of the sales program.
SET totalDue TO totalCost + voucherValue
Explain this type of error.(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) The pseudo-code for part of the sales program is shown.
(i) Identify the error in the voucher subroutine that would prevent compilation and give a new line of code that will correct the error.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
12 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A0821*8
4 The HappyPetBox Company issues money off vouchers as part of its sales strategy.
(a) An error at line 12 was discovered during testing of the sales program.
SET totalDue TO totalCost + voucherValue
Explain this type of error.(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(b) The pseudo-code for part of the sales program is shown.
(i) Identify the error in the voucher subroutine that would prevent compilation and give a new line of code that will correct the error.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
*S53445A0921* Turn over
9
(ii) Describe the purpose of the pseudo-code on line 5.(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(c) Complete the table to give the appropriate data type of a variable to store each item.
(4)
Item Data type
Whether a customer has a sales voucher
The length of a subscription (months)
Total order value (£0.00)
Box type required (C, SD, M or L)
(d) Each HappyPetBox Company box must contain a suitable treat for the pet.
Data about each treat and the supplier of each treat are stored in tables. The key field for each table is shown in bold.
Complete the diagram to show:
• a foreign key in the blank cell of tbl_TREATS
• the relationship between the tables
• a one to many relationship.(3)
tbl_TREATS tbl_SUPPLIERS
TreatNumber SupplierRef
Description Address
BoxType Email
Telephone
(Total for Question 4 = 13 marks)
13Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01021*10
BLANK PAGE
14 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01021*10
BLANK PAGE
*S53445A01121* Turn over
11
5 The accounts department at the HappyPetBox Company processes sales, subscriptions, and invoices.
The accounts office has a list of paid invoices, but they are all jumbled up. A bubble sort can be used to sort the list of paid invoice numbers.
The pseudo-code for the sort algorithm is shown.
(a) Explain an improvement that could be made to the algorithm to increase the efficiency of the sort.
(3)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
15Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01221*12
(b) The HappyPetBox Company has discovered a quantity of broken printed circuit boards in its warehouse.
Explain how the printed circuit boards should be disposed of to reduce the environmental impact.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(c) Staff using computer displays need a break every 90 minutes. The company has decided to add a timing system to the sales program to help staff monitor their use of the computer displays.
The pseudo-code for an algorithm to monitor working time is shown. The function timeNow () returns the current time.
16 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01221*12
(b) The HappyPetBox Company has discovered a quantity of broken printed circuit boards in its warehouse.
Explain how the printed circuit boards should be disposed of to reduce the environmental impact.
(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(c) Staff using computer displays need a break every 90 minutes. The company has decided to add a timing system to the sales program to help staff monitor their use of the computer displays.
The pseudo-code for an algorithm to monitor working time is shown. The function timeNow () returns the current time.
*S53445A01321* Turn over
13
(i) Explain why the selection statement at line 12 will not function as intended.(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(ii) Describe the effect of executing line 14.(2)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(d) The HappyPetBox Company’s website uses cookies to improve the browsing experience. A cookie is a small file that a website puts on your hard disc. The file enables the website to identify you the next time you visit.
Identify two reasons why many visitors to the website decide not to allow the site to use cookies.
(2)
1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(Total for Question 5 = 11 marks)
17Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01421*14
6 The HappyPetBox Company uses a software application to calculate staff wages and produce payslips. Sample input data for this system is shown.
National insurance (NI) number Standard format LL123456L
Full time
Y or N
Full-time = minimum of 40 hours per week
Part-time = maximum of 20 hours per week
Hours worked
Integer
Hours worked in current week
Maximum of 10 hours overtime in one week for full-time only
Pay rateReal
Hourly pay rate
(a) The input data needs to be validated.
(i) Complete the validation rules in the pseudo-code.
Write your answers in the boxes provided.(6)
(ii) Create a suitable ‘error message’ to explain one of your validation rules to the user.
(1)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
18 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01421*14
6 The HappyPetBox Company uses a software application to calculate staff wages and produce payslips. Sample input data for this system is shown.
National insurance (NI) number Standard format LL123456L
Full time
Y or N
Full-time = minimum of 40 hours per week
Part-time = maximum of 20 hours per week
Hours worked
Integer
Hours worked in current week
Maximum of 10 hours overtime in one week for full-time only
Pay rateReal
Hourly pay rate
(a) The input data needs to be validated.
(i) Complete the validation rules in the pseudo-code.
Write your answers in the boxes provided.(6)
(ii) Create a suitable ‘error message’ to explain one of your validation rules to the user.
(1)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
*S53445A01521* Turn over
15
(b) Create a written description of a function for the wages system. The function should receive hours worked and pay rate from the main program and return total pay due. Overtime rate is 1.5 x pay rate.
Do not use pseudo-code, program code, or a flowchart.(4)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
(Total for Question 6 = 11 marks)
19Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01621*16
7 (a) The sales staff want to encourage customers to renew their subscriptions.
One month before a subscription expires, the sales team sends the customer an email invitation to renew his or her subscription.
If the subscription is not renewed within 3 months after its expiry, the sales team sends the customer an email with a voucher as an incentive to renew.
If the subscription is not renewed within 6 months after its expiry, the customer record is marked as lapsed.
A function called monthDifference () returns the number of months between the current month and the expiry month, even if it crosses the start of a new year.
The function is shown in the flowchart as monthDifference
20 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01621*16
7 (a) The sales staff want to encourage customers to renew their subscriptions.
One month before a subscription expires, the sales team sends the customer an email invitation to renew his or her subscription.
If the subscription is not renewed within 3 months after its expiry, the sales team sends the customer an email with a voucher as an incentive to renew.
If the subscription is not renewed within 6 months after its expiry, the customer record is marked as lapsed.
A function called monthDifference () returns the number of months between the current month and the expiry month, even if it crosses the start of a new year.
The function is shown in the flowchart as monthDifference
*S53445A01721* Turn over
17
Complete the flow chart to show this process. (6)
Start
monthDi�erence
Di�erence=
–1?
Email voucher
Yes
Yes
No
No
21Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01821*18
(b) The HappyPetBox Company wants to reward loyal customers.
When customers have ordered at least 24 boxes, of any size combination, they receive a loyalty card that gives them a discount when buying products from partner companies.
Customer details are stored in a file. Each customer has a record. Part of the customer file is shown.
Customer Standard Medium Large Card
836154JSA 7 1 3 N
579317NOY 12 15 0 Y
958375MEB 0 0 48 Y
294713PUC 1 0 2 N
Each month the HappyPetBox Company processes the file to see if any more customers qualify for a loyalty card. If a customer is sent a loyalty card, the costumer’s record needs to be updated.
22 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A01821*18
(b) The HappyPetBox Company wants to reward loyal customers.
When customers have ordered at least 24 boxes, of any size combination, they receive a loyalty card that gives them a discount when buying products from partner companies.
Customer details are stored in a file. Each customer has a record. Part of the customer file is shown.
Customer Standard Medium Large Card
836154JSA 7 1 3 N
579317NOY 12 15 0 Y
958375MEB 0 0 48 Y
294713PUC 1 0 2 N
Each month the HappyPetBox Company processes the file to see if any more customers qualify for a loyalty card. If a customer is sent a loyalty card, the costumer’s record needs to be updated.
*S53445A01921* Turn over
19
Construct a flowchart to show the process of determining qualifying for a loyalty card.
(6)
(Total for Question 7 = 12 marks)
23Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A02021*20
8 The HappyPetBox Company needs a program to validate customer identifiers. Valid customer identifiers are 9 characters long, ending with 3 uppercase letters.
Here are 4 examples of valid customer identifiers.
• 836154JSA • 579317NOY • 958375MEB • 294713PUC
Write an algorithm that will:
• Take a potential customer identifier from the user.
• If input is “Q”, then allow user to quit the program.
• If the potential customer identifier is too short, then tell the user.
• If the last 3 characters do not follow the rules, then tell the user.
• Allow the user to keep entering customer identifiers.
A sample output is shown.
Write an algorithm to meet the requirements.
Use pseudo-code or a programming language with which you are familiar.(9)
24 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
*S53445A02021*20
8 The HappyPetBox Company needs a program to validate customer identifiers. Valid customer identifiers are 9 characters long, ending with 3 uppercase letters.
Here are 4 examples of valid customer identifiers.
• 836154JSA • 579317NOY • 958375MEB • 294713PUC
Write an algorithm that will:
• Take a potential customer identifier from the user.
• If input is “Q”, then allow user to quit the program.
• If the potential customer identifier is too short, then tell the user.
• If the last 3 characters do not follow the rules, then tell the user.
• Allow the user to keep entering customer identifiers.
A sample output is shown.
Write an algorithm to meet the requirements.
Use pseudo-code or a programming language with which you are familiar.(9)
*S53445A02121*21
(Total for Question 8 = 9 marks)
TOTAL FOR PAPER = 80 MARKS
25Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
26 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
1
P
aper
2 M
ark
Sch
eme
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
1(a
) bo
xTyp
e (1
)
subs
crip
tionD
urat
ion
(1)
Acc
ept o
ther
var
iabl
es
appr
opria
te to
the
scen
ario
. 2
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
1(b
) Ite
ms
per h
our:
12
stan
dard
box
es p
er h
our x
6 it
ems
per s
tand
ard
box
= 72
ite
ms
per h
our.
M
ediu
m b
oxes
per
hou
r: 72
item
s pe
r hou
r ÷ 9
item
s pe
r med
ium
box
= 8
m
ediu
m b
oxes
per
hou
r.
Num
ber o
f med
ium
box
es in
som
e nu
mbe
r of h
ours
= 8
x h
1 m
ark
for d
eriv
ing
the
cons
tant
8, i
n an
y fo
rm.
1 m
ark
for g
ener
alis
ing
by m
ultip
licat
ion
with
h.
Uni
ts a
re n
ot re
quire
d.
8h
= 2
mar
ks.
2
27Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
2
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
1(c
) O
ne m
ark
for e
ach
corre
ct p
roce
ss:
Stag
e In
put
Proc
ess
Out
put
1 B
ox ty
pe
Incr
emen
t num
ber o
f box
ty
pe o
rder
ed
Tota
l of e
ach
box
type
to
be p
acke
d
2 N
umbe
r of s
tand
ard,
m
ediu
m a
nd la
rge
dog
boxe
s ne
eded
toda
y
Cal
cula
te to
tal p
acki
ng
time
/ num
ber o
f pac
kers
ne
eded
Num
ber o
f pac
kers
re
quire
d to
day
3 N
umbe
r of p
acke
rs
avai
labl
e C
ompa
re o
utpu
t (2)
with
in
put (
3)
Mes
sage
- sp
are
capa
city
/ m
ore
pack
ers
requ
ired
3
28 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
3
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
2(a
)
Inpu
t D
isco
unt
subs
crip
tionL
en
boxT
ype
12
Stan
dard
R
egul
ar p
ricin
g / n
one
(1)
6 La
rge
Silv
er s
tar (
1)
1 M
ediu
m
Reg
ular
pric
ing
/ non
e (1
)
3
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
2(b
) O
ne m
ark
for e
ach
corre
ct ro
w:
Req
uire
men
ts
Inpu
t su
bscr
iptio
nLe
n bo
xTyp
e
A co
nditi
on g
ener
atin
g a
bro
nze
star
di
scou
nt
3 / 5
M
ediu
m
Sm
alle
st s
ubsc
riptio
n qu
alify
ing
for a
gol
d st
ar d
isco
unt
12
Med
ium
Larg
est s
ubsc
riptio
n qu
alify
ing
for n
o di
scou
nt
5 St
anda
rd
Que
stio
n as
ks fo
r bo
unda
ry c
ondi
tions
on
ly.
3
29Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
4
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
3 (
a)
Any
two
from
: A
llow
s de
com
posi
tion
of a
com
plex
task
into
sim
pler
ste
ps. (
1)
Red
uces
dup
licat
ion
of c
ode
with
in a
pro
gram
/ w
ritte
n on
ce, u
sed
seve
ral
times
. (1)
E
nabl
e re
use
of c
ode
acro
ss m
ultip
le p
rogr
ams.
(1)
Impr
ovin
g er
ror t
raci
ng /
isol
ates
erro
rs. (
1)
2
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
3(b
)(i)
Prog
ram
feat
ure
Line
num
ber(
s)
Inde
ntat
ion
14 -
17 /
14 (1
) Ite
ratio
n 13
- 18
/ 13
(1)
Com
men
ts
2 / 3
/ 4
(1)
Dat
a st
ruct
ure
7 / 1
4 / 1
5 (1
)
4
30 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
5
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
3(b
)(ii)
O
ne m
ark
for e
ach
corre
ct ro
w s
how
ing
varia
ble
chan
ge.
coun
t sa
les[
coun
t] lo
wes
t bo
xID
0
10
0 0
55
55
1 65
2
40
40
2 3
45
La
yout
util
isin
g ad
ditio
nal r
ows
acce
pted
.
5
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
4(a
) Th
is is
a lo
gica
l erro
r (1)
bec
ause
the
wro
ng a
rithm
etic
ope
rato
r / +
inst
ead
of –
ha
s be
en u
sed.
(1)
2
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
4(b
)(i)
M
issi
ng re
turn
sta
tem
ent.
(1)
Line
17
shou
ld re
ad R
ETU
RN
dis
coun
tVal
ue. (
1)
2
31Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
6
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
4(b
)(ii)
C
ombi
nes
a st
ring
(1) w
ith a
n in
tege
r / re
al (1
) to
mak
e a
strin
g fo
r out
put
2
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
4(c
) B
oole
an (1
) In
tege
r (1)
R
eal (
1)
Stri
ng (1
)
4
32 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
7
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
4(d
)
tbl_
TRE
ATS
tb
l_S
UP
PLIE
RS
Trea
tNum
ber
1 Su
pplie
rRef
D
escr
iptio
n
Add
ress
B
oxTy
pe
M
Em
ail
Sup
plie
rRef
(1)
Te
leph
one
Cor
rect
fiel
d. (1
) Cor
rect
link
. (1)
Cor
rect
rela
tions
hip.
(1)
M
= m
any
or
appr
opria
te
sym
bol
3
33Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
8
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
5(a
) A
loca
l var
iabl
e / f
lag
coul
d be
use
d to
con
trol t
he s
ort.
(1)
The
flag
coul
d be
set
to z
ero
in th
e in
ner l
oop
whe
n no
sw
aps
are
mad
e. (1
) Th
e fla
g co
uld
then
be
used
in th
e ou
ter l
oop
to s
top
the
sort
and
end
the
proc
edur
e. (1
)
3
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
5(b
) C
ircui
t boa
rds
need
to b
e re
cycl
ed (1
) to
recl
aim
pre
ciou
s m
etal
s / a
void
po
tent
ial t
oxic
con
tam
inat
ion
from
land
fill.
(1)
2
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
5(c
)(i)
Th
e va
riabl
e tim
eEla
psed
is n
ot a
cces
sibl
e in
line
12
beca
use:
it
is a
loca
l var
iabl
e in
the
timeW
orki
ng fu
nctio
n (1
) and
it
has
not b
een
decl
ared
in th
e m
ain
prog
ram
. (1)
2
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
5(c
)(ii)
Th
e lin
e w
ill st
op th
e pr
ogra
m a
nd w
ait f
or u
ser i
nput
. (1)
Th
e us
er w
ill ha
ve to
ack
now
ledg
e th
e ad
vice
pro
vide
d. (1
)
2
34 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
9
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
5(d
) P
rivac
y co
ncer
ns a
risin
g fro
m tr
acki
ng In
tern
et u
se. (
1)
Sec
urity
con
cern
s re
latin
g to
mis
use
of c
olle
cted
dat
a. (1
)
2
35Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
10
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
6(a
)(i)
6
36 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
11
Q
uest
ion
Num
ber
Ans
wer
Add
ition
al
Gui
danc
e M
ark
6(a
)(ii)
N
I num
ber /
ent
ry m
ust b
e 9
char
acte
rs lo
ng. (
1)
Hou
rs w
orke
d / i
nput
val
ue m
ust b
e be
twee
n 1
and
50. (
1)
Hou
rs w
orke
d fo
r par
t-tim
e st
aff m
ust b
e be
twee
n 1
and
20. (
1)
1
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
6(b
) C
heck
if o
verti
me
wor
ked
/ hou
rs w
orke
d >
40. (
1)
If no
ove
rtim
e, th
en c
alcu
late
tota
l / to
tal =
hou
rs *
rate
. (1)
If
over
time
wor
ked,
then
cal
cula
te o
verti
me
pay
as (h
ours
– 4
0) *
(rat
e *
1.5)
(1)
Add
wee
kly
pay
+(40
*1.
5). (
1)
4
37Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
12
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
7(a
) A
com
plet
ed fl
ow c
hart
that
incl
udes
:
S
uita
ble
proc
ess
nam
ed a
fter f
irst d
ecis
ion
(Em
ail i
nvita
tion)
. (1)
Cor
rect
dia
mon
d sy
mbo
l for
sec
ond
deci
sion
. (1)
Cor
rect
‘Yes
’ and
‘No’
labe
ls o
n ar
row
s fro
m s
econ
d de
cisi
on. (
1)
C
orre
ct te
st (D
iffer
ence
= 6
?) in
last
dec
isio
n bo
x. (1
)
Cor
rect
pro
cess
des
crip
tion
(Mar
k el
apse
d) in
third
pro
cess
box
. (1)
Cor
rect
wor
d (e
nd, s
top,
fini
sh) i
n te
rmin
ator
sym
bol.
(1)
6
38 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
13
39Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
14
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
7(b
)
Th
ere
are
a m
axim
um o
f 3
mar
ks fo
r fun
ctio
nalit
y.
Ther
e ar
e a
max
imum
of 3
m
arks
for a
ccur
acy
of
nota
tion.
Th
e m
arks
for f
unct
iona
lity
and
accu
racy
are
aw
arde
d in
depe
nden
tly.
The
subp
rogr
am s
ymbo
l use
is
aw
arda
ble.
A
ny d
isce
rnib
le id
entif
ier f
or
reco
rd fi
elds
(Car
d, S
tand
ard,
M
ediu
m) u
sed
cons
iste
ntly,
is
awar
dabl
e.
Ther
e ar
e m
any
diffe
rent
so
lutio
ns.
Indi
cativ
e co
nten
t: H
andl
ing
end
of fi
le, c
heck
ing
if cu
stom
er a
lread
y ha
s a
card
, ad
ding
up
the
coun
t of b
oxes
, te
stin
g of
>=
24, u
pdat
ing
field
s in
reco
rd, r
ewrit
ing
upda
ted
reco
rd.
6
40 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
15
Asp
ect
of
Sol
uti
on
Mar
ks
0
1
2
3
Fun
ctio
nal
ity
No
rew
arda
ble
cont
ent.
Th
ere
are
sign
ifica
nt
erro
rs in
logi
c, le
adin
g to
an
over
all s
olut
ion
that
is n
on-f
unct
iona
l.
Ther
e ar
e m
inor
er
rors
in lo
gic,
lead
ing
to a
n ov
eral
l sol
utio
n th
at is
not
com
plet
ely
func
tion
al.
Ther
e ar
e no
err
ors
in
logi
c, le
adin
g to
an
over
all s
olut
ion
that
is
ful
ly fun
ctio
nal.
Acc
ura
cy o
f n
otat
ion
N
o re
war
dabl
e co
nten
t.
Not
atio
n fo
llow
s a
broa
dly
unre
cogn
isab
le
conv
ention
tha
t is
ap
plie
d in
cons
iste
ntly
, al
thou
gh a
spec
ts o
f it
are
disc
erni
ble.
Not
atio
n fo
llow
s a
reco
gnis
able
co
nven
tion
whi
ch is
br
oadl
y di
scer
nibl
e bu
t is
app
lied
inco
nsis
tent
ly.
Not
atio
n fo
llow
s a
reco
gnis
able
co
nven
tion
and
is
appl
ied
cons
iste
ntly
th
roug
hout
.
41Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
16
Que
stio
n N
umbe
r Ans
wer
Add
ition
al
Gui
danc
e M
ark
8
Indi
cativ
e co
nten
t:
Taki
ng s
tring
inpu
t fro
m u
ser.
Lo
op c
ontro
l, al
low
ing
user
to e
xit (
whi
le, r
epea
t).
Le
ngth
che
ck o
n in
put;
appr
opria
te e
rror m
essa
ge.
Is
olat
ion
of la
st 3
cha
ract
ers
(inde
, spl
ittin
g, s
licin
g).
C
heck
ing
of 3
cha
ract
ers
to b
e up
per c
ase
(“A”>
=x<=
”Z”,
mem
bers
hip
of
a us
er-m
ade
list “
AB
C…
Z”.
A
ppro
pria
te m
essa
ge w
hen
char
acte
rs a
re v
alid
. E
xam
ples
:
Che
ckin
g fo
r alp
habe
tic is
not
su
ffici
ent,
due
to lo
wer
cas
e
9
42 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
17
43Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
18
44 Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016
19
A
spec
t of S
olut
ion
Mar
ks
0 1
2 3
Func
tiona
lity
No
awar
dabl
e co
nten
t. Th
ere
are
sign
ifica
nt
erro
rs in
logi
c, le
adin
g to
an
over
all s
olut
ion
that
is n
on-fu
nctio
nal.
Ther
e ar
e m
inor
erro
rs
in lo
gic,
lead
ing
to a
n ov
eral
l sol
utio
n th
at is
no
t com
plet
ely
func
tiona
l.
Ther
e ar
e no
erro
rs in
lo
gic,
lead
ing
to a
n ov
eral
l sol
utio
n th
at is
fu
lly fu
nctio
nal.
Acc
urac
y of
Not
atio
n N
o aw
arda
ble
cont
ent.
Not
atio
n fo
llow
s a
broa
dly
unre
cogn
isab
le
conv
entio
n th
at is
ap
plie
d in
cons
iste
ntly,
al
thou
gh a
spec
ts o
f it
are
disc
erni
ble.
Not
atio
n fo
llow
s a
reco
gnis
able
co
nven
tion
whi
ch is
br
oadl
y di
scer
nibl
e bu
t is
app
lied
inco
nsis
tent
ly.
Not
atio
n fo
llow
s a
reco
gnis
able
co
nven
tion
and
is
appl
ied
cons
iste
ntly
th
roug
hout
.
Effic
ienc
y,
App
ropr
iate
ness
, and
A
ccur
acy
of S
olut
ion
No
awar
dabl
e co
nten
t. Th
ere
are
sign
ifica
nt
erro
rs in
the
sele
ctio
n an
d ac
cura
te u
se o
f ap
prop
riate
tech
niqu
es.
Tech
niqu
es h
ave
been
se
lect
ed a
nd u
sed
with
so
me
accu
racy
, al
thou
gh th
e te
chni
ques
m
ay n
ot b
e th
e m
ost
appr
opria
te.
Tech
niqu
es h
ave
been
se
lect
ed a
nd u
sed
accu
rate
ly a
nd
appr
opria
tely
th
roug
hout
to
dem
onst
rate
an
effic
ient
so
lutio
n.
45Pearson Edexcel Level 1/Level 2 GCSE (9–1) in Computer Science – Specimen Paper Pearson Education Limited 2016