Home
Subjects
Past papers
Key terms
Pricing

My courses

Select your courses

Loading…

Subjects

History
Geography
Biology
Chemistry
Physics
Combined Science
Mathematics
Classics
Business
Computer Science
Religious Studies
Statistics
Physical Education
Design and Technology
Food Preparation and Nutrition

Resources

Browse courses
Past papers
Key terms & definitions
Pricing

About

Not affiliated with any exam board.

Home
Subjects
Past papers
Key terms
Pricing

My courses

Select your courses

Loading…

Subjects

History
Geography
Biology
Chemistry
Physics
Combined Science
Mathematics
Classics
Business
Computer Science
Religious Studies
Statistics
Physical Education
Design and Technology
Food Preparation and Nutrition

Resources

Browse courses
Past papers
Key terms & definitions
Pricing

About

Not affiliated with any exam board.

Home
Computer Science
OCR GCSE Computer Science
Paper 2

OCR GCSE Computer Science · J277

OCR GCSE Computer Science Paper 2

Computational thinking, algorithms and programming

Length: 1 hour 30 minutes
Marks: 80
Weighting: 50% of the GCSE

From the OCR specification (opens in a new tab), Version 3.1 (May 2026), PDF page 25.

5 sections · 36 revision notes

What’s on Paper 2

2.1 Algorithms

Computational Thinking · Designing, Creating and Refining Algorithms · Searching and Sorting Algorithms8 notes

2.1.1 Computational Thinking

Computational Thinking Principles Free

2.1.2 Designing, Creating and Refining Algorithms

Paper 2 past papers

We can’t match OCR GCSE Computer Science’s past papers to Paper 2 yet.

All OCR GCSE Computer Science past papers

Other papers

Paper 1

Inputs, Processes, and Outputs

Pro

Structure Diagrams Pro

Algorithm Creation and Refinement Pro

Identifying Common Errors Pro

Trace Tables Pro

2.1.3 Searching and Sorting Algorithms

Standard Searching Algorithms Pro
Standard Sorting Algorithms Pro

Algorithms overview

2.2 Programming Fundamentals

Programming Basics · Data Types · Additional Programming Techniques12 notes

2.2.1 Programming Basics

Variables, Constants, and Operators Free
Basic Programming Constructs Pro
Common Arithmetic Operators Pro
Common Boolean Operators Pro

2.2.2 Data Types

Use of Data Types Pro

2.2.3 Additional Programming Techniques

Basic String Manipulation Pro
Basic File Handling Operations Pro
Using Records to Store Data

Programming Fundamentals overview

2.3 Producing Robust Programs

Defensive Design · Testing8 notes

2.3.1 Defensive Design

Defensive Design Considerations Free
Input Validation Pro
Program Maintainability Pro

2.3.2 Testing

Purpose of Testing Pro
Types of Testing Pro
Syntax and Logic Errors Pro

Producing Robust Programs overview

2.4 Boolean Logic

Boolean Logic4 notes

2.4.1 Boolean Logic

Simple Logic Diagrams Free
Truth Tables Pro
Combining Boolean Operators Pro
Applying Logical Operators Pro

Boolean Logic overview

2.5 Programming Languages and IDEs

Programming Languages · Integrated Development Environments4 notes

2.5.1 Programming Languages

Levels of Programming Languages Free
Purpose of Translators Pro
Compilers and Interpreters Pro

2.5.2 Integrated Development Environments

IDE Tools and Facilities Pro

Programming Languages and IDEs overview

Pro

Using SQL to Search Data Pro

1D and 2D Arrays Pro

Using Subprograms Pro

Random Number Generation Pro

Selecting Suitable Test Data Pro

Refining Algorithms Pro