Mark Scheme
Mark Scheme
Computer Science
Advanced GCE
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 2021
Annotation Meaning
Omission mark
Incorrect point
Expansion of a point
Follow through
Repeat
Correct point
Too vague
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
H446/01 Mark Scheme
Level 3
iii • Performing complex numerical calculations 2 Example has to relate to insurance company
• Calculations on matrices / vectors / multiple data at
AO2.2
the same time
• …e.g. insurance pricing, modelling risk, calculating
bills
iii • Only one customer entry allowed (because of key 2 Mark in pairs.
field)
• …so would not be able to add second entry AO2.1
• Customer data already present/would be repeated
• ….resulting in redundant data/wasted space
• …resulting in inconsistencies should changes be
made
Iv • Add in second table 5
• …for the cars // splitting up cars/customers
• The primary key of customer is used as a field in the AO1.2
car/vehicle table
• … as a foreign key of cars
• Create one to many relationship. Accept many to
one.
H446/01 Mark Scheme
AO1.2
ii 0110 1111 1
AO1.2
(b) i • Move decimal place 1 place right = 0.1101 to 4
normalise
• Pad with 0s, mantissa is 011010 AO1.2
• Exponent is 4 / Subtract 1 from exponent…
• New exponent is 3 = 0011
0 marks
No attempt to answer the question or response is not
worthy of credit.
H446/01 Mark Scheme
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
iii • Logic circuit adds together 2 binary digits / half 4
adder
H446/01 Mark Scheme
• S gives sum, C gives carry AO1.2
• Two half adders can be joined together…
• …with an OR gate
• to form full adder
• 4 full adders can be used to add two four bit
numbers
• Carry out on one joined to carry in on next
H446/01 Mark Scheme
Question Answer Mark Guidance
6 (a) i • Temporary storage/memory location… 2
• …inside the CPU
• Used for a single specific purpose AO1.1
• Faster access speed than RAM / secondary storage
(c) • Input two numbers into two separate variables / 4 Can be completed either by using MOD / DIV or by
other suitable data structure AO3.2 using repeated subtraction as in LMC example
• Correctly calculate integer division
• Correctly calculate remainder
• Print out both
AO2
H446/01 Mark Scheme
The candidate provides a thorough discussion which is Immediate addressing; operand of 27 would refer to the
well balanced. Evaluative comments are consistently value 27
relevant and well-considered. Direct addressing; operand of 27 would tell the
processor to fetch the data held at address 27.
There is a well-developed line of reasoning which is Indirect addressing; operand of 27 would tell the
clear and logically structured. The information processor to fetch the data held at address 27, which
presented is relevant and substantiated. itself would then be used an address to fetch data from.
Indexed addressing; operand of 27 would be added to
Mark Band 2-Mid Level (5-8 marks) the value of the Index register and this would then be
The candidate demonstrates reasonable knowledge used as the address to fetch data from.
and understanding of different modes of addressing;
the material is generally accurate but at times AO3
underdeveloped. Immediate addressing allows simple access to data
with no fetch required, but limited by the data size of the
The candidate is able to apply their knowledge and operand.
understanding directly to the context provided although Direct addressing allows data to be fetched from
one or two opportunities are missed. memory. Data can potentially be larger in size that with
Evidence/examples are for the most part implicitly immediate addressing but address range limited by size
relevant to the explanation. of operand.
Indirect addressing allows a larger range of addresses
The candidate provides a sound discussion, the to be accessed as address fetched. However, multiple
majority of which is focused. Evaluative comments are fetches required to access data.
for the most part appropriate, although one or two Indexed addressing allows the Index register to be
opportunities for development are missed. manipulated to access data stored sequentially e.g. in
an array.
There is a line of reasoning presented with some
structure. The information presented is in the most part
relevant and supported by some evidence.
0 marks
No attempt to answer the question or response is not
worthy of credit.
H446/01 Mark Scheme
Question Answer Mark Guidance
7 (a) (i) Stack 1 Correct answer only
AO1.1
(ii) • Input name from user 4 Example answer
• Check if stack is full e.g.(top <=5) new = input("enter a name : ")
• If not, update top pointer AO3.2 if top <=5 then
• Correctly push name to index referenced by top top = top + 1
wNames[top] = new
end if
(b) 1 mark per name inserted in correct place in diagram 4
AO2.1
(iii) • Binary tree more efficient than linked list 2 Allow reference to big O for second mark.
• Do not need to check every value / tree removes half Linked List O(n), Binary Tree O(log n)
values each time AO1.2
(iv) • Binary tree less efficient than hash table 2 Allow reference to big O for second mark.
• Hash table can find data immediately / without Binary tree O(log n) Hash table O(1)
checking other values. AO1.2
(c) (i) • Object – instantiated from class 3
• Method – action object performs / link to
procedure/functions AO1.1
• Attribute – value held by object / link to variable
(ii) • Class definition statement 5 One mark per bullet point to 5 maximum.
• Defining name and attendance attributes
H446/01 Mark Scheme
• Appropriate get methods for name and attendance AO3.2
that return a value and have no parameter Example answer
• Appropriate set methods for name and attendance class Customer
that take a parameter private name
• …that restricts attendance to be 0 to 100. private attendance
www.ocr.org.uk
For staff training purposes and as part of our quality assurance programme your call may be
recorded or monitored