Skip to content ↓
Trinity School Trinity School

Trinity School

Year 12 Computer Science


Term 1

Term 2

Term 3

Term 4

Term 5

Term 6


1.1.1 Structure and Function of the Processor

1.1.2 Types of Processor

1.1.3 Input, Output and Storage

1.2.1 Systems Software

2.1.2 Thinking Ahead

2.1.2 Computational Methods

1.2.1 Systems Software

1.2.2 Applications Generation

2.1.2 Thinking Ahead

1.2.3 Software Development

1.2.4 Types of Programming Languages

1.4.1 Data Types

1.4.2 Data Structures

2.2.1 Programming Techniques

1.3.4 Web Technologies

1.3.1 Compression, Encryption and Hashing

1.3.2 Databases

2.2.2 Computational Methods

1.3.3 Networks

1.3.3 Networks

1.3.4 Web Technologies

2.1.1 Thinking Abstractly

2.2.2 Computational Methods

2.2.2 Computational Methods

2.1.2 Thinking Ahead

1.2.4 Types of Programming Language

2.3.1 Algorithms

1.4.2 Data Structures

Key Terminology and skills

ALU, CU, Busses, Registers, FDE, CPU Performance, Caching, CPU Architectures, CISC, RISC, Pipelining, GPU, Multicore and Parallel, IO, Storage, Virtual Storage, RAM and ROM, BIOS, Virtual Memory, Memory Management

Application Software, Nature of Applications, Utility Software, UI, OS, Scheduling, Interrupts, ISR, Device Drivers, Virtual Machine, Open and Closed Source, Translators, Libraries, Reusable components, Linkers, Loaders


Development Methodologies, Programming Languages, Procedural Languages, LMC and Assembly, Addressing Memory, Data Types, Arrays, Lists, Tuples, Records, UNICODE, ASCII, Hash Tables, Programming Constructs, Functions and Procedures, Parameter Passing, Global and Local Variables, Recursion, Debugging, IDE, Algorithms, HTML, CSS, JavaScript

Lossy vs Lossless;
Run Length and Dictionary Encoding
Symmetric and Asymmetric Encryption
Database Fundamentals
Structured Query Language
DB Normalisation
Referential Integrity
Transaction Processing
Managing data in a Database
Performance Modelling
Network Characteristics
Protocols and Standards
Network Hardware

Client Server;
Client/ Server Side Processing
Peer to Peer
TCP/IP Stack
Packet and Circuit Switching
Network Security and Threats
Firewalls - Proxies and Encryption
Search Engine Indexing
Page Rank Algorithm
Nature of Abstraction and the need for Abstraction
Abstraction and Reality
Use of Abstraction
Devise an Abstract Model
Computationally Solvable Problems

Problem Recognition
Determining Preconditions
Problem Decomposition
Identify Inputs and Outputs
Classes - Objects - Methods and Attributes
Linked Lists
Stack and Queue

Firefly Links*

* Firefly links will only work for Trinity staff members, students and parents.


After learning new theory content, students make their own notes before answering questions using our bespoke knowledge checking website.  They have access to supporting videos as well as knowledge organisers.

During each lesson, students have access to past paper questions for each topic. Time is allocated to answering these and the creation of model answers. The mark schemes are available to support and check responses.


Students are set up to 3 hours of homework per week for this subject. This time is tracked through our knowledge checking website and performance is closely monitored and rewarded with house points. Students are directed to spend time on topics which most benefit them for revision (based on previous performance).