Computer Science

Fundamentals of programming

This subtopic explores the fundamental data types in programming, which define the kind of data that can be stored and manipulated within an application. Understanding data types is essential for writing efficient, error-free code, as they determine memory allocation, allowable operations, and how data is represented at the machine level. Mastery of primitive types, strings, and pointers underpins more advanced concepts such as data structures, type safety, and low-level memory management, crucial for A-Level assessments and practical programming tasks.

Data types, Relational operations in a programming language, String handling operations in a programming language +7 more

E2E stub concept

Fundamentals of databases

Transaction processing is fundamental to maintaining data integrity in multi-user database systems, ensuring that operations are executed reliably even in the event of failures or concurrent access. The ACID properties—Atomicity, Consistency, Isolation, and Durability—provide the theoretical framework for designing robust transaction systems. Mastery of these concepts is essential for evaluating database engine implementations and solving real-world challenges in sectors like finance and e-commerce.

Transaction processing, Security and integrity, Relational databases +2 more

Big Data

This subtopic explores the four fundamental types of data analytics within the context of Big Data: descriptive, diagnostic, predictive, and prescriptive analytics. Each type answers a different question about data—descriptive explains what happened, diagnostic uncovers why it happened, predictive forecasts what will happen, and prescriptive recommends actions to achieve desired outcomes. Mastery of these concepts is essential for leveraging large datasets to inform strategic business decisions and drive innovation.

Data analytics, Processing Big Data, Characteristics of Big Data +1 more

Fundamentals of functional programming

Lists are the foundational data structure in functional programming, and operations such as head, tail, cons, length, and append allow programmers to access and build lists in an immutable, side-effect-free manner. This subtopic explores how these basic functions serve as building blocks for more complex list processing, including recursion and higher-order functions, which are essential for solving problems in a functional paradigm as tested in AQA A-Level Computer Science.

Lists in functional programming, Types in functional programming, Function application +1 more

Systematic approach to problem solving

This subtopic focuses on the creation and representation of algorithms using pseudocode, flowcharts, and structured English. Students learn to translate problem requirements into clear, unambiguous step-by-step solutions, a foundational skill in software development that facilitates communication and reduces errors before coding begins.

Algorithms for problem solving, Problem solving stages, Evaluation criteria +1 more

Fundamentals of data structures

This subtopic covers the fundamental concept of arrays as static data structures that store elements of the same data type in contiguous memory locations, accessible via integer indices. Students explore one-dimensional arrays for linear collections and two-dimensional arrays for grid-based data representation, learning to declare, initialise, traverse, and manipulate these structures in algorithmic problem-solving. Mastery of arrays is essential for implementing matrices, lookup tables, and many classic algorithms in computer science.

Data structures and arrays, Lists, Dictionaries +6 more

Fundamentals of algorithms

Graph traversal algorithms, depth-first search (DFS) and breadth-first search (BFS), are fundamental techniques for systematically exploring vertices and edges in a graph. They underpin many advanced graph algorithms and have practical applications in network routing, social network analysis, and puzzle solving.

Graph traversal algorithms, Tree traversal algorithms, Reverse Polish notation +3 more

Theory of computation

Turing machines provide a foundational model of computation, formalising the notion of algorithms and computability. By manipulating symbols on an infinite tape according to a finite set of rules, they can simulate any algorithmic process, making them essential for understanding the limits of what can be computed. This subtopic covers the machine's components and the design of simple machines to solve basic computational problems.

Turing machines, Complexity theory, Context-free languages +4 more

Fundamentals of data representation

This topic explores the conversion of continuous analogue sound waves into discrete digital data through sampling at a defined rate and quantising each sample to a specific bit depth. It underpins all digital audio systems, from music streaming to voice recording, affecting quality, storage, and transmission.

Representation of sound, Representation of images, Bitwise manipulation and masks +6 more

Fundamentals of computer systems

This subtopic examines the structure of machine code instructions, detailing how opcodes and operands are encoded, and how various addressing modes determine the location of operand data. Understanding instruction formats is essential for appreciating the fetch-decode-execute cycle and the trade-offs between speed, flexibility, and memory usage in program execution. Mastery of addressing modes—immediate, direct, indirect, and indexed—enables students to analyse and write efficient low-level code and comprehend how high-level constructs are implemented at the hardware level.

The processor instruction set, Classification of programming languages, Hardware and software +7 more

Fundamentals of computer organisation and architecture

The stored program concept is a foundational principle in computer architecture where both instructions and data are stored in the same memory, enabling programs to be modified and executed sequentially without manual rewiring. This concept underpins the fetch-execute cycle, in which the program counter holds the address of the next instruction, allowing seamless program flow. Its practical application is the basis for all modern general-purpose computers, from desktops to embedded systems.

The stored program concept, Internal components of a computer, Processor performance +2 more

Consequences of uses of computing

This subtopic examines the key legislation governing the use of computing in the UK, including the Data Protection Act 2018, the Computer Misuse Act 1990, and the Copyright, Designs and Patents Act 1988. Students must understand the principles, offenses, and rights defined by these laws, as well as their implications for individuals, organizations, and society in areas such as privacy, security, and intellectual property.

Legal issues, Privacy and censorship, Ethical issues +2 more

Fundamentals of communication and networking

This element examines the fundamental methods by which data is transmitted between digital systems, contrasting serial and parallel communication in terms of data pathways and comparing synchronous versus asynchronous protocols for timing coordination. Understanding these methods is essential for designing efficient network links and device interconnections in modern computing.

Communication methods, Network security, The internet and the World Wide Web +2 more