A-Level Computer Science

1.1.1 Binary, Denary and Hexadecimal 1.1.2 Binary Magnitudes and Data Prefixes 1.1.3 Binary Arithmetic and Overflow 1.1.4 Binary Coded Decimal 1.1.5 Text Representation in Binary 1.2.1 Images 1.2.2 Sound 1.3.1 Compression

2.1.1 Network Purpose, LANs and WANs 2.1.2 Network Models and Client Types 2.1.3 Network Topologies and Packet Paths 2.1.4 Wired, Wireless and Satellite Communication 2.1.5 LAN Hardware and Device Roles 2.1.6 Routing, Ethernet and Collision Management 2.1.7 Internet Infrastructure and Access 2.1.8 Web and Cloud Services 2.1.9 Streaming Media and Network Performance 2.1.10 IP Addressing, Subnetting and Assignment 2.1.11 URLs, Domain Names and DNS

3.1.1 Components of a Computer System 3.1.2 Embedded Computer Systems 3.1.3 Primary Memory Technologies 3.1.4 Secondary Storage Technologies 3.1.5 Input and Output Devices 3.1.6 Buffers and Differences in Transfer Speed 3.1.7 Monitoring and Control Systems 3.2.1 Logic Gates and Truth Tables 3.2.2 From Problem Statements to Logic Circuits 3.2.3 Translating Between Logic Representation

4.1.1 Stored Programs and the Von Neumann Model 4.1.2 Inside the CPU: Components and Registers 4.1.3 Moving Data: Memory and the System Buse 4.1.4 What Affects Processor Performance? 4.1.5 Connecting Peripheral Devices 4.1.6 The Fetch–Decode–Execute Cycle 4.1.7 Interrupts and Interrupt Service Routines 4.2.1 From Machine Code to Assembly Language 4.2.2 How a Two-Pass Assembler Works 4.2.3 Finding Data: Addressing Modes 4.2.4 Understanding the Assembly Instruction Set 4.2.5 Tracing Assembly Programs 4.3.1 Binary Shifts and Their Effects 4.3.2 Bitwise Logic and Masks 4.3.3 Using Bits to Read and Control Devices

5.1.1 Why Computers Need an Operating System 5.1.2 How the Operating System Manages a Computer 5.1.3 Utility Software for System Maintenance 5.1.4 Reusing Code with Program Libraries and DLLs 5.2.1 Assemblers, Compilers and Interpreters 5.2.2 Choosing a Translation Metho 5.2.3 Inside an Integrated Development Environment

6.1.1 Security, Privacy and Data Integrity 6.1.2 Threats to Computer Systems and Data 6.1.3 Defending Systems and Controlling Access 6.2.1 Checking Data During Entry 6.2.2 Detecting Errors During Data Transfer

7.1.1 Ethical Responsibilities in Computing 7.1.2 Copyright and Digital Ownership 7.1.3 Choosing a Software Licence 7.1.4 Artificial Intelligence: Applications and Wider Impact

8.1.1 From File-Based Storage to Databases 8.1.2 Tables, Records and Attributes 8.1.3 Keys, Relationships and Data Integrity 8.1.4 Modelling Databases with E–R Diagrams 8.1.5 Normalising Data to Third Normal Form 8.2.1 How a DBMS Organises and Protects Data 8.2.2 Data Dictionaries and DBMS Tools 8.3.1 Defining Database Structures with SQL 8.3.2 Selecting, Filtering and Sorting Data 8.3.3 Grouping, Aggregates and Two-Table Queries 8.3.4 Inserting, Updating and Deleting Data

9.1.1 Abstraction: Keeping What Matters 9.2.1 From a Problem to an Algorithm 9.2.2 Structured English, Flowcharts and Pseudocode 9.2.3 Sequence, Decisions, Loops and Logic 9.2.4 Stepwise Refinement: From Outline to Programmable Detail 9.2.5 Modular Algorithm Design

10.1.1 Choosing the Right Data Type 10.1.2 Defining and Using Records 10.2.1 One-Dimensional Arrays: Indices and Bounds 10.2.2 Two-Dimensional Arrays and Nested Loops 10.2.3 Finding Values with Linear Search 10.2.4 Ordering Values with Bubble Sort 10.3.1 Creating and Appending Text Files 10.3.2 Reading Multi-line Text Files 10.4.1 Abstract Data Types and Choosing a Structure 10.4.2 Stacks: Push, Pop and LIFO 10.4.3 Queues: Enqueue, Dequeue and Circular Storage 10.4.4 Linked Lists: Nodes, Pointers and Updates 10.4.5 Implementing ADTs with Arrays

11.1.1 Turning a Design into Pseudocode 11.1.2 Variables, Constants and Assignment 11.1.3 Arithmetic, Comparison and Logical Expressions 11.1.4 Input, Output and Built-in Routines 11.2.1 IF, ELSE and Nested Decisions 11.2.2 Selecting from Several Alternatives with CASE 11.2.3 Count-Controlled Repetition 11.2.4 Pre-condition and Post-condition Loops 11.2.5 Choosing and Combining Control Structures 11.3.1 Procedures and Modular Programs 11.3.2 Functions and Return Values 11.3.3 Parameters, Arguments and Subroutine Interfaces 11.3.4 Passing Parameters and Writing Efficient Modules

12.1.1 From Requirements to a Maintained Program 12.1.2 Developing Software with the Waterfall Model 12.1.3 Building Software Through Iteration 12.1.4 Rapid Development with Prototypes 12.1.5 Choosing an Appropriate Development Model 12.2.1 Decomposing Programs with Structure Charts 12.2.2 Parameters, Interfaces and Control in Structure Charts 12.2.3 Turning a Structure Chart into Pseudocode 12.2.4 Modelling Behaviour with State-Transition Diagrams 12.3.1 Finding, Preventing and Correcting Program Errors 12.3.2 Dry Runs, Walkthroughs and Trace Tables 12.3.3 Testing Code, Paths and Modules 12.3.4 Testing from the User’s Perspective 12.3.5 Test Strategies, Test Plans and Test Data 12.3.6 Maintaining and Extending Existing Software