A-Level CCEA Computer Science: Final Revision Checklist | A-Level CCEA 计算机：期末复习提纲

📚 A-Level CCEA Computer Science: Final Revision Checklist | A-Level CCEA 计算机：期末复习提纲

This comprehensive revision checklist is designed for students preparing for the CCEA A-Level Computer Science examination. It organises the entire specification into manageable sections, highlighting the essential knowledge, common pitfalls, and practical revision strategies for both AS and A2 units. Use this guide to structure your final review, test yourself against each bullet point, and build confidence before the exam.

这份全面的复习提纲专为备考 CCEA A-Level 计算机科学考试的学生设计。它将整个考纲梳理为易于掌握的板块，突出了必备的知识点、常见误区以及针对 AS 和 A2 单元的实际复习策略。用这份指南来规划你的期末回顾，对照每个要点进行自测，并在考前建立信心。

---

1. Algorithmic Thinking and Problem Solving | 算法思维与问题求解

Algorithmic thinking is the foundation of computational problem solving. It involves abstraction, decomposition, pattern recognition, and the step-by-step design of algorithms using pseudocode or flowcharts. You must be able to identify inputs, processes, and outputs for a given scenario and represent the solution unambiguously.

算法思维是计算问题求解的基础。它包括抽象、分解、模式识别，以及使用伪代码或流程图逐步设计算法。你必须能够针对给定场景确定输入、处理和输出，并清晰地表达解决方案。

Standard searching algorithms include linear search and binary search. Linear search examines each element in turn with O(n) complexity; binary search requires sorted data and repeatedly halves the search space, giving O(log n) complexity. Be prepared to trace both and explain when each is appropriate.

标准查找算法包括线性查找和二分查找。线性查找依次检查每个元素，复杂度为 O(n)；二分查找要求有序数据并反复将查找空间减半，复杂度为 O(log n)。准备好追踪两种算法并解释各自适用的场合。

For sorting, focus on bubble sort and insertion sort, and optionally merge sort for higher-tier understanding. Know the principle of comparing adjacent elements (bubble), building a sorted sub-list (insertion), and the divide-and-conquer strategy of merge sort. Be able to complete trace tables and identify the number of comparisons in each pass.

排序方面，重点掌握冒泡排序和插入排序，如追求高分可了解归并排序。理解相邻元素比较（冒泡）、构建有序子列表（插入）以及归并排序的分治策略。能够完成追踪表并识别每一趟的比较次数。

Algorithm efficiency is discussed using Big O notation. Revise the common complexities: O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). Be able to relate these to typical algorithms and interpret the dominance of operations in nested loops or recursive calls.

算法效率用大 O 表示法讨论。复习常见复杂度：O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。能够将这些复杂度和典型算法关联起来，并解释嵌套循环或递归调用中主导操作的影响。

---

2. Programming Fundamentals | 编程基础

A solid grasp of programming constructs is essential. Revise sequence, selection (IF…ELSE, CASE/SWITCH statements) and iteration (FOR, WHILE, REPEAT…UNTIL loops). Be able to write syntactically correct pseudocode and test it with dry runs, particularly when loops contain nested selections.

扎实掌握编程构造至关重要。复习顺序、选择（IF…ELSE、CASE/SWITCH 语句）和迭代（FOR、WHILE、REPEAT…UNTIL 循环）。能够写出语法正确的伪代码并利用纸笔运行进行测试，尤其是循环嵌套选择结构时。

Data types are a fundamental topic. You must be able to differentiate integers, real/float, character, string, and Boolean, and understand how each is stored. Revise type casting, the limitations of fixed-precision numbers, and the concept of overflow when assigning a value beyond the range.

数据类型是基础课题。你必须能区分整型、实型/浮点型、字符、字符串和布尔型，并理解各自的存储方式。复习类型转换、定点精度的局限性以及当赋值超出范围时的溢出概念。

Strings and arrays (one-dimensional and two-dimensional) are examined frequently. Know how to declare, index, slice, and traverse them. Be comfortable with standard operations such as concatenation, length, substring, and initialising parallel arrays.

字符串与数组（一维和二维）是常考内容。知道如何声明、索引、切片和遍历它们。熟悉拼接、长度、子串等标准操作以及并行数组的初始化。

Subroutines (functions and procedures) support modular design. Understand the difference between passing parameters by value and by reference, the scope of variables (local vs. global), and how to use a return statement. Practice tracing programs that pass arrays as parameters.

子程序（函数和过程）支持模块化设计。理解按值传递和按引用传递参数的区别、变量作用域（局部与全局）以及如何使用返回语句。练习追踪将数组作为参数传递的程序。

---

3. Data Structures | 数据结构

Dynamic data structures distinguish A-Level from simpler programming courses. Revise the behaviour and applications of stacks (LIFO), queues (FIFO), and linked lists. Be ready to draw diagrams of push, pop, enqueue, dequeue, and to trace operations that manage pointers and dynamic memory.

动态数据结构是 A-Level 与更基础编程课程的区分点。复习栈（LIFO）、队列（FIFO）和链表的行为及应用。准备好绘制压入、弹出、入队、出队的图示，并追踪管理指针和动态内存的操作。

For linked lists, understand the node structure containing data and a pointer (or two pointers for doubly linked lists). Be able to insert and delete nodes at various positions, adjusting the links correctly. Recognise the advantages over arrays when frequent insertions or deletions are required.

对于链表，理解包含数据和一个指针（双向链表为两个指针）的节点结构。能够在不同位置插入和删除节点，正确调整链接。认识到在频繁插入或删除时链表相对于数组的优势。

Binary trees are also explored, particularly binary search trees (BST). Know the property that for any node, the left subtree contains values smaller and the right subtree contains values larger. Practice tree traversal algorithms: pre-order, in-order, and post-order. In-order traversal of a BST yields sorted data.

二叉树也会涉及，尤其是二叉搜索树（BST）。了解其性质：对于任意节点，左子树的值较小，右子树的值较大。练习树的遍历算法：前序、中序和后序。二叉搜索树的中序遍历会得到有序数据。

Revise the use of static and dynamic data structures, comparing memory usage and performance. In CCEA, you may be asked to implement or explain a stack using an array and a pointer, contrasting it with a fully dynamic linked list implementation.

复习静态与动态数据结构的使用，比较内存占用和性能。在 CCEA 考试中，可能要求你实现或解释用数组和指针实现的栈，并与完全的动态链表实现进行对比。

---

4. Object-Oriented Programming (OOP) | 面向对象编程

OOP is a paradigm built on classes and objects. Review the core principles: encapsulation (bundling data and methods, restricting access), inheritance (creating subclasses that share and extend parent behaviour), polymorphism (method overriding and interface implementation), and abstraction (hiding complex reality while exposing essential features).

面向对象编程是基于类和对象的范式。回顾核心原则：封装（将数据和方法捆绑，限制访问）、继承（创建共享并扩展父类行为的子类）、多态（方法重写和接口实现）以及抽象（隐藏复杂现实，只展示必要特征）。

You should be able to read and write simple class definitions in pseudocode or a specified language. Practice declaring attributes (private, public, protected), constructors, getter/setter methods, and specialised methods. Understand the ‘this’ keyword and how to call parent constructors using ‘super’.

你应该能够用伪代码或指定语言读写简单的类定义。练习声明属性（私有、公有、保护）、构造函数、获取/设置方法以及专用方法。理解 ‘this’ 关键字以及如何使用 ‘super’ 调用父类构造函数。

Inheritance diagrams (UML-style) may appear in questions. Be able to indicate the relationships and deduce the methods and attributes of a subclass. Practice identifying where polymorphism allows a parent reference to call overridden methods of different subclass objects dynamically.

继承图（UML 风格）可能出现在考题中。能够标示关系并推断子类的方法和属性。练习识别多态何时允许父类引用动态调用不同子类对象的重写方法。

OOP design principles help write maintainable code. Revisit the idea of ‘program to an interface, not an implementation’ and recognise how encapsulation protects data integrity. Always link your answers to CCEA’s scenario-based questions, where a class diagram models a real-world system.

面向对象设计原则有助于编写可维护的代码。重温“面向接口编程，而非面向实现”的理念，并认识到封装如何保护数据完整性。始终将你的答案与 CCEA 基于场景的题目联系起来，这些题目用类图为现实世界系统建模。

---

5. Computer Architecture | 计算机体系结构

The von Neumann architecture remains central to the CCEA specification. You must explain the roles of the CPU, main memory (RAM, ROM), control unit, arithmetic logic unit (ALU), and the system bus (address, data, control). Be comfortable with the fetch-decode-execute cycle and how the program counter (PC) and instruction register (IR) interact.

冯·诺依曼体系结构在 CCEA 考纲中仍居中心地位。你必须解释 CPU、主存（RAM、ROM）、控制单元、算术逻辑单元（ALU）以及系统总线（地址总线、数据总线、控制总线）的角色。熟悉取指-译码-执行周期以及程序计数器（PC）和指令寄存器（IR）如何交互。

Factors affecting processor performance are a common exam topic. Compare clock speed, word length, number of cores, and cache memory. Explain how a multi-core processor can execute multiple threads simultaneously, but also recognise the limitation imposed by Amdahl’s law for sequential portions of a program.

影响处理器性能的因素是常见考题。比较时钟频率、字长、核心数和高速缓存。解释多核处理器如何同时执行多个线程，但也要认识到阿姆达尔定律对程序串行部分的限制。

Understand secondary storage technologies: magnetic disks, solid-state drives (SSD), and optical media. Compare their access speeds, durability, cost per byte, and typical applications. Be prepared to justify storage choices for given scenarios, such as cloud data centres versus embedded systems.

理解辅助存储技术：磁盘、固态硬盘（SSD）和光学介质。比较它们的存取速度、耐用性、单位字节成本以及典型应用。准备好为给定场景（如云数据中心与嵌入式系统）选择存储方案并给出理由。

Input and output devices may be examined in the context of interactive systems. Review sensors, barcode readers, touch screens, and actuators. Know how data travels from a sensor through an analogue-to-digital converter (ADC) into the computer and how digital signals are converted back via a DAC.

输入与输出设备可能在交互系统情境下考察。复习传感器、条码阅读器、触摸屏和执行器。了解数据如何从传感器经模数转换器（ADC）进入计算机，以及如何通过数模转换器（DAC）将数字信号转换回去。

---

6. Data Representation | 数据表示

Numbers in computing are represented in binary, hexadecimal, binary-coded decimal (BCD), and floating-point formats. Master conversions between denary, binary, and hex, and understand why BCD is used in financial applications where exact decimal representation is required.

计算机中的数字以二进制、十六进制、二进制编码十进制（BCD）和浮点格式表示。熟练掌握十进制、二进制和十六进制之间的转换，并理解 BCD 为何用于需要精确十进制表示的金融领域。

Binary arithmetic covers addition, subtraction (via two’s complement), and overflow detection. Be able to perform two’s complement subtraction by negating the subtrahend and adding. Understand how the carry and overflow flags differ and when each indicates a genuine arithmetic error.

二进制算术涵盖加法、减法（通过二进制补码）和溢出检测。能够通过求减数的补码相加来执行二进制补码减法。理解进位标志与溢出标志的区别，以及何时各自指示真正的算术错误。

Negative number representation must be clear: sign-and-magnitude and two’s complement. Two’s complement is preferred because it has a single zero and allows the same addition circuit to operate on signed numbers. Practice converting and interpreting negative binary values.

负数表示必须清楚：符号数值法和二进制补码。二进制补码更受青睐，因为它只有一个零且允许同一加法电路对带符号数进行运算。练习转换和解析负的二进制值。

Floating-point representation uses a mantissa and exponent. Revise the IEEE-like format specified by CCEA, normalisation (the first significant bit after the sign bit is different from the sign bit), precision and range trade-offs, and the conversion between floating-point binary and decimal.

浮点表示使用尾数和阶码。复习 CCEA 指定的类似 IEEE 的格式、规格化（符号位后的第一个有效位与符号位不同）、精度与范围的权衡，以及浮点二进制与十进制之间的转换。

Character representation is covered with ASCII, extended ASCII, and Unicode. Know the bit width and number of representable characters for each. Unicode’s ability to represent multiple languages with UTF-8 encoding is important when discussing globalised software and web content.

字符表示方面涵盖 ASCII、扩展 ASCII 和 Unicode。知道每种编码的位宽和可表示字符数量。Unicode 通过 UTF-8 编码表示多种语言的能力在全球化的软件和网络内容讨论中很重要。

Sound and image representation concepts: sample rate, bit depth, bit rate for audio; resolution and colour depth for images. Be able to calculate the file size of an uncompressed image or sound clip using simple multiplication, and explain the effect of metadata.

声音和图像表示的概念：音频的采样率、位深度、比特率；图像的分辨率和颜色深度。能够通过简单乘法计算未压缩的图像或声音片段的文件大小，并解释元数据的影响。

---

7. Operating Systems and Resource Management | 操作系统与资源管理

An operating system (OS) manages hardware and provides a user interface. Revise its core functions: memory management (paging, segmentation, virtual memory), processor scheduling (round robin, shortest job first, priority-based), file management, and security through access control and authentication.

操作系统（OS）管理硬件并提供用户接口。复习其核心功能：内存管理（分页、分段、虚拟内存）、处理器调度（轮转法、最短作业优先、基于优先级）、文件管理，以及通过访问控制和身份验证实现安全。

Virtual memory is a key concept. When RAM is full, the OS uses a section of the hard drive as an extension. Understand the concept of paging, swapping, and thrashing (frequent disk access that drastically slows down performance). Explain the role of the Memory Management Unit (MMU).

虚拟内存是关键概念。当 RAM 满时，操作系统将硬盘的一部分用作扩展。理解分页、交换和颠簸（频繁的磁盘访问导致性能急剧下降）的概念。解释内存管理单元（MMU）的作用。

Processor scheduling algorithms are evaluated using metrics such as throughput, turnaround time, waiting time, and response time. Practice tracing Gantt charts for a set of processes and identify which scheduling policy is best for batch systems versus interactive real-time systems.

处理器调度算法的评价指标包括吞吐量、周转时间、等待时间和响应时间。练习为一组进程绘制甘特图，并识别哪种调度策略最适合批处理系统，哪种适合交互式实时系统。

Interrupt handling and the role of a dispatcher are also examined. Be able to explain how an interrupt is detected, the saving of context, the execution of an Interrupt Service Routine (ISR), and the resumption of the original process. Understand the difference between maskable and non-maskable interrupts.

中断处理与调度程序的角色也会考察。能够解释中断如何被检测、上下文如何保存、中断服务程序（ISR）的执行以及原始进程的恢复。理解可屏蔽中断与不可屏蔽中断的区别。

---

8. Databases and SQL | 数据库与 SQL

Relational databases organise data into tables linked by primary and foreign keys. Revise entity-relationship diagrams (ERDs) to show one-to-one, one-to-many, and many-to-many relationships. Understand why data redundancy is reduced through normalisation up to third normal form (3NF).

关系数据库将数据组织成由主键和外键连接的表。复习实体-关系图（ERD）来展示一对一、一对多和多对多的关系。理解为什么通过规范化为第三范式（3NF）可以减少数据冗余。

SQL commands are divided into DDL and DML. Be ready to write CREATE TABLE with constraints (PRIMARY KEY, FOREIGN KEY, NOT NULL, UNIQUE), and modify schema using ALTER and DROP. For data manipulation, practice SELECT with WHERE, ORDER BY, GROUP BY, HAVING, and various joins (INNER, LEFT).

SQL 命令分为 DDL 和 DML。准备好编写带约束的 CREATE TABLE（PRIMARY KEY、FOREIGN KEY、NOT NULL、UNIQUE），并使用 ALTER 和 DROP 修改模式。对于数据操作，练习带 WHERE、ORDER BY、GROUP BY、HAVING 的 SELECT 以及各种连接（INNER、LEFT）。

Aggregate functions (COUNT, SUM, AVG, MIN, MAX) appear frequently. Be careful with the difference between WHERE and HAVING: WHERE filters rows before grouping, HAVING filters after grouping. Practice writing nested queries (subqueries) to answer multi-table questions without using JOIN.

聚合函数（COUNT、SUM、AVG、MIN、MAX）频繁出现。注意 WHERE 与 HAVING 的区别：WHERE 在分组前过滤行，HAVING 在分组后过滤。练习编写嵌套查询（子查询）来回答涉及多表的问题而不使用 JOIN。

Data consistency and integrity are maintained by constraints and transactions (ACID properties: Atomicity, Consistency, Isolation, Durability). Explain the importance of referential integrity and how cascading updates and deletes work.

数据一致性和完整性由约束和事务（ACID 属性：原子性、一致性、隔离性、持久性）来维护。解释引用完整性的重要性以及级联更新和删除如何工作。

SQL Clause	Purpose
SELECT DISTINCT	Remove duplicate rows from result
ORDER BY DESC	Sort descending
LIMIT / TOP	Restrict the number of returned rows

上表总结了一些常用的 SQL 子句及其用途。

---

9. Data Communication and Networking | 数据通信与组网

Networking models are best understood through the TCP/IP stack. Revise the four layers: Application, Transport, Internet, and Network Access. Know the role of protocols at each layer, such as HTTP/HTTPS, FTP, SMTP (Application), TCP/UDP (Transport), IP (Internet), and Ethernet/Wi-Fi (Network Access).

通过 TCP/IP 协议栈最容易理解网络模型。复习四层：应用层、传输层、互联网层和网络接入层。知道每层协议的作用，例如 HTTP/HTTPS、FTP、SMTP（应用层），TCP/UDP（传输层），IP（互联网层），以及以太网/Wi-Fi（网络接入层）。

The concept of packet switching must be clear. Data is split into packets, each with a header containing source and destination IP addresses, sequence number, and checksum. Routers examine the destination IP and forward packets independently, which may take different routes. This provides fault tolerance but can cause out-of-order delivery.

必须清楚数据包交换的概念。数据被拆分成包，每个包带有包含源和目标 IP 地址、序列号和校验和的包头。路由器检查目标 IP 并独立转发数据包，这些包可能经由不同路径。这提供了容错能力，但可能导致乱序投递。

IP addresses, subnetting, and the difference between IPv4 and IPv6 are examined. Understand why we are transitioning to IPv6 (exhaustion of IPv4 addresses) and how Network Address Translation (NAT) helps share a public IP among private addresses. Practise simple subnet mask calculations.

IP 地址、子网划分以及 IPv4 和 IPv6 的区别会考察。理解为什么转向 IPv6（IPv4 地址耗尽）以及网络地址转换（NAT）如何帮助在私有地址间共享一个公有 IP。练习简单的子网掩码计算。

Wireless communication topics including Wi-Fi (IEEE 802.11), Bluetooth, and cellular network generations should be reviewed. Know the frequencies, ranges, and security mechanisms (WPA3 has largely replaced WEP/WPA). Relate these to the electromagnetic spectrum and interference.

应复习无线通信主题，包括 Wi-Fi（IEEE 802.11）、蓝牙和蜂窝网络代际。了解频率、范围和安全性机制（WPA3 已在很大程度上取代 WEP/WPA）。将这些与电磁波谱和干扰联系起来。

---

10. Cybersecurity, Encryption and Legislation | 网络安全、加密与法律

Threats to data and systems include malware (virus, worm, Trojan, ransomware), phishing, SQL injection, and denial-of-service (DoS/DDoS) attacks. Be able to describe how each attack works and identify appropriate countermeasures such as firewalls, anti-malware software, and intrusion detection systems.

对数据和系统的威胁包括恶意软件（病毒、蠕虫、特洛伊木马、勒索软件）、网络钓鱼、SQL 注入和拒绝服务（DoS/DDoS）攻击。能够描述每种攻击的工作方式并识别相应的对策，如防火墙、反恶意软件和入侵检测系统。

Encryption is vital for data in transit and at rest. Revise symmetric encryption (same key, e.g. AES) and asymmetric encryption (public/private key pair, e.g. RSA). Explain how digital signatures and digital certificates (SSL/TLS) provide authentication and integrity. Practice simple Caesar cipher and Vernam cipher calculations.

加密对于传输中和静态数据至关重要。复习对称加密（相同密钥，如 AES）和非对称加密（公钥/私钥对，如 RSA）。解释数字签名和数字证书（SSL/TLS）如何提供身份验证和完整性。练习简单的凯撒密码和 Vernam 密码的计算。

Key legislation in the UK includes the Computer Misuse Act 1990 (offences: unauthorised access, access with intent to commit further offences, unauthorised modification of data), the Data Protection Act 2018 (GDPR principles), and the Regulation of Investigatory Powers Act (RIPA). Relate these to specific scenarios where personal data is processed.

英国的关键法律包括《1990 年计算机滥用法》（罪行：未经授权访问、意图进一步犯罪的访问、未经授权修改数据）、《2018 年数据保护法》（GDPR 原则）和《调查权力规范法》（RIPA）。将这些与处理个人数据的具体场景联系起来。

Ethical and environmental considerations are also assessed. Be ready to discuss the digital divide, green computing (energy-efficient hardware, responsible e-waste disposal), and the impact of AI and automation on employment. Use concrete examples, such as the carbon footprint of data centres or the use of assistive technology.

伦理与环境因素也会被评估。准备好讨论数字鸿沟、绿色计算（节能硬件、负责任的电子废物处理）以及人工智能和自动化对就业的影响。使用具体例子，如数据中心的碳足迹或辅助技术的使用。

---

11. Software Development and Exam Technique | 软件开发与考试技巧

Understand the stages of the software development lifecycle: analysis, design, implementation, testing, deployment, and maintenance. Be able to distinguish between verification (are we building the product right?) and validation (are we building the right product?), and describe testing methods: unit, integration, system, and acceptance.

理解软件开发生命周期的阶段：分析、设计、实现、测试、部署和维护。能够区分验证（我们是否正确地构建了产品？）和确认（我们是否构建了正确的产品？），并描述测试方法：单元测试、集成测试、系统测试和验收测试。

Familiarise yourself with common design tools: data flow diagrams (DFDs), flowcharts, structure charts, and Gantt charts for project management. Practice interpreting these diagrams and explaining how they aid communication among developers and stakeholders.

熟悉常用的设计工具：数据流图（DFD）、流程图、结构图以及用于项目管理的甘特图。练习解读这些图表并解释它们如何促进开发人员和利益相关者之间的沟通。

In your exam, time management is critical. Use the marks allocation as a guide; a 2-mark question expects a concise, accurate answer, while a 6-mark extended response requires a structured argument. Show working clearly in calculations, and in pseudocode questions, opt for clarity over clever shortcuts.

考试中，时间管理至关重要。将分值作为指引；2 分的题目期望简洁准确的回答，而 6 分的扩展回答则需要结构化的论证。在计算题中清晰展示步骤，在伪代码题中，优先选择清晰明了而非取巧的捷径。

Finally, review CCEA past papers and mark schemes to internalise the expected phrasing and depth. Create summary sheets for each topic, test yourself regularly, and practise explaining concepts aloud. Consistent retrieval practice is the most effective way to consolidate the wide range of computer science knowledge required at A-Level.

最后，复习 CCEA 历年真题和评分方案，内化期望的措辞和深度。为每个主题制作总结表，定期自我测试，并练习口头解释概念。持续的检索练习是巩固 A-Level 所需广泛计算机科学知识的最有效方法。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）