OCR A-Level · Exam Tips

Computer Science - H446 Exam Tips

Master the OCR A Level Computer Science (H446) exam with evidence-based tips. Learn how to maximize marks on high-tariff essays, avoid case-sensitivity pitfalls in LMC, and structure flawless OOP code.

3 min readUpdated: Jun 21, 2026

Exam at a Glance

Papers
2
Total Marks
280
Time Limit
5h
Question Types
3
PaperDurationMarksQuestionsWeightingQuestion Types
Computer Systems2h 30min1403340%short_answer, structured_theory, extended_essay
Algorithms and Programming2h 30min1403340%short_answer, structured_algorithmic, extended_essay, structured_oop_code, code_completion_and_debugging, extended_essay
Grade Scale
A*ABCDEU
Calculator Policy

A scientific or graphical calculator that meets JCQ regulations may be used (some GCSE Mathematics and Science papers are non-calculator). Graphical calculators must be set to exam mode; you must clear any stored programs, notes or data before the exam, and the calculator must not be able to retrieve stored text or formulae.

  • AO1: AO1: Demonstrate knowledge and understanding of the principles and concepts of computer science. (35%)
  • AO2: AO2: Apply knowledge and understanding of the principles and concepts of computer science to a given scenario, including the analysis of problems in computational terms. (40%)
  • AO3: AO3: Design, write and evaluate computer programs. Solve problems, evaluate systems and improve design. (25%)

Built from real past papers and marking schemes (2022–2024).

Tips & Strategies

Where the Marks Really Hide

In OCR A Level Computer Science (H446), high-scoring students aren't just memorizing facts (AO1); they excel at contextual application (AO2) and evaluation (AO3). In both Paper 1 and Paper 2, the high-tariff 9-mark and 12-mark questions (indicated with an asterisk *) require you to structure balanced arguments rather than simply dump lists of facts. For example, when comparing system life cycles or database models, examiners consistently penalize candidates who fail to reference the specific scenario given in the prompt (such as Rosa's gym or a delivery scheduling system). To secure top-tier marks, you must explicitly link the advantages and disadvantages of a technology directly to the needs, constraints, and scale of the user in the scenario.

The 1-Minute-Per-Mark Golden Rule

Both papers are exactly 150 minutes long for a total of 140 marks, which gives you roughly 1.07 minutes per mark. To manage your time effectively, aim to work at a pace of 1 mark per minute. This will leave you with a crucial 10-minute buffer at the end of the exam. Use this extra time specifically to scan your code and trace tasks for fatal, easily missed errors like incorrect loop termination boundaries, missing file-handling speech marks, or case-sensitivity mismatches in assembly languages.

Mastering the Command Words: Explain, Describe, and Write

Understanding the exact requirements of OCR's command words is the easiest way to prevent dropped marks:

  • Describe: Requires you to state a characteristic and expand upon it with an explanation of how it works. For example, describing the Fetch stage requires stating not just the registers involved (PC, MAR, MDR, CIR) but also how data and control signals are transmitted along specific buses (address bus, data bus, control bus).
  • Discuss: This is your cue for a levels-of-response essay. You must show knowledge (AO1), apply it to the scenario (AO2), and make a reasoned evaluation or final recommendation (AO3).
  • Write code / Complete pseudocode: When designing algorithms, make sure you write complete, syntactically correct constructs. Never leave dangling variables, and make sure that any function or procedure headers match their parameters precisely.

The Anatomy of a Perfect OOP Class Definition

Object-Oriented Programming (OOP) questions in Section B of Paper 2 are highly structured. Examiners report that many students write pythonic syntax without respecting OCR's formal pseudocode guidelines. To write a flawless class definition, ensure you follow this template:

  1. Declare the class header clearly: class Dog
  2. Declare all attributes as private with their data types: private name : string
  3. Write the constructor as a public procedure named new() or matching the exact class name: public procedure new(pName)
  4. Explicitly assign parameters to attributes: name = pName
  5. Ensure getters are declared as functions that return values, while setters are procedures that do not.

What Top Scorers Do Differently

  • Trace Tables: When executing algorithms like Dijkstra or A*, top scorers never just write down the final path. They systematically show their working out by overwriting temporary distance values (e.g., showing 19 being crossed out and replaced with 14 at a node) and updating the "Previous node" column in real time.
  • Strict Logic & Notation: In Boolean simplification tasks, they apply De Morgan's Law carefully by changing the operator (OR to AND, or vice-versa) at the same time they negate individual terms, rather than making careless partial adjustments.
  • Register and Bus Clarity: When explaining the FDE cycle, they specify exactly which register contents are copied to which bus (e.g., Program Counter copied to MAR via the address bus), instead of writing vague descriptions like "the CPU gets the address."

Calculator Programs

Graph: zeros, intersections & turning points

Graphical calculator / GDC (exam mode)

Purpose: Plot a function to read its roots (zeros), points of intersection, and maxima/minima.

When to use it: Checking solutions, sketching, or solving where an analytic method is hard.

Steps
Graph the function(s) and use the built-in zero, intersect and maximum/minimum tools.

Exam note: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.

Numerical equation solver

Graphical calculator / GDC (exam mode)

Purpose: Solve an equation or find a variable numerically when an algebraic route is long or implicit.

When to use it: Iterative or implicit equations, or to confirm an algebraic solution.

Steps
Use the equation/zero solver, entering the equation and a sensible starting estimate.

Exam note: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.

Numerical integration & differentiation

Graphical calculator / GDC (exam mode)

Purpose: Evaluate a definite integral \(\int_a^b f(x)\,dx\) or a gradient \(f'(x)\) at a point.

When to use it: Checking calculus answers, or where only a numerical value is needed.

Steps
Use the GDC's numeric integral / derivative function with the limits or the point.

Exam note: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.

Statistics & probability distributions

Graphical calculator / GDC (exam mode)

Purpose: 1-var/2-var statistics, linear regression, and cumulative binomial / normal / Poisson probabilities without tables.

When to use it: Statistics questions and hypothesis tests.

Steps
Enter data in the statistics editor, or use the distribution menu (binomial cdf, normal cdf, …).

Exam note: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.

Common Mistakes

  1. 1highMarks at stake: 4Software Development

    Failing to relate comparative technology facts directly to the given scenario context in essay questions.

    How to avoid it: Explicitly mention the users, systems, or entities defined in the prompt (e.g., Rosa's gym, the mobile staff) to justify why a specific system is suitable.
  2. 2mediumMarks at stake: 2Types of Programming Language

    Mixing case sensitivity in Little Man Computer (LMC) labels, leading to trace and logic errors.

    How to avoid it: Ensure all variables, mnemonics, and labels strictly match the casing defined in DAT declarations (usually UPPERCASE).
  3. 3highMarks at stake: 3Structure and function of the processor

    Confusing pipelining with parallel processing or multi-core execution.

    How to avoid it: Describe pipelining as overlapping the FDE stages of different instructions to increase throughput, not executing multiple instructions simultaneously on different cores.
  4. 4mediumMarks at stake: 2Boolean Algebra

    Incorrectly applying De Morgan's Law by failing to change the operator (OR to AND, or vice-versa) during negation.

    How to avoid it: Remember to change the operator (+ to . or . to +) when negating terms individually: NOT(A OR B) becomes NOT A AND NOT B.
  5. 5mediumMarks at stake: 3Data Types

    In floating-point conversions, shifting the binary point in the wrong direction or failing to pad the shifted mantissa with trailing zeros to maintain an 8-bit length.

    How to avoid it: Verify the exponent value direction and pad any shifted mantissa with trailing zeros so it precisely fills the 8-bit size requirement.
  6. 6highMarks at stake: 2Algorithms

    Omit showing the step-by-step overwriting of temporary distances in Dijkstra's/A* algorithm tables.

    How to avoid it: Explicitly draw a strike-through or show updated temporary values in the table to fully document the algorithm's execution state changes.
  7. 7mediumMarks at stake: 3Programming techniques

    Writing setter methods or return statements inside procedures, or using inconsistent self-syntax in Object-Oriented coding.

    How to avoid it: Declare setters as procedures (no return value) and getters as functions (must return). Use a consistent pseudocode parameter-naming pattern.

Turn these tips into top grades

thinka turns your weak spots into targeted practice, with instant marking and exam-style feedback. Study smarter, not longer.

Practise real exam questions with instant AI feedback and marking.

Start Practising Free