Question Paper Computer Systems
Question Paper Computer Systems
• an HB pencil
Do not use:
• a calculator
* H 4 4 6 0 1 *
First name(s)
Last name
INSTRUCTIONS
• Use black ink. You can use an HB pencil, but only for graphs and diagrams.
• Write your answer to each question in the space provided. If you need extra space use
the lined pages at the end of this booklet. The question numbers must be clearly shown.
• Answer all the questions.
INFORMATION
• The total mark for this paper is 140.
• The marks for each question are shown in brackets [ ].
• Quality of extended response will be assessed in questions marked with an asterisk (*).
• This document has 32 pages.
ADVICE
• Read each question carefully before you start your answer.
© OCR 2022
3
Answer all questions.
1 A charity uses a desktop computer to record financial donations that it receives. The computer
contains a single core, 2.4GHz processor with 2MB cache.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(ii) Give one way that the Harvard architecture differs from the Von Neumann architecture.
...........................................................................................................................................
...................................................................................................................................... [1]
(b) The charity is concerned that the performance of the computer is not sufficient and wishes to
replace the processor.
Give two features of a replacement processor that would increase the typical performance of
the computer.
1 ................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
[2]
start INP
STA donation
SUB hundred
BRP bonus
nobonus LDA total
ADD donation
STA total
OUT
BRA start
bonus LDA total
ADD donation
ADD twenty
STA total
OUT
BRA start
hundred DAT 100
twenty DAT 20
donation DAT 0
total DAT 0
Fig. 1
(i) The program shown in Fig. 1 is run once using three different inputs. Therefore, while
the program is running once, it will output the updated total three times.
Give the total values that are output when the values 10, 50 and 120 are input into this
program.
© OCR 2022
5
(ii) Write LMC code that will reset the value of the memory location labelled total to zero
and then stop the program.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [4]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [3]
(iv) Explain one benefit to the charity of using a processor that allows pipelining.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(i) Describe how the accumulator is used during the Fetch-Decode-Execute cycle.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(ii) Describe how the program counter is used during the Fetch-Decode-Execute cycle.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(iii) State the name of three other registers that are used during the Fetch-Decode-Execute
cycle.
1 ........................................................................................................................................
...........................................................................................................................................
2 ........................................................................................................................................
...........................................................................................................................................
3 ........................................................................................................................................
...........................................................................................................................................
[3]
© OCR 2022
7
(e)* The charity has several desktop computers in their office that use a CISC processor. They
are considering buying mobile devices for their staff to use when they are not in the office.
Discuss whether these mobile devices should use the same CISC processors that are used
in their desktop computers or if they should use a RISC processor instead.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© OCR 2022
9
BLANK PAGE
Membership contains data about current memberships that customers hold and package
contains data about different streaming packages available.
Fig. 2
...........................................................................................................................................
...................................................................................................................................... [1]
(ii) Identify the foreign key used in the database and the table name where this is a foreign
key.
...........................................................................................................................................
...........................................................................................................................................
[2]
...........................................................................................................................................
...................................................................................................................................... [1]
© OCR 2022
11
(iv) Give the name of the field that could be stored using a Boolean data type.
...........................................................................................................................................
...................................................................................................................................... [1]
(b) The Adverts field indicates if customers will be shown adverts. true indicates that
customers will be shown adverts, and false indicates that adverts are not shown.
Write Structured Query Language (SQL) to return the Username and FirstName fields for
all customers who see adverts.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [5]
(i) Identify one method of capturing a new customer’s personal data, describing why this
method is suitable.
Method ..............................................................................................................................
...........................................................................................................................................
Suitability ...........................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
[3]
(ii) Sometimes the company may need to move or backup its data they hold about
customers.
1 ........................................................................................................................................
...........................................................................................................................................
2 ........................................................................................................................................
...........................................................................................................................................
[2]
(d) The database supports ACID transactions. ACID stands for Atomicity, Consistency, Isolation
and Durability.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(ii) Give one way that durability can be achieved for a completed transaction.
...........................................................................................................................................
...................................................................................................................................... [1]
© OCR 2022
13
(iii) Explain how record locking can be used to ensure that the ACID principle of isolation is
achieved when carrying out multiple transactions.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [3]
...........................................................................................................................................
...................................................................................................................................... [1]
(e) The Copyright Designs and Patents Act 1988 applies to all videos that are streamed.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [2]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [5]
© OCR 2022
15
(g) A program is written using an object-oriented programming paradigm and uses a class called
video to organise the videos that are streamed to customers.
• name
• number of views
• star rating.
The constructor method will set the name attribute to the name that is passed in as a
parameter. The constructor will also initially set the number of views to 0 and the star rating
to 3.
(i) Write program code or pseudocode to declare the class video and initialise the required
attributes as private.
You should include both the attribute definitions and the constructor method in your
answer.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [7]
Write program code or pseudocode for the method updateviews() to increase the
number of views by one.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
© OCR 2022
17
3 (a) (i) Convert the hexadecimal value B7E to a binary number.
...........................................................................................................................................
...................................................................................................................................... [1]
(ii) 110010101 is a binary number that is represented using sign and magnitude.
...........................................................................................................................................
...................................................................................................................................... [1]
(iii) Complete this binary subtraction. Both numbers are 8-bit integer values represented
using two’s complement.
Show the result in the same format and show your working.
0110 1101 –
0011 0100
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [3]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [4]
(c) Table 3 here shows floating point numbers that are stored using 6 bits for the mantissa and
3 bits for the exponent, both in two’s complement.
Tick (✓) one box in each row to state whether each number is normalised or not normalised.
Table 3
[4]
© OCR 2022
19
4* Amit is studying Computer Science at university. He has been asked to write an assignment on
Artificial Intelligence (AI).
Discuss the extent to which you think computer systems will inherit the biases and discrimination
of their programmers as the use of AI increases.
• the meaning of AI
• examples of when AI may be affected by bias
• the measures that can be taken to prevent people being affected by bias in AI. [9]
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
..........................................................................................................................................................
© OCR 2022
21
5 A programmer creates this function shown in Fig. 5 using a high-level language.
function mystery(x,y)
total = x + y
x = x – 10
y = y – 10
total = total + x + y
endwhile
return total
endfunction
Fig. 5
...........................................................................................................................................
...................................................................................................................................... [1]
...........................................................................................................................................
...................................................................................................................................... [1]
...........................................................................................................................................
...................................................................................................................................... [1]
...........................................................................................................................................
...................................................................................................................................... [1]
Difference 1 .......................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
Difference 2 .......................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
[4]
© OCR 2022
23
(c) For each statement shown in Table 5, tick (✓) one box in each row to indicate which stage of
compilation each action takes place at.
Table 5
[5]
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
.............................................................................................................................................. [2]
The asc() function takes in a character and returns its ASCII value. For example asc("A")
returns 65. Capital letters have ASCII values between 65 and 90 inclusive.
function countCapitals(text)
// initialise counter to 0
capCount = 0
for x = 0 to text.length-1
c = text.subString(x, 1)
…………………………………………………………………………
endif
next x
……………………………………………………………………
endfunction
[3]
...........................................................................................................................................
...................................................................................................................................... [1]
Difference 1 .......................................................................................................................
...........................................................................................................................................
Difference 2 .......................................................................................................................
...........................................................................................................................................
[2]
© OCR 2022
25
(f)* The programmer has been asked by a client to create a complex computer program. Compare
the spiral model and waterfall lifecycle methodologies for this task.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
© OCR 2022
27
6 Anika’s computer runs a multi-tasking operating system. She has access to a printer and a
broadband internet connection through a wireless connection. The operating system uses
scheduling algorithms such as first come first served and round-robin.
(a) (i) Explain why the computer’s operating system uses a first come first served algorithm
when sending documents to the printer.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(ii) Explain why the computer’s operating system uses a round-robin algorithm for allocating
processor time.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [3]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
(i) Explain what happens at the application layer of the TCP/IP stack when using this
program.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [5]
(ii) Explain what happens at the link layer (sometimes referred to as the “network interface
layer”, “network access layer” or simply the “network layer”) of the TCP/IP stack when
using this program.
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...................................................................................................................................... [2]
© OCR 2022
29
ADDITIONAL ANSWER SPACE
If additional space is required, you should use the following lined page(s). The question number(s)
must be clearly shown in the margin(s).
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
© OCR 2022
30
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
© OCR 2022
31
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
© OCR 2022
32
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
..................................................................................................................................................................
© OCR 2022
GCE
Computer Science
A Level
It is also responsible for developing new specifications to meet national requirements and the
needs of students and teachers. OCR is a not-for-profit organisation; any surplus made is
invested back into the establishment to help towards the development of qualifications and
support, which keep pace with the changing needs of today’s society.
This mark scheme is published as an aid to teachers and students, to indicate the requirements
of the examination. It shows the basis on which marks were awarded by examiners. It does not
indicate the details of the discussions which took place at an examiners’ meeting before marking
commenced.
All examiners are instructed that alternative correct answers and unexpected approaches in
candidates’ scripts must be given marks that fairly reflect the relevant knowledge and skills
demonstrated.
Mark schemes should be read in conjunction with the published question papers and the report
on the examination.
© OCR 2022
MARKING INSTRUCTIONS
PREPARATION FOR MARKING
SCORIS
1. Make sure that you have accessed and completed the relevant training packages for on-screen marking: RM assessor Online Training; OCR
Essential Guide to Marking.
2. Make sure that you have read and understood the mark scheme and the question paper for this unit. These are posted on the RM Cambridge
Assessment Support Portal http://www.rm.com/support/ca
3. Log-in to RM Assessor and mark the required number of practice responses (“scripts”) and the number of required standardisation responses.
YOU MUST MARK 5 PRACTICE AND 10 STANDARDISATION RESPONSES BEFORE YOU CAN BE APPROVED TO MARK LIVE SCRIPTS.
MARKING
3. The schedule of dates is very important. It is essential that you meet the 50% and 100% deadlines. If you experience problems, you must contact
your Team Leader (Supervisor) without delay.
1. If you are in any doubt about applying the mark scheme, consult your Team Leader by telephone or the RM messaging system, or by email.
Contradictory Responses
H446/01 Mark Scheme June 2022
When a candidate provides contradictory responses, then no mark should be awarded, even if one of the answers is correct.
Short Answer Questions (requiring only a list by way of a response, usually worth only one mark per response)
Where candidates are required to provide a set number of short answer responses then only the set number of responses should be marked. The
response space should be marked from left to right on each line and then line by line until the required number of responses have been considered. The
remaining responses should not then be marked. Examiners will have to apply judgement as to whether a ‘second response’ on a line is a development
of the ‘first response’, rather than a separate, discrete response. (The underlying assumption is that the candidate is attempting to hedge their bets and
therefore getting undue benefit rather than engaging with the question and giving the most relevant/correct responses.)
Short Answer Questions (requiring a more developed response, worth two or more marks)
If the candidates are required to provide a description of, say, three items or factors and four items or factors are provided, then mark on a similar basis
– that is downwards (as it is unlikely in this situation that a candidate will provide more than one response in each section of the response space.)
3. Always check the pages (and additional objects if present) at the end of the response in case any answers have been continued there. If the candidate
has continued an answer there then add a tick to confirm that the work has been seen.
• anything is written in the answer space and is not worthy of credit (this includes text and symbols).
Team Leaders must confirm the correct use of the NR button with their markers before live marking commences and should check this when
reviewing scripts.
8. The RM comments box is used by your team leader to explain the marking of the practice responses. Please refer to these comments when
checking your practice responses. Do not use the comments box for any other reason.
If you have any questions or comments for your team leader, use the phone, the RM messaging system, or e-mail.
9. Assistant Examiners will send a brief report on the performance of candidates to their Team Leader (Supervisor) via email by the end of the marking
period. The report should contain notes on particular strengths displayed as well as common errors or weaknesses. Constructive criticism of the
question paper/mark scheme is also appreciated.
H446/01 Mark Scheme June 2022
On the borderline of this level and the one below At bottom of level
Above bottom and either below middle or at middle of level (depending on number of marks
Just enough achievement on balance for this level
available)
Meets the criteria but with some slight Above middle and either below top of level or at middle of level (depending on number of marks
inconsistency available)
Consistently meets the criteria for this level At top of level
H446/01 Mark Scheme June 2022
Annotation Meaning
Omission mark
Incorrect point
Expansion of a point
Follow through
Repeat
Correct point
Too vague
H446/01 Mark Scheme June 2022
Zero (big)
Blank Page – this annotation must be used on all blank pages
within an answer booklet (structured or unstructured) and on
each page of an additional object where there is no candidate
response.
Level 1
Level 2
Level 3
11.
H446/01 Mark Scheme June 2022
Example 2
LDA total
SUB total
STA total
HLT
BP1 can be given for any value being loaded into the
accumulator e.g. INP
(iii) ● Memory Address Register // MAR 3 Allow Memory Buffer Register for MDR
● Memory Data Register // MDR
● Current Instruction Register // CIR
● Index Register // IR
H446/01 Mark Scheme June 2022
(e) Mark Band 3–High Level (9-12 marks) 12 AO1
The candidate demonstrates a thorough knowledge and CISC is a complex instruction set. The traditional
understanding of both CISC and RISC. The material is AO1.1 approach to processor design. Lots of instructions
generally accurate and detailed. (2), available although some instructions in CISC will rarely
AO1.2
(2), get used.
The candidate is able to apply their knowledge and AO2.1 RISC is a reduced instruction set. A smaller number of
understanding directly and consistently to the context (3), instructions available, several instructions can be
provided. Evidence/examples will be explicitly relevant AO3.3. combined to perform the same tasks as CISC
(5)
to the explanation. processors. RISC instructions are used regularly.
RISC has fewer transistors/less complex circuitry
The candidate provides a thorough discussion which is whereas CISC integrated circuits are more
well balanced. Evaluative comments are consistently expensive/complicated. RISC instructions take one
relevant and well-considered. cycle whereas CISC may take several. RISC can only
do complex things by combining multiple instructions
There is a well-developed line of reasoning which is whereas CISC is done in one line. Compilers for RISC
clear and logically structured. The information presented need to be more complex than compilers for CISC
is relevant and substantiated.
0 marks
No attempt to answer the question or response is not
worthy of credit.
H446/01 Mark Scheme June 2022
(ii) e.g. 2
● CSV
● JSON
● XML
● SQL
● APIs
● EDI
● RSS
● SOAP
(d) (i) ● (Committed) data/transaction is not lost… 2
● …in case of power / system failure
(ii) ● Completed transactions stored in secondary storage 1
// data not stored long-term in RAM/cache
(iii) ● The outcome of concurrent transactions is the same 3 Allow reference to lost updates/dirty reads/phantom reads for
as if transactions were completed sequentially. BP3.
● Record locking allows one user/process to
access/modify record level data at any one time
● So data that is being used elsewhere cannot be
modified // data that is being modified elsewhere
cannot be used
(iii) 0011 1001 3 Working could include showing “borrowing” values from
● One mark for correct left hand nibble (CAO) other columns or making the second number negative
● One mark for correct right hand nibble (CAO) and adding.
● One mark for working clearly shown
Answer must be 8 bits to achieve full marks (stated in
question).
Binary number Normalised Not normalised Accept other marks that clearly indicate choice (e.g. X)
010101 100 x
110101 111 x
011010 010 x
101010 110 x
H446/01 Mark Scheme June 2022
0 marks
No attempt to answer the question or response is not
worthy of credit.
H446/01 Mark Scheme June 2022
(ii) ● 70 1 CAO
(b) (i) ● To convert (high-level or assembly) code to low level/machine code 1 Do not allow answers referring to making
the program executable, given in question.
(ii) ● Compiler translates code all at once/before it’s executed 4 Mark answers in pairs
● Interpreter translates code line by line / during runtime
Max 2 marks per answer space
● Compiler produces executable file for reuse // Doesn’t need to be
translated everytime it is run
● Interpreter needs to re-translate next time program is run
● Compiler lists all errors//Compiled code doesn’t run if there are any
errors
● Interpreter stops at the first error
Keywords are x
replaced with
tokens
Object code is x
created
Symbol table x
created for
variables
Builds an x
abstract
syntax tree
(iii) ● ASCII has fewer characters (128/256) // Unicode has more 2 Only mark the 1st answer for each
characters difference
● ASCII is 7/8 bits whereas Unicode can be larger 16/32 / can have
variable sized characters For BP2&3, must have both sides to get
● ASCII limited to Latin / English / European characters whereas the mark
Unicode can represent other symbols (e.g. Chinese/Cyrillic/Emojis)
H446/01 Mark Scheme June 2022
(f) Mark Band 3–High Level (7-9 marks) 9 AO1
The candidate demonstrates a thorough knowledge and understanding The spiral model has four quadrants
of both waterfall and the spiral model. The material is generally AO1.1 (determine objectives, identify and manage
accurate and detailed. (2), risk, develop and test, plan next iteration).
AO1.2
(2), Client feedback then informs future
The candidate is able to apply their knowledge and understanding AO2.1 development and prototypes which
directly and consistently to the context provided. Evidence/examples (2), feedback into future revisions. Waterfall
will be explicitly relevant to the explanation. AO3.3 has a structured
.
(3)
analysis/design/development/test flow.
The candidate provides a thorough discussion which is well balanced. Progress to the next step is not made until
Evaluative comments are consistently relevant and well-considered. the previous step is completed.
0 marks
No attempt to answer the question or response is not worthy of credit.
H446/01 Mark Scheme June 2022
H446/01 Mark Scheme June 2022
Question Answer Mark Guidance
6 (a) (i) ● For printer queue 2
● All documents/users have equal priority
● Whichever document is received first is printed first
● First in First Out / Last in Last Out
(ii) ● To enable multitasking to take place 3 BP4, 5 & 6 are dependent on BP3 only
● To switch between active processes and those
running in the background
● To limit each process to a certain amount of
time//allow processes an equal share of processor
time….
● …to ensure the OS cycles through all processes //
the process then goes to the back of the end of the
queue
● …so that users can receive an immediate response
● …to handle an interrupt immediately
(iii) ● Shortest job first / shortest remaining time 2 One mark for name, one mark for description.
● Process which has the shortest time (remaining) is
completed first
(b) (i) ● Protocol to be used is decided based on the 5 For BP2, don’t allow HTTP (question mentions
application encryption). Don’t allow a list of protocols which aren’t
● E.g. HTTPS for browser based service // relevant to the question. Don’t allow a protocol without
SMTP/IMAP for messaging service its use
● Adds encryption
● Passes on to transport layer to send
● Gets data from transport layer when receiving
● Unpacks message ready for display // removes
headers or other non-viewable data
● Decrypts message
H446/01 Mark Scheme June 2022
(ii) ● Receives (layered) data from internet layer to send 2 Wireless access given in question stem
● MAC addresses are added to the packet
● Passes and receives data across wireless network
(to WAN / other machine)
● Passes (layered) data back up to internet layer
when receiving
Need to get in touch?
If you ever have any questions about OCR qualifications or services (including administration, logistics and teaching) please feel free to get in
touch with our customer support centre.
Call us on
01223 553998
ocr.org.uk/qualifications/resource-finder
ocr.org.uk
Twitter/ocrexams
/ocrexams
/company/ocr
/ocrexams
OCR is part of Cambridge University Press & Assessment, a department of the University of Cambridge.
For staff training purposes and as part of our quality assurance programme your call may be recorded or monitored. © OCR
2022 Oxford Cambridge and RSA Examinations is a Company Limited by Guarantee. Registered in England. Registered office
The Triangle Building, Shaftesbury Road, Cambridge, CB2 8EA.
OCR operates academic and vocational qualifications regulated by Ofqual, Qualifications Wales and CCEA as listed in their
qualifications registers including A Levels, GCSEs, Cambridge Technicals and Cambridge Nationals.
OCR provides resources to help you deliver our qualifications. These resources do not represent any particular teaching method
we expect you to use. We update our resources regularly and aim to make sure content is accurate but please check the OCR
website so that you have the most up-to-date version. OCR cannot be held responsible for any errors or omissions in these
resources.
Though we make every effort to check our resources, there may be contradictions between published support and the
specification, so it is important that you always use information in the latest specification. We indicate any specification changes
within the document itself, change the version number and provide a summary of the changes. If you do notice a discrepancy
between the specification and a resource, please contact us.
Whether you already offer OCR qualifications, are new to OCR or are thinking about switching, you can request more
information using our Expression of Interest form.
Please get in touch if you want to discuss the accessibility of resources we offer to support you in delivering our qualifications.
Qualification
Accredited
Oxford Cambridge and RSA
A LEVEL
Examiners’ report
COMPUTER
SCIENCE
H446
For first teaching in 2015
Version 1 ocr.org.uk/computerscience
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Contents
Introduction ..............................................................................................................................................4
Paper 1 series overview ...........................................................................................................................5
Question 1 (a) (i) ...................................................................................................................................6
Question 1 (a) (ii) ..................................................................................................................................6
Question 1 (b) ......................................................................................................................................7
Question 1 (c) (i) ...................................................................................................................................8
Question 1 (c) (ii) ..................................................................................................................................9
Question 1 (c) (iii)..................................................................................................................................9
Question 1 (c) (iv) ...............................................................................................................................10
Question 1 (d) (i) .................................................................................................................................11
Question 1 (d) (ii) ................................................................................................................................11
Question 1 (d) (iii) ...............................................................................................................................12
Question 1 (e)* ...................................................................................................................................12
Question 2 (a) (ii) ................................................................................................................................13
Question 2 (b) .....................................................................................................................................13
Question 2 (c) (i) .................................................................................................................................14
Question 2 (c) (ii) ................................................................................................................................15
Question 2 (d) (i) .................................................................................................................................15
Question 2 (d) (ii) ................................................................................................................................15
Question 2 (d) (iii) ...............................................................................................................................16
Question 2 (d) (iv) ...............................................................................................................................16
Question 2 (e) .....................................................................................................................................17
Question 2 (f) ......................................................................................................................................17
Question 2 (g) (i) .................................................................................................................................18
Question 2 (g) (ii) ................................................................................................................................19
Question 3 (a) (iii) ...............................................................................................................................20
Question 3 (b) ....................................................................................................................................21
Question 3 (c) ....................................................................................................................................21
Question 4* .........................................................................................................................................22
Question 5 (b) (i) .................................................................................................................................22
Question 5 (b) (ii) ................................................................................................................................23
Question 5 (d) ....................................................................................................................................23
Question 5 (e) (iii) ...............................................................................................................................24
Question 5 (f)* ....................................................................................................................................24
2 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
3 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Introduction
Our examiners’ reports are produced to offer constructive feedback on candidates’ performance in the
examinations. They provide useful guidance for future candidates.
The reports will include a general commentary on candidates’ performance, identify technical aspects
examined in the questions and highlight good performance and where performance could be improved.
A selection of candidate answers are also provided. The reports will also explain aspects which caused
difficulty and why the difficulties arose, whether through a lack of knowledge, poor examination
technique, or any other identifiable and explainable reason.
Where overall performance on a question/question part was considered good, with no particular areas to
highlight, these questions have not been included in the report.
A full copy of the question paper and the mark scheme can be downloaded from OCR.
To support student revision, advance information was published about the focus of exams for Summer
2022 assessments. Advance information was available for most GCSE, AS and A Level subjects, Core
Maths, FSMQ, and Cambridge Nationals Information Technologies. You can find more information on
our website.
4 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
To do well on this paper, candidates need to be able to demonstrate and apply knowledge across all the
topics listed above, in different contexts.
It is important that candidates apply their knowledge to the question where a scenario or data is
provided. Extra information was provided for this series, but candidates were still expected to have
covered the whole specification. Definitions were at times not clearly expressed and key terms not used.
Centres should take note of the SQL that candidates are expected to have awareness of.
Candidates who did well on this paper Candidates who did less well on this paper
generally did the following: generally did the following:
• Applied their knowledge to the context • Gave unclear definitions
• Were able to write pseudocode or program • Attempted to answer questions with a mix of
code pseudocode and program code
• Were able to address all parts of the question • Only addressed a part of an extended answer
in their extended answer responses question
• Were able to explain the principles of ACID
5 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Many candidates were able to access full marks on this question. This question has been asked in
previous papers and candidates should be encouraged to use these to make sure they are clear in their
responses. There were many possible responses in the mark scheme to help candidates to gain full
marks. Most candidates gained at least 1 mark.
This question was generally answered well by candidates and the majority gave separate areas of
memory for data and instructions. Where candidates were not given marks, it was generally because
their answer was unclear, e.g. just saying ‘separate memory’.
6 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Question 1 (b)
Most candidates were able to gain full marks on this question. Less successful responses often
mentioned clock speed, cache or cores without referring to an improvement, e.g. higher or faster.
7 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
This was generally well answered by candidates who had a good understanding of LMC. Candidates
should be encouraged to trace through LMC programs with different values as well as writing them.
8 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
This was generally answered well, and the majority of students were able to gain marks with most
gaining 3 or 4 marks. Less successful responses over complicated the program leading to them making
mistakes. A small number of candidates attempted to answer in pseudocode rather than LMC.
Candidates should be encouraged to use the commands in Appendix 5d of the specification.
Many candidates were able to gain at least 2 marks on this question. Some candidates were not
awarded marks as they wrote about multiple cores or programs being fetched instead, of instructions.
9 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Exemplar 1
The candidate has clearly described pipelining with correct terminology. They gained full marks for the
description of one instruction being decoded while another is fetched and another is executed, as well as
describing that it allows multiple instructions to be processed at the same time.
Many candidates gained 1 mark for giving a benefit to the charity, but they did not go on to say why
pipelining enabled that. Some candidates did not apply their answer to the charity, so were not awarded
the mark for the benefit.
10 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Most candidates were able to access 1 mark for the result of ALU calculations, but few were able to give
two uses. Some confused the accumulator with the program counter and the ALU.
This question was generally well answered by candidates who gave clear responses.
Misconception
Some candidates thought that the program counter kept track of a count of the number of
instructions that had been fetched.
11 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Most candidates gained full marks on this question and were able to correctly identify three other
registers. Some lost marks for saying the ALU or control unit were registers.
Question 1 (e)*
Many candidates were able to discuss the difference in reduced or complex instruction sets and gave
some discussion of the increase in hardware requirements for CISC. Few talked about the software
differences, and some assumed the charity would need to be programming the devices which was not
relevant to the question.
12 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Many candidates gained 1 mark for the foreign key and most gained both marks, although some
candidates gave ‘package’ as the table where it is a primary key rather than the membership table where
it is the foreign key.
Question 2 (b)
Many candidates were able to gain some marks. The question refers to the Adverts field which is in the
package table and states that the data shown in the tables is only an extract from the tables. For full
marks on this question, candidates were expected to attempt to join the two tables to access the
Username and Firstname from the membership table, and the Adverts from the package table.
13 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Few candidates were able to gain full marks on this question as many overcomplicated it or could not
give a relevant data capture method. When they did give form as a relevant answer, they often had
unclear suitability.
Exemplar 2
The candidate has given a valid method and has given clear and correct suitability by describing that the
details could be automatically added to the database and can be filled in from home, which would be a
remote location. The candidate gained the full 3 marks.
14 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Few candidates gained full marks on this question although there were a range of relevant responses
they could have given.
15 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
For candidates with a good understanding of ACID, these questions were well answered. Unfortunately,
some had only a vague knowledge or confused it with referential integrity. Some answers were unclear.
Some candidates talked about locking the entire database when record locking rather than just the
relevant records.
Many candidates were given a mark for deadlock or longer wait times. Those candidates given a mark in
Question 2 (d) (iv) tended to be those who has gained marks in Question 2 (d) (iii).
16 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Question 2 (e)
Most candidates were able to gain 1 mark for this question, but few went on to gain a second mark.
Question 2 (f)
Candidates tended to write at length for this question, but often made the same point twice. Many
missed marks for not making the comparison between lossy and lossless and only gave one side. Some
candidates discussed the videos being downloaded rather than streamed.
17 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
This question was well answered by some candidates. The question asks for pseudocode or program
code and candidates should be encouraged to do one or the other if given a choice, rather than a
combination of the two. Many candidates did not use the information in the question stem to help them
structure their answer and gave more than one parameter in the constructor.
18 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Exemplar 3
This was a good clear example of an answer given in pseudocode. The candidate has declared the 3
given attributes as private, shown a constructor with one parameter and set name to the parameter and
views and rating to 0 and 3. The candidate gained 7 marks.
Most candidates were able to gain at least 1 mark for this question. Those who were not given marks
used pseudocode but did not state that the procedure was public, or they did not use the same attribute
they had declared in Question 2 (g) (i).
19 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Most candidates were able to gain some marks, with many gaining full marks. A popular method was to
do two’s complement addition. Candidates should be encouraged to show their working in binary and not
do the subtraction in denary and then just give the answer in binary. The question asks them to complete
a binary subtraction.
20 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Question 3 (b)
Most candidates correctly identified the exponent and that the point needed to be moved to the left. Any
valid method of working was given marks here, where candidates got the correct answer.
Question 3 (c)
This question was mostly well answered. However, some candidates were able to identify 01 as being
normalised but not 10 being normalised.
21 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Question 4*
There were a wide range of responses to this question and a wide range of marks given. The most
successful responses were able to address all parts of the question and could give the meaning of AI as
well as some relevant examples of AI bias. They were also able to give at least one measure that could
be taken. Many candidates used self-driving cars as their only example and should be encouraged to
explore the use of AI in different fields. Some confused the AI being biased with people being biased
against AI. Many candidates were unable to give relevant measures for preventing bias. Candidates
should be encouraged to make sure they include all points the question asked for, in their answer.
This question was generally well answered, though some candidates thought that a translator translated
machine code into source code or that it translated code into something the computer could understand,
without specifying what that was.
22 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
This question was well answered by many candidates who showed two distinct differences.
Question 5 (d)
Many candidates gave good descriptions of how code is optimised, but they did not answer the question
which asked what the purpose of optimisation is.
23 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Candidates should be encouraged to give a complete answer. Just saying ‘Unicode uses more bits than
ASCII’ is not enough to be given a mark at this level.
Question 5 (f)*
Most candidates gained some marks on this question. Most could explain that spiral was iterative and
waterfall was done in linear stages, but many did not expand on this. Few candidates linked their answer
to the complex computer program mentioned in the question. Some candidates also described waterfall
as iterative.
24 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
This question was generally well answered with many candidates gaining at least 1 mark. The question
asked why the OS used ‘first come first served’ and many candidates were not given marks for stating
why the user would want the OS to use it. Some candidates talked about other scheduling algorithms
even though this was not relevant to the question.
25 © OCR 2022
A Level Computer Science - H446/01 - Summer 2022 Examiners’ report
Very few students could explain what happens at the application layer and answers tended to be about
splitting data into packets. Some candidates did mention that encryption would take place but didn’t go
on to mention decryption when receiving data. Those candidates that identified that protocols are applied
here were unable to give a specific example and simply listed protocols they knew, but without context.
Very few candidates were able to gain 2 marks on this question. Some candidates talked about
transmitting data via cables, despite wireless being mentioned in the question.
26 © OCR 2022
Supporting you
Post-results If any of your students’ results are not as expected, you may wish
to consider one of our post-results services. For full information
services about the options available visit the OCR website.
Keep up-to-date We send a weekly roundup to tell you about important updates.
You can also sign up for your subject specific updates.
If you haven’t already, sign up here.
OCR Attend one of our popular CPD courses to hear directly from a senior
assessor or drop in to a Q&A session. Most of our courses are delivered
Professional live via an online platform, so you can attend from any location.
Development Please find details for all our courses on the relevant subject page
on our website or visit OCR professional development.
Active Results Review students' exam performance with our free online results
analysis tool. It is available for all GCSEs, AS and A Levels and
Cambridge Nationals.
It allows you to:
• review and run analysis reports on exam performance
• analyse results at question and/or topic level
• compare your centre with OCR national averages
• identify trends across the centre
• facilitate effective planning and delivery of courses
• identify areas of the curriculum where students excel or struggle
• help pinpoint strengths and weaknesses of students and teaching
departments.
Find out more.
Need to get in touch? We really value your feedback
If you ever have any questions about OCR Click to send us an autogenerated email about
qualifications or services (including administration, this resource. Add comments if you want to.
logistics and teaching) please feel free to get in touch Let us know how we can improve this resource or
with our customer support centre. what else you need. Your email address will not be
used or shared for any marketing purposes.
Call us on
01223 553998 I like this I dislike this
Alternatively, you can email us on
[email protected] I dislike this
OCR is part of Cambridge University Press & Assessment, a department of the University of Cambridge.
For staff training purposes and as part of our quality assurance programme your call may be recorded or monitored. © OCR 2022 Oxford Cambridge and
RSA Examinations is a Company Limited by Guarantee. Registered in England. Registered office The Triangle Building, Shaftesbury Road, Cambridge, CB2 8EA.
Registered company number 3484466. OCR is an exempt charity.
OCR operates academic and vocational qualifications regulated by Ofqual, Qualifications Wales and CCEA as listed in their qualifications registers including A Levels,
GCSEs, Cambridge Technicals and Cambridge Nationals.
OCR provides resources to help you deliver our qualifications. These resources do not represent any particular teaching method we expect you to use. We update
our resources regularly and aim to make sure content is accurate but please check the OCR website so that you have the most up to date version. OCR cannot be
held responsible for any errors or omissions in these resources.
Though we make every effort to check our resources, there may be contradictions between published support and the specification, so it is important that you
always use information in the latest specification. We indicate any specification changes within the document itself, change the version number and provide a
summary of the changes. If you do notice a discrepancy between the specification and a resource, please contact us.
You can copy and distribute this resource freely if you keep the OCR logo and this small print intact and you acknowledge OCR as the originator of the resource.
OCR acknowledges the use of the following content: N/A
Whether you already offer OCR qualifications, are new to OCR or are thinking about switching, you can request more information using our Expression of Interest form.
Please get in touch if you want to discuss the accessibility of resources we offer to support you in delivering our qualifications.