Sample · Read-only

Sample Scheme of Work

OCR GCSE J277 · 2 lessons per week · 07 Sep 2026 to 01 May 2028 · exams from 15 May 2028

64Teaching weeks
102Lessons
8Assessments
2Mock weeks
This is a read-only sample.
Build your own in a couple of minutes. Free, no sign-up needed. Choose your exam board, term dates, lessons per week and how you want to weight each topic.
Build your own
Week
Starting
Lessons
Autumn 1 26/27
1
07 Sep 2026
Coding
Variables, Constants and Data Types J277 2.2.1
Variables, constants, data types and casting
Teach this first - students need a programming foundation before theory topics make sense.
5 learning objectives
  1. Name and describe the five fundamental data types: integer, float, string, boolean and character.
  2. Declare variables and constants correctly in both Python and C#.
  3. Identify the appropriate data type for a given real-world scenario.
  4. Cast between types using int(), float(), str() and their C# equivalents.
  5. Explain what happens when an invalid cast is attempted.
Coding
Variables, Constants and Data Types J277 2.2.1
Variables, constants, data types and casting
Teach this first - students need a programming foundation before theory topics make sense.
5 learning objectives
  1. Name and describe the five fundamental data types: integer, float, string, boolean and character.
  2. Declare variables and constants correctly in both Python and C#.
  3. Identify the appropriate data type for a given real-world scenario.
  4. Cast between types using int(), float(), str() and their C# equivalents.
  5. Explain what happens when an invalid cast is attempted.
2
14 Sep 2026
Coding
Variables, Constants and Data Types J277 2.2.1
Variables, constants, data types and casting
Teach this first - students need a programming foundation before theory topics make sense.
5 learning objectives
  1. Name and describe the five fundamental data types: integer, float, string, boolean and character.
  2. Declare variables and constants correctly in both Python and C#.
  3. Identify the appropriate data type for a given real-world scenario.
  4. Cast between types using int(), float(), str() and their C# equivalents.
  5. Explain what happens when an invalid cast is attempted.
Coding
Input, Output and String Handling J277 2.2.1
Input, output and string handling operations
Covers J277 2.2.2 (sequence) and 2.2.3 (string handling) together.
5 learning objectives
  1. Use input() and Console.ReadLine() to read user input and cast to required types.
  2. Use print() / Console.WriteLine() to output values, including f-strings and string interpolation.
  3. Apply string operations: length, upper, lower, index access, slicing and find.
  4. Explain the difference between Python slicing (end index) and C# Substring (length).
  5. Convert between characters and ASCII codes using ord/chr in Python and (int)/(char) in C#.
3
21 Sep 2026
Coding
Input, Output and String Handling J277 2.2.1
Input, output and string handling operations
Covers J277 2.2.2 (sequence) and 2.2.3 (string handling) together.
5 learning objectives
  1. Use input() and Console.ReadLine() to read user input and cast to required types.
  2. Use print() / Console.WriteLine() to output values, including f-strings and string interpolation.
  3. Apply string operations: length, upper, lower, index access, slicing and find.
  4. Explain the difference between Python slicing (end index) and C# Substring (length).
  5. Convert between characters and ASCII codes using ord/chr in Python and (int)/(char) in C#.
Coding
Input, Output and String Handling J277 2.2.1
Input, output and string handling operations
Covers J277 2.2.2 (sequence) and 2.2.3 (string handling) together.
5 learning objectives
  1. Use input() and Console.ReadLine() to read user input and cast to required types.
  2. Use print() / Console.WriteLine() to output values, including f-strings and string interpolation.
  3. Apply string operations: length, upper, lower, index access, slicing and find.
  4. Explain the difference between Python slicing (end index) and C# Substring (length).
  5. Convert between characters and ASCII codes using ord/chr in Python and (int)/(char) in C#.
4
28 Sep 2026
Coding
Arithmetic and Boolean Operators J277 2.2.1
Arithmetic and Boolean operators
Also a good point to introduce random number generation (J277 2.2.4) as a brief aside - not a standalone lesson in the curriculum.
5 learning objectives
  1. Use all arithmetic operators including %, //, ** and explain the difference between / and // in Python.
  2. Explain why C# integer division differs from Python's / operator.
  3. Apply MOD to real problems: even/odd, digit extraction, time conversion.
  4. Use AND, OR and NOT (Python) and &&, || and ! (C#) to build compound conditions.
  5. Apply BIDMAS precedence rules to predict the value of complex expressions.
Theory+Coding
Sequence, Selection and Iteration J277 2.2.1
Sequence, selection and iteration - conceptual overview
Teach the concept before the syntax. This lesson from the Algorithms series sets up the next three programming lessons.
5 learning objectives
  1. Define sequence, selection and iteration and explain the role of each in algorithm design.
  2. Write correct pseudocode using IF/ELSEIF/ELSE for single and multi-branch selection.
  3. Write correct pseudocode for count-controlled (FOR) and condition-controlled (WHILE) loops.
  4. Identify which loop type is more appropriate for a given scenario and justify the choice.
  5. Trace an algorithm that combines all three constructs and produce the correct output.
5
05 Oct 2026
Coding
Selection: IF, ELIF, ELSE J277 2.2.1
Selection - if, elif, else
5 learning objectives
  1. Write single-branch (IF), two-branch (IF/ELSE) and multi-branch (IF/ELIF/ELSE) selection in Python and C#.
  2. Correctly order conditions in an elif chain from most to least restrictive.
  3. Explain the difference between separate IF statements and an elif chain.
  4. Write and trace nested IF statements.
  5. Identify condition-ordering bugs and correct them.
Coding
Selection: IF, ELIF, ELSE J277 2.2.1
Selection - if, elif, else
5 learning objectives
  1. Write single-branch (IF), two-branch (IF/ELSE) and multi-branch (IF/ELIF/ELSE) selection in Python and C#.
  2. Correctly order conditions in an elif chain from most to least restrictive.
  3. Explain the difference between separate IF statements and an elif chain.
  4. Write and trace nested IF statements.
  5. Identify condition-ordering bugs and correct them.
6
12 Oct 2026
Coding
Count-Controlled Iteration: FOR Loops J277 2.2.1
Count-controlled iteration - for loops
5 learning objectives
  1. Write FOR loops using range() with one, two and three arguments.
  2. Use negative step values to count downwards.
  3. Write accumulator patterns: initialise before loop, update inside loop.
  4. Write and trace nested FOR loops, counting total iterations.
  5. Complete trace tables for FOR loops showing loop variable and accumulator at each step.
Coding
Count-Controlled Iteration: FOR Loops J277 2.2.1
Count-controlled iteration - for loops
5 learning objectives
  1. Write FOR loops using range() with one, two and three arguments.
  2. Use negative step values to count downwards.
  3. Write accumulator patterns: initialise before loop, update inside loop.
  4. Write and trace nested FOR loops, counting total iterations.
  5. Complete trace tables for FOR loops showing loop variable and accumulator at each step.
7
Assessment
19 Oct 2026
Coding
Condition-Controlled Iteration: WHILE Loops J277 2.2.1
Condition-controlled iteration - while loops
5 learning objectives
  1. Write WHILE loops with correct condition syntax in Python and C#.
  2. Identify and fix infinite loop bugs (missing variable update).
  3. Write validation loops that reject invalid input.
  4. Use sentinel values to control input-collection loops.
  5. Justify when a WHILE loop is more appropriate than a FOR loop.
Assessment
Formal assessment 1 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Autumn 2 26/27
8
02 Nov 2026
Coding
Exception Handling J277 2.3.1
Exception handling; defensive design and testing
Covers exception handling (2.3.1 - defensive design) and introduces testing concepts (2.3.2). Dedicated testing lesson not in curriculum - supplement with a CodeBash task.
5 learning objectives
  1. Identify and distinguish syntax errors, runtime exceptions and logic errors with examples of each.
  2. Use try, except and finally to handle runtime exceptions gracefully.
  3. Name and recognise common exception types: ValueError, ZeroDivisionError, IndexError, FileNotFoundError, TypeError.
  4. Raise exceptions deliberately using raise in Python and throw in C#.
  5. Explain what is meant by "robust" code and why defensive programming matters in real systems.
Theory
Database Concepts J277 2.2.3
Database concepts - tables, fields, records, primary key
OCR J277 2.2.9 requires basic SQL. The full relational design content (L2) is beyond spec but provides useful context.
5 learning objectives
  1. Define database, flat-file database and relational database.
  2. Explain what data redundancy is and why it causes problems.
  3. Identify tables, records and fields in a given database structure.
  4. Select appropriate data types for given fields and justify the choice.
  5. Define primary key and state the three rules it must satisfy.
9
09 Nov 2026
Theory
Relational Design and ER Diagrams J277 2.2.3
Relational design - normalisation context, ER diagrams (beyond spec, contextual)
Optional for GCSE - beyond J277 spec but helps students understand WHY SQL exists. Mark as enrichment in the SoW.
5 learning objectives
  1. Define foreign key and explain how it links two tables.
  2. Distinguish between one-to-one, one-to-many and many-to-many relationships with examples.
  3. Describe what a junction table is and when it is needed.
  4. Draw a simple ER diagram using correct notation (rectangles, diamonds, ellipses, multiplicity).
  5. Interpret an ER diagram and describe the relationship in words.
Coding
SQL: Querying Data J277 2.2.3
SQL querying - SELECT, FROM, WHERE
5 learning objectives
  1. Write a SELECT query using FROM and WHERE for a given scenario.
  2. Use AND and OR to combine conditions in a WHERE clause.
  3. Sort results using ORDER BY ASC and DESC.
  4. Use LIKE with the % wildcard to match patterns.
  5. Trace a given SQL query and predict its output from a table.
10
16 Nov 2026
Coding
SQL: Querying Data J277 2.2.3
SQL querying - SELECT, FROM, WHERE
5 learning objectives
  1. Write a SELECT query using FROM and WHERE for a given scenario.
  2. Use AND and OR to combine conditions in a WHERE clause.
  3. Sort results using ORDER BY ASC and DESC.
  4. Use LIKE with the % wildcard to match patterns.
  5. Trace a given SQL query and predict its output from a table.
Coding
SQL Data Manipulation and SQL Injection J277 2.2.3, J277 1.4.1
SQL data manipulation; SQL injection attacks
SQL injection links back to Cyber L3 (Technical Attacks) - good consolidation opportunity.
5 learning objectives
  1. Write an INSERT INTO statement to add a new record.
  2. Write an UPDATE statement to modify existing data.
  3. Write a DELETE statement and explain the risk of omitting WHERE.
  4. Write a query involving two tables with a linking WHERE condition.
  5. Explain what SQL injection is, how it works and how parameterised queries prevent it.
11
23 Nov 2026
Coding
SQL Data Manipulation and SQL Injection J277 2.2.3, J277 1.4.1
SQL data manipulation; SQL injection attacks
SQL injection links back to Cyber L3 (Technical Attacks) - good consolidation opportunity.
5 learning objectives
  1. Write an INSERT INTO statement to add a new record.
  2. Write an UPDATE statement to modify existing data.
  3. Write a DELETE statement and explain the risk of omitting WHERE.
  4. Write a query involving two tables with a linking WHERE condition.
  5. Explain what SQL injection is, how it works and how parameterised queries prevent it.
Lesson
Testing and Debugging J277 2.3.2
Testing methodology and trace tables
Iterative vs terminal testing; normal, boundary and erroneous test data; trace tables for logic errors.
12
30 Nov 2026
Lesson
Defensive Design and Validation J277 2.3.1
Defensive design - input validation and authentication
Range, presence, length and format checks; basic authentication; maintainability.
Coding
Condition-Controlled Iteration: WHILE Loops J277 2.2.1
Condition-controlled iteration - while loops
5 learning objectives
  1. Write WHILE loops with correct condition syntax in Python and C#.
  2. Identify and fix infinite loop bugs (missing variable update).
  3. Write validation loops that reject invalid input.
  4. Use sentinel values to control input-collection loops.
  5. Justify when a WHILE loop is more appropriate than a FOR loop.
13
07 Dec 2026
Coding
Lists and Arrays J277 2.2.3
Lists and arrays - 1D and 2D
Allow 2 lessons - traversal and manipulation of 2D arrays takes time to embed.
5 learning objectives
  1. Create lists and arrays and access elements by zero-based index.
  2. Modify, append, remove and sort list elements.
  3. Traverse a list with a for-in loop and with an index loop.
  4. Create and traverse 2D lists/arrays using grid[row][col].
  5. Identify and explain IndexError (off-by-one) bugs.
Coding
Lists and Arrays (continued) J277 2.2.3
Lists and arrays (continued) - 2D arrays and practice
Continuation of position 8.
5 learning objectives
  1. Create lists and arrays and access elements by zero-based index.
  2. Modify, append, remove and sort list elements.
  3. Traverse a list with a for-in loop and with an index loop.
  4. Create and traverse 2D lists/arrays using grid[row][col].
  5. Identify and explain IndexError (off-by-one) bugs.
14
Assessment
14 Dec 2026
Coding
Subroutines: Procedures and Functions J277 2.2.3
Subroutines - procedures, functions, parameters, return values, scope
Allow 2 lessons - local vs global scope and return values need practice.
5 learning objectives
  1. Define and call subroutines with and without parameters in Python and C#.
  2. Distinguish between procedures (void) and functions (return value).
  3. Explain the difference between parameters and arguments.
  4. Describe local scope and explain why local variables cannot be accessed outside their function.
  5. Use the global keyword in Python and explain when it is needed.
Assessment
Formal assessment 2 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Spring 1 26/27
15
11 Jan 2027
Theory
Computational Thinking J277 2.1.1
Computational thinking - abstraction, decomposition, algorithmic thinking
5 learning objectives
  1. Define computational thinking and state why it is a useful problem-solving approach.
  2. Explain abstraction and give an appropriate real-world example.
  3. Apply decomposition to break a given problem into distinct sub-problems.
  4. Describe pattern recognition and explain how it allows solutions to be reused.
  5. State the three required properties of an algorithm and explain each.
Theory+Coding
Representing Algorithms J277 2.1.2
Designing algorithms - pseudo-code and flowcharts
5 learning objectives
  1. Define pseudocode and explain why it is preferred for algorithm design over real code.
  2. Read and write pseudocode using correct notation for assignment, input, output, selection and iteration.
  3. Identify all five standard flowchart shapes and state the purpose of each.
  4. Complete a trace table for a given algorithm with supplied input values.
  5. Convert between pseudocode and flowchart representations of the same algorithm.
16
18 Jan 2027
Theory+Coding
Representing Algorithms J277 2.1.2
Designing algorithms - pseudo-code and flowcharts
5 learning objectives
  1. Define pseudocode and explain why it is preferred for algorithm design over real code.
  2. Read and write pseudocode using correct notation for assignment, input, output, selection and iteration.
  3. Identify all five standard flowchart shapes and state the purpose of each.
  4. Complete a trace table for a given algorithm with supplied input values.
  5. Convert between pseudocode and flowchart representations of the same algorithm.
Coding
Linear Search J277 2.1.3
Linear search - implementation and trace
5 learning objectives
  1. Describe how linear search works and trace it step by step with a given list and target.
  2. Write pseudocode for linear search that correctly handles "found" and "not found" cases.
  3. State the best, worst and average case number of comparisons for a list of n items.
  4. Identify when linear search is the appropriate choice over binary search.
  5. Compare linear search to binary search in terms of efficiency and requirements.
17
25 Jan 2027
Coding
Linear Search J277 2.1.3
Linear search - implementation and trace
5 learning objectives
  1. Describe how linear search works and trace it step by step with a given list and target.
  2. Write pseudocode for linear search that correctly handles "found" and "not found" cases.
  3. State the best, worst and average case number of comparisons for a list of n items.
  4. Identify when linear search is the appropriate choice over binary search.
  5. Compare linear search to binary search in terms of efficiency and requirements.
Coding
Binary Search J277 2.1.3
Binary search - implementation and comparison with linear search
5 learning objectives
  1. Explain why binary search requires a sorted list.
  2. Describe the role of the low, high and mid pointers in binary search.
  3. Calculate the mid index given low and high values using integer division.
  4. Trace binary search step by step for a given list and target, showing all pointer updates.
  5. Compare binary and linear search in terms of efficiency and requirements.
18
01 Feb 2027
Coding
Binary Search J277 2.1.3
Binary search - implementation and comparison with linear search
5 learning objectives
  1. Explain why binary search requires a sorted list.
  2. Describe the role of the low, high and mid pointers in binary search.
  3. Calculate the mid index given low and high values using integer division.
  4. Trace binary search step by step for a given list and target, showing all pointer updates.
  5. Compare binary and linear search in terms of efficiency and requirements.
Coding
Bubble Sort J277 2.1.3
Bubble sort - implementation and trace
5 learning objectives
  1. Explain how bubble sort works and why large elements "bubble up" to the end.
  2. Show the state of the list after each pass of a bubble sort trace.
  3. Write pseudocode for bubble sort including the temp variable swap mechanism.
  4. Explain the early termination optimisation and state when it makes the biggest difference.
  5. State the worst-case complexity of bubble sort and identify which input causes it.
19
08 Feb 2027
Coding
Bubble Sort J277 2.1.3
Bubble sort - implementation and trace
5 learning objectives
  1. Explain how bubble sort works and why large elements "bubble up" to the end.
  2. Show the state of the list after each pass of a bubble sort trace.
  3. Write pseudocode for bubble sort including the temp variable swap mechanism.
  4. Explain the early termination optimisation and state when it makes the biggest difference.
  5. State the worst-case complexity of bubble sort and identify which input causes it.
Coding
Insertion Sort and Merge Sort J277 2.1.3
Insertion sort and merge sort - implementation and comparison
5 learning objectives
  1. Describe insertion sort and explain the roles of the key element and sorted sub-list.
  2. Trace insertion sort step by step showing the list state after each insertion.
  3. Explain the divide-and-conquer strategy of merge sort using a diagram.
  4. Trace the merge of two sorted lists into one sorted list.
  5. Compare bubble sort, insertion sort and merge sort in terms of efficiency and use cases.
Spring 2 26/27
20
22 Feb 2027
Theory
What does a computer do? J277 1.1.1
The purpose of the CPU; Von Neumann architecture overview
4 learning objectives
  1. Describe the stored program concept: why storing both instructions and data in memory was the key breakthrough that made general-purpose computers possible.
  2. Explain each stage of the FDE cycle - what is fetched, where it goes, what decoding means, and what execution produces.
  3. Trace the flow of data between the CPU and main memory during a single FDE cycle, naming the registers involved (PC, MAR, MDR, CIR).
  4. Give two concrete real-world examples of the FDE cycle operating at different timescales (e.g. a single keystroke vs rendering a video frame).
Theory
Inside the CPU J277 1.1.1
CPU components (ALU, CU, cache, registers) and the Fetch-Decode-Execute cycle
Core lesson - covers 1.1.2, 1.1.3 and 1.1.4 together.
4 learning objectives
  1. Identify and describe the function of the ALU, Control Unit, and key registers (PC, MAR, MDR, ACC, CIR) and their roles during the FDE cycle.
  2. Explain the purpose of the three bus types - address, data, and control - describing what each carries and in which direction.
  3. Trace data movement through specific registers during fetch, decode, and execute phases, giving the correct register name at each step.
  4. Explain how bus width affects the amount of data transferred per cycle and link this to system performance.
21
01 Mar 2027
Theory
Inside the CPU J277 1.1.1
CPU components (ALU, CU, cache, registers) and the Fetch-Decode-Execute cycle
Core lesson - covers 1.1.2, 1.1.3 and 1.1.4 together.
4 learning objectives
  1. Identify and describe the function of the ALU, Control Unit, and key registers (PC, MAR, MDR, ACC, CIR) and their roles during the FDE cycle.
  2. Explain the purpose of the three bus types - address, data, and control - describing what each carries and in which direction.
  3. Trace data movement through specific registers during fetch, decode, and execute phases, giving the correct register name at each step.
  4. Explain how bus width affects the amount of data transferred per cycle and link this to system performance.
Theory
Why is your CPU fast? J277 1.1.2
CPU performance - cores, cache size, clock speed
Also a good point to cover embedded systems (J277 1.1.6) briefly.
4 learning objectives
  1. Explain how clock speed (in GHz) determines the number of FDE cycles per second, and state why doubling the clock speed does not always double real-world performance.
  2. Describe what CPU cores are and explain why multi-core processors improve throughput for parallelisable tasks but not for inherently serial programs.
  3. Explain how cache memory (L1, L2, L3) reduces average memory access time, and describe what a cache hit and a cache miss mean in practice.
  4. Describe pipelining and explain how overlapping FDE stages increases throughput - and identify at least one situation where it does not help (pipeline hazards).
22
Assessment
08 Mar 2027
Assessment
Formal assessment 3 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Theory
What is AI? J277 1.6.1
What is AI? - introduction to machine learning concepts (enrichment)
Not required by J277 spec. Use as enrichment within the Ethics block for higher-ability classes or when time allows.
3 learning objectives
  1. Explain the difference between a rules-based system and a machine learning system, with a real-world example of each.
  2. Explain why machine learning is preferable when the rules governing a task are too complex or numerous to write explicitly.
  3. Identify at least one risk of using machine learning in a safety-critical context.
23
15 Mar 2027
Theory
Bias, Fairness and Ethics in AI J277 1.6.1
Bias, fairness and ethics in AI (enrichment - directly relevant to 1.6 discussion)
Strongest AI lesson for OCR GCSE context. Pairs well with Ethics L5 (Cultural and Social Impact).
3 learning objectives
  1. Identify and describe at least three types of bias that can affect AI systems, with a real-world example of each.
  2. Explain the real-world consequences of biased AI in at least two contexts: criminal justice and healthcare or employment.
  3. Apply the EU AI Act risk classification framework to classify a new AI system and justify the classification.
Coding
Subroutines: Procedures and Functions (continued) J277 2.2.3
Subroutines (continued) - scope, parameters, consolidation
Continuation of position 10.
5 learning objectives
  1. Define and call subroutines with and without parameters in Python and C#.
  2. Distinguish between procedures (void) and functions (return value).
  3. Explain the difference between parameters and arguments.
  4. Describe local scope and explain why local variables cannot be accessed outside their function.
  5. Use the global keyword in Python and explain when it is needed.
24
22 Mar 2027
Coding
File Handling J277 2.2.3
File handling - reading and writing to text files
5 learning objectives
  1. Open files in read, write and append modes and explain the difference between each.
  2. Read file contents using read(), readline() and readlines().
  3. Write and append text data to a file, including correct use of newline characters.
  4. Explain why closing a file matters and use the with statement as best practice.
  5. Distinguish between sequential and direct access file methods.
Coding
File Handling J277 2.2.3
File handling - reading and writing to text files
5 learning objectives
  1. Open files in read, write and append modes and explain the difference between each.
  2. Read file contents using read(), readline() and readlines().
  3. Write and append text data to a file, including correct use of newline characters.
  4. Explain why closing a file matters and use the with statement as best practice.
  5. Distinguish between sequential and direct access file methods.
25
29 Mar 2027
Theory
Programming Languages: High vs Low Level J277 2.5.1
Levels of language - high-level and low-level; machine code; assembly
4 learning objectives
  1. Describe the characteristics of machine code and explain why programmers rarely write it directly.
  2. Explain what assembly language is and identify a situation where it is preferred over a high-level language.
  3. State three advantages of high-level languages over low-level languages.
  4. Define portability and explain which types of language are portable and why.
Theory
Programming Languages: High vs Low Level J277 2.5.1
Levels of language - high-level and low-level; machine code; assembly
4 learning objectives
  1. Describe the characteristics of machine code and explain why programmers rarely write it directly.
  2. Explain what assembly language is and identify a situation where it is preferred over a high-level language.
  3. State three advantages of high-level languages over low-level languages.
  4. Define portability and explain which types of language are portable and why.
Summer 1 26/27
26
19 Apr 2027
Theory
The memory problem J277 1.2.1
Primary storage - RAM, ROM, volatile/non-volatile, virtual memory
4 learning objectives
  1. Explain the memory hierarchy and state why each level exists: registers are fastest but tiny, RAM is larger but slower, SSD is larger still but orders of magnitude slower.
  2. Compare RAM and ROM by volatility, typical use case, and whether they can be written to at runtime.
  3. Describe virtual memory, why the OS uses it when RAM is full, and what the performance cost is.
  4. Explain the role of cache in the memory hierarchy and link it to the concept of locality of reference.
Theory
The memory problem J277 1.2.1
Primary storage - RAM, ROM, volatile/non-volatile, virtual memory
4 learning objectives
  1. Explain the memory hierarchy and state why each level exists: registers are fastest but tiny, RAM is larger but slower, SSD is larger still but orders of magnitude slower.
  2. Compare RAM and ROM by volatility, typical use case, and whether they can be written to at runtime.
  3. Describe virtual memory, why the OS uses it when RAM is full, and what the performance cost is.
  4. Explain the role of cache in the memory hierarchy and link it to the concept of locality of reference.
27
26 Apr 2027
Theory
Storing data long-term J277 1.2.2
Secondary storage types - magnetic, optical, solid state
4 learning objectives
  1. Describe how magnetic platters, tracks, sectors and the read/write head work together in an HDD, and explain why seek time and rotational latency slow it down.
  2. Explain how a NAND floating-gate transistor stores a binary value by trapping or removing electrons, and describe what wear leveling does and why it is needed.
  3. Describe how data is encoded as pits and lands on an optical disc and how a laser reads it back.
  4. Compare HDD, SSD, optical and flash storage across speed, capacity, cost per GB, portability, durability and volatility - and select and justify the most appropriate type for a given context.
Theory
Translators: Compilers, Interpreters and Assemblers J277 2.5.1
Translators - compilers, interpreters and assemblers
4 learning objectives
  1. Explain what a compiler does and describe what a compiled executable contains.
  2. Explain what an interpreter does and how it differs from a compiler at runtime.
  3. State at least four differences between a compiler and an interpreter.
  4. Explain what an assembler does and state what it translates from and to.
28
03 May 2027
Theory
Translators: Compilers, Interpreters and Assemblers J277 2.5.1
Translators - compilers, interpreters and assemblers
4 learning objectives
  1. Explain what a compiler does and describe what a compiled executable contains.
  2. Explain what an interpreter does and how it differs from a compiler at runtime.
  3. State at least four differences between a compiler and an interpreter.
  4. Explain what an assembler does and state what it translates from and to.
Theory
IDEs and Development Tools J277 2.5.2
IDEs - editor features, debugging tools, error types
4 learning objectives
  1. State at least five features of an IDE and explain the specific benefit of each.
  2. Explain what a breakpoint is and describe how it is used in a debugging session.
  3. Distinguish between a syntax error and a logic error and explain how an IDE helps with each.
  4. Explain how autocomplete reduces bugs as well as speeding up development.
29
Assessment
10 May 2027
Assessment
Formal assessment 4 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Lesson
Records and Structured Data J277 2.2.8
Records and structured data
Group named fields about one entity into a single value (dictionaries / namedtuples / record types).
30
17 May 2027
Coding
Insertion Sort and Merge Sort J277 2.1.3
Insertion sort and merge sort - implementation and comparison
5 learning objectives
  1. Describe insertion sort and explain the roles of the key element and sorted sub-list.
  2. Trace insertion sort step by step showing the list state after each insertion.
  3. Explain the divide-and-conquer strategy of merge sort using a diagram.
  4. Trace the merge of two sorted lists into one sorted list.
  5. Compare bubble sort, insertion sort and merge sort in terms of efficiency and use cases.
Theory+Coding
Evaluating Algorithms J277 2.1.3
Evaluating and comparing algorithms - efficiency and Big-O (introductory)
5 learning objectives
  1. Explain what Big-O notation measures and state the complexity of each algorithm studied.
  2. Compare any two algorithms for a given scenario, addressing efficiency and requirements.
  3. Calculate maximum comparisons for binary search and linear search on a given list size.
  4. Select and justify the most appropriate algorithm for a described real-world scenario.
  5. Answer structured exam questions on algorithm comparison with appropriate technical detail.
31
24 May 2027
Theory
Privacy and Personal Data J277 1.6.1
Privacy and personal data - surveillance, tracking, data collection
4 learning objectives
  1. Distinguish between active and passive digital footprints with examples.
  2. Explain what cookies are and identify the three main types.
  3. State and apply the six GDPR principles to real scenarios.
  4. Analyse the Cambridge Analytica case using correct GDPR terminology.
Theory
Privacy and Personal Data J277 1.6.1
Privacy and personal data - surveillance, tracking, data collection
4 learning objectives
  1. Distinguish between active and passive digital footprints with examples.
  2. Explain what cookies are and identify the three main types.
  3. State and apply the six GDPR principles to real scenarios.
  4. Analyse the Cambridge Analytica case using correct GDPR terminology.
Summer 2 26/27
32
07 Jun 2027
Theory
Number Systems J277 1.2.4
Number systems - binary, denary, hexadecimal; units of storage; conversion
6 learning objectives
  1. State that computers use binary because transistors have two physical states (on/off)
  2. Convert 8-bit binary numbers to denary using place values (128,64,32,16,8,4,2,1)
  3. Convert denary numbers (0-255) to binary using the repeated division method
  4. Use the 4-bit group trick to convert between binary and hexadecimal
  5. Convert 2-digit hex values to denary via binary or direct multiplication
  6. Calculate the minimum number of bits needed to represent n different values
Theory
Number Systems J277 1.2.4
Number systems - binary, denary, hexadecimal; units of storage; conversion
6 learning objectives
  1. State that computers use binary because transistors have two physical states (on/off)
  2. Convert 8-bit binary numbers to denary using place values (128,64,32,16,8,4,2,1)
  3. Convert denary numbers (0-255) to binary using the repeated division method
  4. Use the 4-bit group trick to convert between binary and hexadecimal
  5. Convert 2-digit hex values to denary via binary or direct multiplication
  6. Calculate the minimum number of bits needed to represent n different values
33
14 Jun 2027
Theory
Binary Arithmetic J277 1.2.4
Binary arithmetic - addition, two's complement, overflow
Extension content for many students - consider timing based on ability profile.
5 learning objectives
  1. Apply binary addition rules (0+0, 0+1, 1+1, 1+1+carry) with correct carry propagation
  2. Detect overflow in 8-bit addition and explain why the result is incorrect
  3. Apply left/right binary shifts and state the multiplication/division effect
  4. Convert a positive number to its two's complement negative using flip-and-add-1
  5. Verify a two's complement result using the weighted place value (-128, 64, 32...)
Theory
Binary Arithmetic J277 1.2.4
Binary arithmetic - addition, two's complement, overflow
Extension content for many students - consider timing based on ability profile.
5 learning objectives
  1. Apply binary addition rules (0+0, 0+1, 1+1, 1+1+carry) with correct carry propagation
  2. Detect overflow in 8-bit addition and explain why the result is incorrect
  3. Apply left/right binary shifts and state the multiplication/division effect
  4. Convert a positive number to its two's complement negative using flip-and-add-1
  5. Verify a two's complement result using the weighted place value (-128, 64, 32...)
34
21 Jun 2027
Theory
Character Encoding J277 1.2.4
Character encoding - ASCII and Unicode
5 learning objectives
  1. Explain that character encoding assigns a unique binary number to each character
  2. State that ASCII uses 7 bits (128 characters) with key values: A=65, a=97, 0=48
  3. State the limitation of ASCII (English only, cannot represent global languages)
  4. State one benefit (more characters/languages) and one drawback (larger files) of Unicode
  5. Encode a short word using a given ASCII table in an exam context
Theory
Representing Images J277 1.2.4
Representing images - pixels, colour depth, resolution, file size calculation
6 learning objectives
  1. Define pixel as the smallest element of a digital image with a binary colour value
  2. State that resolution = width x height (number of pixels)
  3. State that colour depth = bits per pixel; more bits = more colours
  4. Apply the file size formula in all required units (bits, bytes, KB, MB)
  5. Calculate minimum bits needed for a given number of colours
  6. Describe the trade-off: higher quality = larger file size
35
Mock prep
28 Jun 2027
Mock exam prep
Mock exam preparation
Past paper walkthroughs, exam technique and timed practice.
Mock exam prep
Mock exam preparation
Past paper walkthroughs, exam technique and timed practice.
36
05 Jul 2027
Theory
Representing Images J277 1.2.4
Representing images - pixels, colour depth, resolution, file size calculation
6 learning objectives
  1. Define pixel as the smallest element of a digital image with a binary colour value
  2. State that resolution = width x height (number of pixels)
  3. State that colour depth = bits per pixel; more bits = more colours
  4. Apply the file size formula in all required units (bits, bytes, KB, MB)
  5. Calculate minimum bits needed for a given number of colours
  6. Describe the trade-off: higher quality = larger file size
Theory
Representing Sound J277 1.2.4
Representing sound - sample rate, sample resolution, file size
5 learning objectives
  1. Explain that sampling converts an analogue wave to digital by measuring amplitude at set intervals
  2. Define sample rate (measurements per second, in Hz) and bit depth (bits per sample)
  3. Explain that higher sample rate and higher bit depth both improve quality and increase file size
  4. Calculate file size using: sample rate x bit depth x duration / 8 = bytes
  5. Complete fill-in-the-gap questions about sound representation using correct terminology
37
Assessment
12 Jul 2027
Assessment
Formal assessment 5 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Theory
Data Compression J277 1.2.5
Data compression - lossy, lossless, run-length encoding, Huffman coding
NOTE: OCR J277 1.2.5 states 'Not required: ability to carry out specific compression algorithms' - RLE and Huffman coding are NOT examined. Teach lossy vs lossless concepts only.
5 learning objectives
  1. Distinguish lossy from lossless compression: lossy removes data permanently, lossless allows exact reconstruction
  2. Apply RLE to a row of pixel data: identify runs, express as count-value pairs
  3. Explain when RLE is ineffective or counterproductive
  4. Describe Huffman coding: shorter codes for more frequent characters
  5. Calculate bit savings from a compression scheme
38
19 Jul 2027
Theory
Data Compression J277 1.2.5
Data compression - lossy, lossless, run-length encoding, Huffman coding
NOTE: OCR J277 1.2.5 states 'Not required: ability to carry out specific compression algorithms' - RLE and Huffman coding are NOT examined. Teach lossy vs lossless concepts only.
5 learning objectives
  1. Distinguish lossy from lossless compression: lossy removes data permanently, lossless allows exact reconstruction
  2. Apply RLE to a row of pixel data: identify runs, express as count-value pairs
  3. Explain when RLE is ineffective or counterproductive
  4. Describe Huffman coding: shorter codes for more frequent characters
  5. Calculate bit savings from a compression scheme
Theory
Legislation J277 1.6.1
Legislation - Computer Misuse Act, Data Protection Act / GDPR, Copyright Act
4 learning objectives
  1. Name the three main offences in the Computer Misuse Act 1990 and their maximum penalties.
  2. Explain the purpose of the DPA 2018, CDPA 1988 and FoIA 2000.
  3. Distinguish between proprietary, open source, freeware and shareware licences.
  4. Apply the correct legislation to a range of exam scenarios.
Autumn 1 27/28
39
06 Sep 2027
Theory
AND, OR and NOT Gates J277 2.4.1
AND, OR and NOT logic gates and truth tables
4 learning objectives
  1. State the rule for AND, OR and NOT gates in plain English.
  2. Construct a full truth table for a two-input gate from memory.
  3. Write a Boolean expression to represent a simple logic rule.
  4. Evaluate a Boolean expression for given input values, showing working.
Theory
AND, OR and NOT Gates J277 2.4.1
AND, OR and NOT logic gates and truth tables
4 learning objectives
  1. State the rule for AND, OR and NOT gates in plain English.
  2. Construct a full truth table for a two-input gate from memory.
  3. Write a Boolean expression to represent a simple logic rule.
  4. Evaluate a Boolean expression for given input values, showing working.
40
13 Sep 2027
Theory
NAND, NOR and XOR Gates J277 2.4.1
NAND, NOR and XOR gates
4 learning objectives
  1. State the rule for NAND, NOR and XOR in plain English.
  2. Complete truth tables for NAND, NOR and XOR from memory.
  3. Explain what is meant by a universal gate and state which gate(s) are universal.
  4. Identify the circuit symbol for NAND and NOR (standard AND/OR shape with inversion bubble).
Theory
Logic Circuits and Truth Tables J277 2.4.1
Logic circuits and full truth tables
4 learning objectives
  1. State the number of truth table rows for a circuit with n inputs using the formula 2^n.
  2. Complete a full truth table for a 2-input or 3-input compound circuit by filling in intermediate columns.
  3. Write the Boolean expression for a circuit by tracing from output back to inputs.
  4. Evaluate a Boolean expression for a given set of input values, showing all working.
41
20 Sep 2027
Theory
Logic Circuits and Truth Tables J277 2.4.1
Logic circuits and full truth tables
4 learning objectives
  1. State the number of truth table rows for a circuit with n inputs using the formula 2^n.
  2. Complete a full truth table for a 2-input or 3-input compound circuit by filling in intermediate columns.
  3. Write the Boolean expression for a circuit by tracing from output back to inputs.
  4. Evaluate a Boolean expression for a given set of input values, showing all working.
Theory
Legislation J277 1.6.1
Legislation - Computer Misuse Act, Data Protection Act / GDPR, Copyright Act
4 learning objectives
  1. Name the three main offences in the Computer Misuse Act 1990 and their maximum penalties.
  2. Explain the purpose of the DPA 2018, CDPA 1988 and FoIA 2000.
  3. Distinguish between proprietary, open source, freeware and shareware licences.
  4. Apply the correct legislation to a range of exam scenarios.
42
27 Sep 2027
Theory
Environmental Impact J277 1.6.1
Environmental impact - energy use, e-waste, carbon footprint of computing
4 learning objectives
  1. Describe the problem of e-waste including specific toxic materials.
  2. Explain why data centres use large amounts of energy and what proportion goes to cooling.
  3. Use real examples (Bitcoin, Ireland) to support arguments about digital environmental impact.
  4. Suggest specific, realistic solutions to reduce environmental impact of technology.
Theory
The Digital Divide J277 1.6.1
The digital divide - access, inclusion and inequality
4 learning objectives
  1. Define the digital divide and explain at least three causes with examples.
  2. Name and describe at least four types of assistive technology.
  3. Evaluate the One Laptop Per Child initiative using specific evidence.
  4. Apply digital divide concepts to new scenarios and suggest realistic solutions.
43
04 Oct 2027
Theory
Cultural and Social Impact J277 1.6.1
Cultural and social impact - automation, AI, employment, health
4 learning objectives
  1. Define automation and explain both positive and negative effects on employment.
  2. Define algorithmic bias and explain how it arises from training data.
  3. Analyse the Facebook mood experiment and Amazon CV tool using ethical frameworks.
  4. Write balanced "evaluate" answers that cover both sides and give a justified conclusion.
Theory
Open Source, Licensing and Exam Technique J277 1.6.1
Open source and licensing; exam technique for ethics questions
4 learning objectives
  1. Compare open source and proprietary software across 6 dimensions with specific examples.
  2. Distinguish between proprietary, open source, freeware, shareware and Creative Commons licences.
  3. Analyse the Munich LiMux case to evaluate trade-offs in open source adoption.
  4. Write a structured evaluate answer that scores full marks: balanced evidence, justified conclusion.
44
Assessment
11 Oct 2027
Assessment
Formal assessment 6 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
Theory
Open Source, Licensing and Exam Technique J277 1.6.1
Open source and licensing; exam technique for ethics questions
4 learning objectives
  1. Compare open source and proprietary software across 6 dimensions with specific examples.
  2. Distinguish between proprietary, open source, freeware, shareware and Creative Commons licences.
  3. Analyse the Munich LiMux case to evaluate trade-offs in open source adoption.
  4. Write a structured evaluate answer that scores full marks: balanced evidence, justified conclusion.
45
18 Oct 2027
Theory
What is a Network? J277 1.3.1
Types of networks - LAN, WAN; network performance factors
4 learning objectives
  1. Define a computer network and state at least three specific benefits of networking with developed justifications.
  2. Distinguish between a LAN and a WAN using geographical size and ownership of infrastructure as the two key criteria.
  3. Identify and describe the function of each key network hardware device: NIC, router, switch, hub, WAP and modem - including the critical differences between router/switch and switch/hub.
  4. Compare client-server and peer-to-peer network models, giving advantages and disadvantages of each in context.
Theory
Network Topologies J277 1.3.1
Network topologies - bus, star, mesh, ring
6 learning objectives
  1. Define network topology and distinguish between physical and logical topology.
  2. Describe and draw star, bus, ring and mesh topologies, identifying nodes and connections.
  3. State at least two advantages and two disadvantages of each topology.
  4. Explain the fault tolerance of each topology, identifying single points of failure.
  5. Apply the formula n(n-1)/2 to calculate connections in a full mesh network.
  6. Justify a topology choice for a given scenario using specific criteria.
Autumn 2 27/28
46
01 Nov 2027
Theory
Network Topologies J277 1.3.1
Network topologies - bus, star, mesh, ring
6 learning objectives
  1. Define network topology and distinguish between physical and logical topology.
  2. Describe and draw star, bus, ring and mesh topologies, identifying nodes and connections.
  3. State at least two advantages and two disadvantages of each topology.
  4. Explain the fault tolerance of each topology, identifying single points of failure.
  5. Apply the formula n(n-1)/2 to calculate connections in a full mesh network.
  6. Justify a topology choice for a given scenario using specific criteria.
Theory
Wired & Wireless Networks J277 1.3.2
Wired and wireless networks - Ethernet, WiFi, Bluetooth, NFC; connection hardware
6 learning objectives
  1. Describe Ethernet (Cat5e/Cat6) including typical speed, range and appropriate use cases.
  2. Explain how fibre optic transmits data using light and why this gives advantages over copper.
  3. Describe Wi-Fi including frequency bands and the role of WAPs in extending coverage.
  4. Distinguish between Wi-Fi (connects to a network) and Bluetooth (direct device-to-device).
  5. List and explain at least four factors that affect wireless network performance.
  6. Recommend and justify a connection type for a given scenario using specific criteria.
47
08 Nov 2027
Theory
The Internet & How Data Travels J277 1.3.2
The internet - IP addressing, DNS, packet switching, routers
6 learning objectives
  1. Explain the structure of an IPv4 address and state the valid range of each octet (0-255).
  2. Compare IPv4 and IPv6, explaining why IPv6 was introduced.
  3. Distinguish between a MAC address and an IP address, explaining the purpose of each.
  4. Describe the DNS lookup process including the role of name servers.
  5. Explain how packet switching works, including the purpose of headers and sequence numbers.
  6. Describe the complete journey of a web request from typing a URL to receiving the page.
Theory
The Internet & How Data Travels J277 1.3.2
The internet - IP addressing, DNS, packet switching, routers
6 learning objectives
  1. Explain the structure of an IPv4 address and state the valid range of each octet (0-255).
  2. Compare IPv4 and IPv6, explaining why IPv6 was introduced.
  3. Distinguish between a MAC address and an IP address, explaining the purpose of each.
  4. Describe the DNS lookup process including the role of name servers.
  5. Explain how packet switching works, including the purpose of headers and sequence numbers.
  6. Describe the complete journey of a web request from typing a URL to receiving the page.
48
15 Nov 2027
Theory
Protocols & Layers J277 1.3.2
Protocols and layers - TCP/IP model, HTTP/S, FTP, SMTP, DNS
6 learning objectives
  1. Define the term protocol and explain why agreed protocols are necessary for network communication.
  2. Describe the purpose of HTTP, HTTPS, FTP, SMTP, IMAP and POP3 with their default port numbers.
  3. Compare IMAP and POP3, explaining when each is more appropriate.
  4. Name the four layers of the TCP/IP model and state the role of each layer.
  5. Classify protocols and networking activities into the correct TCP/IP layer.
  6. State at least two advantages of using a layered model for network design.
Theory
Protocols & Layers J277 1.3.2
Protocols and layers - TCP/IP model, HTTP/S, FTP, SMTP, DNS
6 learning objectives
  1. Define the term protocol and explain why agreed protocols are necessary for network communication.
  2. Describe the purpose of HTTP, HTTPS, FTP, SMTP, IMAP and POP3 with their default port numbers.
  3. Compare IMAP and POP3, explaining when each is more appropriate.
  4. Name the four layers of the TCP/IP model and state the role of each layer.
  5. Classify protocols and networking activities into the correct TCP/IP layer.
  6. State at least two advantages of using a layered model for network design.
49
22 Nov 2027
Theory
Network Security J277 1.4.1, J277 1.4.2
Network security overview - threats and prevention introduction
Use this as the bridge between Networks and Cyber Security. Introduces threats before Cyber goes into depth.
6 learning objectives
  1. Define and distinguish between five types of malware: virus, ransomware, spyware, worm and trojan.
  2. Explain how phishing works and classify it correctly as social engineering, not malware.
  3. Describe brute force attacks and explain the relationship between password complexity and attack time.
  4. Distinguish between DoS and DDoS attacks, explaining how each works and why DDoS is harder to block.
  5. Explain the function of firewalls, encryption, 2FA, access control and penetration testing as network defences.
  6. Match specific defences to appropriate threats and justify recommendations in an exam context.
Theory
Forms of Attack - Malware J277 1.4.1
Malware types - viruses, worms, trojans, ransomware, spyware
4 learning objectives
  1. Define the term malware and name all six types
  2. Explain how each malware type spreads and what it does
  3. Distinguish between similar types (virus vs worm, spyware vs keylogger)
  4. Apply knowledge to novel scenarios (exam-style)
50
29 Nov 2027
Theory
Social Engineering J277 1.4.1
Social engineering - phishing, baiting, shouldering, blagging
4 learning objectives
  1. Define social engineering and explain why it exploits humans rather than technology
  2. Describe phishing, blagging, shoulder surfing and baiting with examples
  3. Distinguish between phishing and blagging in exam scenarios
  4. Identify red flags in a phishing email
Theory
Technical Attacks J277 1.4.1
Technical attacks - brute force, DoS, data interception, SQL injection
SQL injection links nicely to Databases L4 - consider scheduling these in the same half-term.
4 learning objectives
  1. Explain how brute force and dictionary attacks work
  2. Distinguish between DoS and DDoS attacks
  3. Explain how SQL injection bypasses authentication
  4. Describe packet sniffing and man-in-the-middle attacks
51
Assessment
06 Dec 2027
Theory
Technical Attacks J277 1.4.1
Technical attacks - brute force, DoS, data interception, SQL injection
SQL injection links nicely to Databases L4 - consider scheduling these in the same half-term.
4 learning objectives
  1. Explain how brute force and dictionary attacks work
  2. Distinguish between DoS and DDoS attacks
  3. Explain how SQL injection bypasses authentication
  4. Describe packet sniffing and man-in-the-middle attacks
Assessment
Formal assessment 7 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
52
13 Dec 2027
Theory
Technical Prevention J277 1.4.2
Technical prevention - anti-malware, firewalls, encryption, access control
5 learning objectives
  1. Explain how firewalls filter network traffic using rules
  2. Define plaintext and ciphertext; explain how encryption protects data in transit
  3. Compare symmetric and asymmetric encryption: one shared key vs a public/private key pair; explain the key distribution problem
  4. Describe how anti-malware, 2FA and automatic updates protect systems
  5. Match technical measures to specific threats in exam scenarios
Theory
Technical Prevention J277 1.4.2
Technical prevention - anti-malware, firewalls, encryption, access control
5 learning objectives
  1. Explain how firewalls filter network traffic using rules
  2. Define plaintext and ciphertext; explain how encryption protects data in transit
  3. Compare symmetric and asymmetric encryption: one shared key vs a public/private key pair; explain the key distribution problem
  4. Describe how anti-malware, 2FA and automatic updates protect systems
  5. Match technical measures to specific threats in exam scenarios
Spring 1 27/28
53
10 Jan 2028
Theory
Policies, Procedures & Physical Security J277 1.4.2
Non-technical prevention - policies, procedures, physical security
4 learning objectives
  1. Explain user access levels and the principle of least privilege
  2. Describe what an Acceptable Use Policy is and why it matters
  3. Identify appropriate physical security measures for a given scenario
  4. Explain penetration testing and why regular backups are essential
Theory
Layered Defence & Exam Technique J277 1.4.1, J277 1.4.2
Layered defence in depth; exam technique for security questions
4 learning objectives
  1. Explain the defence in depth model and why multiple layers are needed
  2. Match specific threats to the most appropriate defences
  3. Apply security knowledge to novel exam scenarios with precision
  4. Identify and correct common exam errors
54
17 Jan 2028
Theory
Layered Defence & Exam Technique J277 1.4.1, J277 1.4.2
Layered defence in depth; exam technique for security questions
4 learning objectives
  1. Explain the defence in depth model and why multiple layers are needed
  2. Match specific threats to the most appropriate defences
  3. Apply security knowledge to novel exam scenarios with precision
  4. Identify and correct common exam errors
Theory
What is System Software? J277 1.5.1
System software overview - types and purpose
4 learning objectives
  1. Define system software and give at least three examples from memory.
  2. Explain the four-layer software stack in the correct order from hardware upwards.
  3. Distinguish between an OS, a device driver, and firmware with a specific example of each.
  4. Explain why system software must be running before any application can start.
55
Mock prep
24 Jan 2028
Mock exam prep
Mock exam preparation
Past paper walkthroughs, exam technique and timed practice.
Mock exam prep
Mock exam preparation
Past paper walkthroughs, exam technique and timed practice.
56
31 Jan 2028
Theory
Operating Systems: What Does an OS Actually Do? J277 1.5.1
Operating systems - memory management, multitasking, drivers, UI
4 learning objectives
  1. State and define all six core functions of an operating system.
  2. Explain how memory management prevents processes from interfering with each other.
  3. Describe what process scheduling means and why the OS needs to do it.
  4. Compare a CLI and a GUI - give one advantage of each.
Theory
Operating Systems: What Does an OS Actually Do? J277 1.5.1
Operating systems - memory management, multitasking, drivers, UI
4 learning objectives
  1. State and define all six core functions of an operating system.
  2. Explain how memory management prevents processes from interfering with each other.
  3. Describe what process scheduling means and why the OS needs to do it.
  4. Compare a CLI and a GUI - give one advantage of each.
57
07 Feb 2028
Theory
Utility Software J277 1.5.2
Utility software - encryption tools, defragmentation, backup, antivirus
4 learning objectives
  1. Explain why defragmentation improves read speed on a hard disk and why SSDs do not need it.
  2. Distinguish between lossless and lossy compression with a real example of each.
  3. Describe the difference between a full backup and an incremental backup.
  4. Explain what antivirus software does and state one limitation against new malware.
Revision
Revision: Programming Fundamentals
Recap of key concepts from Programming Fundamentals, with retrieval practice and exam-style questions.
Spring 2 27/28
58
21 Feb 2028
Revision
Revision: Producing Robust Programs
Recap of key concepts from Producing Robust Programs, with retrieval practice and exam-style questions.
Revision
Revision: Algorithms
Recap of key concepts from Algorithms, with retrieval practice and exam-style questions.
59
Assessment
28 Feb 2028
Revision
Revision: Systems Architecture
Recap of key concepts from Systems Architecture, with retrieval practice and exam-style questions.
Assessment
Formal assessment 8 of 8
Single-lesson written or on-screen assessment covering content taught since the last assessment.
Use a CodeBash assessment template or build your own.
60
06 Mar 2028
Revision
Revision: Memory and Storage
Recap of key concepts from Memory and Storage, with retrieval practice and exam-style questions.
Revision
Revision: Data Representation
Recap of key concepts from Data Representation, with retrieval practice and exam-style questions.
61
13 Mar 2028
Revision
Revision: Boolean Logic
Recap of key concepts from Boolean Logic, with retrieval practice and exam-style questions.
Revision
Revision: Computer Networks
Recap of key concepts from Computer Networks, with retrieval practice and exam-style questions.
62
20 Mar 2028
Revision
Revision: Network Security
Recap of key concepts from Network Security, with retrieval practice and exam-style questions.
Revision
Revision: Network Security - Cyber
Recap of key concepts from Network Security - Cyber, with retrieval practice and exam-style questions.
63
27 Mar 2028
Revision
Revision: Systems Software
Recap of key concepts from Systems Software, with retrieval practice and exam-style questions.
Revision
Revision: Programming Languages and IDEs
Recap of key concepts from Programming Languages and IDEs, with retrieval practice and exam-style questions.
Summer 1 27/28
64
17 Apr 2028
Revision
Revision: Databases and SQL
Recap of key concepts from Databases and SQL, with retrieval practice and exam-style questions.
Revision
Revision: Ethical, Legal and Cultural Issues
Recap of key concepts from Ethical, Legal and Cultural Issues, with retrieval practice and exam-style questions.
65
24 Apr 2028
Revision
Revision: AI - Enrichment
Recap of key concepts from AI - Enrichment, with retrieval practice and exam-style questions.
Revision
Revision: Programming Fundamentals
Recap of key concepts from Programming Fundamentals, with retrieval practice and exam-style questions.
66
01 May 2028
Revision
Revision: Producing Robust Programs
Recap of key concepts from Producing Robust Programs, with retrieval practice and exam-style questions.
Revision
Revision: Algorithms
Recap of key concepts from Algorithms, with retrieval practice and exam-style questions.
Spec gaps to flag
  • J277 2.2.4 - Random number generation
    Not a standalone lesson. Taught as a brief aside within Programming L3 (Arithmetic and Boolean Operators). Flag to teacher.