📚 Core Knowledge Overview for Year 12 AQA Computer Science | Year 12 AQA 计算机科学核心知识点梳理
This article provides a structured walkthrough of the essential topics that every Year 12 student following the AQA A-level Computer Science specification (7517) needs to master. By consolidating the key concepts from programming, data structures, algorithms, theory of computation, data representation, computer systems, networks, databases, big data, and ethical implications, learners can build a solid foundation for both the AS examinations and the full A-level.
本文系统梳理了 AQA A-level 计算机科学（7517）课程在 Year 12 阶段必须掌握的核心主题。涵盖编程基础、数据结构、算法、计算理论、数据表示、计算机系统与架构、网络通信、数据库、大数据以及计算机使用的社会伦理等知识模块，帮助同学们为 AS 考试和完整的 A-level 学习打下扎实基础。
1. Programming Fundamentals | 编程基础
All programming questions in AQA papers expect familiarity with a procedural, high-level language. The specification allows a choice of languages, but the underlying concepts are universal: sequence, selection, and iteration. You must be able to write, trace, and debug code that uses variables, constants, and appropriate data types.
AQA 考试中所有编程题目都要求熟练掌握一门高级过程式语言。虽然考纲允许多种编程语言，但其核心概念是普遍适用的：顺序、选择和循环。学生必须能够编写、追踪和调试代码，正确使用变量、常量和合适的数据类型。
Subroutines (procedures and functions) are fundamental building blocks. A procedure performs a set of steps without returning a value, whereas a function returns a single value. Parameter passing can be by value or by reference – understanding the difference is critical for tracing programs and avoiding side-effect errors.
子程序（过程和函数）是基本的构建块。过程执行一系列步骤但不返回值，函数则返回一个值。参数传递可分为值传递和引用传递——理解两者的区别对于程序追踪和避免副作用错误至关重要。
Scoping rules determine where an identifier is accessible. Local variables exist only within the subroutine where they are declared, while global variables are accessible throughout the program. Overuse of global variables can lead to unintended interference and makes code harder to maintain.
作用域规则决定了标识符的可访问范围。局部变量只在其声明的子程序内存在，而全局变量在整个程序中均可访问。过度使用全局变量可能导致意外的相互干扰，使代码难以维护。
- Sequence, selection (if-else, switch), iteration (for, while, do-while)
- Variables, constants, identifier naming conventions
- Subroutines: functions vs procedures, return values
- Parameter passing: by value vs by reference
- Scope: local and global variables
- 顺序、选择（if-else、switch）、循环（for、while、do-while）
- 变量、常量及标识符命名规则
- 子程序：函数与过程的区别、返回值
- 参数传递：值传递与引用传递
- 作用域：局部变量与全局变量
2. Data Structures | 数据结构
The specification emphasises arrays, records, lists, tuples, and the practical use of these structures to store and manipulate data. Arrays (one- and two-dimensional) are indexed collections of elements of the same data type. They allow direct access via an index, but their size is static in many languages.
考纲强调数组、记录、列表和元组以及如何在实际中运用这些结构存储和操作数据。数组（一维和二维）是相同数据类型的元素的索引集合，可以通过索引直接访问，但在许多语言中其大小是静态的。
A record (or struct) groups related data items of possibly different types under one name. Each component is called a field. Records are fundamental for implementing databases and represent a single entity, such as a student with fields for name, ID, and grade.
记录（或结构体）将可能不同类型的数据项组合在一个名称下，每个组成部分称为字段。记录是实现数据库的基础，代表一个实体，例如一个学生记录包含姓名、ID 和成绩等字段。
Lists (especially in Python) and tuples form the basis of dynamic data handling. A list is mutable, meaning its elements can be changed after creation, while a tuple is immutable. Use lists when the data needs updating; use tuples for fixed collections, such as coordinates or dictionary keys.
列表（尤其在 Python 中）和元组是动态数据处理的基础。列表是可变的，即创建后可以修改其元素；元组则是不可变的。当数据需要更新时使用列表，而像坐标或字典键这类固定集合则使用元组。
| Structure | Mutable | Typical Use |
|---|---|---|
| Array | Usually yes (but size fixed) | Tables of values, matrix operations |
| Record | Yes | Grouping related fields |
| List | Yes | Dynamic collections |
| Tuple | No | Immutable sequence |
| 结构 | 可变性 | 典型用途 |
|---|---|---|
| 数组 | 通常可变（大小固定） | 数值表格、矩阵运算 |
| 记录 | 可变 | 分组相关字段 |
| 列表 | 可变 | 动态集合 |
| 元组 | 不可变 | 不可变序列 |
3. Algorithms and Computational Complexity | 算法与计算复杂性
Algorithmic thinking is at the heart of problem-solving in computer science. Year 12 students must be able to describe, trace, and compare common searching and sorting algorithms. Linear search checks each element in order; binary search requires a sorted array and repeatedly halves the search space.
算法思维是计算机科学问题求解的核心。Year 12 学生需要能够描述、追踪并比较常见的查找和排序算法。线性查找按顺序检查每个元素；二分查找要求有序数组并反复将查找区间减半。
Sorting algorithms that feature heavily include bubble sort, insertion sort, and merge sort. Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. Insertion sort builds a sorted sublist by inserting each new element into its correct position. Merge sort uses a divide-and-conquer approach, recursively splitting the list and then merging sorted sublists.
重点考查的排序算法包括冒泡排序、插入排序和归并排序。冒泡排序反复比较相邻元素并在顺序错误时交换。插入排序通过将新元素插入到已排序子列表的合适位置来构建有序列表。归并排序采用分治策略，递归地划分子列表，然后合并有序子列表。
Algorithm efficiency is expressed using Big O notation. Common time complexities include O(1) (constant), O(log n) (logarithmic, e.g., binary search), O(n) (linear), O(n log n) (e.g., merge sort), and O(n²) (quadratic, e.g., bubble sort worst case). Students need to decide on an algorithm based on the size and nature of the data.
算法效率用大 O 表示法来刻画。常见的时间复杂度包括 O(1)（常数）、O(log n)（对数，如二分查找）、O(n)（线性）、O(n log n)（如归并排序）和 O(n²)（平方，如冒泡排序最差情况）。学生需要根据数据的规模和特点选择合适的算法。
Binary search time complexity: O(log n)
二分查找时间复杂度：O(log n)
Recursion is another key concept. A recursive routine calls itself with a smaller instance of the problem until a base case is reached. Understanding the call stack and how recursion can be used for tasks like factorial calculation, tree traversal, and solving the Towers of Hanoi is essential.
递归是另一个关键概念。递归例程在更小的问题实例上调用自身，直到达到基本情况。理解调用栈以及递归如何用于阶乘计算、树遍历和汉诺塔问题等任务至关重要。
4. Theory of Computation | 计算理论
AQA's theory of computation module covers finite state machines (FSMs), regular expressions, context-free languages, and a basic introduction to Turing machines. An FSM consists of states, an initial state, transitions driven by inputs, and accepting states. It can model the behaviour of many simple systems, such as vending machines or coin-operated turnstiles.
AQA 的计算理论模块涵盖有限状态机（FSM）、正则表达式、上下文无关语言以及图灵机的基本入门。FSM 由状态集、初始状态、由输入驱动的转移以及接受状态组成，可以对许多简单系统（如自动售货机或投币闸机）的行为建模。
Regular expressions provide a concise way of describing a set of strings. Students must be able to read and write simple regular expressions using operators like * (zero or more), + (one or more), ? (optional), and | (alternation). Finite state machines without output are called finite state automata (FSA) and are equivalent to regular expressions in expressive power.
正则表达式为描述字符串集合提供了一种简洁的方式。学生必须能够读写简单的正则表达式，会使用 *（零次或多次）、+（一次或多次）、?（可选）和 |（或）等运算符。无输出的有限状态机称为有限状态自动机（FSA），其表达能力与正则表达式等价。
rules to define the syntax of programming languages. A simple example: <digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | ents should be able to produce derivations and draw syntax diagrams from BNF descriptions.
上下文无关语言通过递归扩展了这一思想，并使用巴克斯-诺尔范式（BNF）来描述。BNF 使用产生式规则定义编程语言的语法。一个简单例子：<digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9。学生应能根据 BNF 描述进行推导并画出语法图。
A Turing machine provides a theoretical model of computation. It consists of an infinite tape, a head that can read/write, a finite set of states, and a transition function. Although Year 12 does not require deep investigation, understanding that a Turing machine can solve any computable problem (Church-Turing thesis) helps in appreciating the limits of computation.
图灵机提供了计算的理论模型，由无限长的纸带、可读写的磁头、有限状态集和转移函数组成。尽管 Year 12 不要求深入探究，但理解图灵机能解决任何可计算问题（Church-Turing 论题）有助于认识计算的局限性。
5. Data Representation | 数据表示
Numbers inside a computer are stored as binary. Students need to be able to convert between binary, denary, and hexadecimal, and understand the use of two's complement to represent negative integers. A fixed number of bits (e.g., 8) are used, with the most significant bit (MSB) indicating the sign: 0 for positive, 1 for negative in two's complement.
计算机内部以二进制存储数字。学生需要掌握二进制、十进制和十六进制之间的转换，并理解如何使用补码（two's complement）表示负整数。使用固定位数（例如 8 位），最高有效位（MSB）表示符号：补码中 0 为正，1 为负。
Positive integers can be converted directly; for negative numbers, we invert the bits of the positive equivalent and add 1 to the least significant bit. Subtraction can then be performed by adding the two's complement of the subtrahend, simplifying hardware design.
正整数可直接转换；对于负数，先写出对应正数的二进制，按位取反后加 1。这样减法可以通过加上减数的补码来实现，从而简化硬件设计。
Characters are encoded using standard systems: ASCII uses 7 bits (extended ASCII 8 bits) to represent 128 characters; Unicode uses variable-length encoding (UTF-8, UTF-16) to cover virtually all writing systems. Storing a character therefore takes 1 or more bytes.
字符通过标准编码系统表示：ASCII 使用 7 位（扩展 ASCII 为 8 位）表示 128 个字符；Unicode 使用变长编码（UTF-8、UTF-16）覆盖几乎所有的书写系统。存储一个字符因此占用 1 个或多个字节。
Images are represented as bitmaps (a grid of pixels) or vector graphics (mathematical descriptions). In a bitmap, colour depth determines the number of bits per pixel, and resolution defines the number of pixels. An image file size can be calculated as: width x height x colour depth (in bits).
图像以位图（像素网格）或矢量图（数学描述）表示。在位图中，颜色深度决定了每个像素的位数，分辨率定义为像素个数。图像文件大小可计算为：宽 x 高 x 颜色深度（以位为单位）。
Sound is sampled at a fixed sample rate and bit depth. Higher sample rates and bit depths improve quality but increase file size. Calculating sound file size requires: sample rate x bit depth x duration x number of channels.
声音以固定的采样率和采样深度进行采样。更高的采样率和位深度可提高质量，但会增加文件大小。声音文件大小的计算公式为：采样率 x 采样深度 x 持续时间 x 声道数。
Bitmap size (bits) = width x height x colour depth
位图大小（位）= 宽 x 高 x 颜色深度
6. Computer Systems and Architecture | 计算机系统与架构
The Von Neumann architecture underpins most modern computers. It consists of a central processing unit (CPU) linked to a single memory that stores both program instructions and data. The CPU internally contains the arithmetic logic unit (ALU), the control unit (CU), and various registers such as the program counter (PC), memory address register (MAR), memory data register (MDR), and accumulator (ACC).
冯·诺依曼架构是现代计算机的基础，它由一个中央处理器（CPU）和单一存储器组成，程序指令和数据均存储于该存储器中。CPU 内部包含算术逻辑单元（ALU）、控制单元（CU）以及多个寄存器，如程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）和累加器（ACC）。
The fetch-decode-execute cycle repeats for every instruction. In the fetch phase, the address in the PC is copied to the MAR, the instruction is fetched to the MDR, and the PC increments. The decode phase interprets the instruction, and the execute phase carries out the operation, often using the ALU.
每个指令都会经历取指-解码-执行周期。取指阶段，PC 中的地址被复制到 MAR，指令被取至 MDR，PC 自增；解码阶段解释指令；执行阶段执行操作，通常用到 ALU。
Factors affecting CPU performance include clock speed (number of cycles per second, measured in GHz), number of cores (allowing parallel processing), and cache memory (high-speed memory close to the CPU). Pipelining allows overlapping the stages of the fetch-decode-execute cycle to improve throughput.
影响 CPU 性能的因素包括时钟速度（每秒周期数，以 GHz 为单位）、核心数（支持并行处理）和缓存（靠近 CPU 的高速存储器）。流水线技术允许多个指令的取指-解码-执行阶段重叠执行，以提高处理吞吐量。
The Harvard architecture has separate memories for instructions and data, enabling simultaneous access and potentially faster operation, often used in embedded systems and digital signal processors.
哈佛架构将指令存储器和数据存储器分开，允许同时访问，可能实现更快的操作，常用于嵌入式系统和数字信号处理器。
7. Computer Networks | 计算机网络
Networks are classified by geographic scope: LAN (Local Area Network) covers a small area like a building, WAN (Wide Area Network) spans cities or countries. LANs often use Ethernet and Wi-Fi, while WANs rely on leased lines or broadband connections. The Internet is a global WAN that interconnects millions of networks.
网络按照地理范围分类：LAN（局域网）覆盖一座建筑等小范围区域，WAN（广域网）跨城市或国家。局域网通常使用以太网和 Wi-Fi，广域网则依赖专线或宽带连接。互联网是一个全球性的广域网，连接着数以百万计的网络。
Network topologies describe the physical or logical layout. In a star topology, all devices connect to a central switch or hub; if one link fails, only that device is affected, but the central node is a single point of failure. In a bus topology, all devices share a single communication line; it is simple and cheap, but a break in the bus can bring down the whole network.
网络拓扑描述物理或逻辑布局。星型拓扑中，所有设备连接到一个中央交换机或集线器；若某条链路故障，仅该设备受影响，但中央节点是单点故障。总线拓扑中，所有设备共享一条通信线路；结构简单、成本低廉，但总线中的断点可能导致整个网络瘫痪。
The TCP/IP stack is the foundation of modern internet communication, consisting of four layers: application (e.g., HTTP, FTP, SMTP), transport (TCP, UDP), internet (IP), and network access (Ethernet, Wi-Fi). Protocols define rules for data transmission. HTTP is used to transfer web pages, FTP for file transfer, SMTP for email sending, and POP/IMAP for email retrieval.
TCP/IP 协议栈是现代互联网通信的基石，包含四层：应用层（如 HTTP、FTP、SMTP）、传输层（TCP、UDP）、网络层（IP）和网络接入层（以太网、Wi-Fi）。协议定义了数据传输规则：HTTP 用于传输网页，FTP 用于文件传输，SMTP 用于发送邮件，POP/IMAP 用于接收邮件。
Network security essentials include firewalls (packet filtering, stateful inspection), encryption (symmetric and asymmetric), and virtual private networks (VPNs). MAC address filtering and WPA2/WPA3 are used in Wi-Fi security. Students should be able to explain how public/private key encryption works and why it is used in digital signatures and HTTPS.
网络安全基础包括防火墙（包过滤、状态检测）、加密（对称和非对称）以及虚拟专用网（VPN）。Wi-Fi 安全中使用 MAC 地址过滤和 WPA2/WPA3。学生应能解释公钥/私钥加密的工作原理以及为何用于数字签名和 HTTPS。
8. Databases and SQL | 数据库与 SQL
A relational database organises data into tables (relations) where each table has a primary key that uniquely identifies each record. To link tables, foreign keys are used. This structure minimises data redundancy and improves integrity when compared to a single flat file.
关系数据库将数据组织成表（关系），每个表都有一个主键来唯一标识每条记录。为连接表，使用外键。与单个平面文件相比，这种结构能最大限度地减少数据冗余并提高完整性。
Structured Query Language (SQL) is the standard language for querying and manipulating relational databases. Basic SELECT statements can retrieve data from one or more tables using conditions (WHERE), joins (INNER JOIN, LEFT JOIN), and wildcards (LIKE). INSERT, UPDATE, and DELETE statements allow data modification.
结构化查询语言（SQL）是查询和操作关系数据库的标准语言。基本的 SELECT 语句可以使用条件（WHERE）、连接（INNER JOIN、LEFT JOIN）和通配符（LIKE）从一个或多个表中检索数据。INSERT、UPDATE 和 DELETE 语句用于修改数据。
Normalisation up to Third Normal Form (3NF) is part of Year 12 study. First normal form (1NF) requires no repeating groups and atomic values. Second normal form (2NF) removes partial dependencies (non-key attributes must depend on the whole primary key). Third normal form removes transitive dependencies (non-key attributes must depend only on the primary key). Normalisation ensures data integrity and reduces update anomalies.
规范化的内容直到第三范式（3NF）属于 Year 12 的学习范畴。第一范式（1NF）要求没有重复组且属性值为原子值；第二范式（2NF）消除部分依赖（非主属性必须依赖于整个主键）；第三范式消除传递依赖（非主属性必须仅依赖于主键）。规范化确保数据完整性并减少更新异常。
Entity-relationship diagrams (ERDs) are used to model database structures, showing entities, attributes, and the relationships (one-to-one, one-to-many, many-to-many) between them. Understanding cardinality helps in designing tables before writing SQL.
实体关系图（ERD）用于对数据库结构建模，展示实体、属性以及它们之间的关系（一对一、一对多、多对多）。理解基数有助于在编写 SQL 之前设计表结构。
9. Big Data | 大数据
Big data refers to extremely large datasets that cannot be processed effectively by traditional data-processing applications. The concept is often characterised by the three Vs: volume (sheer size), velocity (speed of data generation), and variety (different formats – structured, semi-structured, unstructured).
大数据指传统数据处理应用程序难以有效处理的超大数据集。其特点通常用三个 V 概括：volume（规模）、velocity（生成速度）和 variety（多样性——结构化的、半结构化的、非结构化的）。
Distributed computing frameworks like MapReduce and the Hadoop ecosystem allow parallel processing of big data across clusters of commodity hardware. The paradigm shift is from moving data to a central processor to moving processing to where the data resides.
MapReduce 和 Hadoop 生态系统等分布式计算框架允许在普通硬件集群上并行处理大数据。这种范式转变将处理从数据移动到集中处理器改为将处理移动到数据所在之处。
Functional programming concepts, such as immutable data and higher-order functions, underpin many big data processing techniques. For instance, the map function applies a given operation to each element of a list, and reduce (fold) combines elements using a binary operation. These ideas are explored in Year 12 and developed further in Year 13.
函数式编程概念（如不可变数据和高阶函数）是许多大数据处理技术的基础。例如，map 函数对列表中的每个元素应用给定操作，reduce（折叠）使用二元运算组合元素。这些思想在 Year 12 中涉及，并在 Year 13 中进一步深化。
Students should also consider the ethical implications of big data, such as privacy concerns, profiling, and the potential for data misuse. Data protection laws (e.g., UK GDPR) govern how personal data can be collected, stored, and processed.
学生还应考虑大数据的伦理影响，例如隐私问题、用户画像及数据滥用的可能性。数据保护法（如英国 GDPR）规范了个人数据的收集、存储和处理方式。
10. Consequences of Uses of Computing | 计算机使用的社会后果
This cross-cutting theme pervades the whole specification. Topics include legislation (Data Protection Act, Computer Misuse Act, Regulation of Investigatory Powers Act, Copyright and Intellectual Property), the digital divide, and the environmental impact of computing.
这一跨域主题贯穿整个考纲，包括立法（数据保护法、计算机滥用法、调查权力规制法、版权与知识产权）、数字鸿沟以及计算对环境的影响。
The Computer Misuse Act 1990 makes it illegal to gain unauthorised access to computer material (Section 1), unauthorised access with intent to commit further offences (Section 2), and unauthorised acts with intent to impair operation (Section 3). Awareness of these offences is essential for any student considering a career in computing.
1990 年《计算机滥用法》规定：未经授权访问计算机材料（第 1 条）、为实施进一步犯罪而未经授权访问（第 2 条）以及意图损害计算机运作而进行未经授权的行为（第 3 条）均属违法。任何考虑从事计算机行业的学生都必须了解这些罪行。
The digital divide refers to the gap between those who have access to modern information and communication technology and those who do not. Factors include economic inequality, geography, lack of education, and age. Computing professionals have a role in designing inclusive systems and considering global accessibility.
数字鸿沟指那些能够接触现代信息与通信技术的人与不能接触的人之间的差距。影响因素包括经济不平等、地理位置、教育匮乏和年龄。计算机专业人员在设计包容性系统和考虑全球可达性方面扮演着重要角色。
Environmental impact arises from the energy consumption of data centres, the carbon footprint of manufacturing devices, and e-waste. Students should be aware of sustainable computing practices and initiatives like modular hardware design and efficient cooling systems.
环境影响来源于数据中心的能耗、设备制造的碳足迹以及电子废弃物。学生应了解可持续计算实践以及模块化硬件设计和高效冷却系统等举措。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图