📚 High-Frequency Exam Topics and Common Mistakes in WJEC Year 11 Computer Science | WJEC 十一年级计算机科学高频考点与易错题分析
The WJEC GCSE Computer Science examination challenges students not only on theoretical understanding but also on the precise application of concepts. Many learners lose marks because of consistent, avoidable errors in areas that appear year after year. This article dissects the most frequently tested topics, unpacks typical misconceptions, and offers strategies to sidestep the pitfalls so you can face the exam with confidence.
WJEC 计算机科学 GCSE 考试不仅考查理论知识，更注重对概念的精确运用。许多考生因为年复一年出现在高频考点上的可避免失误而丢分。本文拆解这些反复考查的主题，剖析典型误解，并提供绕过陷阱的策略，帮助同学们自信迎考。
1. Data Representation: Binary, Hex and Negative Numbers | 数据表示：二进制、十六进制与负数
Binary and hexadecimal conversions are consistently examined. A binary number like 1101 0110 must first be split into 1101 (D) and 0110 (6) to give D6 in hex. It is vital to pad with leading zeros so that the grouping always starts from the rightmost bit. A common mistake is to convert each nibble independently but read the bits in the wrong order, especially with numbers shorter than 8 bits.
二进制与十六进制转换是必考题。例如二进制 1101 0110 必须拆分为 1101（D）和 0110（6），得到十六进制 D6。关键在于从最右边开始分组并用前导零补足四位。常见错误是独立转换每个半字节时读错位的顺序，特别是遇到不足 8 位的数字时。
Two’s complement is used to represent negative integers. To find the two’s complement of +27 using an 8‑bit register, you write 0001 1011, flip all bits to 1110 0100, and add 1 to obtain 1110 0101. Learners often forget that the leftmost bit indicates the sign and that the range for 8 bits is –128 to +127. When adding two two’s complement numbers, overflow occurs if the carry into the sign bit differs from the carry out, a subtlety frequently mishandled in exams.
补码用来表示负整数。要计算 +27 的 8 位补码，先写出 0001 1011，全部翻转得 1110 0100，再加 1 得到 1110 0101。考生常忽略最左位是符号位，且 8 位补码的范围是 –128 到 +127。两个补码相加时，若进入符号位的进位与从符号位出来的进位不同，则发生溢出，这一细节在考试中常被误判。
2. Logic Gates and Boolean Algebra | 逻辑门与布尔代数
The basic gates AND, OR, NOT, NAND and NOR appear in truth‑table questions and in combination circuits. A large number of students confuse the NAND gate’s output — it is the exact inverse of AND: only when both inputs are 1 does it output 0. NOR behaves similarly for OR. Drawing the symbol incorrectly or misreading the bubble on a gate instantly breaks the whole logic diagram.
基本门电路 AND、OR、NOT、NAND 和 NOR 会以真值表和组合电路的形式出现。大量学生混淆 NAND 门的输出——它恰是 AND 的反相：只有当两个输入均为 1 时才输出 0。NOR 门与 OR 的关系类似。画错符号或看错门上的小圆圈会立刻破坏整个逻辑图。
outinely tested. Candidates frequently fail to spot where an absorption law can be applied and attempt a truth table instead, losing time. When asked to write a Boolean expression from a circuit, always work from left to right, labelling intermediate wires. Overlooking one connection changes the whole expression.
使用吸收律（如 A + A·B = A）化简布尔表达式是经常考查的内容。考生常常识别不出应用吸收律的位置，转而试图画真值表，耗费大量时间。从电路图写出布尔表达式时，务必从左向右处理，标出中间连线。忽略一条连线就会改变整个表达式。
3. CPU Architecture and the Fetch‑Decode‑Execute Cycle | CPU 架构与取指‑解码‑执行周期
WJEC expects you to describe the von Neumann architecture: a single memory store for both instructions and data, with a control unit, arithmetic logic unit (ALU) and registers (MAR, MDR, PC, ACC). Mixing up the Memory Address Register (holds the address to be accessed) with the Memory Data Register (holds the actual data) is the most widespread error.
WJEC 要求描述冯·诺依曼架构：指令与数据共用一个存储器，包含控制单元、算术逻辑单元（ALU）和寄存器（MAR、MDR、PC、ACC）。将存储地址寄存器（存放待访问地址）与存储数据寄存器（存放实际数据）搞混是最常见的错误。
In the fetch‑decode‑execute cycle, the Program Counter (PC) points to the next instruction’s address. The address is copied to the MAR, the instruction is fetched into the MDR, then decoded by the Control Unit. Students often reverse the order of MAR and PC, or forget that the PC must be incremented before the next fetch. A typical mark‑losing shortcut is writing ‘the CPU gets the instruction’ without naming the specific buses and registers involved.
在取指‑解码‑执行周期中，程序计数器（PC）指向下一条指令的地址。该地址被复制到 MAR，指令被取到 MDR，再由控制单元解码。学生常把 MAR 和 PC 顺序颠倒，或忘记 PC 必须在下次取指前递增。一个典型的丢分写法是“CPU 获取指令”，却没有指明所涉及的具体总线和寄存器。
4. Memory, Storage and the Purpose of Cache | 内存、存储器与缓存的作用
RAM is volatile working memory that holds the operating system, programs and data currently in use. ROM is non‑volatile and stores the boot firmware (BIOS). When asked to compare RAM with cache, candidates incorrectly state that cache is larger; cache is much smaller but significantly faster, sitting closer to the CPU to reduce the average memory access time.
RAM 是易失性工作内存，存放当前在用的操作系统、程序和数据。ROM 非易失，存储引导固件（BIOS）。当被要求比较 RAM 与缓存时，考生错误地声称缓存更大；实际上缓存小得多但显著更快，更靠近 CPU，以降低平均内存访问时间。
Virtual memory uses a section of secondary storage (usually an HDD or SSD) to simulate extra RAM when physical RAM is exhausted. The penalty is speed, because disk access is orders of magnitude slower. An exam favourite is to ask why a thrashing computer is unresponsive — the answer is excessive swapping of pages between RAM and virtual memory. Many learners attribute the slowness to a virus instead of the real cause.
虚拟内存利用次级存储器（通常为 HDD 或 SSD）的一部分来模拟额外 RAM，当物理 RAM 耗尽时使用。代价是速度，因为磁盘访问慢数个数量级。考试常问为什么“抖动”中的计算机会卡顿——答案是 RAM 与虚拟内存之间频繁的页面交换。许多学生将缓慢归咎于病毒，而非真正原因。
5. Networks: Topologies, Protocols and the TCP/IP Stack | 网络：拓扑结构、协议与 TCP/IP 协议栈
When comparing star and bus topologies, the exam requires explicit statements about performance, fault tolerance and cost. In a star, each node has a dedicated link to a central switch; a cable break isolates only one node, whereas in a bus, a single backbone failure brings down the entire segment. Learners often confuse physical topology with logical topology.
在比较星型与总线型拓扑时，考试要求明确论述性能、容错性和成本。星型拓扑中每个节点有独立链路连到中央交换机；一根线断裂只会隔离一个节点，而总线型中一条骨干线故障会导致整个网段瘫痪。考生常将物理拓扑与逻辑拓扑混淆。
The TCP/IP stack layers — application, transport, internet and link — must be known with the protocols that operate at each. HTTP and FTP belong to the application layer, TCP to transport, IP to internet, and Ethernet/Wi‑Fi to link. A common slip is to place IP at the transport layer. Also remember that MAC addresses are used on the same local network, while IP addresses allow routing across networks.
必须掌握 TCP/IP 协议栈的分层——应用层、传输层、互联网层和链路层——以及各层上运行的协议。HTTP 和 FTP 属于应用层，TCP 属于传输层，IP 属于互联网层，以太网/Wi‑Fi 属于链路层。常见错误是把 IP 放在传输层。还应记住 MAC 地址用于同一局域网络内，而 IP 地址用于跨网络路由。
6. Network Security Threats and Defences | 网络安全威胁与防御
Malware types (virus, worm, Trojan), phishing, brute‑force attacks and SQL injection are examined frequently. A phishing attack uses a deceptive email or website to trick users into revealing credentials; it does not rely on cracking encryption. Students mislabel phishing as a form of hacking that exploits operating system vulnerabilities.
恶意软件类型（病毒、蠕虫、特洛伊木马）、网络钓鱼、暴力攻击和 SQL 注入是频繁考查的。网络钓鱼攻击利用欺骗性邮件或网站诱骗用户泄露凭据；它并不依赖破解加密。学生常将网络钓鱼错误归类为利用操作系统漏洞的黑客攻击。
Defence mechanisms include firewalls (filtering packets based on rules), encryption (especially the difference between symmetric and asymmetric keys), penetration testing and physical security. A high‑frequency pitfall is claiming that encryption prevents all attacks — it protects confidentiality but does not stop, say, a DoS attack. Explain how an asymmetric system uses a public key to encrypt and a private key to decrypt, while symmetric uses a single shared key.
防御机制包括防火墙（基于规则过滤数据包）、加密（尤其要区分对称与非对称密钥）、渗透测试以及物理安全。一个高频陷阱是声称加密能防止所有攻击——它保护机密性，却无法阻止例如 DoS 攻击。应该说明非对称系统使用公钥加密而私钥解密，而对称系统使用同一个共享密钥。
7. Databases and SQL Query Writing | 数据库与 SQL 查询编写
Relational database theory requires a firm grasp of primary keys, foreign keys and how they enforce referential integrity. A foreign key in one table must reference a primary key in another table. Candidates often pick a non‑unique field as a primary key, or forget that a foreign key can contain duplicate values.
关系数据库理论要求牢固掌握主键、外键以及它们如何实施参照完整性。一张表中的外键必须引用另一张表的主键。考生常选择一个非唯一字段作主键，或忘记外键可以包含重复值。
Writing accurate SQL is a prime differentiator. A typical query: SELECT CustomerName, City FROM Customers WHERE Country = 'UK' ORDER BY City ASC;. Mistakes include omitting the single quotes around text literals, using = instead of LIKE with wildcards, and writing ORDER BY before WHERE. For a JOIN, many fail to specify the linking condition in the ON clause, producing a Cartesian product. Practise dry‑running the output table of a given SQL statement — that exact skill is tested repeatedly.
写出准确的 SQL 是拉开差距的关键。一条典型查询：SELECT CustomerName, City FROM Customers WHERE Country = 'UK' ORDER BY City ASC;。错误包括漏掉文本值两侧的单引号、在带通配符时仍用 = 而非 LIKE，以及把 ORDER BY 写在 WHERE 之前。对于 JOIN，很多人忘记在 ON 子句中指定连接条件，导致产生笛卡尔积。请反复练习跟踪给定 SQL 语句的输出表——这一项技能被一再考查。
8. Algorithms: Searching, Sorting and Tracing | 算法：搜索、排序与追踪
Linear search works on unsorted data and checks each element in turn; its worst‑case time complexity is O(n). Binary search is far faster (O(log n)), but the data must be sorted first. A shocking number of students apply binary search to an unordered list in exams, resulting in a completely wrong trace table. When drawing a binary search example, always describe the low, mid and high indices clearly.
线性搜索用于未排序数据，逐一检查每个元素；其最坏时间复杂度为 O(n)。二分搜索快得多（O(log n)），但数据必须已排序。令人震惊的是，许多学生在考试中对未排序列表应用二分搜索，导致追踪表全盘错误。在画二分搜索示例时，务必清楚标明 low、mid 和 high 索引。
Bubble sort and merge sort appear in pseudocode questions and diagram‑based traces. With bubble sort, remember that each pass places the largest unsorted element at the end. For merge sort, the divide‑and‑conquer approach splits the list until single elements remain, then merges them in sorted order. The most frequent slip is omitting the merging phase or showing incorrect comparisons during the merge step.
冒泡排序和归并排序出现在伪代码题和图表追踪题中。关于冒泡排序，记住每一趟都会将未排序部分的最大元素放到末尾。归并排序采用分治策略，先将列表拆分为单个元素，再进行有序合并。最常见的错误是遗漏合并阶段，或在合并步骤中写出错误的比较过程。
9. Programming Fundamentals and Pseudocode Precision | 编程基础与伪代码精准度
WJEC uses a specific pseudocode style with keywords such as OUTPUT, INPUT, WHILE … ENDWHILE, FOR … NEXT and IF … THEN … ELSE … ENDIF. Indentation is required and is assessed. A variable must be assigned with the ← operator, not =. Learners who write x = x + 1 lose marks for notation even if the logic is correct.
WJEC 使用一种特定的伪代码风格，关键词包括 OUTPUT、INPUT、WHILE … ENDWHILE、FOR … NEXT 和 IF … THEN … ELSE … ENDIF。缩进是必需的，并且纳入评分。变量赋值必须使用 ← 运算符，而非 =。写下 x = x + 1 的考生即使逻辑正确，也会因符号错误而丢分。
Array indexing starts at zero in many implementations but the exam typically assumes 1‑based indexing unless stated otherwise. Always check the scenario. Writing a loop that misses the last element (FOR i ← 1 TO LEN(list) – 1 instead of LEN(list)) is a recurring mistake. Boundary conditions, such as an empty list, should be thought through during algorithm design.
数组索引在很多实现中从零开始，但考试通常假定从 1 开始，除非另有说明。务必检查题目情境。写循环时遗漏最后一个元素（FOR i ← 1 TO LEN(list) – 1 而非 LEN(list)）是反复出现的错误。在算法设计时就应考虑边界条件，例如空列表的情形。
10. Testing, Error Types and Dry Running | 测试、错误类型与手工追踪
Syntax errors are caught by the translator (compiler/interpreter) because the code breaks the language’s grammar rules. Logic errors produce unexpected results but run without crashing. A dry‑run table, with columns for each variable and output, is the primary tool for debugging both. Candidates frequently omit updating the loop counter in their dry‑run or fail to show intermediate values, leading to incomplete marks.
语法错误由翻译器（编译器/解释器）捕获，因为代码违反了语言语法规则。逻辑错误产生非预期结果却能无崩溃运行。以各变量和输出为列的手工追踪表是调试两者的主要工具。考生经常忘记在追踪过程中更新循环计数器，或未展示中间值，导致评分不完整。
Selecting suitable test data means using normal, boundary and erroneous values. For a program that accepts an integer between 1 and 50, boundary values would be 0, 1, 50 and 51. Erroneous data could include a letter or a negative number. Many students provide only middle‑of‑the‑range values and miss the marks for boundary testing.
选择合适的测试数据意味着使用正常值、边界值和错误值。对于一个接受 1 至 50 之间整数的程序，边界值为 0、1、50 和 51。错误数据可能包括一个字母或负数。许多学生只提供区间中间的值，从而错过边界测试的分数。
11. Ethical, Legal and Environmental Considerations | 伦理、法律与环境考量
The Data Protection Act 2018 (UK GDPR) sets principles for processing personal data, such as data minimisation, accuracy and storage limitation. A typical exam question asks how a school manages student data lawfully. Answers must reference consent, the right of access and secure disposal. Confusing the Data Protection Act with the Computer Misuse Act (which criminalises unauthorised access and malware) is a serious error.
《2018 年数据保护法》（英国 GDPR）规定了处理个人数据的原则，例如数据最少化、准确性和存储限制。一道典型考题会问学校如何合法管理学生数据。答案必须提及同意、访问权限和安全销毁。将数据保护法与《计算机滥用法》（将未经授权访问和恶意软件定为犯罪）混淆是一个严重错误。
The environmental impact of computing includes the carbon footprint of data centres, energy consumption of devices and electronic waste (e‑waste). Open‑source software can prolong hardware lifespan. Students ought to link specific facts — for instance, that 1.5 kg of e‑waste is produced per person annually in the UK — to the concept of sustainability, rather than giving generic remarks such as ‘computers are bad for the environment’. The Copyright, Designs and Patents Act is another statutory reference that protects software creators and impacts file sharing.
计算对环境的影响包括数据中心的碳足迹、设备的能耗以及电子废弃物。开源软件能延长硬件寿命。学生应将具体事实——例如英国每人年均产生 1.5 千克电子废弃物——与可持续发展的概念联系起来，而非泛泛而谈“计算机对环境不好”。《版权、设计和专利法》是另一部保护软件创作者并影响文件共享的法律参照。
12. Last‑Minute Preparation: High‑Yield Revision Strategies | 考前冲刺：高回报复习策略
Past paper patterns reveal that about 40% of marks come from writing or interpreting algorithms and SQL. Prioritise practising pseudocode under timed conditions, using the exact WJEC approved keywords. Create a one‑page glossary of command words such as ‘state’, ‘describe’, ‘explain’ and ‘compare’ — each demands a different depth of response. ‘Compare’ requires both similarities and differences, while ‘explain’ needs reasons or purposes.
历年试卷规律显示，约 40% 的分数来自编写或解读算法与 SQL。请优先进行定时条件下的伪代码练习，使用 WJEC 认可的精确关键词。制作一页指令词词汇表，如“陈述”“描述”“解释”和“比较”——每个词要求不同的回答深度。“比较”需要给出相似点与不同点，而“解释”则需给出原因或目的。
Read every question stem twice, underlining exactly what is being requested. If a question asks for two reasons, provide exactly two; any extra will not gain marks but can waste precious time. In the final days, review your own dry‑run tables for loops and conditional statements — this targeted practice directly addresses the topic that separates grade 7 from grade 9 candidates.
每道题干都要读两遍，在要求的内容下划线。如果题目要求写出两条理由，就只给两条；多余的内容不会加分，反而浪费宝贵时间。在最后的日子里，回顾自己为循环和条件语句所做的手工追踪表——这项针对性练习直击区分 7 分与 9 分学生的核心主题。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图