GCE

Computer Science

H446/02: Algorithms and programming

A Level

Mark Scheme for June 2023

Oxford Cambridge and RSA Examinations

OCR (Oxford Cambridge and RSA) is a leading UK awarding body, providing a wide range of
qualifications to meet the needs of candidates of all ages and abilities. OCR qualifications
include AS/A Levels, Diplomas, GCSEs, Cambridge Nationals, Cambridge Technicals,
Functional Skills, Key Skills, Entry Level qualifications, NVQs and vocational qualifications in
areas such as IT, business, languages, teaching/training, administration and secretarial skills.

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 2023

Oxford Cambridge and RSA Examinations

H446/02 Mark Scheme June 2023

MARKING INSTRUCTIONS
PREPARATION FOR MARKING

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

1. Mark strictly to the mark scheme.

2. Marks awarded must relate directly to the marking criteria.

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.

4. If you are in any doubt about applying the mark scheme, consult your Team Leader by telephone or the RM assessor messaging system, or by email.

5. Crossed Out Responses

Where a candidate has crossed out a response and provided a clear alternative then the crossed-out response is not marked. Where no alternative
response has been provided, examiners may give candidates the benefit of the doubt and mark the crossed-out response where legible.

Contradictory Responses
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

2
H446/02 Mark Scheme June 2023
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.)

Longer Answer Questions (requiring a developed response)

Where candidates have provided two (or more) responses to a medium or high tariff question which only required a single (developed) response and not
crossed out the first response, then only the first response should be marked. Examiners will need to apply professional judgement as to whether the
second (or a subsequent) response is a ‘new start’ or simply a poorly expressed continuation of the first response.

6. 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.

7. Award No Response (NR) if:

• there is nothing written in the answer space

Award Zero ‘0’ if:

• 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 assessor 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 assessor 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 .

10. For answers marked by levels of response:

a. To determine the level – start at the highest level and work down until you reach the level that matches the answer
b. To determine the mark within the level, consider the following:

3
H446/02 Mark Scheme June 2023
Descriptor Award mark

On the borderline of this level and the one below At bottom of level
Just enough achievement on balance for this Above bottom and either below middle or at middle of level (depending on number of marks
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

4
H446/02 Mark Scheme June 2023

11. Annotations

Annotation Meaning
Omission mark

Benefit of the doubt

Incorrect point

Follow through

Not answered question

No benefit of doubt given

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
Level 3

5
H446/02 Mark Scheme June 2023

12. Subject Specific Marking Instructions

Question Answer Mark Guidance

1 (a) (i) 1 mark each to max 2 2
• It is a hierarchical structure / not directed
• Data is stored in nodes
• Nodes are linked by branches/edges
• It has a root node
• Each node has zero or more nodes 'beneath' it // nodes can link to child nodes
• It has leaf nodes / nodes without any lower nodes are leaf nodes
• It has no cycles/loops (distinguishing it from a graph)

1 (a) (ii) 1 mark each 4 Do not allow nodes to be drawn

• Root node 22 at the start downwards.
• 13 and 14 in correct order
• 5 and 8 in correct order
• 36 and 55 in correct order

6
H446/02 Mark Scheme June 2023

1 (a) (iii) 1 mark each 2

• Search/traverse tree until the required node is found
• Set the parent node pointer to the leaf node to null
• Add the deleted node to the free storage list // leave for garbage clear up
1 (a) (iv) 1 mark each to max 4 4
• Check if the root node is equal to search value and if so….
• …return/output/report found
• If value is less than root node take left subtree
• If value is greater than root node take right subtree
• Repeat process with the subtree…
• …until search value is found
• …until no more branches can be travelled.

7
H446/02 Mark Scheme June 2023

1 (a) (v) 1 mark each 4

• Visiting A first…
• …Then visiting F, C…
• …Then visiting L, T, P…
• …Visiting H last

Solution: A, F,C, L,T,P, H

1 (a) (vi) 1 mark each to max 2 2 Candidates may use an example
• When a leaf node is reached… from the tree in 1a(v) to illustrate
• …the traversal backtracks to the leaf’s parent node their response.
• …backtracks to last node with unvisited children
If an answer gives implementational
detail of how a stack is used, map
to the bullet points given.
1 (b) 1 mark for final path A, D, G 6 Nodes should appear in the
1 mark for final distance 14 alphabetical order given if
1 mark for each SECTION or equivalent working shown. candidates add them as the
Node Distance Previous node Marking algorithm progresses but allow
travelled Guidance other orderings of the nodes.
A 0 - / N/A / blank / None 1 Mark
For the last mark in the table there
B 5 A
must be a clear indication that G 19
C 2 A 1Mark from E is overwritten by G 14 from
D 10 A D.
E 7 B 1 Mark
F 15 E Allow equivalent discrete maths
G 19 14 E D 1 Mark approach or textual description.

Check diagram for annotations /

solution.

8
H446/02 Mark Scheme June 2023
Question Answer Mark Guidance
2 Mark Band 3 – High level 9 AO1: Knowledge and Understanding
(7-9 marks) Indicative content
The candidate demonstrates a thorough knowledge and • Problem recognition is identifying that there is a
understanding of both computational thinking methods; the material problem to be solved, to determine exactly what the
is generally accurate and detailed. problem is from a description/scenario and to
The candidate is able to apply their knowledge and understanding determine if the problem can be solved with
directly and consistently to the context provided. computational methods
Evidence/examples will be explicitly relevant to the explanation. • Decomposition is splitting the problem down into
There is a well-developed line of reasoning which is clear and subproblems that can be solved independently
logically structured. The information presented is relevant and AO2: Application
substantiated. • Problem recognition: identifying the need for the
scheduling system, what it will take as its inputs,
Mark Band 2 – Mid level what will need to be output etc.
(4-6 marks) • Decomposition: subproblems could include:
The candidate demonstrates reasonable knowledge and o inputting the requirements
understanding of both computational thinking methods; the material o generating possible routes
is generally accurate but at times underdeveloped. o evaluating the routes
The candidate is able to apply their knowledge and understanding o outputting the schedule
directly to the context provided although one or two opportunities AO3: Evaluation
are missed. Evidence/examples are for the most part implicitly Computational methods allow the e.g.:
relevant to the explanation. • programmer to determine what the problem, what
The candidate provides a reasonable discussion, the majority of the challenges may be and what additional
which is focused. Evaluative comments are, for the most part information is required before starting to code the
appropriate, although one or two opportunities for development are solution
missed. • identification of the key features for programmers to
There is a line of reasoning presented with some structure. The focus on
information presented is in the most part relevant and supported by • splitting of the task into smaller, more
some evidence. manageable/solvable problems which allows for a
solution to be developed quicker
Mark Band 1 – Low Level
• design of an effective/efficient solution that makes
(1-3 marks)
best use of a processor
The candidate demonstrates a basic knowledge of both
• splitting of a task to allow programmers to focus on
computational thinking methods with limited understanding shown;
areas they specialise in.
the material is basic and contains some inaccuracies. The
candidates makes a limited attempt to apply acquired knowledge
and understanding to the context provided.
The candidate provides a limited discussion which is narrow in
focus. Judgements if made are weak and unsubstantiated.
9
H446/02 Mark Scheme June 2023
The information is basic and comunicated in an unstructured way.
The information is supported by limited evidence and the
relationship to the evidence may not be clear.

0 marks
No attempt to answer the question or response is not worthy of
credit.

10
H446/02 Mark Scheme June 2023

3 (a) 1 mark each 2

• headPointer: To indicate the first element in the
list
• freeListPointer: To indicate the next index to
store data in (the freeList)

3 (b) It doesn't point to another node 1

Indicates the end of the linked list

3 (c) • first output red… 2

• …remainder of list correct

e.g.
red blue grey green purple orange

11
H446/02 Mark Scheme June 2023

3 (d) 1 mark each to max 4 4 Note descriptions could be for either appending an item
to the end of the current list or prepending it to the start.
Check space available in the free list There are different ways to achieve this.
• Check to make sure freeListPointer is not Null
Allow answers that illustrate solutions by example from
Add new data item to first free space in free list the table in Fig 3 at the start of the question.
• Insert new data item at index freeListPointer
(index 4) Reponses must refer to the relevant pointers or give
clear exemplifications.
Append e.g.
• Traverse to / locate the end of the list (index 3
‘orange’)
• Set the pointer of the last item in the linked list to
freeListPointer (pointer at index 3 ‘orange’
changes from Null to 4)…
• … update freeListPointer to the location that
new data item pointer is pointing to at present.
(freeListPointer changes from 4 to 5)
• … update pointer from new data item to Null (index 4
pointer changes from 5 to Null)

Prepend e.g.
• Update freeListPointer to point to the location
that the pointer from the first item in the free list is
pointing to (freeListPointer changes from 4 to
5)
• … Update pointer from new data item to
headPointer (index 4 pointer changes from 5 to 1)
• … Update headPointer to the index of new data
item (headPointer changes from 1 to 4)

12
H446/02 Mark Scheme June 2023

Question Answer Mark Guidance

3 (e) 1 mark for each statement 5 Ignore case of
identifiers in
function findNode(toFind, headPointer, linkedList) pseudocode
currentNode = headPointer
while(currentNode != NULL) Only penalise
if linkedList[currentNode].data == toFind then excessive
return currentNode spaces within
else identifier names
currentNode = linkedList[currentNode].pointer if obvious.
endif
endwhile
return -1
endfunction

13
H446/02 Mark Scheme June 2023

Question Answer Mark Guidance

4 (a) (i) 1 mark for: 1 Penalise excessive spaces in
• isInteger identifiers such as
• number ascii Value
• result instead of asciiValue
• count
• asciiValue
4 (a) (ii) (0)5 1

4 (a) (iii) (0)3 1

4 (b) 1 mark each 3

03
• Loop through each of the characters/digits in the number string (parameter)
04
• Find the ASCII value of the current character/digit
09
• Return true if the value is an integer and false otherwise

4 (c) 1 mark each to max 2: 2

• One piece of code can be used many times / in multiple places / makes code
more efficient
• No need to write the same code multiple times
• Takes less time to plan/design/code the program
• Easier error detection as fix once and it corrects in each place // less likely to
have errors as code is not written multiple times
• Makes it easier to maintain the program

14
H446/02 Mark Scheme June 2023

5 (a) 1 mark each to max 3 3 Allow answers in context as long as

• The function calls itself…. they are clear what the features are.
• …..such as line 05 / 07
• Each recursive call will create a new copy of the values in the function….
• ….and add all of the values of the copy the call is being made from to a stack
• There is a base case // condition that stops the recursive calls…
• …condition in line 02
• There may be more than one base case
5 (b) 1 mark for final return value 29 (award in working or answer space) 5 The table is given as guidance, but
1 mark each for working actual process may be presented in
• First call with 10 and second call with 7 different ways.
• Remainder of calls 6, 3, 2
• Final call value -1
• Adding/showing return values (1 + 2 + 3 + 6 + 7 + 10)

e.g.

Function call value return

recursiveAlgorithm(10) 10 29
recursiveAlgorithm(7) 7 19
recursiveAlgorithm(6) 6 12
recursiveAlgorithm(3) 3 6
recursiveAlgorithm(2) 2 3
recursiveAlgorithm(-1) -1 1

15
H446/02 Mark Scheme June 2023

6 1 mark each to max 6 6 Note candidates can reverse the

• Taking number as input string before output if they don’t
• Calculating remainder after division by 8 concatenate in the order given in the
• Calculating integer after division by 8 example.
• Correct loop until 0 is reached (or equivalent method) E.g.
• Concatenating each remainder // storing each remainder in an array/list endResult = str(endResult)
+ str(remainder)
• Outputting the correct result

e.g. pseudocode The final markpoint can only be

number = input("Enter a number") awarded where the correct output will
be produced by the algorithm.
endResult = ""

while number != 0
remainder = number MOD 8
number = number DIV 8
endResult = str(remainder) + str(endResult)
endwhile
print endResult

16
H446/02 Mark Scheme June 2023

7 (a) Mark Band 3 – High level 9 AO1: Knowledge and

(7-8 marks) Understanding
The candidate demonstrates a thorough knowledge and understanding of Big O; the Indicative content
material is generally accurate and detailed. • Big O measures the number of
The candidate is able to apply their knowledge and understanding directly and steps and memory usage change
consistently to the context provided. Evidence/examples will be explicitly relevant to according to the data as the
the explanation. amount of data being processed
There is a well-developed line of reasoning which is clear and logically structured. The increases
information presented is relevant and substantiated. • Linear - grows in proportion to
amount of data
Mark Band 2 – Mid level • Exponential – the rate of increase
(4-6 marks) is at the rate kn as n increases
The candidate demonstrates reasonable knowledge and understanding of Big O; the • Constant - it does not change
material is generally accurate but at times underdeveloped. • Logarithmic – means the rate of
The candidate is able to apply their knowledge and understanding directly to the increase gets smaller as the
context provided although one or two opportunities are missed. Evidence/examples amount of data increases time /
are for the most part implicitly relevant to the explanation. time increases at a rate of logkn
The candidate provides a reasonable discussion, the majority of which is focused. as n increases.
Evaluative comments are, for the most part appropriate, although one or two
opportunities for development are missed. AO2: Application
There is a line of reasoning presented with some structure. The information presented • Algorithm 1 – The time taken
is in the most part relevant and supported by some evidence. increases as the data set grows.
The space taken also significantly
Mark Band 1 – Low Level increases. This algorithm is not
(1-3 marks) memory efficient.
The candidate demonstrates a basic knowledge of Big O with limited understanding • Algorithm 2 – The time increases
shown; the material is basic and contains some inaccuracies. The candidates makes significantly and therefore this
a limited attempt to apply acquired knowledge and understanding to the context algorithm is not time efficient. The
provided. space will never change which
The candidate provides a limited discussion which is narrow in focus. Judgements if means the amount of memory will
made are weak and unsubstantiated. not change as the data set grows.
The information is basic and comunicated in an unstructured way. The information is
• Algorithm 3 – The time will grow
supported by limited evidence and the relationship to the evidence may not be clear.
less fast as the data set grows
relative to the other algorithms.
0 marks
The space required will also
No attempt to answer the question or response is not worthy of credit.
increase, but not insurmountably.
This is therefore an efficient

17
H446/02 Mark Scheme June 2023
algorithm with large data sets
compared to algorithm 1 and 2
overall.

AO3: Evaluation
• Number of elements is unknown.
Exponential is least appropriate
because this could increase
significantly and be
unmanageable.
• Constant is the most ideal as the
time will not increase.
• Algorithm 3 is more suitable
because it has a logarithmic time
complexity, so it increases less
quickly than the other algorithms.
It will be reasonable with a small
amount (2 items) of data, but then
when very large amounts (2 billion
items) are needed it will not be
significantly more.

7 (b) (i) 1 mark for each to max 2 2

• Processes happen at the same time // processes overlap
• One process can start before another one finishes
• Each process is given a slice of processor time
• Different processes can be executed (in parallel) by different processors/cores
7 (b) (ii) 1 mark each to max 2 2
e.g.
• More efficient processor use // Less idle time for processor // Greater
throughput
• Long running tasks do not delay short running tasks
• Tasks requiring preconditions can wait and then resume execution
• User is able to interact with the computer while other tasks are running

18
H446/02 Mark Scheme June 2023

7 (c) (i) 1 mark each to max 5 5 Allow array/list as equivalent

• The data list is split into two lists
• These sublists continue to be (recursively) split…
• …until each sublist is one item
• The first element in two different sublists is compared…
• …the smaller item is then selected…
• …and written to a new list
• …until both sublists fully merged
• Repeated until all sorted sublists are recombined

7 (c) (ii) 1 mark for benefit 2

e.g.
• More efficient time complexity (for large data sets) // takes fewer steps to sort
the data
• Time complexity O(n log n), rather than O(n2)
• Uses divide and conquer
• Can apply concurrent processing to reduce sorting time

1 mark for drawback

e.g.
• More difficult to implement // needs more complex code
• Less efficient space complexity // uses more memory with more data items
• Space complexity of O(n)/linear, rather than O(1) / constant
• Merge sort is always O(nlog2n) whereas the best case for bubble sort is O(n)

19
H446/02 Mark Scheme June 2023

7 (d) 1 mark for identification, 1 for description of feature 6 Consider awarding description
e.g. without feature.
• Error diagnostics
• … to locate and fix errors Allow other suitable answers.

• Breakpoints
• …stop a program running at a point to check variables

• Syntax highlighting
• … to identify key words, variables and help identify syntax errors

• Stepping // step through

• … run the program line by line to check variable values at each stage

• Variable watch window

• …view how variables change while the program executes

• Auto-complete
• … start typing a command/identifier and it completes it

20
H446/02 Mark Scheme June 2023

8 (a) 1 mark for each input to max 2 3

• Username
• Password

1 mark for output

e.g.
• Message to request input
• Message to state login successful
• Message to say login unsuccessful
8 (b) 1 mark each to max 2 e.g. 2 Allow other suitable subprocedures
• Connect to database that link to the scenario.
• Access usernames in file/database
• Check username against file/database
• Hash password
• Access password/hash in file/database
• Check password entered/hashed vs stored
• Output result

21
H446/02 Mark Scheme June 2023

Question Answer Mark Guidance

9 (a) (i) 1 mark for each description to max 2 and 1 mark for 3 Allow other suitable examples that are relevant to the
example treasure game.
e.g.
• Removal of unnecessary detail…
• ….to allow programmers to focus on core
aspects of the problem….
• ….simplifies a complex problem
Examples, e.g:
• Treasure objects are replaced with text labels //
no images of treasure are used
• Island is set of coordinates and no info as to
environment/layout and other objects
9 (a) (ii) 1 mark each to max 3 3
e.g.
• Reduces programming time
• Reduces complexity of code (through
abstraction by generalisation)
• Reduces amount of memory required /
computational power
• Simplifies the problem so it's easier to solve /
understand (by recognising common patterns)
• Allows programmers to focus on core aspects of
the problem

22
H446/02 Mark Scheme June 2023

9 (b) (i) 1 mark each 5 Allow use of this/self or equivalent dependent on

• Defining class Treasure language
• Defining the private attributes value and level
• Defining a new public procedure… public procedure new(value, level)
• …Taking two parameters (integer and string) this.value = value
• Correctly assigning both parameters to the this.level = level
attributes endprocedure

e.g. Python answers must either use comments to indicate

class Treasure private attributes or use the double underscore private
attribute convention to be credited.
private value self.__level
private level self.level # private

public procedure new(valueP, levelP)

value = valueP
level = levelP
endprocedure
endclass
9 (b) (ii) 1 mark each 2 Note Python self will appear, but no other parameters
• get level method header with no parameter def getLevel(self):
• Returning level attribute

e.g.
public function getLevel()
return level
endfunction
9 (b) (iii) 1 mark each 2
• Encapsulation
• Allowing an attribute to only be
accessed/changed via a method

23
H446/02 Mark Scheme June 2023

9 (c) 1 mark for each completed statement 5

public procedure new()
for row = 0 to 9
for column = 0 to 19
grid[row, column] = new Treasure(-
1,"")
next column
next row
endprocedure
9 (d) 1 mark each to max 7 7 Note candidates may attempt to access private
• Procedure declaration taking parameter attributes directly gameboard.grid(x,y) for example,
• Taking two inputs for row and column from the instead of gameboard.getGridItem(x,y).
user
• Accessing item at grid position… Credit cannot be given for the dependent second mark
• …using correct get methods getGridItem using appropriate get method if they do this, but FT
• Checking (treasure) object’s level/value… marks can be awarded for later points if a reasonable
• …using correct get method getLevel attempt has been made.
getValue
• …outputting "No treasure" if empty
• …otherwise outputting value and level

e.g.
procedure guessGrid(gameboard)
rCoord = input("Enter R coordinate")
cCoord = input("Enter C coordinate")
treasureItem =
gameBoard.getGridItem(rCoord, cCoord)
if treasureItem.getLevel() = "" then
print("No treasure")
else
print("This treasure is level ",
treasureItem.getLevel(), " with value ",
treasureItem.getValue())
endprocedure

24
H446/02 Mark Scheme June 2023

9 (e) 1 mark each to max 4 e.g. 4 1 mark per benefit identified and 1 mark per expansion.
• Code can easily be reused… Max 2 benefits and 1 expansion per benefit.
• …classes can be used in other programs
• …inheritance can be to extend upon existing
classes
• …as a class can be based on an existing class
• Easier to maintain….
• ….as classes can be modified or extended
• …debugging can be easier as encapsulation
limits how attibutes are changed.
• Code can be more secure…
• … as access to attributes can be restricted to
being via methods.
• Better for coding as part of a team…
• …as classes can be distributed between team
members.

25
H446/02 Mark Scheme June 2023

9 (f) Mark Band 3 – High level 9 AO1: Knowledge and Understanding

(7-9 marks) Indicative content
The candidate demonstrates a thorough knowledge and • Local variable can only be accessed within sub-
understanding of parameters and local/global variables; program/main program it is declared within
the material is generally accurate and detailed. • Global variable can be accessed by all sub-
The candidate is able to apply their knowledge and programs
understanding directly and consistently to the context • Parameters are items passed to a subproblem
provided. Evidence/examples will be explicitly relevant • Passing by reference sends a pointer to the original
to the explanation. value, so this will be changed when control is
There is a well-developed line of reasoning which is returned
clear and logically structured. The information • Passing by value sends the a copy of the value, so
presented is relevant and substantiated. the original will not be changed when control is
returned
Mark Band 2 – Mid level
(4-6 marks) AO2: Application
The candidate demonstrates reasonable knowledge • If board is local it can only be accessed in the main
and understanding of parameters and local/global program
variables; the material is generally accurate but at times • This will need to be passed to any sub-programs
underdeveloped. that need to use it
The candidate is able to apply their knowledge and
• If the board needs to be changed it will need
understanding directly to the context provided although
passing by reference, so that the board is updated
one or two opportunities are missed.
• If it only needs to be accessed and not changed it
Evidence/examples are for the most part implicitly
can be passed by value
relevant to the explanation.
The candidate provides a reasonable discussion, the
AO3: Evaluation
majority of which is focused. Evaluative comments are,
for the most part appropriate, although one or two • If global then this would be present in memory
opportunities for development are missed. throughout hence using more memory
There is a line of reasoning presented with some • …however the board will be required throughout the
structure. The information presented is in the most part program so may be as efficient as passing it
relevant and supported by some evidence. through parameters
• …if global then the programming may be more
Mark Band 1 – Low Level straight forward, and less likely to have errors with
(1-3 marks) passing the board incorrectly to subprograms, i.e. it
The candidate demonstrates a basic knowledge of may not be updated when it needs to be
parameters and local/global variables with limited • Using local means that the board can be
understanding shown; the material is basic and manipulated by subprograms without affecting the
contains some inaccuracies. The candidates makes a
26
H446/02 Mark Scheme June 2023
limited attempt to apply acquired knowledge and actual board if needed, for example to simulate
understanding to the context provided. potential changes.
The candidate provides a limited discussion which is
narrow in focus. Judgements if made are weak and
unsubstantiated.
The information is basic and comunicated in an
unstructured way. The information is supported by
limited evidence and the relationship to the evidence
may not be clear.

0 marks
No attempt to answer the question or response is not
worthy of credit.

27
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

Alternatively, you can email us on

[email protected]

For more information visit

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
2023 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.

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.