Checked against official spec

A-Level Computer Science (H446) Specification

The OCR A-Level Computer Science specification (H446): 2 written papers, a programming project (non-exam assessment) and the systems + algorithms structure.

Source: OCR, v3.0 (first teaching 2015) · Reviewed by Jonathan Ellis · Last reviewed 2026-08-05

specification overview

OCR A-Level Computer Science (H446) is a two-year linear qualification split between two written papers and a programming project. Component 01 (Computer Systems) is worth 40%, Component 02 (Algorithms and Programming) is worth 40%, and Component 03/04 (the Programming Project, non-exam assessment) is worth 20%.

specification overview

subject content

  1. 1.1. The characteristics of contemporary processors, input, output and storage devices

    Component 01
    • CPU architecture, fetch-decode-execute cycle
    • Memory, storage and I/O devices
  2. 1.2. Software and software development

    Component 01
    • Types of software; systems software; applications software
    • Programming paradigms and software development methodologies
  3. 1.3. Exchanging data

    Component 01
    • Compression, encryption and hashing
    • Databases, SQL and normalisation
    • Networks, protocols and the internet
  4. 1.4. Data types, data structures and algorithms

    Component 01
    • Primitive and composite data types
    • Data structures (arrays, linked lists, trees, stacks, queues, hash tables)
    • Boolean algebra and logic gates
  5. 1.5. Legal, moral, cultural and ethical issues

    Component 01
    • Computing legislation and privacy
    • Ethical issues in computing
  6. 2.1. Elements of computational thinking

    Component 02
    • Abstraction, decomposition, pattern recognition and algorithms
    • Thinking procedurally, logically, concurrently and abstractly
  7. 2.2. Problem solving and programming

    Component 02
    • Programming techniques and structured problem-solving
    • Software development lifecycle
  8. 2.3. Algorithms

    Component 02
    • Algorithm analysis (Big-O)
    • Standard algorithms (searching, sorting, graph traversal, path-finding)
subject content

assessment structure

PaperComponent 01 (Computer systems)
What's assessedTopics 1.1-1.5: architecture, software, exchanging data, data structures, ethics
Length2h 30m
Marks140
Weight40%
Question typesShort-answer, structured and extended-response questions
PaperComponent 02 (Algorithms and programming)
What's assessedTopics 2.1-2.3: computational thinking, problem-solving, algorithms
Length2h 30m
Marks140
Weight40%
Question typesShort-answer, structured and extended-response questions including algorithm and code writing
PaperComponent 03/04 (Programming project)
What's assessedNon-exam assessment: a student-chosen practical programming project
LengthCoursework
Marks70
Weight20%
Question typesAnalysis, design, development, testing and evaluation of a substantial programming project

The Programming Project (Component 03 or 04) is a substantial NEA worth 20% of the A-Level. The two components are the same assessment and differ only in the moderation route: H446/03 is work uploaded electronically (OCR Repository / Submit for Assessment), while H446/04 is a sample posted to the moderator. Language choice is identical either way.

assessment structure

assessment objectives

AOAO1
What it meansDemonstrate knowledge and understanding of the principles and concepts of computer science, including abstraction, logic, algorithms and data representation.
Overall35%
AOAO2
What it meansApply knowledge and understanding of the principles and concepts of computer science including to analyse problems in computational terms.
Overall30%
AOAO3
What it meansDesign, program and evaluate computer systems that solve problems, making reasoned judgements about these and presenting conclusions.
Overall35%
assessment objectives

key tips for success

  • Start the programming project early

    The NEA is 20% and needs substantial development time. Start scoping the problem in year 12 rather than leaving it for year 13.

  • Master Big-O analysis

    Component 02 tests algorithm analysis. Practise deriving Big-O for common algorithms (bubble sort, quicksort, mergesort, binary search, graph traversal, path-finding).

  • Learn standard algorithms cold

    Searching (linear, binary), sorting (bubble, insertion, merge, quick), graph traversal (BFS, DFS), path-finding (Dijkstra, A*). Know how to trace and code each.

  • Practise database and SQL

    Component 01 tests relational databases through to 3NF. Practise writing SQL SELECT/JOIN/GROUP BY queries and normalising unstructured tables.

  • Know the TCP/IP stack

    Application, transport, network, link layers. Understand which protocols sit at each layer (HTTP, TCP, IP, Ethernet). Consistently examined on Component 01.

  • Understand programming paradigms

    Procedural, object-oriented, functional, declarative. Understand differences, when each is appropriate and how to identify them in unfamiliar code.

key tips for success

Where to next

Start your learning journey today...

Practise with Cognito's free past papers for this spec – or browse grade boundaries and related specifications.

Where to next

Frequently asked questions