OCR GCSE Computer Science Computational thinking, algorithms and programming (02), June 2025
Every question from OCR GCSE Computer Science Computational thinking, algorithms and programming (02), June 2025 (J277): 6 questions, 80 marks, each with its mark scheme and topic.
- Question 1 9 marks
Identify suitable test data types for a range check, complete an algorithm that validates integer input, and identify a variable and a Boolean operator from the code.
2.1 Algorithms · 2.2 Programming fundamentals · 2.3 Producing robust programs · 2.1.2 Designing, creating and refining algorithms · 2.2.1 Programming fundamentals · 2.3.2 Testing
- Question 2 12 marks
Trace a flowchart containing iteration for given inputs, identify and describe types and constructs of iteration and other programming constructs, and identify and describe IDE tools used when implementing the algorithm.
2.1 Algorithms · 2.2 Programming fundamentals · 2.5 Programming languages and Integrated Development Environments · 2.1.2 Designing, creating and refining algorithms · 2.2.1 Programming fundamentals · 2.5.2 The Integrated Development Environment (IDE)
- Question 3 9 marks
Demonstrate the steps of a merge sort, identify characteristics of sorting algorithms and arrays, and name and describe conditions for a linear search algorithm.
2.1 Algorithms · 2.2 Programming fundamentals · 2.1.3 Searching and sorting algorithms · 2.2.3 Additional programming techniques
- Question 4 6 marks
Complete an algorithm that reads data from an external text file and outputs non-zero values, and identify how casting is used within the algorithm.
2.1 Algorithms · 2.2 Programming fundamentals · 2.1.2 Designing, creating and refining algorithms · 2.2.2 Data types · 2.2.3 Additional programming techniques
- Question 5 14 marks
Draw a logic circuit and truth table, match computational thinking techniques to examples, and write an algorithm to validate a 4-digit PIN.
2.1 Algorithms · 2.2 Programming fundamentals · 2.3 Producing robust programs · 2.4 Boolean logic · 2.1.1 Computational thinking · 2.1.2 Designing, creating and refining algorithms · 2.2.1 Programming fundamentals · 2.2.3 Additional programming techniques · 2.3.1 Defensive design · 2.4.1 Boolean logic
- Question 6 30 marks
Design, trace, and refine algorithms and code for a festival management system, including SQL queries, subprograms, trace tables, and loops.
2.1 Algorithms · 2.2 Programming fundamentals · 2.1.2 Designing, creating and refining algorithms · 2.2.1 Programming fundamentals · 2.2.2 Data types · 2.2.3 Additional programming techniques