A-LEVEL Exam A-LEVEL Computer Science

A-LEVEL Computer Science

4 Subject content – A-level

4.1 Fundamentals of databases

4.1.1 Programming

4.1.1.2 Programming concepts

4.1.1.3 Arithmetic operations in a programming language

4.1.1.4 Relational operations in a programming language

4.1.1.5 Boolean operations in a programming language

4.1.1.8 Random number generation in a programming language

4.1.1.10 Subroutines (procedures/functions)

4.1.1.11 Parameters of subroutines

4.1.1.13 Local variables in subroutines

4.1.1.15 Role of stack frames in subroutine calls

4.1.1.16 Recursive techniques

4.1.2 Programming paradigms

4.2 Fundamentals of data structures

4.4.4.2 Maths for Big-O notation

4.4.4.3 Order of complexity

4.4.4.4 Limits of computation

4.4.4.5 Classification of algorithmic problems

4.4.4.6 Computable and non-computable problems

4.4.4.7 Halting problem

4.4.5 A model of computation

4.5 Fundamentals of data representation

4.6 Fundamentals of computer systems

4.7 Fundamentals of computer organisation and architecture

4.8 Consequences of uses of computing

4.9 Fundamentals of communication and networking

4.10.1 Conceptual data models and entity relationship modelling

4.10.5 Client server databases

4.11 Big Data

4.12 Fundamentals of functional programming

4.13 Systematic approach to problem solving

4.14 Non-exam assessment - the computing practical project

AO1 Demonstrate knowledge and understanding of the principles and concepts of computer science, including abstraction, logic, algorithms and data representation.

AO2 Apply knowledge and understanding of the principles and concepts of computer science, including to analyse problems in computational terms.

AO3 Design, program and evaluate computer systems that solve problems, making reasoned judgements about these and presenting conclusions.

4.1.1.2 Programming concepts

4.1.1.3 Arithmetic operations in a programming language

4.1.1.4 Relational operations in a programming language

4.1.1.5 Boolean operations in a programming language

4.1.1.8 Random number generation in a programming language

4.1.1.10 Subroutines (procedures/functions)

4.1.1.11 Parameters of subroutines

4.1.1.13 Local variables in subroutines

4.1.1.15 Role of stack frames in subroutine calls

4.1.1.16 Recursive techniques