OCRA-Level36 resources

OCR A-Level Computer Science Past Papers & Mark Schemes

Free OCR A-Level Computer Science (H446) past papers, mark schemes & moderator reports. Computer Systems, Algorithms and Programming papers plus Programming Project guidance. 33 resources.

πŸ“…June 2017 – June 2024πŸ“„36 resources availableβœ…Free to download

Download Past Papers

Type
Year

36 of 36 resources β€” page 1 of 2

June 2023

6 files
πŸ“„

Computer Science – Question paper – Computer systems

Question Paper
πŸ“Š

Computer Science – Examiners’ report – Computer systems

Examiner Report
πŸ“„

Computer Science – Question paper – Algorithms and programming

Question Paper
βœ…

Computer Science – Mark scheme – Algorithms and programming

Mark Scheme
βœ…

Computer Science – Mark scheme – Computer systems

Mark Scheme
πŸ“Š

Computer Science – Moderators report

Examiner Report

June 2022

6 files
πŸ“„

Computer Science – Question paper – Computer systems

Question Paper
πŸ“Š

Computer Science – Examiners’ report – Computer systems

Examiner Report
πŸ“„

Computer Science – Question paper – Algorithms and programming

Question Paper
βœ…

Computer Science – Mark scheme – Algorithms and programming

Mark Scheme
βœ…

Computer Science – Mark scheme – Computer systems

Mark Scheme
πŸ“Š

Computer Science – Moderators report

Examiner Report

November 2021

5 files
πŸ“„

Computer Science – Question paper – Algorithms and programming

Question Paper
βœ…

Computer Science – Mark scheme – Algorithms and programming

Mark Scheme
πŸ“„

Computer Science – Question paper – Computer systems

Question Paper
βœ…

Computer Science – Mark scheme – Computer systems

Mark Scheme
πŸ“Š

Computer Science – Examiners’ report

Examiner Report

November 2020

7 files
πŸ“„

Computer Science – Question paper – Algorithms and programming

Question Paper
βœ…

Computer Science – Mark scheme – Algorithms and programming

Mark Scheme
πŸ“„

Computer Science – Question paper – Computer systems

Question Paper
βœ…

Computer Science – Mark scheme – Computer systems

Mark Scheme
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“‹

Computer Science – Modified papers

Modified Paper

No date

1 file
πŸ“

Computer Science – Programming project

Sample Assessment Materials

Systems, Algorithms, and a Programming Project: OCR's Three-Part CS Assessment

OCR A-Level Computer Science (H446) is the most widely taken A-Level CS specification in England. It combines two written examinations β€” one on computer systems theory and one on algorithms and programming β€” with a substantial programming project that accounts for 20% of the final grade. Paper 1: Computer Systems (H446/01, 2 hours 30 minutes, 140 marks, 40%) covers the theoretical foundations of computing. Content includes: the characteristics of processors and their architecture (von Neumann, Harvard, CISC vs RISC); input, output, and storage devices; software classification (system software, utility programs, translators); data types and number systems (binary, hexadecimal, two's complement, floating point); data structures (arrays, linked lists, stacks, queues, trees, hash tables, graphs); Boolean algebra and logic gates; legal, moral, and ethical issues; and networking (TCP/IP, protocols, security). Paper 2: Algorithms and Programming (H446/02, 2 hours 30 minutes, 140 marks, 40%) focuses on problem-solving and algorithm design. Content includes: computational thinking (abstraction, decomposition, pattern recognition); algorithm design and complexity (Big O notation); searching algorithms (linear, binary); sorting algorithms (bubble, merge, insertion, quick sort); graph traversal (breadth-first, depth-first); Dijkstra's algorithm; object-oriented programming concepts (inheritance, polymorphism, encapsulation); functional programming (higher-order functions, map, filter, fold); and programming paradigms. The Programming Project (H446/03, NEA, 70 marks, 20%) requires students to design, develop, test, and evaluate a solution to a problem of their choice using a programming language. The project must demonstrate analysis, design, technical skill (including algorithms of appropriate complexity), and evaluation.

Exam Paper Structure

Paper 1Calculator βœ“

Computer Systems

⏱ 2 hours 30 minutes🎯 140 marksπŸ“Š 40% of grade
Processor architecture (von Neumann, Harvard, CISC/RISC)Input/output/storage devicesSoftware (OS, translators, utilities)Data types and number systems (binary, hex, floating point)Data structures (arrays, lists, stacks, queues, trees, graphs, hash tables)Boolean algebra and logic gatesNetworking (TCP/IP, protocols, encryption)Legal, moral, ethical, and cultural issues
Paper 2Calculator βœ“

Algorithms and Programming

⏱ 2 hours 30 minutes🎯 140 marksπŸ“Š 40% of grade
Computational thinking (abstraction, decomposition)Algorithm design and Big O complexitySearching (linear, binary) and sorting (bubble, merge, insertion, quick)Graph traversal (BFS, DFS) and Dijkstra's algorithmOOP (inheritance, polymorphism, encapsulation)Functional programming (higher-order functions, recursion)Programming paradigms comparison
Programming ProjectNo calculator

NEA

⏱ Coursework🎯 70 marksπŸ“Š 20% of grade
Analysis and problem identificationDesign (data structures, algorithms, UI)Implementation with appropriate complexityTesting and evaluation

Key Information

Exam BoardOCR
Specification CodeH446
QualificationA-Level
Grading ScaleA*–E
Assessment Type2 written papers + 1 NEA (programming project)
Number Of Papers2 exams + 1 NEA
Exam DurationPapers 1 & 2: 2h 30m each
Total Marks350 (140 + 140 + 70)
Calculator StatusCalculator allowed in both papers
Available SessionsJune 2017 – June 2024
Total Resources33

Key Topics in Computer Science

Topics you need to know

Processor architecture (fetch-decode-execute cycle, pipelining, multicore)Data representation (binary arithmetic, floating point, character encoding)Data structures (implementation and application of stacks, queues, trees, graphs)Algorithm complexity (Big O notation, space vs time trade-offs)Sorting and searching algorithms (comparative analysis)Object-oriented programming (design patterns, SOLID principles)Functional programming (immutability, pure functions, recursion)Networking and security (encryption, protocols, client-server vs peer-to-peer)

Exam Command Words

Command wordWhat the examiner expects
DescribeGive a detailed account of how a system, algorithm, or process works
ExplainGive reasons for why something happens or why a particular approach is used in computing
WriteProduce pseudocode, a program fragment, or an algorithm to solve a stated problem
StateGive a short, factual answer β€” typically a definition, name, or value
CompareIdentify similarities and differences between two approaches, algorithms, or data structures
TraceFollow the execution of code step by step, recording variable values at each stage
DiscussExamine a computing issue considering multiple viewpoints, advantages, and disadvantages

Typical Grade Boundaries

GradeApproximate mark needed
A*72–84%
A61–71%
B51–60%
C41–50%
D32–40%
E23–31%

⚠️ Typical boundaries across two papers and NEA (350 total marks). Actual boundaries vary by series β€” check OCR's website.

Pseudocode Fluency, Algorithm Tracing, and Building a Portfolio-Worthy Project

OCR's pseudocode conventions are used consistently in Paper 2. Familiarise yourself with OCR's specific syntax for assignment (=), comparison (==), logical operators (AND, OR, NOT), array access, function definitions, and class declarations. Questions frequently ask you to trace through pseudocode, modify it, or identify errors β€” you need to read it as fluently as you read a programming language you actually use. Algorithm complexity questions (Big O notation) appear in almost every Paper 2 sitting. Know the complexities of standard algorithms β€” O(n) for linear search, O(log n) for binary search, O(nΒ²) for bubble sort, O(n log n) for merge sort β€” and be able to determine the complexity of short code snippets by counting nested loops. A common trap is confusing best-case, average-case, and worst-case complexity: OCR typically asks for worst-case unless stated otherwise. The programming project (NEA) is worth 20% but is the component where the most marks are lost through poor documentation rather than poor programming. The analysis must demonstrate genuine investigation of the problem (not just a restatement of the task); the design must use recognised techniques (data flow diagrams, ER diagrams, class diagrams); the implementation must include algorithms of genuine complexity (not just CRUD operations); and the evaluation must be honest about limitations and link back to objectives. Boolean algebra questions in Paper 1 follow a limited set of patterns: simplifying expressions using De Morgan's laws, constructing truth tables, drawing logic circuits, and converting between logic gate diagrams and Boolean expressions. These are among the most predictable marks in the exam β€” practise until the laws are automatic.

More OCR A-Level Subjects

Explore other A-Level subjects from OCR

Related Past Papers

AI-Powered Revision

Meet your AI Tutor

Get clear explanations, worked examples, and step-by-step guidance on any A-Level Computer Science topic. Your personal AI tutor, free to try.

βœ“ No credit card requiredβœ“ Covers all OCR topicsβœ“ Instant answers