📚 A-Level AQA Computer Science: High-Frequency Topics Summary | A-Level AQA 计算机：高频考点总结
This article provides a structured summary of the most frequently examined topics in the AQA A-Level Computer Science specification. Each section pairs a key concept with its Chinese explanation, covering data representation, computer systems, networking, databases, algorithms, and more. Use this as your core revision guide to check understanding, fill gaps, and boost exam confidence.
本文系统梳理了 AQA A-Level 计算机课程中考查频率最高的核心主题。每个小节都采用中英双语对照讲解，覆盖数据表示、计算机系统、网络、数据库、算法等关键领域。将此文作为核心复习指南，可帮助检验理解、查缺补漏、增强应考信心。
1. Data Representation and Number Bases | 数据表示与进制
The binary system is fundamental. All data – numbers, text, images, sound – is stored as sequences of 0s and 1s. You must be able to convert between binary, denary, and hexadecimal, and understand why hex is used as a shorthand for binary.
二进制是计算机的基石。所有数据——数字、文本、图像、声音——均以0和1序列存储。你必须熟练掌握二进制、十进制与十六进制之间的转换，并理解为什么十六进制常被用作二进制的简写形式。
Negative numbers are represented using two's complement. In an 8-bit system, the most significant bit (MSB) indicates the sign: 1 for negative, 0 for positive. To find the two's complement, invert all bits and add 1.
负数采用补码（two's complement）表示。在8位系统中，最高有效位（MSB）为符号位：1表示负数，0表示正数。求补码时，将所有位取反后加1即可。
Floating point representation uses a mantissa and an exponent to store real numbers in binary. Normalisation ensures maximum precision by adjusting the mantissa so that the first two bits are different. You may be asked to convert between denary and normalised floating point binary.
浮点数表示法使用尾数（mantissa）和阶码（exponent）在二进制中存储实数。规格化（normalisation）通过调整尾数，使其前两位不同，从而保证最大精度。考题可能要求进行十进制与规格化浮点二进制之间的转换。
2. Computer Systems and the CPU | 计算机系统与中央处理器
The Von Neumann architecture forms the basis of most modern computers. It stores both instructions and data in the same memory. The CPU fetches, decodes, and executes instructions in a continuous cycle.
冯·诺依曼架构是大多数现代计算机的基础，它将指令和数据存储在同一内存中。CPU 通过取指、译码、执行的循环不断运行。
Registers within the CPU include the Program Counter (PC), Memory Address Register (MAR), Memory Data Register (MDR), Current Instruction Register (CIR), and Accumulator (ACC). The PC holds the address of the next instruction to be fetched. During the fetch phase, the address from the PC is copied to the MAR, the instruction is read into the MDR, then moved to the CIR. The PC is then incremented.
CPU 内部的寄存器包括程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器（ACC）。PC 保存下一条要取出的指令的地址。取指阶段，PC 中的地址被复制到 MAR，指令被读入 MDR，然后送至 CIR，最后 PC 增加。
Factors affecting processor performance are clock speed, number of cores, and cache size. Pipelining improves throughput by overlapping fetch, decode, and execute stages. However, branch instructions can cause pipeline stalls.
影响处理器性能的因素包括时钟速度、核心数量和缓存大小。流水线技术（pipelining）通过重叠取指、译码和执行阶段来提升吞吐量，但分支指令可能导致流水线停顿。
3. Operating Systems and System Software | 操作系统与系统软件
The operating system (OS) manages hardware resources and provides a user interface. Key functions include memory management, processor scheduling, file management, and I/O control. Virtual memory allows the computer to use secondary storage as if it were RAM when physical memory is full.
操作系统（OS）管理硬件资源并提供用户界面，其核心功能包括内存管理、处理器调度、文件管理和输入/输出控制。当物理内存不足时，虚拟内存允许计算机将辅助存储器当 RAM 使用。
Utility software performs specific housekeeping tasks: disk defragmentation reorganises files to improve access speed; backup software creates copies of data; encryption software secures data; and compression software reduces file size. Lossy compression permanently removes data (e.g., JPEG, MP3), while lossless compression preserves all original data (e.g., PNG, ZIP).
实用程序执行特定的维护任务：磁盘碎片整理通过重组文件提升访问速度；备份软件创建数据副本；加密软件保障数据安全；压缩软件减小文件体积。有损压缩永久删除部分数据（如 JPEG、MP3），而无损压缩保留全部原始信息（如 PNG、ZIP）。
4. Programming Concepts and Paradigms | 编程概念与范式
You should be comfortable with the three main programming constructs: sequence, selection (IF-ELSE, SWITCH), and iteration (FOR, WHILE, REPEAT-UNTIL). Recursion is a technique where a subroutine calls itself and must include a base case to terminate.
你需要熟悉三种基本程序结构：顺序、选择（IF-ELSE、SWITCH）和迭代（FOR、WHILE、REPEAT-UNTIL）。递归是一种子程序调用自身的技术，必须包含基准情形（base case）以防止无限循环。
Object-oriented programming (OOP) revolves around classes and objects. A class is a blueprint; an object is an instance. Key principles are encapsulation, inheritance, and polymorphism. Encapsulation hides internal state; inheritance allows a subclass to derive from a superclass; polymorphism lets objects of different classes respond to the same method call differently.
面向对象编程（OOP）围绕类和对象展开。类是蓝图，对象是实例。核心原则包括封装、继承和多态。封装隐藏内部状态；继承允许子类从超类派生；多态使得不同类的对象对同一方法调用作出不同响应。
5. Data Structures | 数据结构
Arrays store elements of the same data type contiguously in memory. They allow fast indexed access (O(1)) but have a fixed size. Lists can grow dynamically. Stacks (LIFO – Last In, First Out) and queues (FIFO – First In, First Out) are abstract data types often implemented using arrays or linked lists.
数组将相同类型的元素连续存储在内存中，支持通过索引快速访问（O(1)），但大小固定。列表可以动态增长。栈（后进先出）和队列（先进先出）是抽象数据类型，通常用数组或链表实现。
Trees, especially binary search trees, organise data hierarchically. Each node has at most two children. An in-order traversal visits left subtree, root, right subtree, producing sorted output. Graphs consist of vertices and edges. They can be represented using adjacency matrices or adjacency lists.
树，尤其是二叉搜索树，以层级方式组织数据。每个节点最多有两个子节点。中序遍历按左子树、根节点、右子树的顺序访问，可获得有序输出。图由顶点和边组成，可通过邻接矩阵或邻接表表示。
6. Algorithms and Computational Thinking | 算法与计算思维
Search algorithms: linear search checks each element sequentially (O(n)); binary search requires a sorted list and repeatedly divides the search interval in half (O(log n)).
搜索算法：线性搜索逐个检查每个元素（时间复杂度 O(n)）；二分搜索要求列表已排序，每次将搜索区间减半（O(log n)）。
Sorting algorithms: bubble sort compares adjacent pairs and swaps if needed (O(n²)). Merge sort divides the list into halves, recursively sorts, then merges (O(n log n)). You must trace these algorithms step by step and understand their time complexity.
排序算法：冒泡排序比较相邻元素并在需要时交换（O(n²)）。归并排序将列表分成两半，递归排序后再合并（O(n log n)）。你需能逐步追踪这些算法并理解它们的时间复杂度。
Big O notation describes the worst-case performance. Common complexities in increasing order: O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ). Space complexity refers to extra memory requirements.
大O表示法描述最坏情况下的性能。常见复杂度从小到大为：O(1)、O(log n)、O(n)、O(n log n)、O(n²)、O(2ⁿ)。空间复杂度指额外内存的需求。
7. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路
Boolean algebra uses the operators AND (·), OR (+), and NOT ( ¯ ). De Morgan's laws allow conversion between AND and OR forms: ¬(A·B) = ¬A + ¬B and ¬(A+B) = ¬A · ¬B. Simplifying Boolean expressions reduces the number of logic gates needed.
布尔代数使用与（·）、或（+）、非（¯）运算符。德摩根定律可实现与、或形式的转换：¬(A·B) = ¬A + ¬B 以及 ¬(A+B) = ¬A · ¬B。化简布尔表达式能减少所需逻辑门数量。
Logic gate symbols for AND, OR, NOT, NAND, NOR, and XOR must be memorised. You should be able to draw a circuit from a Boolean expression, write a truth table, and produce an expression from a given truth table using sum-of-products.
必须熟记与门、或门、非门、与非门、或非门和异或门的逻辑门符号。应能根据布尔表达式画出电路图，写出真值表，并能运用“积之和”方法从给定真值表推导表达式。
8. Communication and Networking | 通信与网络
Networks can be classified as LAN (Local Area Network) or WAN (Wide Area Network). Common topologies include star, bus, and mesh. In a star topology, each node connects to a central switch; failure of one cable does not affect others but the switch is a single point of failure.
网络可分为局域网（LAN）和广域网（WAN）。常见拓扑结构包括星型、总线型和网状型。星型拓扑中，所有节点连接到中央交换机；单个节点断线不影响其他节点，但交换机若故障则全网瘫痪。
The TCP/IP stack consists of four layers: Application, Transport, Internet, and Link. Protocols: HTTP/HTTPS for web, FTP for file transfer, SMTP/POP3/IMAP for email, TCP for reliable transmission, IP for routing.
TCP/IP 协议栈包括四层：应用层、传输层、互联网层和链路层。协议：HTTP/HTTPS 用于网页传输，FTP 用于文件传输，SMTP/POP3/IMAP 用于电子邮件，TCP 保证可靠传输，IP 负责路由寻址。
Network security threats include malware, phishing, DoS attacks, and SQL injection. Firewalls monitor incoming and outgoing traffic. Encryption (symmetric and asymmetric) protects data confidentiality. Digital signatures and certificates verify authenticity.
网络安全威胁包括恶意软件、网络钓鱼、拒绝服务攻击和 SQL 注入。防火墙监控进出流量。加密（对称和非对称）保护数据机密性。数字签名和证书用于验证真实性。
9. Databases and SQL | 数据库与 SQL
A relational database stores data in tables linked by primary and foreign keys. Normalisation (up to Third Normal Form) reduces data redundancy and improves integrity. 1NF: atomic values, no repeating groups. 2NF: 1NF + no partial dependencies. 3NF: 2NF + no transitive dependencies.
关系型数据库将数据存储在通过主键和外键关联的表中。规范化（至第三范式）可减少数据冗余并提升完整性。1NF：原子值，无重复组。2NF：1NF 且无部分依赖。3NF：2NF 且无传递依赖。
Structured Query Language (SQL) is used to define and manipulate data. Essential commands:
结构化查询语言（SQL）用于定义和操作数据。核心命令如下：
| SQL Command | Purpose |
|---|---|
| SELECT ... FROM ... WHERE ... | Retrieve data based on conditions |
| INSERT INTO ... VALUES ... | Add new records |
| UPDATE ... SET ... WHERE ... | Modify existing records |
| DELETE FROM ... WHERE ... | Remove records |
| JOIN ... ON ... | Combine rows from two tables |
You must practice writing queries involving multiple tables, GROUP BY, HAVING, and aggregate functions like COUNT, SUM, AVG, MAX, MIN.
必须练习编写涉及多表查询、GROUP BY、HAVING 以及聚合函数（如 COUNT、SUM、AVG、MAX、MIN）的 SQL 语句。
10. Big Data and Functional Programming | 大数据与函数式编程
Big data is characterised by volume, velocity, and variety. Traditional relational databases may struggle; distributed file systems like Hadoop's HDFS and the MapReduce programming model enable processing across many machines. The fact-based model records immutable, timestamped events.
大数据的特征包括体量（volume）、速度（velocity）和多样性（variety）。传统关系型数据库可能不堪重负；Hadoop 的 HDFS 等分布式文件系统和 MapReduce 编程模型能在多台机器上并行处理。事实模型记录不可变的带时间戳的事件。
Functional programming treats computation as the evaluation of mathematical functions, avoiding state changes and mutable data. Key concepts: first-class functions (functions treated as values), higher-order functions (map, filter, fold/reduce), and pure functions (no side effects, same output for same input).
函数式编程将计算视为数学函数求值，避免状态变化和可变数据。核心概念包括：一等函数（函数可当作值使用）、高阶函数（如 map、filter、fold/reduce）以及纯函数（无副作用，相同输入必得相同输出）。
11. Systematic Approach to Problem Solving | 系统化问题解决方法
Computational thinking involves decomposition (breaking a problem into smaller parts), pattern recognition, abstraction (focusing on relevant details), and algorithm design. These techniques are applicable across all topics and are often assessed through scenario-based questions.
计算思维包括分解（将问题拆解为更小部分）、模式识别、抽象（聚焦相关细节）和算法设计。这些技巧贯穿所有主题，常在基于场景的题目中考查。
Finite State Machines (FSMs) model systems with a finite number of states, inputs, and transitions. They are used in lexical analysis, protocol design, and control systems. You should be able to draw state transition diagrams and trace executions for given inputs.
有限状态机（FSM）用有限数量的状态、输入和转换来建模系统，广泛应用于词法分析、协议设计和控制系统。你应能绘制状态转换图，并针对给定输入追踪执行过程。
Regular expressions define search patterns. Basic operators: * (zero or more), + (one or more), ? (zero or one), | (or), () grouping. In the AQA pseudocode, they are used to describe language tokens.
正则表达式定义搜索模式。基本运算符包括：*（零次或多次）、+（一次或多次）、?（零次或一次）、|（或）、() 分组。在 AQA 伪代码中，正则表达式用于描述语言标记。
12. Legal, Ethical, and Environmental Issues | 法律、伦理与环境问题
The Data Protection Act 2018 (UK GDPR) governs how personal data is collected, stored, and processed. Principles include lawfulness, fairness, purpose limitation, data minimisation, accuracy, storage limitation, integrity, and confidentiality.
《2018 年数据保护法》（英国 GDPR）规范个人数据的收集、存储和处理。其原则包括合法公平、目的限制、数据最小化、准确、存储限制、完整性与保密性等。
The Computer Misuse Act 1990 criminalises unauthorised access to computer material, unauthorised access with intent to commit further offences, and unauthorised acts with intent to impair operation. The Copyright, Designs and Patents Act protects intellectual property.
《1990 年计算机滥用法》将未经授权访问计算机材料、意图进一步犯罪而访问、以及蓄意破坏运行的行为定为刑事犯罪。《版权、外观设计和专利法》保护知识产权。
Environmental concerns include energy consumption of data centres and e-waste from discarded devices. Ethical issues encompass algorithmic bias, surveillance, and the digital divide. You should be prepared to discuss these in context, weighing pros and cons of technology deployment.
环境问题包括数据中心的能耗和废弃设备产生的电子垃圾等。伦理议题涉及算法偏见、监控和数字鸿沟等。你应能在具体情境下讨论这些问题，权衡技术应用的利弊。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图