A-Level CCEA Computer Science: High-Frequency Exam Topics Summary | A-Level CCEA 计算机：高频考点总结

📚 A-Level CCEA Computer Science: High-Frequency Exam Topics Summary | A-Level CCEA 计算机：高频考点总结

This article summarises the most frequently examined topics in the CCEA A-Level Computer Science specification. Covering both AS and A2 units, it highlights essential concepts, algorithms, and principles that regularly appear in past papers. Whether you are revising for module 1 or preparing for the final assessment, these key areas will help you focus your study effectively.

本文总结了 CCEA A-Level 计算机科学考纲中最常考的主题。文章涵盖 AS 和 A2 单元，梳理了历年真题中反复出现的关键概念、算法与原理。无论你是在复习模块一还是备战期末评估，这些重点领域都将帮助你高效聚焦学习。

1. Data Structures and Abstract Data Types | 数据结构与抽象数据类型

Abstract data types (ADTs) specify the behaviour of data structures without revealing implementation details. The stack is a LIFO structure supporting push and pop; the queue is a FIFO structure with enqueue and dequeue. Candidates must trace these operations and implement them using arrays or linked lists.

抽象数据类型 (ADT) 规定了数据结构的行为而不暴露实现细节。栈是后进先出 (LIFO) 结构，支持 push 和 pop；队列是先进先出 (FIFO) 结构，对应 enqueue 和 dequeue。考生需要能够跟踪这些操作，并用数组或链表加以实现。

Binary trees, especially binary search trees, are common. Knowledge of traversals (pre-order, in-order, post-order) and tree-based expression evaluation is tested. Hash tables and collision resolution strategies such as chaining and open addressing also appear, with questions on load factor and efficiency.

二叉树，尤其是二叉搜索树，十分常见。树的遍历（前序、中序、后序）和基于树的表达式求值是考查内容。散列表以及链地址法和开放寻址法等解决冲突的策略同样会出现，常常涉及负载因子和效率的提问。

2. Algorithms and Complexity | 算法与复杂度

Sorting algorithms – bubble, insertion, merge, and quick sort – are core. Candidates compare time complexities, discuss stability, and reason about the choice of algorithm. Linear search and binary search are examined alongside O(n) and O(log n) characterisations.

排序算法，包括冒泡、插入、归并和快速排序，是核心内容。考生需要比较它们的时间复杂度，讨论稳定性，并对算法选择进行论证。线性搜索和二分搜索连同 O(n) 和 O(log n) 的特性也一同考查。

At A2, graph algorithms such as Dijkstra’s shortest path and A* heuristic search are tested step by step. Recursion is a recurring theme: candidates must handle base cases, the call stack, and design recursive solutions for tasks like factorial, Fibonacci, or tree problems.

在 A2 阶段，图算法如 Dijkstra 最短路径和 A* 启发式搜索会被逐步测试。递归是反复出现的主题：考生必须处理基案、调用栈，并为阶乘、斐波那契或树问题设计递归解法。

3. Object-Oriented Programming | 面向对象编程

OOP is central to the CCEA programming unit. Encapsulation binds data and methods; inheritance creates class hierarchies; polymorphism lets objects of different types respond to the same method call. Candidates write class definitions, identify ‘is-a’ and ‘has-a’ relationships, and apply overriding/overloading.

面向对象编程 (OOP) 是 CCEA 编程单元的核心。封装绑定数据和方法；继承创建类的层次结构；多态让不同类型的对象响应同一方法调用。考生需要编写类定义，识别“is-a”与“has-a”关系，并应用重写和重载。

UML class diagrams, showing inheritance, association, aggregation, and composition, must be interpreted and drawn. Implementation in Java or C# requires proper use of constructors, access modifiers, instance variables, and understanding of static versus instance members.

UML 类图展示继承、关联、聚合与组合，考生需要能够解读和绘制。使用 Java 或 C# 实现时，要求正确使用构造方法、访问修饰符、实例变量，并理解静态成员与实例成员的区别。

4. Computer Architecture and Data Representation | 计算机体系结构与数据表示

The Von Neumann architecture features a control unit, ALU, and registers (PC, MAR, MDR, CIR, accumulator). The fetch-decode-execute cycle must be described, along with the role of the system bus in transferring data between memory and CPU.

冯·诺依曼体系结构包含控制单元、算术逻辑单元和寄存器（程序计数器、内存地址寄存器、内存数据寄存器、当前指令寄存器、累加器）。需要

Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com

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