📚 Comprehensive Overview of AQA Year 12 Computer Science Syllabus | AQA Year 12 计算机科学课程大纲全面解析
The AQA Year 12 Computer Science course is designed to give students a thorough grounding in the key principles of computation, programming, and digital systems. It covers everything from the fundamentals of thinking computationally and writing efficient code to understanding how hardware, networks, and data storage work together. This article provides a section‑by‑section breakdown of the entire AS‑level syllabus, highlighting the core concepts you need to master, the structure of the assessments, and the connections between topics. Whether you are revising for your final exams or just starting the course, this guide will help you navigate the full curriculum with clarity and confidence.
AQA Year 12 计算机科学课程旨在为学生打下计算思维、程序设计和数字系统核心原理的坚实基础。内容涵盖从计算思维和编写高效代码，到理解硬件、网络与数据存储如何协同工作的所有知识。本文将对整个 AS 级别课程大纲进行逐节解析，突出你需要掌握的核心概念、考试结构以及各主题之间的联系。无论你是在备考期末考试还是刚开始学习这门课，这份指南都能帮助你清晰、自信地把握全部课程内容。
1. Course Structure and Assessment | 课程结构与评估方式
The AQA AS Computer Science qualification is divided into two examination papers. Paper 1 (50% of AS, 1 hour 30 minutes) is an on‑screen programming exam where you write, test, and debug code using a high‑level language, typically Python, C# or Java. This paper also includes short‑answer questions on problem solving and programming theory. Paper 2 (50% of AS, 1 hour 30 minutes) is a traditional written paper assessing your knowledge of the theoretical topics such as data representation, computer systems, networking, databases, and the consequences of computing. Both papers are taken at the end of the academic year and are equally weighted.
AQA AS 计算机科学资格由两份试卷组成。试卷一（占 AS 总分 50%，时长 1 小时 30 分钟）为上机编程考试，你需要使用 Python、C# 或 Java 等高级语言编写、测试和调试代码。该试卷还包含简答题，考查问题求解和编程理论。试卷二（占 AS 总分 50%，时长 1 小时 30 分钟）为传统的书面考试，考查你对数据表示、计算机系统、网络、数据库以及计算的社会影响等理论专题的掌握情况。两场考试均在学年末进行，权重相同。
Your problem‑solving ability is woven into every topic, but Paper 1 places particular emphasis on programming and algorithm design. In Paper 2, you are expected to recall key definitions, describe processes such as the fetch‑execute cycle, and discuss ethical dilemmas. Understanding the distinction between the two papers is vital for targeted revision – spend time coding under timed conditions for Paper 1, and create precise, technical notes for the written topics of Paper 2.
问题求解能力贯穿每个主题，但试卷一特别重视编程和算法设计。试卷二则要求你记住关键定义，描述诸如取指‑执行周期等过程，并讨论伦理困境。理解两份试卷的区别对精准复习至关重要——针对试卷一，要在计时条件下练习编程；针对试卷二的笔试题，则要整理出准确、专业的笔记。
2. Fundamentals of Programming | 编程基础
Programming lies at the heart of the course. You must be confident in using variables, constants, the assignment operator, and all common data types: integer, real/float, Boolean, character, and string. Normal arithmetic operations follow operator precedence, and you need to be able to construct complex Boolean expressions using AND, OR, and NOT. String handling operations like concatenation, slicing, and length retrieval are frequently tested, as are type conversion functions. The syllabus expects you to write clear, well‑structured code that uses meaningful identifier names and appropriate indentation.
编程是这门课程的核心。你必须熟练运用变量、常数、赋值操作符以及所有常见数据类型：整数、浮点数、布尔、字符和字符串。常规算术运算遵循运算符优先级，而你需要能够使用 AND、OR 和 NOT 构造复杂的布尔表达式。字符串处理操作（如连接、切片和长度获取）以及类型转换函数都是常考点。大纲期望你写出清晰、结构良好、使用有意义标识符和恰当缩进的代码。
Beyond basic syntax, you need to master the three fundamental programming constructs: sequence, selection (IF...THEN...ELSE, CASE/SWITCH) and iteration (FOR, WHILE, REPEAT...UNTIL loops). Nesting these constructs allows you to solve more sophisticated problems. You must also understand exception handling – using try‑except blocks to manage runtime errors gracefully. Subroutines (procedures and functions) are a major focus: you will write modular code that accepts parameters, returns values, and uses local and global variables appropriately.
除了基础语法，你还需要掌握三种基本编程结构：顺序、选择（IF...THEN...ELSE、CASE/SWITCH）和循环（FOR、WHILE、REPEAT...UNTIL 循环）。嵌套这些结构能让你解决更复杂的问题。你还必须理解异常处理——使用 try‑except 块来优雅地处理运行时错误。子程序（过程和函数）是重点：你将编写接受参数、返回值、恰当使用局部与全局变量的模块化代码。
3. Data Structures and Abstract Data Types | 数据结构与抽象数据类型
AQA expects you to understand and be able to implement static and dynamic data structures. You must know the difference between one‑dimensional and two‑dimensional arrays (and the syntax for declaring them in your chosen language), as well as lists and tuples if your language supports them. The abstract data types (ADTs) covered include queues, stacks, and priority queues. For each ADT you must describe its behaviour, know the principal operations – push/pop for stack, enqueue/dequeue for queue – and illustrate how an ADT can be represented using arrays or linked lists.
AQA 考试局希望你能理解并实现静态和动态数据结构。你需要掌握一维数组和二维数组（以及你用所选语言声明它们的语法），如果你的语言支持，还包括列表和元组。课程涵盖的抽象数据类型（ADT）包括队列、栈和优先队列。对于每种 ADT，你必须描述其行为，了解主要操作——栈的 push/pop，队列的 enqueue/dequeue——并能说明如何使用数组或链表来表示一个 ADT。
You will also need to design and trace algorithms that use these data structures, such as reversing a string with a stack or simulating a print queue with a queue. Linked lists themselves are not required to be coded at AS, but you should be able to draw and interpret pointer‑based diagrams. The ability to select the most appropriate data structure for a given scenario – for example, choosing a queue for a breadth‑first search backup buffer – demonstrates higher‑order thinking that examiners reward.
你还需要设计和追踪使用这些数据结构的算法，例如用栈反转字符串或用队列模拟打印队列。AS 阶段不要求亲手写出链表的代码，但你应该能够绘制和解读基于指针的示意图。为给定场景选择最合适的数据结构的能力——例如，为广度优先搜索后备缓冲区选择队列——体现了高阶思维能力，是考官乐于奖励的。
4. Algorithms and Problem Solving | 算法与问题解决
Algorithms are step‑by‑step procedures for solving problems, and you will encounter a range of standard algorithms throughout the course. These include linear search, binary search, bubble sort, merge sort, and algorithms for insertion and deletion on stacks and queues. You must be able to describe each algorithm in plain English, represent it using pseudocode or flow charts, and manually trace through it with sample data, recording variables at each stage.
算法是解决问题的分步骤过程，在整个课程中你会遇到一系列标准算法，包括线性搜索、二分搜索、冒泡排序、归并排序，以及在栈和队列上进行插入和删除的算法。你必须能用通俗语言描述每个算法，用伪代码或流程图表示它，并用示例数据人工追踪执行，记录每一步的变量值。
The concept of algorithm efficiency is introduced via Big‑O notation. You will be expected to compare the time and space complexity of different algorithms, stating that linear search is O(n) while binary search is O(log n), for example. You do not need to derive formal proofs, but you should be able to explain why one algorithm is faster than another based on the number of operations in the worst case. This understanding directly informs your programming: choosing a binary search over a linear search when working with sorted data dramatically improves performance.
算法的效率概念通过大 O 表示法引入。你需要能够比较不同算法的时间和空间复杂度，例如说出线性搜索是 O(n) 而二分搜索是 O(log n)。你不需要推导形式化证明，但应该能够解释为什么在最坏情况下某个算法会更快，依据操作的数量。这种理解直接指导编程实践：处理有序数据时选择二分搜索而非线性搜索会极大提升性能。
5. Theory of Computation | 计算理论
This topic gives a formal, mathematical underpinning to what computers can and cannot do. You will study finite state machines (FSMs) with and without output, learning to interpret state transition diagrams and tables, and to analyse an FSM’s response to an input string. The specification also introduces the Turing machine as an abstract model of computation; you need to describe its components (tape, head, state register, transition function) and appreciate that it can simulate any algorithm, thus defining the limits of computability.
本专题为计算机能做什么和不能做什么提供了形式化、数学化的基础。你将学习带输出和不带输出的有限状态机 (FSM)，学会解释状态转移图和表，并分析 FSM 对输入字符串的响应。大纲还引入图灵机作为抽象的计算模型；你需要描述其组成部分（纸带、读写头、状态寄存器、转移函数），并认识到它可以模拟任何算法，从而定义了可计算性的界限。
Regular expressions and context‑free languages are covered at a basic level: you will write regular expressions to define sets of strings and understand their relationship to FSMs. The notion of inherent limitations, such as the halting problem, is introduced qualitatively. You must be able to explain why there are problems that no computer can ever solve, no matter how much time or memory is available. This often surprises students but deepens their appreciation of computing as a discipline.
正则表达式与上下文无关语言的基础也会涉及：你将编写正则表达式来定义字符串集合，并理解它们与 FSM 的关系。像停机问题这样的固有限制会被定性引入。你必须能够解释为什么存在某些问题，无论有多少时间或内存，计算机都永远无法解决。这常常令学生惊讶，但也加深了他们对计算作为一门学科的鉴赏。
6. Data Representation | 数据表示
Data representation covers the binary foundations of all information stored and processed by a computer. You will learn to convert between binary, denary (decimal), and hexadecimal number systems, and to perform binary addition with overflow detection. The forms of representing negative numbers – sign‑and‑magnitude and two’s complement – are essential, and you must be able to use two’s complement for subtraction. Fixed‑point and floating‑point binary represent real numbers; you will learn about mantissa and exponent, and to normalise floating‑point values.
数据表示涵盖了计算机所存储和处理的所有信息的二进制基础。你将学习二进制、十进制和十六进制数制之间的转换，并执行带溢出检测的二进制加法。表示负数的方式——原码和二进制补码——是必不可少的，你必须能用补码进行减法。定点二进制和浮点二进制表示实数；你将学习尾数和指数，并对浮点值进行规格化。
Other data codes include ASCII and Unicode character sets, with an understanding of why Unicode is now preferred for supporting multiple languages. Sound and images are also represented digitally: you must explain how sample rate and bit depth affect audio quality and file size, and how bitmap images are stored pixel‑by‑pixel with colour depth. Compression techniques – lossy vs lossless – fit here, with run‑length encoding and dictionary methods as examples. All these concepts tie into Paper 2 questions on file sizes and quality trade‑offs.
其他数据编码包括 ASCII 和 Unicode 字符集，并要理解为何 Unicode 现在更适合支持多语言。声音和图像也以数字方式表示：你必须解释采样率和位深度如何影响音频质量和文件大小，以及位图图像如何按像素和颜色深度进行存储。压缩技术——有损与无损——也在此处，游程编码和字典方法是常见示例。所有这些概念都与试卷二中关于文件大小和质量权衡的题目相关。
7. Computer Systems and Architecture | 计算机系统与体系结构
This section clarifies the difference between hardware, software, and the overall architecture of computer systems. You will classify software as system software (operating systems, utilities) or application software, and describe the role of an operating system in managing resources, providing a user interface, handling interrupts, and ensuring security. The concept of a virtual machine is also introduced, showing how one physical machine can emulate multiple computing environments.
本部分阐明了硬件、软件与计算机系统整体体系结构之间的区别。你将软件分为系统软件（操作系统、实用工具）和应用软件，并描述操作系统在管理资源、提供用户界面、处理中断和保障安全方面的作用。虚拟机的概念也会引入，展示一台物理机如何模拟多个计算环境。
The stored program concept and Von Neumann architecture form the backbone of modern computing. You will draw and label the main components: processor, main memory, address and data buses, and I/O controllers. Understanding the flow of data along buses and the role of the clock helps you answer exam questions accurately. Harvard architecture, common in embedded systems, is discussed as an alternative. The fetch‑decode‑execute cycle is a key process; you must be able to describe it step by step, mentioning the program counter, memory address register, memory data register, and current instruction register.
存储程序概念和冯·诺依曼架构构成了现代计算的骨干。你将画出并标注主要组件：处理器、主存储器、地址和数据总线以及输入输出控制器。理解数据沿总线的流动以及时钟的作用，有助于你准确回答考题。哈佛架构在嵌入式系统中常见，也会作为替代方案进行讨论。取指‑译码‑执行周期是一个关键过程；你必须逐步描述它，并提到程序计数器、地址寄存器、数据寄存器和当前指令寄存器。
8. Computer Organisation and Hardware | 计算机组成与硬件
Building on the architecture, you now focus on the internal hardware components of the processor. The arithmetic logic unit (ALU) and control unit (CU) work together to execute instructions. Logical operations like AND, OR, NOT, XOR are performed bitwise, and you should be able to apply a logical mask to manipulate specific bits. The concepts of RISC (Reduced Instruction Set Computer) and CISC (Complex Instruction Set Computer) processors are compared: you will explain differences in instruction set size, execution time, and use‑cases, such as CISC for general‑purpose desktops and RISC for power‑efficient smartphones.
在体系结构的基础上，你现在聚焦于处理器内部的硬件组件。算术逻辑单元 (ALU) 和控制单元 (CU) 协同工作以执行指令。AND、OR、NOT、XOR 等逻辑操作是按位进行的，你应该能够应用逻辑掩码来操纵特定位。精简指令集计算机 (RISC) 和复杂指令集计算机 (CISC) 处理器的概念会被比较：你将解释指令集大小、执行时间和用例的差异，比如 CISC 用于通用台式机而 RISC 用于高能效智能手机。
Memory hierarchy is a vital topic. You need to know the characteristics of registers, cache memory, RAM (SRAM and DRAM), ROM, and secondary storage (magnetic, optical, solid state). The speed, cost and capacity trade‑offs explain why a computer uses a blend of these memories. Solid state drives are increasingly replacing magnetic disks due to faster access times and lower power consumption, a point examiners expect you to justify. Input and output devices complete the hardware picture, with multi‑touch screens, barcode readers, and sensors among those mentioned in the specification.
存储层次结构是一个重要主题。你需要了解寄存器、高速缓存、RAM（SRAM 和 DRAM）、ROM 以及辅助存储（磁、光、固态）的特性。速度、成本和容量之间的权衡解释了计算机为何混合使用这些存储器。由于更快的访问时间和更低的功耗，固态硬盘正越来越多地取代磁碟，这一点你需要能够论证。输入输出设备完善了硬件图景，多点触摸屏、条码阅读器和传感器等都在大纲中提及。
9. Networking and Communication | 网络与通信
Networks are the glue that connects modern computing. You will learn about local area networks (LANs) and wide area networks (WANs), along with the topologies – star, bus, and mesh – and their relative robustness and cost. The client‑server and peer‑to‑peer models are essential paradigms for understanding how services are delivered. You must also describe the hardware required, including switches, routers, wireless access points, and network interface cards.
网络是连接现代计算的纽带。你将学习局域网 (LAN) 和广域网 (WAN)，以及星形、总线和网状等拓扑结构及其相对的稳健性和成本。客户‑服务器与对等网络模型是理解服务传递方式的基本范式。你还必须描述所需硬件，包括交换机、路由器、无线接入点和网络接口卡。
The Internet is explained through the TCP/IP stack, with each layer having a specific role: application (e.g. HTTP, SMTP), transport (TCP/UDP), internet (IP), and link (Ethernet). You should be able to follow the journey of a data packet across the layers. Key protocols like HTTP, HTTPS, FTP, SMTP, POP3, and IMAP are matched to their purposes, and you need to understand the difference between circuit switching and packet switching. The Domain Name System (DNS) is covered demystifying how URLs are resolved into IP addresses.
互联网通过 TCP/IP 协议栈来解释，每一层都有特定角色：应用层（如 HTTP、SMTP）、传输层 (TCP/UDP)、网络层 (IP) 和链路层（以太网）。你应该能够追踪数据包跨层传输的旅程。HTTP、HTTPS、FTP、SMTP、POP3 和 IMAP 等关键协议要与其用途对应，并理解电路交换与分组交换的区别。域名系统 (DNS) 的讲解揭开了 URL 如何解析为 IP 地址的神秘面纱。
10. Databases and Big Data | 数据库与大数据
Databases are modelled using entity‑relationship diagrams (limited to one‑to‑many relationships), and you will appreciate how flat‑file databases compare with relational databases in terms of data redundancy and integrity. The relational model introduces tables, primary keys, foreign keys, and composite keys. SQL is the standard language for defining and manipulating relational data; you need to write and interpret basic SELECT, INSERT, UPDATE, and DELETE statements, use WHERE clauses with AND/OR, and perform inner joins across tables. Normalisation to third normal form (3NF) is assessed, requiring you to reduce anomalies by eliminating repeating groups, partial key dependencies, and non‑key dependencies.
数据库使用实体‑关系图（仅限于一对多关系）进行建模，你将理解平文件数据库与关系数据库在数据冗余和完整性方面的差异。关系模型引入了表、主键、外键和复合键。SQL 是定义和操纵关系数据的标准语言；你需要能编写和解释基本的 SELECT、INSERT、UPDATE 和 DELETE 语句，使用带 AND/OR 的 WHERE 子句，并执行跨表内连接。数据库规范到第三范式 (3NF) 是考查点，要求你通过消除重复组、部分依赖和非主属性对候选键的传递依赖来减少异常。
Big Data is a modern addition, covering the three V’s: volume, velocity, and variety. You will discuss how traditional relational databases sometimes struggle with the scale of big data, leading to alternative approaches such as distributed computing and functional programming (for parallel processing). The specification only requires a conceptual understanding at AS, but you should be able to give examples of big data sources, such as social media streams and IoT sensors, and explain why they pose new challenges for storage and analysis.
大数据是新增内容，覆盖三个 V：规模 (Volume)、速度 (Velocity) 和多样性 (Variety)。你将讨论传统关系数据库为何有时难以应对大数据的规模，从而导致分布式计算和函数式编程（用于并行处理）等替代方案的出现。AS 阶段仅要求概念性理解，但你应能举出大数据来源的例子，如社交媒体流和物联网传感器，并解释它们为何给存储和分析带来新挑战。
11. Ethical, Legal and Environmental Impacts | 伦理、法律与环境影响
Computing does not exist in a vacuum, and the AS curriculum expects you to engage with the wider consequences of digital technology. You will examine the digital divide, the issue of free speech versus online censorship, and the ethical dilemmas surrounding the widespread collection of personal data. Key legislation – the Data Protection Act (2018, incorporating GDPR), the Computer Misuse Act, the Regulation of Investigatory Powers Act, and the Copyright, Designs and Patents Act – shape how individuals and organisations use technology legally in the UK.
计算并非存在于真空中，AS 课程要求你探讨数字技术的广泛影响。你将审视数字鸿沟、言论自由与网络审查的问题，以及围绕大规模收集个人数据的伦理困境。关键立法——《数据保护法》（2018 年，包含 GDPR）、《计算机滥用法》、《调查权力管制法》和《版权、设计与专利法》——塑造了英国个人和组织合法使用技术的方式。
Environmental impacts, such as the energy consumption of data centres and the recycling of electronic waste, are also addressed. You should be able to argue for sustainable practices in both hardware production (such as using recycled materials) and software (energy‑efficient algorithms). Debating the moral responsibilities of developers – for example, when an algorithm perpetuates bias – demonstrates a mature engagement with the subject. In the exam, you may be asked to justify a point of view or recognise both sides of a controversy.
环境影响，如数据中心的能耗和电子废弃物的回收，也被纳入。你应该能够论述硬件生产（如使用回收材料）和软件（节能算法）中的可持续实践。讨论开发者的道德责任——例如，当算法延续偏见时——展示了对这门学科的成熟思考。考试中，你可能需要为自己的观点辩护，或认识到争议双方的理由。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图