H446-01 - MS - June19
H446-01 - MS - June19
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 2019
H446/01 Mark Scheme June 2019
Annotations
Annotation Meaning
Omission mark
Incorrect point
Expansion of a point
Follow through
Repeat
Correct point
Too vague
H446/01 Mark Scheme June 2019
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
INTRODUCTION
Your first task as an Examiner is to become thoroughly familiar with the material on which the examination depends. This material includes:
• the specification, especially the assessment objectives
• the question paper and its rubrics
• the mark scheme.
You should ensure also that you are familiar with the administrative procedures related to the marking process. These are set out in the OCR
booklet Instructions for Examiners. If you are examining for the first time, please read carefully Appendix 5 Introduction to Script Marking:
Notes for New Examiners.
Please ask for help or guidance whenever you need it. Your first point of contact is your Team Leader.
H446/01 Mark Scheme June 2019
Please study this Mark Scheme carefully. The Mark Scheme is an integral part of the process that begins with the setting of the question paper and
ends with the awarding of grades. Question papers and Mark Schemes are developed in association with each other so that issues of
differentiation and positive achievement can be addressed from the very start.
This Mark Scheme is a working document; it is not exhaustive; it does not provide ‘correct’ answers. The Mark Scheme can only provide ‘best
guesses’ about how the question will work out, and it is subject to revision after we have looked at a wide range of scripts.
The Examiners’ Standardisation Meeting will ensure that the Mark Scheme covers the range of candidates’ responses to the questions, and that all
Examiners understand and apply the Mark Scheme in the same way. The Mark Scheme will be discussed and amended at the meeting, and
administrative procedures will be confirmed. Co-ordination scripts will be issued at the meeting to exemplify aspects of candidates’ responses and
achievements; the co-ordination scripts then become part of this Mark Scheme.
Before the Standardisation Meeting, you should read and mark in pencil a number of scripts, in order to gain an impression of the range of
responses and achievement that may be expected.
In your marking, you will encounter valid responses which are not covered by the Mark Scheme: these responses must be credited. You will
encounter answers which fall outside the ‘target range’ of Bands for the paper which you are marking. Please mark these answers according to the
marking criteria.
Please read carefully all the scripts in your allocation and make every effort to look positively for achievement throughout the ability range. Always
be prepared to use the full range of marks.
H446/01 Mark Scheme June 2019
The indicative content indicates the expected parameters for candidates’ answers, but be prepared to recognise and credit unexpected approaches
where they show relevance.
Using ‘best-fit’, decide first which set of BAND DESCRIPTORS best describes the overall quality of the answer. Once the band is located, adjust
the mark concentrating on features of the answer which make it stronger or weaker following the guidelines for refinement.
• Highest mark: If clear evidence of all the qualities in the band descriptors is shown, the HIGHEST Mark should be awarded.
• Lowest mark: If the answer shows the candidate to be borderline (i.e. they have achieved all the qualities of the bands below and show
limited evidence of meeting the criteria of the band in question) the LOWEST mark should be awarded.
• Middle mark: This mark should be used for candidates who are secure in the band. They are not ‘borderline’ but they have only achieved
some of the qualities in the band descriptors.
Be prepared to use the full range of marks. Do not reserve (e.g.) high Band 3 marks ‘in case’ something turns up of a quality you have not yet seen.
If an answer gives clear evidence of the qualities described in the band descriptors, reward appropriately.
H446/01 Mark Scheme June 2019
Assessment Objective
AO1 Demonstrate knowledge and understanding of the principles and concepts of computer science, including abstraction, logic, algorithms
and data representation.
AO1.1 Demonstrate knowledge of the principles and concepts of abstraction, logic, algorithms, data representation or other as appropriate.
AO1.2 Demonstrate understanding of the principles and concepts of abstraction, logic, algorithms, data representation or other as appropriate.
AO2 Apply knowledge and understanding of the principles and concepts of computer science including to analyse problems in computational
terms.
AO2.1 Apply knowledge and understanding of the principles and concepts of computer science.
AO3 Design, program and evaluate computer systems that solve problems, making reasoned judgements about these and presenting
conclusions.
AO3.3 Evaluate computer systems that solve problems, making reasoned judgements about these and presenting conclusions.
H446/01 Mark Scheme June 2019
Output Device
Speaker…
…To play the device’s responses
LEDs…
…To indicate the device is on/listening
Screen…
…To show visual information
− CCC AO1.2
− ... followed by MMMCCCC
(1 per -, max 2)
H446/01 Mark Scheme June 2019
− 4C1O AO1.2
− Followed by 3L5C
− Followed by 1M1O5C
d − Correct function name and parameter 5 E.g.
AND the function returns a value. function longest(sequence)
− Use of a loop to correctly iterate AO3.2 currentRun = 0
through the sequence biggestRun = 0
− Adds one to a running total when a C is for i = 0 To sequence.length - 1
encountered if sequence.substring(i, 1) == "C" then
− -when character changes from a C if currentRun = currentRun + 1
running total is > maximum, overwrites else
maximum… if currentRun > biggestRun then
− …correctly reset running total biggestRun = currentRun
end if
1 mark per -, max 5 currentRun = 0
endif
next i
return biggestRun
endfunction
3 a Input Output 3
1 1
2 4 AO3.3
3 9
1 per row, max 3
b Squares a number / multiplies a number by 1
itself AO3.3
c − The value 16 is copied to the MAR 2
− The contents of the of the ACC (i.e. 9)
are copied to the MDR AO2.2
− The value 9 is copied to location
16/count
1 per -, max 2
H446/01 Mark Scheme June 2019
d Interrupt 1 cao
AO1.1
e − Immediate addressing… 2
− …operand is the value to be used.
− Indirect Addressing… AO1.1
− …operand is the memory location
holding a value representing the
memory location to be used.
− Indexed Addressing…
− …Operand is added to contents of
Index Register to get memory location
of value needed.
(1 mark for naming addressing mode, 1 mark
for correct description)
4 a One from 2 Accept legacy media such as laserdisc and videodisc.
− read/written to, using a laser Do not accept DVD variants (DVD-R, DVD-RW etc)
− read/written onto a reflective surface AO1.1
− data is stored using pits and lands
Plus example
− Eg. Blu-Ray/CD
(1 per - , max 2)
b − Cheap to produce/buy 1
− Capacity big enough to hold film AO1.1
− Robust enough to be used over long
periods/ moved around
− Portable
− Does not need an internet connection
(1 per - , max 1)
c A program that enables communication 1
between an operating system and a AO1.1
(hardware) device.
H446/01 Mark Scheme June 2019
d Advantages 4
− Can access film (and indeed entire AO1.2
library) from anywhere with an internet
connection
− No physical storage needed
− No risk of films being
stolen/damaged/lost
− Optical/disk player hardware not
required to play film
Disadvantage
− Reliant on having an (fast enough)
internet connection.
− Need enough storage for download
− Reliant on servers of the company
providing the connection.
− People like having a physical copy
− If the company providing the stream
goes out of business, copy is lost.
(1 per -, max 4. If only advantages or
disadvantages, max 3)
H446/01 Mark Scheme June 2019
(1 per -, max 3)
5 a tuple / record / list 1 Don't accept array
AO2.1
b 228 1 cao
AO2.1
H446/01 Mark Scheme June 2019
(1 per -, max 5 )
H446/01 Mark Scheme June 2019
d 4
− rnd.com would cause a collision with AO1.2
ocr.org.uk/would has to the same
position as ocr.org.uk (228)
(1 per -, max 4)
H446/01 Mark Scheme June 2019
e Mark Band 3–High Level (9-12 marks) 12 Searching of a Linked list involves starting at the first node and following the pointers
The candidate demonstrates a thorough until either the desired value is found, or the end of the list is reached, meaning the
knowledge and understanding of storing and AO1.1 item isn’t in the list.
retrieving data from hash tables and linked (2)
lists. The material is generally accurate and AO1.2 The bigger the linked list grows, the longer it takes to search.
detailed. (2) If a linked list doubles in size it will, on average, take twice as long to search.
AO2.1 A list of size n takes on average n/2 checks.
The candidate is able to apply their knowledge (3) In Big O this is O(n), or linear complexity.
and understanding directly and consistently to AO3.3
the context provided. Evidence/examples will (5)
be explicitly relevant to the explanation. Searching of a hash table requires the key to be hashed and the correct location
accessed.
The candidate is able to weigh up both sides The time this takes is largely dependent on the time to create the hash.
of the argument which results in a supported If we ignore collisions, the time to find an item will stay the same regardless of the size
and realistic judgment as to which data of the white list.
structure is suitable. In other words it has O(1) or constant complexity.
Unfortunately as the white list grows collisions become more likely.
There is a well-developed line of reasoning Linear probing and chaining means that once a location has been found the time taken
which is clear and logically structured. The grows linearly with the number of collisions that have occurred for that location,
information presented is relevant and
substantiated. Nonetheless this is still going to perform significantly better than a linked list.
Mark Band 2-Mid Level (5-8 marks)
The candidate demonstrates reasonable If items are added to the end of the linked list then if the location of the last node is
knowledge and understanding of storing and stored, that location can be ready made to point at the new item.
retrieving data from hash tables or linked lists; The time to add items is constant.
the material is generally accurate but at times
underdeveloped. If they are added in some sort of order then the time to add items grows linearly due to
the time spent searching for the right position. (Storing in order has the advantage that
The candidate is able to apply their knowledge it is if an item isn’t in the list this can be deduced once its location is passed, rather
and understanding directly to the context than waiting until the end.)
provided although one or two opportunities are
missed. Evidence/examples are for the most Adding items to a hash table involves hashing the key and placing it in the correct
part implicitly relevant to the explanation. location.
This takes a constant amount of time..
The candidate makes a reasonable attempt to ..unless there are collisions then there is an overhead which grows with the number of
come to a conclusion showing some collisions for that location.
recognition of influencing factors that would
H446/01 Mark Scheme June 2019
d − Consistency 3
− Isolation AO1.1
− Durability
(1 mark per -, max 3)
e Advantage 2
− More characters can be represented AO1.2
− may include foreign alphabets
− may include emojis
Disadvantage
− Reviews take up more storage (4 times
their previous storage size).
OR
c 11010111 2
(1 Mark for the left most 1, 1 mark for the AO1.2
remaining 7 bits)
d 1121 2
022022 AO1.2
01001001-
00101111
00011010
1 mark for correct answer
1 mark for valid method
e − Exponent is 3 3
− Mantissa becomes 0100.11 AO1.2
− Which is 4.75. (accept 4¾ )
(1 per -, max 3)
f − In fixed point is 1010.11 4 For MP3 any number of leading 0s is valid (including none)
− Mantissa becomes 1.01011 AO1.2
− Exponent of 3 / 11
− Giving answer of 101011 011
(1 per -, max 4)
H446/01 Mark Scheme June 2019
0 marks
No attempt to answer the question or
response is not worthy of credit.
H446/01 Mark Scheme June 2019
7c 1 1 2
7d 3 3
7e 2 2
8a 1 1
8b 1 1
8c 1 1
8d 1 1
8e 2 2
8f 3 3
8g 1 1
9* 2 2 2 3 9
10am 1 1
10bm 2 2
10cm 2 2
10dm 2 2
10em 3 3
10fm 4 4
11a* 2 2 2 3 9
11b 2 2
11c 2 2
30 43 18 14 3 14 18 140
* = extended response
m = mathematical content
OCR (Oxford Cambridge and RSA Examinations)
The Triangle Building
Shaftesbury Road
Cambridge
CB2 8EA
www.ocr.org.uk
© OCR 2019