Overview

AS = Foundation in theory + basic programming/databases.
A2 (full A Level) = Advanced algorithms, OOP, complex databases, software engineering, advanced networking & data representation

• The A Level is split into AS (Year 1) and A2 (Year 2).
• AS Level → Papers 1 & 2 (already listed in detail earlier).
• A Level → Papers 1, 2 plus Papers 3 & 4 (Advanced Theory + Advanced Practical).

Modules

AS Level Content (Papers 1 & 2 – recap)

• Information representation (binary, hexadecimal, compression, text/sound/image storage)
• Communication & internet technologies (transmission, protocols, IP, DNS, networks)
• Hardware (CPU, registers, buses, input/output/storage devices, logic circuits)
• Processor fundamentals (fetch–decode–execute, machine code, assembly language)
• System software (OS, utility software, translators)
• Security, privacy, data integrity (threats, encryption, backups)
• Ethics & ownership (intellectual property, environmental/social issues)
• Algorithm design & problem solving (pseudocode, searching, sorting)
• Programming (structured code, data types, arrays, records, procedures/functions)
• Databases (relational model, SQL basics)

A2 Level Content (Additional for A Level: Papers 3 & 4)

Paper 3: Advanced Theory

1. Data Representation (extended)

• Floating point representation in detail
• Normalisation
• Bit manipulation (shifts, masks)
• Encryption methods

2. Communication & Networking (advanced)

• Protocols in detail (TCP/IP layers, email protocols, etc.)
• Encryption, security policies, intrusion detection
• Cloud computing, distributed systems

3. Databases (advanced)

• Relational algebra concepts
• Advanced SQL (nested queries, aggregation, constraints, views)
• Normalisation (1NF, 2NF, 3NF)
• Transaction processing (ACID properties)

4. Boolean Algebra & Logic

• Boolean expressions, laws of Boolean algebra
• Simplification of logic expressions
• Design of logic circuits

5. System Life Cycle & Software Engineering

• Systems development methodologies (waterfall, agile, prototyping)
• Testing strategies
• Project management concepts

Paper 4: Advanced Practical

1. Programming & Problem-solving

• Advanced data structures (stacks, queues, linked lists, binary trees, graphs)
• Recursive algorithms
• Searching/sorting (quick sort, binary tree traversal, Dijkstra’s algorithm etc.)
• Complexity (big-O notation basics)

2. Object-oriented Programming (OOP)

• Classes, objects, inheritance, polymorphism
• Encapsulation & abstraction

3. Further Algorithm Design

• Dynamic programming concepts
• Divide-and-conquer strategies
• Heuristic algorithms (e.g., A*)

4. Practical Applications

• Designing full solutions in pseudocode or chosen language (Java, Python, VB etc.)
• File handling, database connectivity

Assessment Structure

• Paper 1 (Theory Fundamentals, 1h45, written) → 25%
• Paper 2 (Fundamental Problem-solving & Programming Skills, 1h45, on-screen) → 25%
• Paper 3 (Advanced Theory, 1h45, written) → 25%
• Paper 4 (Advanced Practical, 1h45, on-screen) → 25%