📚 IB and AQA Computer Science: High-Frequency Topics Summary | IB与AQA计算机科学：高频考点总结
Whether you are preparing for IB Computer Science (HL/SL) or AQA A-level Computer Science, certain topics appear with striking regularity across past papers. This revision guide distils the most frequently examined concepts, from von Neumann architecture and boolean algebra to object-oriented programming and SQL, equipping you with a structured, bilingual review. Each section is presented in concise English–Chinese paired paragraphs to reinforce understanding of technical terms and exam-style reasoning.
无论你正在备考 IB 计算机科学（HL/SL）还是 AQA A-level 计算机科学，有一部分主题在历年真题中反复出现。本复习指南提炼了最高频的考点，从冯·诺依曼体系结构和布尔代数，到面向对象编程与 SQL，用结构化的双语讲解帮助你巩固技术术语和答题思维。每一节均以英文—中文配对段落呈现，便于对照理解。
1. Computer Systems Architecture | 计算机系统架构
The von Neumann architecture remains the backbone of all examination specifications. It describes a system where program instructions and data share the same memory and are transferred via a single set of buses (data, address, control). The processor continuously fetches, decodes and executes instructions in a cycle, using dedicated registers: PC (Program Counter), MAR (Memory Address Register), MDR (Memory Data Register), CIR (Current Instruction Register) and ACC (Accumulator).
冯·诺依曼架构是所有考试大纲的基础。它描述了一种程序指令和数据共享同一内存、并通过一组总线（数据总线、地址总线、控制总线）传输的系统。处理器在专用寄存器配合下不断执行“取指—译码—执行”周期，关键寄存器包括程序计数器 PC、内存地址寄存器 MAR、内存数据寄存器 MDR、当前指令寄存器 CIR 和累加器 ACC。
The fetch-decode-execute (FDE) cycle is often worth 4–6 marks. In the fetch phase, MAR ← PC, then PC is incremented; memory read places the instruction into MDR, which is copied to CIR. In decode, the control unit interprets the opcode. In execute, the operation is performed, sometimes involving memory again. Understanding how each register changes during a sample instruction (e.g., LDA #5 or ADD 10) is vital.
取指—译码—执行（FDE）周期常占 4−6 分。取指阶段：MAR ← PC，然后 PC 递增；内存读出后指令进入 MDR，再复制到 CIR。译码阶段：控制单元解析操作码。执行阶段：执行具体操作，可能再次访问内存。掌握某条示例指令（如 LDA #5 或 ADD 10）执行过程中各寄存器如何变化，非常重要。
For AQA, you must also describe the Harvard architecture, where instruction and data memories are physically separate, allowing simultaneous access. It is common in DSPs and microcontrollers. In contrast, IB places more emphasis on the roles of the ALU, cache levels, and the impact of clock speed, cores and pipelining on performance.
在 AQA 考试中还需描述哈佛架构，即指令内存与数据内存物理分离，可同时访问，常见于数字信号处理器和微控制器。IB 则更侧重 ALU 功能、多级缓存，以及时钟频率、核心数和流水线对性能的影响。
2. Data Representation | 数据表示
Binary, denary and hexadecimal conversions are tested in every session. An 8-bit binary number
n = b₇×2⁷ + b₆×2⁶ + … + b₀×2⁰
can represent 0 to 255 unsigned, or −128 to +127 in two’s complement. Hex simplifies reading: 1101 1111₂ becomes DF₁₆. Be fluent in conversions without a calculator, including fractional binary (e.g., 0.101₂ = 0.625₁₀).
二进制、十进制和十六进制的转换每次考试必考。一个 8 位二进制数
n = b₇×2⁷ + b₆×2⁶ + … + b₀×2⁰
无符号可表示 0−255，补码则可表示 −128 至 +127。十六进制简化了阅读：1101 1111₂ 即 DF₁₆。要熟练进行无需计算器的转换，包括小数二进制（例如 0.101₂ = 0.625₁₀）。
Two’s complement negation: invert all bits and add 1. Overflow occurs when the result of an operation exceeds the representable range—recognisable when the carry into the sign bit differs from the carry out. Both IB and AQA expect you to detect overflow and explain its consequence.
补码取反：所有位取反后加 1。当运算结果超出表示范围时发生溢出，可通过“符号位进位与最高有效位进位不一致”来识别。IB 和 AQA 均要求你检测溢出并解释其后果。
Floating-point representation uses a sign bit, mantissa and exponent. In IB, you normalise mantissas so the binary point is preceded by 01 or 10. AQA focuses more on converting given mantissa-exponent pairs to denary and vice versa. Know the trade-off between range and precision.
浮点数表示使用符号位、尾数和阶码。IB 要求对尾数进行规格化，使小数点前为 01 或 10。AQA 更侧重于给定尾数−阶码组合与十进制之间的互转。理解范围与精度之间的权衡。
3. Boolean Logic & Logic Gates | 布尔逻辑与逻辑门
Logic gates (AND, OR, NOT, NAND, NOR, XOR) are the building blocks of digital circuits. You must draw truth tables and recognise gate symbols for both AQA and IB. A common high-mark question asks you to simplify a boolean expression using identities or Karnaugh maps and then implement the result with the fewest gates.
逻辑门（AND、OR、NOT、NAND、NOR、XOR）是数字电路的基石。你必须能画出真值表并识别门符号，两种考试均作要求。一类常见高分题是要求运用恒等式或卡诺图化简布尔表达式，再用最少门电路实现。
| Gate | Symbol | Boolean Expression |
|---|---|---|
| AND | A·B | A AND B |
| OR | A+B | A OR B |
| NOT | Ā | NOT A |
| NAND | (A·B)’ | NOT (A AND B) |
| NOR | (A+B)’ | NOT (A OR B) |
| XOR | A⊕B | A XOR B = A·B’ + A’·B |
De Morgan’s laws — (A·B)’ = A’ + B’ and (A+B)’ = A’·B’ — appear explicitly in both syllabi. You might be asked to apply them to simplify a circuit or prove an equivalence. IB HL extends this to universal gates (NAND/NOR) used as building blocks for any logic circuit.
德摩根定律——(A·B)’ = A’ + B’ 及 (A+B)’ = A’·B’——在两个大纲中均会直接考查。你可能会被要求运用它化简电路或证明等价性。IB HL 还将其扩展到用通用门（NAND/NOR）构建任意逻辑电路。
A half adder combines XOR and AND to produce Sum and Carry; a full adder cascades two half adders to include a carry-in. IB HL frequently asks for a full-adder diagram or truth table. AQA may ask about the relation of adders to the ALU.
半加器用 XOR 和 AND 产生 Sum 和 Carry；全加器级联两个半加器以包含进位输入。IB HL 经常要求画出全加器图或真值表。AQA 则可能询问加法器与 ALU 的关系。
4. Operating Systems & System Software | 操作系统与系统软件
An operating system manages hardware resources and provides a platform for applications. Key functions include memory management (paging, segmentation), processor scheduling (round-robin, priority-based), file management and input/output control. Both IB and AQA require you to explain why multi-tasking needs scheduling.
操作系统管理硬件资源并为应用提供平台。其主要功能包括内存管理（分页、分段）、处理器调度（轮转、优先级）、文件管理与输入/输出控制。IB 和 AQA 均要求你解释多任务为何需要调度。
Virtual memory uses a portion of secondary storage to simulate extra RAM when physical memory is full, swapping pages in and out. This can lead to disk thrashing if too many page faults occur. IB expects you to link virtual memory to the paging system and page tables.
虚拟内存利用部分辅助存储器模拟额外 RAM，当物理内存满时通过页面调换机制进行。若页面错误过多会导致磁盘抖动。IB 期望你将虚拟内存与分页系统和页表关联起来理解。
Low-level system software includes assemblers, compilers and interpreters. Distinguish their roles: an assembler translates assembly to machine code; a compiler translates high-level source code to machine code in one go; an interpreter translates and executes line-by-line. AQA emphasises lexical, syntax and code generation stages of compilation.
低级系统软件包括汇编器、编译器和解释器。区分其作用：汇编器将汇编语言转为机器码；编译器一次性将高级源代码转为机器码；解释器则逐行翻译执行。AQA 侧重编译过程的词法分析、语法分析和代码生成阶段。
5. Computer Networks & Protocols | 计算机网络与协议
TCP/IP stack understanding is central. Layers — Application (HTTP, FTP, SMTP), Transport (TCP, UDP), Internet (IP) and Link — each encapsulate data with headers. IB HL adds detailed TCP handshake (SYN, SYN-ACK, ACK) and sliding window; AQA focuses on UDP uses in live streaming and DNS basics.
理解 TCP/IP 协议栈是核心。各层——应用层 (HTTP, FTP, SMTP)、传输层 (TCP, UDP)、网络层 (IP) 和链路层——通过头部封装数据。IB HL 会深入 TCP 握手（SYN, SYN-ACK, ACK）和滑动窗口；AQA 则关注 UDP 在直播中的使用以及 DNS 基础。
Network hardware: a hub broadcasts to all ports; a switch forwards based on MAC addresses; a router uses IP addresses to forward packets between networks. Know the role of MAC vs IP addresses and the concept of ARP.
网络硬件：集线器向所有端口广播；交换机基于 MAC 地址转发；路由器使用 IP 地址在网络间转发数据包。需理解 MAC 地址与 IP 地址的区别，以及 ARP 的概念。
Client-server and peer-to-peer models are compared regularly. In IB, you must discuss cloud computing (IaaS, PaaS, SaaS) and security issues like DDoS, phishing and encryption (symmetric vs asymmetric). AQA may ask about public/private key encryption with RSA-like illustrations.
客户端−服务器模型与对等网络模型常被对比。IB 要求你讨论云计算 (IaaS, PaaS, SaaS) 以及 DDoS、网络钓鱼和加密（对称与非对称）等安全问题。AQA 则可能以类似 RSA 的示例考查公钥/私钥加密。
6. Databases & SQL | 数据库与 SQL
Relational databases organise data into tables with primary keys, foreign keys and composite keys. Entity-relationship diagrams (ERDs) help visualise 1:1, 1:M and M:N relationships. Both IB and AQA demand normalisation to third normal form (3NF): remove repeating groups, partial dependencies and transitive dependencies.
关系数据库将数据组织为表，使用主键、外键和复合键。实体关系图 (ERD) 可直观展示 1:1、1:M 和 M:N 关系。IB 和 AQA 均要求掌握第三范式 (3NF) 的规范化：消除重复组、部分依赖和传递依赖。
SQL queries form a substantial part of Paper 2 (IB) or the AQA practical component. You must write
SELECT column FROM table WHERE condition ORDER BY column;
as well as INSERT, UPDATE, DELETE, and inner joins. Aggregate functions (COUNT, SUM, AVG, MAX, MIN) with GROUP BY and HAVING are high-frequency.
SQL 查询在 IB 试卷 2 或 AQA 实践部分占很大比重。你必须能写出
SELECT 列 FROM 表 WHERE 条件 ORDER BY 列;
以及 INSERT、UPDATE、DELETE 和内连接。聚合函数 (COUNT, SUM, AVG, MAX, MIN) 搭配 GROUP BY 与 HAVING 是高频考点。
Transaction processing (ACID properties: Atomicity, Consistency, Isolation, Durability) and concurrency control are more prominent in IB HL, where you may need to discuss lost updates and locking mechanisms.
事务处理（ACID 特性：原子性、一致性、隔离性、持久性）和并发控制在 IB HL 中更突出，你可能需要讨论更新丢失和锁定机制。
7. Data Structures — Stacks, Queues, Trees | 数据结构——栈、队列、树
A stack is a LIFO (Last In, First Out) structure with push, pop and peek operations, often examined through call-stack scenarios or bracket-checking algorithms. A queue is FIFO (First In, First Out), with enqueue and dequeue; circular queues remove the need to shift elements.
栈是一种 LIFO（后进先出）结构，有 push、pop 和 peek 操作，常通过调用栈场景或括号匹配算法进行考查。队列是 FIFO（先进先出），有入队和出队操作；循环队列避免了元素的移动。
For IB, you must be able to trace and construct binary trees and binary search trees (BST). Know pre-order, in-order and post-order traversals. Balanced trees (AVL) and their rotations are HL content. AQA includes linked lists (single, double, circular) and their insertion/deletion algorithms.
IB 要求你能够跟踪和构造二叉树及二叉搜索树 (BST)。掌握前序、中序和后序遍历。平衡树 (AVL) 及其旋转属于 HL 内容。AQA 则包括链表（单、双、循环）及其插入与删除算法。
Hash tables use a hash function to map keys to indices; collisions are resolved via separate chaining or linear/quadratic probing. You should analyse the efficiency:
Search: BST O(log₂ n) (balanced) vs. O(n) (worst); Hash table average O(1)
IB expects complexity comparisons.
哈希表使用哈希函数将键映射到索引；冲突通过分离链或线性/二次探测解决。应分析其效率：
搜索：平衡 BST O(log₂ n) vs. 最坏 O(n)；哈希表平均 O(1)
IB 要求复杂度比较。
8. Algorithms & Computational Thinking | 算法与计算思维
Standard algorithms recur every year: linear and binary search, bubble sort, insertion sort and quick sort. You must trace execution, identify best/worst/average cases, and write pseudocode. Time complexity notation uses
O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)
IB HL adds merge sort and recursion trees; AQA focuses on comparing efficiency with tables of timings.
标准算法每年必考：线性与二分搜索、冒泡、插入和快速排序。你必须能够跟踪执行过程、识别最好/最坏/平均情况，并编写伪代码。时间复杂度符号使用
O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)
IB HL 会增加归并排序和递归树；AQA 侧重通过计时表比较效率。
Recursion and its call stack are crucial for IB: base case, recursive case, stack overflow risks. Converting an iterative solution to recursion and vice versa is a commonly tested skill. AQA may ask trace table completion for recursive procedures.
递归及其调用栈对 IB 至关重要：基线条件、递归情况、栈溢出风险。将迭代解转化为递归解（反之亦然）是常考技能。AQA 可能要求完成递归过程的跟踪表。
Problem-solving methodology involves decomposition, pattern recognition, abstraction and algorithm design. Both specifications ask for real-life computational thinking scenarios, often involving searching large datasets or simulating a queue at a supermarket.
问题解决方法论包括分解、模式识别、抽象化和算法设计。两种大纲都会出实际生活中的计算思维情景题，如搜索大型数据集或模拟超市排队。
9. Programming Fundamentals | 编程基础
You are expected to read, write and debug code in pseudocode and a high-level language (Java in IB, and a chosen language in AQA—often Python or VB.NET). Key concepts include variables, constants, data types (integer, real, char, string, Boolean), operators (arithmetic, relational, logical) and assignment statements.
你需要在伪代码和高级语言（IB 用 Java，AQA 通常选 Python 或 VB.NET）中阅读、编写和调试代码。核心概念包括变量、常量、数据类型（整数、实数、字符、字符串、布尔）、运算符（算术、关系、逻辑）和赋值语句。
Selection (IF-ELSE, CASE/SWITCH) and iteration (FOR, WHILE, REPEAT) constructs are fundamental. Nested statements and loop invariant tracing are particularly important for IB HL. AQA paper generally includes a series of code comprehension tasks requiring you to spot off-by-one errors or infinite loops.
选择结构 (IF-ELSE, CASE/SWITCH) 和循环结构 (FOR, WHILE, REPEAT) 是基础。嵌套语句和循环不变式跟踪对 IB HL 尤为重要。AQA 试卷通常会包含一系列代码理解任务，要求你发现差一错误或无限循环。
Arrays (1D, 2D) and indexing are essential. IB directly tests two-dimensional array processing in the OOP context, while AQA may examine records (structs) and file handling procedures such as open, read, write and close.
数组（一维、二维）和索引是必备知识。IB 直接在 OOP 语境中考查二维数组处理，而 AQA 可能考查记录（结构体）和文件处理程序，如打开、读取、写入和关闭。
10. Object-Oriented Programming (OOP) | 面向对象编程
OOP principles—encapsulation, inheritance, polymorphism and aggregation—are the heart of IB computer science. You must define each, give UML class diagrams, and write code showing ‘extends’ (inheritance), ‘implements’ (interfaces) and overriding methods. Knowledge of public, private and protected access modifiers is compulsory.
OOP 原理——封装、继承、多态和聚合——是 IB 计算机科学的核心。你必须定义每个概念，绘制 UML 类图，并编写展示 ‘extends’（继承）、’implements’（接口）和重写方法的代码。public、private 和 protected 访问修饰符的知识是必考的。
AQA’s emphasis is lighter but still present: you might explain the difference between base and derived classes, or the role of a constructor. Be prepared to compare static vs dynamic binding. Both boards value the ability to identify reusable components in a scenario.
AQA 的侧重点较轻，但仍会涉及：你可能会解释基类与派生类的区别，或构造器的作用。准备好比较静态绑定与动态绑定。两种考试都重视在场景中识别可重用组件的能力。
Design patterns (e.g., Singleton, Factory) appear in IB HL case studies. Maintain a clear distinction between ‘is-a’ (inheritance) and ‘has-a’ (composition) relationships. A typical high-score question asks you to refactor given code into an OOP hierarchy.
设计模式（如单例、工厂）出现在 IB HL 的案例分析中。要保持 ‘is-a’（继承）和 ‘has-a’（组合）关系的清晰区别。典型的高分题会要求你将给定代码重构为 OOP 层次结构。
11. Ethics, Security & Impacts | 伦理、安全与影响
Social and ethical implications of computing recurrently form a section in both exams. Topics include privacy (data mining, surveillance), intellectual property (copyright, open source), the digital divide, and responsible AI. You should argue using frameworks such as the ACM Code of Ethics.
计算机技术的社会与伦理影响在两种考试中都形成一个常考部分。主题包括隐私（数据挖掘、监控）、知识产权（版权、开源）、数字鸿沟以及负责任的人工智能。你应运用 ACM 伦理准则等框架进行论证。
Cyber security measures: firewalls, encryption, authentication (passwords, biometrics, 2FA), malware types (virus, worm, trojan, ransomware) and social engineering. Case study questions may describe a phishing attack and ask you to propose technical and human preventive measures.
网络安全措施：防火墙、加密、认证（密码、生物识别、双重认证）、恶意软件类型（病毒、蠕虫、特洛伊木马、勒索软件）以及社会工程。案例研究题可能描述一种网络钓鱼攻击，要求你提出技术和人为预防措施。
Data Protection Acts (e.g., UK DPA/GDPR) appear in AQA; IB asks you to apply them to a scenario. Be aware of the rights of data subjects: access, rectify, erase, object to processing. Link these to the ethical dilemmas of large-scale data analytics.
数据保护法（如英国 DPA/GDPR）出现在 AQA 中；IB 要求你将它们应用于情景。要了解数据主体的权利：访问权、更正权、删除权、反对处理权。将它们与大规模数据分析的伦理困境联系起来。
12. Exam Technique & Key Skills | 考试技巧与关键技能
Both IB and AQA mark schemes reward precise technical language. Never say ‘faster’ without quantifying (‘improves throughput by x%’). Use bullet points in long-answer questions when comparing, but write full sentences for evaluation. Diagrams (FDE cycle, network layout, tree traversals) must be neatly labelled with annotations.
IB 和 AQA 的评分标准都青睐精准的技术语言。切勿只说“更快”而不量化（“吞吐量提升 x%”）。在比较类长篇问题中使用项目符号，但评价类需用完整句子。图表（FDE 周期、网络布局、树遍历）务必整洁标注并加注释。
Time management is critical: allocate roughly 1 minute per mark. For IB Paper 2 OOP option, practice reading skeleton code and completing method stubs under timed conditions. In AQA, coding questions often include partially completed truth tables or trace tables; fill them systematically row by row.
时间管理至关重要：大约每分钟完成 1 分的题量。对于 IB 试卷 2 的 OOP 选考题，要在限时条件下练习阅读骨架代码并补全方法存根。AQA 中，编程题常附有部分完成的真值表或跟踪表，应逐行系统地填写。
Finally, review past papers to internalise command words: ‘state’ (knowledge), ‘describe’ (prose), ‘explain’ (reasons), ‘evaluate’ (judgement with evidence). Underline these words in the exam to avoid misinterpreting the task. With consistent bilingual revision and targeted practice, you can confidently tackle the most demanding topics.
最后，通过练习真题内化指令词：‘state’（陈述知识）、‘describe’（描述过程）、‘explain’（解释原因）、‘evaluate’（带证据评判）。考试中划出这些词以免误解题意。通过一贯的双语复习和针对性的练习，你定能自信地攻克最具挑战性的考点。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导