Past Paper Analysis: J277/02

Component: Computational thinking, algorithms and programming
Scope: June 2022 - June 2025

June 2025

Overview: Follows standard structure. Section A focuses on fundamentals (Testing, Logic, IDEs), Section B on specific scenarios involving sorting and searching.
Q# Marks Command Word Question Type Specification Point
1(a) 4 Tick (✓) Testing Data 2.3.2 Testing (Normal, Boundary, Invalid, Erroneous)
1(b)(i) 3 Complete Algorithm Completion 2.2.1 Programming fundamentals (Selection)
1(b)(ii) 1 Give Identifier 2.2.1 Programming fundamentals (Variables)
1(b)(iii) 1 Give Boolean Operator 2.2.1 Programming fundamentals (Operators)
2(a) 4 Complete Trace Table 2.1.2 Designing algorithms (Trace tables)
2(b)(i) 2 Identify Iteration 2.2.1 Programming fundamentals (Count/Condition loops)
2(b)(ii) 2 Give Constructs 2.2.1 Programming fundamentals (Sequence, Selection)
2(c) 2 Identify IDE Tools 2.5.2 IDE Tools
6(b) 3 Tick (✓) Sorting Characteristics 2.1.3 Sorting algorithms (Insertion vs Bubble)
6(c)(i) 1 Give Search Name 2.1.3 Searching algorithms (Linear search)
6(c)(ii) 1 Identify Stop Condition 2.1.3 Searching algorithms
High Marks ? Design Algorithm Writing 2.2.3 Programming techniques (Strings/Authentication)

June 2024

Overview: Shift in structure noted (Section A Q1-Q8, Section B Q9). Heavy focus on loops, flowcharts, testing, and a multi-part practical scenario.
Q# Marks Command Word Question Type Specification Point
1 2 Complete Code / Loop 2.2.1 Iteration (While loop)
2 4 Draw Flowchart 2.1.2 Flowchart symbols
3(a) 2 Define Error Types 2.3.2 Syntax errors
3(b) 2 Identify Debugging 2.3.2 Logic vs Syntax errors
4(a) 1 Identify IDE Features 2.5.2 IDE tools
4(b) 2 Describe IDE Tools 2.5.2 Editor/Debugger
5(b) 3 Trace Logic/Trace Table 2.4.1 Boolean logic
6(a) 2 Describe Search Algorithm 2.1.3 Binary/Linear search
6(b) 4 Show Sorting Steps 2.1.3 Bubble/Insertion sort
7(a) 2 State Data Rep 2.2.2 Casting/ASCII
7(b) 2 Write String Manipulation 2.2.3 Strings
8(a) 3 Complete Testing 2.3.2 Test data types
8(b) 4 Write Defensive Design 2.3.1 Validation
9(a) 4 Design Algorithm Design 2.1.2 Structure diagrams
9(b) 6 Write Practical Programming 2.2.3 File handling
9(c) 4 Refine Refinement 2.3.1 Maintainability
9(f) 6 Write Practical Programming 2.2.3 Arrays/Loops

June 2023

Overview: Section A (Q1–Q5) covers languages, errors, sorting, and logic. Section B (Q6) is the practical programming scenario focusing on SQL and Arrays.
Q# Marks Command Word Question Type Specification Point
1(a) 4 Tick (✓) Knowledge Recall 2.5.1 High-level vs Low-level
1(b) 2 State Translators 2.5.1 Compilers vs Interpreters
1(c)(i) 1 Identify Operator 2.2.1 Arithmetic operators
1(c)(ii) 1 Write Code / Operator 2.2.1 MOD/DIV
1(c)(iii) 1 Write Assignment 2.2.1 Assignments
1(d) 3 Complete Trace Table 2.1.2 Trace tables
2(a) 2 State Error Types 2.3.2 Syntax vs Logic errors
2(b) 4 Identify/Correct Debugging 2.3.2 Identifying errors
3(a) 2 Describe Variable Purpose 2.2.1 Variables
3(b) 3 Explain Algorithm Structure 2.1.2 Nested loops
3(c) 4 Complete Sorting Algorithm 2.1.3 Insertion sort
4(a) 3 Draw Logic Diagram 2.4.1 Logic diagrams
4(b) 2 Complete Truth Table 2.4.1 Truth tables
5(a) 2 Describe Defensive Design 2.3.1 Input validation
5(b) 4 Write Algorithm Writing 2.3.1 Auth/Validation
6(a) 2 Identify Data Types 2.2.2 Data types
6(b) 6 Write Practical Programming 2.2.3 SQL
6(c) 6 Write Practical Programming 2.2.3 Arrays/Functions

June 2022

Overview: Section A (Q1–Q4) focuses on theoretical knowledge and short algorithms. Section B (Q5) assesses practical programming skills including File Handling.
Q# Marks Command Word Question Type Specification Point
1(a) 4 Tick (✓) Code Analysis 2.2.1 Programming fundamentals
2(a)(i) 1 Draw Logic Gate 2.4.1 Logic diagrams
2(a)(ii) 2 Describe Boolean Logic 2.4.1 Truth tables
2(a)(iii) 1 State Truth Table Rows 2.4.1 Truth tables
2(b) 5 Design Flowchart 2.1.2 Flowcharts
2(c) 1 Identify Inputs 2.1.2 Inputs/Outputs
2(d)(i) 1 State Data Types 2.2.2 Casting
3(a) 4 Show Trace / Sorting 2.1.3 Merge sort
3(b) 4 Describe Searching Algorithm 2.1.3 Binary search
3(c) 2 State Searching Algorithm 2.1.3 Linear search
4(a) 2 State Subprograms 2.2.3 Sub programs
4(b) 6 Write Algorithm Writing 2.2.3 Functions/Procedures
5(a) 2 State Data Types 2.2.2 Data types
5(b) 4 Write Code / Algorithm 2.2.1 Variables/IO
5(c) 6 Write Practical Programming 2.2.3 File handling