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

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

This revision guide distils the most frequently examined concepts in A-Level Computer Science, covering data representation, hardware, software, programming, networking, and more. Mastering these core topics will give you a solid foundation for both Paper 1 and Paper 2 assessments.

这份备考指南提炼了 A-Level 计算机中最常考的概念，涵盖数据表示、硬件、软件、编程、网络等内容。掌握这些核心主题，将为你的 Paper 1 和 Paper 2 考试打下扎实的基础。

1. Data Representation & Number Systems | 数据表示与数字系统

Binary, denary, and hexadecimal conversions are a staple of every exam board. Candidates must be able to convert between these number systems fluently and understand why hex is used as a shorthand for binary.

二进制、十进制和十六进制的转换是各大考局的必考内容。考生必须能够熟练地在这些数字系统间转换，并理解为什么十六进制被用作二进制的速记形式。

• Binary → Denary: Multiply each bit by its place value (power of 2) and sum.
• 二进制转十进制：每位乘以它的位值（2 的幂）再求和。
• Binary → Hexadecimal: Group bits into nibbles (4 bits), convert each nibble to hex (0–9, A–F).
• 二进制转十六进制：将位分成半字节（4 位一组），每组转换为 0–9, A–F。
• Two’s complement is used to represent negative integers: invert all bits and add 1.
• 二进制补码用于表示负整数：将所有位取反后加 1。
• Floating‑point binary (mantissa × 2^exponent) is examined in normalised form. Understand precision vs range trade‑off.
• 浮点二进制（尾数 × 2^指数）考察规范化形式。要理解精度与范围的权衡。

2. Computer Architecture & the Fetch‑Decode‑Execute Cycle | 计算机体系结构及取指‑译码‑执行周期

The Von Neumann architecture underpins almost all modern computers. Exams frequently test the roles of the CPU components and the detailed steps of the F‑D‑E cycle.

冯·诺依曼体系结构是几乎所有现代计算机的基础。考试经常考查 CPU 各部件的角色以及取指‑译码‑执行周期的详细步骤。

• Control Unit (CU) sends signals to coordinate components; ALU performs arithmetic/logic; registers (PC, MAR, MDR, CIR, ACC) hold temporary data.
• 控制单元 (CU) 发送信号协调各部件；ALU 执行算术/逻辑运算；寄存器 (PC, MAR, MDR, CIR, ACC) 保存临时数据。
• Fetch: PC → MAR, address bus sends to memory, data returns via data bus into MDR, copied to CIR. PC increments.
• 取指：PC → MAR，地址总线发送到内存，数据经数据总线返回存入 MDR，复制到 CIR。PC 递增。
• Decode: CU interprets the instruction in CIR.
• 译码：CU 解释 CIR 中的指令。
• Execute: CU dispatches signals; e.g. LOAD from memory, ADD with ALU, STORE to RAM.
• 执行：CU 分派信号；例如从内存 LOAD，用 ALU 做 ADD，STORE 到 RAM。
• Factors affecting performance: clock speed, number of cores, cache size, bus width.
• 影响性能的因素：时钟速度、核心数量、缓存大小、总线宽度。

3. Memory & Storage Devices | 内存与存储设备

Distinguishing between primary and secondary storage, and between volatile and non‑volatile memory, is repeatedly examined. Candidates should also compare magnetic, optical and solid‑state technologies.

区分主存储器和辅助存储、易失性和非易失性存储器是反复考察的点。考生还应比较磁、光和固态技术。

• RAM: volatile, stores currently running programs and data; faster than secondary storage.
• RAM：易失性，存储当前运行的程序和数据；比辅助存储快。
• ROM: non‑volatile, stores boot firmware (BIOS/UEFI); cannot be easily altered.
• ROM：非易失性，存储引导固件 (BIOS/UEFI)；不易修改。
• Virtual memory uses part of the HDD/SSD as an extension of RAM when RAM is full; causes disk thrashing.
• 虚拟内存 在 RAM 满时，将硬盘/SSD 的一部分用作 RAM 扩展；会导致磁盘抖动。
• SSD vs HDD: SSDs have no moving parts, lower latency, better durability, but generally higher cost per GB.
• SSD 与 HDD：SSD 无移动部件，延迟更低，耐用性更好，但每 GB 成本通常更高。

4. Operating Systems & Interrupts | 操作系统与中断

Understand the kernel’s role in resource management and how interrupts allow the CPU to handle external events efficiently. The process of context switching is a classic exam question.

理解内核在资源管理中的角色，以及中断如何让 CPU 高效地处理外部事件。上下文切换的过程是经典的考题。

• Functions of OS: memory management, process scheduling, file management, I/O management, security (access rights).
• 操作系统的功能：内存管理、进程调度、文件管理、I/O 管理、安全（访问权限）。
• ISR (Interrupt Service Routine): When an interrupt occurs, CPU finishes current instruction, saves context (registers, PC) onto stack, runs ISR, then restores context.
• 中断服务程序 (ISR)：发生中断时，CPU 完成当前指令，将上下文（寄存器、PC）保存到栈，运行 ISR，然后恢复上下文。
• Interrupt priorities prevent low‑priority interrupts from blocking high‑priority ones (e.g., timer, I/O, hardware fault).
• 中断优先级防止低优先级中断阻塞高优先级中断（如定时器、I/O、硬件故障）。
• Scheduling algorithms: Round Robin, First‑Come‑First‑Served, Shortest Job First, Priority‑based; be ready to evaluate fairness, throughput, and response time.
• 调度算法：轮转调度、先来先服务、最短作业优先、优先级调度；准备评估公平性、吞吐量和响应时间。

5. Programming Basics & Data Structures | 编程基础与数据结构

Examiners expect you to trace code, identify syntax vs logic errors, and understand the behaviour of fundamental data structures. Be comfortable reading pseudocode or exam‑specific languages.

考官期望你能够跟踪代码、识别语法错误与逻辑错误，并理解基本数据结构的行为。要能轻松阅读伪代码或考试专用语言。

• Variables and data types: integer, real/float, char, string, Boolean; casting between types.
• 变量与数据类型：整型、实型/浮点型、字符、字符串、布尔型；类型间的强制转换。
• Control structures: sequence, selection (IF‑THEN‑ELSE, CASE), iteration (FOR, WHILE, REPEAT‑UNTIL).
• 控制结构：顺序、选择 (IF‑THEN‑ELSE, CASE)、循环 (FOR, WHILE, REPEAT‑UNTIL)。
• Arrays and lists: static (fixed size) vs dynamic; 2D arrays for tables.
• 数组与列表：静态（固定大小）与动态；二维数组用于表格。
• Stacks and queues: LIFO vs FIFO; be able to trace push/pop and enqueue/dequeue operations with pointers (head/tail).
• 栈和队列：后进先出与先进先出；要能够用指针（头部/尾部）跟踪压入/弹出和入队/出队操作。
• Subroutines and parameter passing: procedures vs functions; by‑value (copy) vs by‑reference (address).
• 子程序与参数传递：过程与函数；传值（复制）与传引用（地址）。

6. Algorithms: Searching & Sorting | 算法：搜索与排序

Linear search and binary search are examined together, often asking about pre‑conditions (sorted list for binary) and time complexity. Bubble sort and insertion sort are the most frequent sorting algorithms.

线性搜索和二分搜索经常一起考查，常问及前提条件（二分需有序列表）和时间复杂度。冒泡排序和插入排序是最常考的排序算法。

• Binary search: repeatedly halve the list by comparing middle element; only works on sorted data. Time complexity O(log n).
• 二分搜索：通过比较中间元素反复将列表减半；只适用于有序数据。时间复杂度 O(log n)。
• Linear search: checks each element sequentially; time O(n).
• 线性搜索：逐个检查每个元素；时间 O(n)。
• Bubble sort: compare adjacent items and swap if out of order; after each pass the largest element ‘bubbles’ to the end. Time O(n²).
• 冒泡排序：比较相邻项，若顺序错误则交换；每趟后最大元素“冒泡”到末尾。时间 O(n²)。
• Insertion sort: build sorted sublist by inserting each new item into correct position. Efficient for nearly sorted data.
• 插入排序：通过将每个新项插入正确位置来构建已排序子列表。对接近有序的数据效率高。
• You must be able to state the number of comparisons/swaps or complete trace tables for given data.
• 你必须能够针对给定数据，说出比较/交换的次数或完成跟踪表。

7. Databases & SQL | 数据库与 SQL

Relational databases, normalisation, and SQL query writing form a pivotal section of the specification. Candidates need to know how to eliminate data redundancy through normalisation up to 3NF.

关系数据库、规范化和 SQL 查询编写是考纲中的核心部分。考生需要知道如何通过规范化（最高到 3NF）消除数据冗余。

• Primary key: unique identifier for a tuple; foreign key: links to primary key in another table for referential integrity.
• 主键：元组的唯一标识；外键：连接另一表的主键以保证引用完整性。
• Normalisation steps: 1NF (atomic values, no repeating groups) → 2NF (no partial dependencies) → 3NF (no transitive dependencies).
• 规范化步骤：1NF（原子值，无重复组）→ 2NF（无部分依赖）→ 3NF（无传递依赖）。
• SQL commands: SELECT… FROM… WHERE… ORDER BY… INNER JOIN… ON…; be prepared to use LIKE, BETWEEN, wildcard %, and aggregate functions (COUNT, SUM, AVG).
• SQL 命令：SELECT… FROM… WHERE… ORDER BY… INNER JOIN… ON…；准备使用 LIKE、BETWEEN、通配符 % 及聚合函数 (COUNT, SUM, AVG)。
• Understand how to perform a database query stepwise, producing the resulting table from given data.
• 理解如何逐步执行数据库查询，从给定数据生成结果表。

8. Networking & Protocols | 网络与协议

TCP/IP stack, packet switching, and the purpose of key protocols are popular exam themes. Be clear on the difference between the Internet and the World Wide Web.

TCP/IP 协议栈、分组交换以及关键协议的作用是常见的考试主题。要清楚互联网与万维网的区别。

• TCP/IP layers: Application (HTTP, FTP, SMTP), Transport (TCP, UDP), Internet (IP), Link (Ethernet, Wi‑Fi).
• TCP/IP 层次：应用层 (HTTP, FTP, SMTP)、传输层 (TCP, UDP)、网络层 (IP)、链路层 (以太网、Wi‑Fi)。
• Packet switching: data split into packets with header (source, destination, sequence number), routed independently, reassembled at destination.
• 分组交换：数据拆分为带有报头（源地址、目标地址、序号）的分组，独立路由，在目的地重组。
• Client‑server vs peer‑to‑peer: centralised vs distributed; know advantages/disadvantages for performance and security.
• 客户端‑服务器与对等网络：集中式与分布式；了解在性能和安全方面的优缺点。
• Network security: firewalls (packet filtering), encryption (symmetric, asymmetric), digital signatures for authentication.
• 网络安全：防火墙（包过滤）、加密（对称、非对称）、用于身份验证的数字签名。

9. Boolean Algebra & Logic Circuits | 布尔代数与逻辑电路

Simplifying logic expressions using Boolean laws and Karnaugh maps, then drawing the corresponding logic gate circuits, is a tested skill. Truth tables underpin everything.

利用布尔定律和卡诺图化简逻辑表达式，然后绘制相应的逻辑门电路，是一项会被考查的技能。真值表是这一切的基础。

• Basic gates: AND (A•B), OR (A+B), NOT (Ā), XOR (A⊕B).
• 基本门：与 (A•B)、或 (A+B)、非 (Ā)、异或 (A⊕B)。
• Boolean identities: De Morgan’s Theorems: (A•B)’ = A’ + B’; (A+B)’ = A’ • B’.
• 布尔恒等式：德摩根定理：(A•B)’ = A’ + B’；(A+B)’ = A’ • B’。
• Karnaugh maps: used to minimise circuits with up to 4 variables; group 1s in powers of 2.
• 卡诺图：用于最小化最多 4 个变量的电路；以 2 的幂次分组相邻的 1。
• Be prepared to build a logic circuit from a problem statement, then simplify and re‑draw.
• 准备好从问题描述构建逻辑电路，然后化简并重新绘制。
• Half adder and full adder circuits are typical applications.
• 半加器和全加器电路是典型应用。

10. System Development Lifecycle & Ethics | 系统开发生命周期与伦理

The waterfall model and its stages (analysis, design, implementation, testing, evaluation) are examined alongside alternative methodologies like Agile. Questions also probe legal and ethical responsibilities.

瀑布模型及其阶段（分析、设计、实现、测试、评估）与敏捷等替代方法一起被考查。考题还会涉及法律和伦理责任。

• Waterfall: sequential phases, each completed before the next begins; suitable when requirements are well‑understood.
• 瀑布模型：顺序阶段，每个阶段完成后才进入下一阶段；适用于需求明确时。
• Agile: iterative development with user feedback; focuses on adaptability and minimal bureaucracy.
• 敏捷开发：迭代开发并伴有用户反馈；注重适应性和最小官僚流程。
• Testing strategies: alpha (in‑house) / beta (external users); black‑box (functional) vs white‑box (structural); unit, integration, system, acceptance testing.
• 测试策略：alpha（内部）/ beta（外部用户）；黑盒（功能）与白盒（结构）；单元、集成、系统、验收测试。
• Legal & ethical issues: Data Protection Act, Computer Misuse Act, Copyright and Patents Act; AI ethics, bias, privacy.
• 法律与伦理问题：《数据保护法》、《计算机滥用法》、《版权与专利法》；人工智能伦理、偏见、隐私。
• Be able to discuss how technology impacts society and recommend responsible practices.
• 能够讨论技术如何影响社会，并推荐负责任的做法。

11. Computational Thinking & Problem Solving | 计算思维与问题解决

This overarching skill involves decomposition, pattern recognition, abstraction, and algorithm design. You may be asked to design a solution to a novel problem using these techniques.

这项统括性的技能包括分解、模式识别、抽象和算法设计。你可能会被要求使用这些技术，针对一个新颖的问题设计解决方案。

• Decomposition: break a complex problem into smaller, manageable parts.
• 分解：将复杂问题拆分为更小、可管理的部分。
• Abstraction: focus on essential features, ignoring irrelevant details (e.g., map of a city omits houses).
• 抽象：专注于关键特征，忽略无关细节（例如城市地图省略房屋）。
• Algorithm writing: use structured English pseudocode; clearly initialise variables, show loops, and ensure termination.
• 算法编写：使用结构化的英语伪代码；清晰地初始化变量、表示循环并确保终止。
• Common patterns: counting, totalling, min/max finding, flag‑controlled loops.
• 常见模式：计数、累加、查找最小值/最大值、标志控制循环。

12. Examination Technique & Common Pitfalls | 应试技巧与常见陷阱

A‑Level Computer Science papers reward precise terminology and step‑by‑step reasoning. Avoid vague answers and always connect your explanation to the context given in the question.

A‑Level 计算机试卷青睐精确的术语和逐步的推理。避免模糊的答案，并务必将你的解释与题目给出的上下文联系起来。

• Command words: ‘State’ (brief), ‘Explain’ (how/why), ‘Describe’ (characteristics), ‘Evaluate’ (pros/cons, conclusion).
• 指令词：’State’（简述），’Explain’（如何/为什么），’Describe’（特征），’Evaluate’（优缺点，结论）。
• When drawing logic circuits or data paths, use clear symbols and label buses neatly.
• 绘制逻辑电路或数据路径时，使用清晰的符号并整齐地标记总线。
• Check trace tables one line at a time; a single early mistake can propagate.
• 逐行检查跟踪表；早期的一个错误会扩散。
• Manage time: allocate roughly one mark per minute, leaving 10–15 minutes for checking.
• 管理时间：大约每分钟做 1 分的题，留出 10–15 分钟检查。

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

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