📚 Year 12 AQA Computer Science: Complete Syllabus Breakdown | Year 12 AQA 计算机：课程大纲全面解析
Understanding the full AQA Computer Science syllabus for Year 12 is the best way to build a solid foundation in both theory and practical programming. The AS level (7516) lays out a clear roadmap covering programming, algorithms, data representation, computer systems, networks, databases, and more. This guide breaks down every topic you will meet, explains how each area is assessed, and highlights the key ideas examiners want you to grasp.
透彻理解 AQA 计算机科学 Year 12 的完整课程大纲，是打好理论与编程实践双重基础的最佳途径。AS 阶段（7516）清楚地规划了涵盖编程、算法、数据表示、计算机系统、网络、数据库等领域的路线图。本指南将拆解你将遇到的每个主题，说明每个部分的考核方式，并点出考官希望你掌握的核心概念。
1. Assessment Overview at AS Level | AS 阶段考核概览
The AQA AS Computer Science qualification consists of two on-screen examination papers, both taken at the end of Year 12. Paper 1 focuses on theoretical knowledge, while Paper 2 tests your practical programming ability through a pre-released skeleton program. Together they give an overall grade that can either stand alone as an AS certificate or contribute to the full A-level if you continue.
AQA AS 计算机科学资格包含两场上机考试，均在 Year 12 结束时进行。Paper 1 侧重理论知识，Paper 2 则通过预先发布的骨架程序考查你的实际编程能力。两者结合给出一个总评等级，既可独立作为 AS 证书，也可在继续学习时计入完整 A-level 成绩。
| Paper | Weighting | Duration | Style |
|---|---|---|---|
| Paper 1: Computational Thinking and Problem-Solving Skills | 50% of AS | 1 hour 30 minutes | On-screen, short and long answer questions |
| Paper 2: Practical Programming and Problem-Solving | 50% of AS | 1 hour 30 minutes | On-screen, based on a pre-released skeleton program |
There is no non-exam assessment (coursework) at AS, which means every mark counts on exam day. Familiarising yourself with the structure early helps you plan revision and allocate time for both theory and programming practice.
AS 阶段没有非考试评估（课程作业），这意味着考场上的每一分都很关键。尽早熟悉考试结构有助于你规划复习，合理分配理论学习和编程练习的时间。
2. Fundamentals of Programming | 编程基础
Programming is at the heart of the AQA specification. You are expected to write, trace and debug code using a high-level language. The syllabus explicitly mentions Python, but other languages such as Java or C# are also acceptable in most exam contexts. Key topics include data types, variables, constants, selection (if-else), iteration (for/while), subroutines (procedures and functions), string handling, file I/O and exception handling.
编程是 AQA 课程的核心。你需要会用一种高级语言编写、跟踪和调试代码。大纲明确提到 Python，但在多数考试场景中 Java 或 C# 等其他语言也可接受。关键主题包括数据类型、变量、常量、选择结构（if-else）、迭代（for/while）、子程序（过程和函数）、字符串处理、文件输入输出以及异常处理。
You need to be comfortable with the concept of scope, parameter passing (by value and by reference), and recursion. Questions often ask you to trace recursive calls or identify the advantages of recursion over iteration for tree traversal. Make sure you can write a simple recursive function, e.g. to calculate factorial or Fibonacci.
你必须熟悉作用域的概念、参数传递（值传递和引用传递）以及递归。试题常要求追踪递归调用，或指出在树遍历时递归相比迭代的优点。确保能写出简单的递归函数，例如计算阶乘或斐波那契数列。
Practical work on a skeleton program (Paper 2) requires you to modify, extend and fix given code. You must demonstrate competence in restructuring a program, adding new features and navigating existing logic under exam conditions.
骨架程序（Paper 2）的实践工作需要你修改、扩展和修正给定的代码。你必须在考试环境下展示重构程序、添加新功能以及理解现有逻辑的能力。
3. Fundamentals of Data Structures | 数据结构基础
Data structures organise and store data efficiently. The AS specification covers arrays (one- and two-dimensional), lists, dictionaries (key-value pairs), stacks, queues and graphs. You must understand static versus dynamic data structures and the scenarios where each is appropriate. For example, a static array has a fixed size but faster access, while a dynamic list can grow but may require more memory management.
数据结构能高效地组织和存储数据。AS 大纲涵盖一维和二维数组、列表、字典（键值对）、栈、队列以及图。你必须理解静态与动态数据结构的区别，以及它们各自适用的场景。例如，静态数组大小固定但访问更快，而动态列表可以增长但可能需要更多的内存管理。
Stacks and queues are examined in depth. You should be able to draw diagrams showing pointer changes during push/pop (for stacks) and enqueue/dequeue (for queues), write pseudocode for their basic operations, and explain applications such as function call stacks, undo operations, or printer spooling.
栈和队列考查得比较深入。你应该能画出 push/pop（栈）和 enqueue/dequeue（队列）操作时的指针变化图，写出基本操作的伪代码，并解释函数调用栈、撤销操作或打印机缓冲池等应用场景。
Graphs are introduced with terminology such as vertex, edge, weighted/directed graphs, and adjacency matrices/list representations. A typical AS question might ask you to compare the space efficiency of an adjacency matrix and adjacency list for a sparse graph.
图论引入了顶点、边、加权/有向图以及邻接矩阵/邻接表表示法。典型的 AS 题目可能会要求你比较稀疏图用邻接矩阵和邻接表的空间效率。
4. Algorithms and Problem Solving | 算法与问题求解
This topic bridges the gap between theory and practical programming. You are expected to design, describe and evaluate algorithms using structured English, flowcharts and pseudocode. Standard algorithms include linear search, binary search, bubble sort, merge sort, and tree traversal (pre-order, in-order, post-order). You must know their time complexity and be able to hand-trace them on small data sets.
本主题连接了理论与实践之间的鸿沟。你需要运用结构化英语、流程图和伪代码来设计、描述和评价算法。标准算法包括线性查找、二分查找、冒泡排序、归并排序以及树遍历（前序、中序、后序）。你必须掌握它们的时间复杂度，并能在小数据集上进行手工跟踪。
The concept of Big O notation is introduced at AS level. You should be able to classify an algorithm's complexity as constant O(1), logarithmic O(log n), linear O(n), quadratic O(n²) or exponential O(2ⁿ). Use the comparison formula: 1 < log n < n < n log n < n² < 2ⁿ for large n.
大 O 表示法在 AS 阶段被引入。你应该能将算法的复杂度归类为常数 O(1)、对数 O(log n)、线性 O(n)、平方 O(n²) 或指数 O(2ⁿ)。对于较大的 n，使用比较公式：1 < log n < n < n log n < n² < 2ⁿ。
Problem solving is also tested through algorithmic puzzles, searching and sorting scenarios, and the ability to develop a logical solution from a given problem statement. Practising "dry run" tracing on paper is crucial for answering exam questions where you must predict the output or state of a program.
问题求解能力也通过算法谜题、查找与排序场景以及从给定问题陈述中生成逻辑方案来考查。在纸上进行“干运行”跟踪对于回答需要预测输出或程序状态的考试题目至关重要。
5. Theory of Computation | 计算理论
Theory of computation asks fundamental questions about what computers can and cannot do. For AS, you study finite state machines (FSMs) and the difference between regular and context-free languages without needing to construct them. You also cover the Halting problem as an example of an unsolvable problem, and the concept of Turing completeness to understand the limits of computation.
计算理论探讨计算机能做什么、不能做什么的根本性问题。在 AS 阶段，你会学习有限状态机（FSM）以及正则语言与上下文无关语言的区别，无需构建它们。你还将通过停机问题这个例子了解不可求解的问题，并学习图灵完备性以理解计算的局限。
FSMs (with and without output) are represented as state transition diagrams. You must be able to interpret a given FSM, trace input strings, and determine whether a string is accepted. Mealy and Moore machines are also part of the syllabus: a Moore machine's output depends only on the state, whereas a Mealy machine's output depends on state and input.
带输出和不带输出的 FSM 用状态转移图表示。你必须能够解读给定的 FSM，跟踪输入字符串，并确定某字符串是否被接受。Mealy 与 Moore 机器也属于课程内容：Moore 机的输出仅取决于状态，而 Mealy 机的输出取决于状态和输入。
The Turing machine model is described at a conceptual level. You should appreciate how a Turing machine can simulate any algorithmic process and why it serves as a benchmark for what is computable. Exam questions often link this to the Halting problem and the idea that some problems are impossible to solve algorithmically.
图灵机模型在概念层面进行描述。你应该理解图灵机如何模拟任何算法过程，以及它为何能成为可计算性的基准。考题常将此与停机问题和某些问题算法上不可能解决的思想联系起来。
6. Computer Systems and Architecture | 计算机系统与体系结构
This section covers the inner workings of a computer system. The Von Neumann architecture is central: processor, control unit, ALU, registers (PC, MAR, MDR, CIR, ACC), memory (RAM/ROM), buses (address, data, control) and I/O controllers. You must be able to describe the fetch-decode-execute cycle in detail and explain how each register contributes.
本部分涵盖计算机系统的内部工作原理。冯·诺依曼体系结构是核心：处理器、控制单元、ALU、寄存器（PC、MAR、MDR、CIR、ACC）、内存（RAM/ROM）、总线（地址、数据、控制）以及 I/O 控制器。你必须能详细描述取指-解码-执行周期，并解释每个寄存器是如何参与其中的。
The syllabus includes factors affecting CPU performance: clock speed, number of cores and cache size. You should be able to discuss the trade-offs, for example why increasing cores does not always double performance due to Amdahl's law. The concept of pipelining is also mentioned, though at AS the focus is on its potential to increase throughput.
大纲包括影响 CPU 性能的因素：时钟速度、核心数量和缓存大小。你应该能讨论其中的取舍，比如为何根据阿姆达尔定律，增加核心数并不总能带来性能翻倍。流水线的概念也有提及，但在 AS 阶段，重点在于其提高吞吐量的潜力。
Input/output and secondary storage technologies round out this topic. You need to know the differences between magnetic, optical and solid-state storage in terms of speed, capacity, cost, portability and durability. AS questions often ask you to choose suitable storage for a given scenario.
输入/输出和辅存技术完善了这一主题。你需要了解磁存储、光存储和固态存储在速度、容量、成本、便携性和耐用性方面的差异。AS 题目经常要求你为给定场景选择合适的存储方案。
7. Data Representation | 数据表示
Data inside a computer is all binary; you need to know how numbers, text, images and sound are encoded and interpreted. For integers, the specification covers unsigned binary, two's complement, and sign-and-magnitude. You must be able to convert between denary, binary and hexadecimal with confidence, and perform binary addition and subtraction using two's complement.
计算机内的数据全部是二进制的；你需要知道数字、文本、图像和声音是如何编码和解读的。对于整数，大纲涵盖无符号二进制、二进制补码以及符号-数值表示法。你必须能自信地在十进制、二进制和十六进制之间转换，并使用二进制补码执行二进制加减法。
Floating point representation using mantissa and exponent (in two's complement) is introduced at AS. You will be given normalised and unnormalised numbers and asked to interpret or convert them. The formula ± mantissa × 2exponent is key.
AS 阶段引入了使用尾数和阶码（均为二进制补码）的浮点表示法。你将面对归一化和非归一化的数字，并回答解读或转换的题目。公式 数值 = ± 尾数 × 2阶码 非常关键。
Character sets such as ASCII and Unicode are compared; Unicode' cs, with formula for file size (pixels × bit depth) and metadata. Sound is sampled and the bit rate (sample rate × bit depth × channels) determines quality and file size. You must be able to calculate file sizes and explain the trade-offs involved in compression.
字符集如 ASCII 与 Unicode 需要比较；Unicode 能表示大量字符，代价是每个字符需要更多位。图像表示涵盖位图和矢量图，并涉及文件大小公式（像素 × 位深）和元数据。声音通过采样表示，比特率（采样率 × 位深 × 声道数）决定了质量和文件大小。你必须能计算文件大小并解释压缩带来的各种权衡。
8. Networking | 网络基础
The AQA specification gives a thorough introduction to networking concepts. You need to describe the client-server and peer-to-peer models, know what a protocol is, and explain the roles of the TCP/IP stack layers: application, transport, network (internet) and link. Protocols like HTTP, HTTPS, FTP, SMTP, POP3, and IMAP are associated with their layers and port numbers, though you are not required to memorise every port number.
AQA 大纲对网络概念做了全面介绍。你需要描述客户端-服务器和点对点模型，知道协议是什么，并解释 TCP/IP 协议栈各层的作用：应用层、传输层、网络层（互联网层）和链路层。HTTP、HTTPS、FTP、SMTP、POP3、IMAP 等协议及其所在层和端口号也应了解，但不必死记所有端口号。
The process of packet switching is a core topic: data is broken into packets, each with a header containing destination, sequence and error-checking information. Routers use the destination address to forward packets along the best available path. At the receiving end, packets are reassembled according to sequence numbers. You may be asked to explain this process step-by-step or to identify its advantages over circuit switching.
分组交换过程是核心主题：数据被拆分为分组，每个分组带有包含目的地、序号和检错信息的头部。路由器利用目的地址沿最佳可用路径转发分组。接收端根据序号重组分组。你可能会被要求一步步解释这一过程，或指出其相对于电路交换的优势。
Network security also appears in the AS syllabus: firewalls (packet filtering, stateful inspection), encryption (symmetric and asymmetric), and the concept of digital signatures and certificates to verify identity. Be prepared to discuss threats such as malware, phishing and denial-of-service attacks, along with prevention strategies.
网络安全也出现在 AS 大纲中：防火墙（包过滤、状态检测）、加密（对称与非对称）以及用于验证身份的数字签名和证书的概念。准备好讨论恶意软件、网络钓鱼和拒绝服务攻击等威胁及其防范策略。
9. Databases and Big Data | 数据库与大数据
Relational databases are a key area, with an emphasis on normalisation up to Third Normal Form (3NF). You must be able to identify partial and transitive dependencies, and normalise a given table to 1NF, 2NF and 3NF. Entity relationship diagrams are also part of the syllabus: entities, attributes, relationships (1:1, 1:M, M:M) and their diagrammatic representation.
关系型数据库是重点领域，重点考查规范化，最高到第三范式 (3NF)。你必须能够识别部分依赖和传递依赖，并将给定表格规范化至 1NF、2NF 和 3NF。实体关系图也属于课程内容：实体、属性、关系（1:1、1:M、M:M）及其图形表示。
SQL is used to define and manipulate data. You should be confident writing queries using SELECT, FROM, WHERE, ORDER BY, GROUP BY, and HAVING, and performing joins (INNER JOIN, LEFT/RIGHT OUTER JOIN). Data definition commands like CREATE TABLE and ALTER TABLE are also required, along with the ability to specify primary and foreign keys.
SQL 用于定义和操作数据。你应该能熟练使用 SELECT、FROM、WHERE、ORDER BY、GROUP BY 和 HAVING 编写查询，并能进行连接操作（INNER JOIN 和 LEFT/RIGHT OUTER JOIN）。数据定义命令如 CREATE TABLE 和 ALTER TABLE 也是必备知识，还要能够指定主键和外键。
Big data is introduced by comparing it to traditional relational databases in terms of volume, velocity and variety (the three Vs). You should know the difference between structured, unstructured and semi-structured data, and be able to discuss the advantages and challenges of data mining and data warehousing.
大数据部分通过与传统关系型数据库在容量（volume）、速度（velocity）和多样性（variety）（即三个 V）上的对比来引入。你应该知道结构化、非结构化和半结构化数据的区别，并能讨论数据挖掘和数据仓库的优点与挑战。
10. Software Development and Systems Analysis | 软件开发与系统分析
Understanding how software is built and managed is important for Paper 1 and provides context for your own programming work. The syllabus covers the waterfall lifecycle and agile methodologies. You should be able to compare these approaches, explain the stages of the waterfall model (analysis, design, implementation, testing, deployment, maintenance) and give examples of where each would be more appropriate.
了解软件如何构建和管理对 Paper 1 很重要，也为你自己的编程工作提供了背景。大纲涵盖瀑布式生命周期和敏捷方法论。你应该能够比较这些方法，解释瀑布模型的各个阶段（分析、设计、实现、测试、部署、维护），并举例说明每种方法更适合的场景。
Prototyping, both throwaway and evolutionary, is also discussed. You might need to evaluate the benefits of using a prototype in terms of user feedback and requirement refinement. The concept of the spiral model is touched upon, linking prototyping to risk management.
原型法（一次性原型和演化式原型）也有讨论。你可能需要从用户反馈和需求细化角度评估使用原型的好处。螺旋模型的概念被简要提及，将原型法与风险管理联系起来。
Testing strategies form a significant part of the systems topic. You must know the difference between white-box and black-box testing, and be able to design test plans with normal, boundary and erroneous data. Alpha and beta testing (acceptance testing) are part of the deployment stage. Exam questions often ask for a suitable testing strategy given a particular development methodology.
测试策略是系统主题的重要组成部分。你必须知道白盒测试与黑盒测试的区别，并能设计包含正常、边界和错误数据的测试计划。Alpha 和 Beta 测试（验收测试）是部署阶段的一部分。考题常要求根据给定的开发方法选择合适的测试策略。
11. The Pre-Released Skeleton Program (Paper 2) | 预先发布的骨架程序（Paper 2）
Paper 2 is unique because it is built around a skeleton program that AQA releases several weeks before the exam. This program is a working application written in a high-level language, typically a game, simulation or utility. Your job is to study it thoroughly: understand every variable, constant, data structure, function and procedure, as well as the overall logic flow.
Paper 2 的独特之处在于它是围绕 AQA 在考前几周发布的一个骨架程序构建的。该程序是用高级语言编写的工作应用，通常是游戏、模拟或实用工具。你的任务是彻底研究它：理解每一个变量、常量、数据结构、函数和过程，以及整体逻辑流。
Exam questions will ask you to modify the program, fix logical or syntax errors, extend its functionality, and explain what particular code segments do. You might be asked to add a new feature like a high-score table, improve validation, or alter the rules of a game. Answering well requires deep familiarity with both the program and the language syntax.
考试题目会要求你修改程序、修正逻辑或语法错误、扩展其功能，并解释特定代码段的作用。你可能会被要求添加一个新功能，比如高分表，改进验证，或改变游戏规则。要想答得好，必须对程序本身和语言语法都极其熟悉。
Practise rewriting parts of the skeleton program in different ways, trace variable values during execution, and design your own modification and testing plans. This hands-on preparation makes a huge difference because Paper 2 is essentially an unseen practical test but with a known starting point.
尝试用不同方式重写骨架程序的某些部分，跟踪执行过程中的变量值，并设计你自己的修改和测试计划。这种动手练习会产生巨大差异，因为 Paper 2 本质上是一场未知的实践测试，只不过起点已知。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图