📚 A-Level WJEC Computer Science: Common Exam Mistakes Explained | A-Level WJEC 计算机：易错题精讲
Even the most confident A-Level Computer Science students can lose marks on topics that seem straightforward at first glance. This article walks through the most frequently misunderstood concepts in the WJEC specification, explaining exactly where candidates go wrong and how to avoid those traps.
即便是最有信心的A-Level计算机科学学生，也可能在看似简单的题目上丢分。本文梳理了WJEC考纲中最易被误解的概念，详细说明考生常在哪里犯错，以及如何避开这些陷阱。
1. Two's Complement Conversion Errors | 补码转换错误
A classic mistake occurs when students attempt to represent a negative integer in two's complement but forget that the process only applies to negative numbers. For example, asking for the two's complement representation of +5 using 8 bits: many candidates incorrectly flip the bits and add 1, yielding 11111011, which actually represents -5. The correct representation for +5 is simply 00000101.
一个经典错误是，学生想用补码表示一个负整数，却忘记转换流程仅适用于负数。例如，要求用8位表示+5的补码：许多考生错误地翻转各位再加1，得到11111011，这实际上代表-5。+5的正确表示就是00000101。
ts magnitude by converting directly to decimal as 242, ignoring the sign. The proper method is to identify a leading 1, perform two' find the positive equivalent (00001110 = 14), and then apply the negative sign to get -14.
另一个常见失误是解释二进制值时错误处理最高有效位(MSB)。学生看到11110010，可能直接按十进制转换为242，忽略了符号位。正确方法是识别前导1，对整个字节再做一次补码运算得出正数等效值（00001110 = 14），再加上负号得到-14。
Be especially careful with the range. An 8-bit two's complement integer can represent values from -128 to +127. Attempting to represent -130 in 8 bits is impossible, yet some candidates will try to force a 9-bit pattern into 8 bits, causing overflow.
特别注意范围。8位补码整数可以表示-128到+127。试图用8位表示-130是不可能的，但有些考生会强行将9位模式塞进8位，造成溢出。
2. Tree Traversal Mix-ups | 树遍历易混淆点
Students frequently confuse pre-order, in-order, and post-order traversal when given a binary tree. A common exam question asks for the sequence of nodes visited in a specific order, and a typical error is mixing up the position of the root. For post-order, many candidates output the root before the right subtree, mimicking in-order behaviour. The correct post-order rule is left subtree, right subtree, root.
学生经常在给定二叉树时混淆前序、中序和后序遍历。考试常要求按特定顺序列出访问节点序列，一个典型错误是搞混根的位置。对于后序遍历，很多考生在右子树之前就输出了根节点，这其实是中序行为。正确的后序规则是左子树、右子树、根节点。
To avoid losing marks, draw a consistent algorithmic walk. Pre-order: visit root, traverse left, traverse right. In-order: traverse left, visit root, traverse right. Post-order: traverse left, traverse right, visit root. A useful trick is to label each node with a left, root, right action sequence rather than trusting memory alone.
为避免丢分，可以画出一致的算法步骤。前序：访问根，遍历左子树，遍历右子树。中序：遍历左子树，访问根，遍历右子树。后序：遍历左子树，遍历右子树，访问根。一个实用技巧是给每个节点标注左、根、右的动作顺序，而不是只靠记忆。
Another pitfall is tree traversal using a stack. Students may push nodes incorrectly or pop in the wrong order, leading to non-algorithmic sequences. Practising iterative traversals with a stack on paper reduces these mistakes.
另一个陷阱是使用栈进行树的遍历。学生可能错误压栈或出栈顺序不对，产生非算法的序列。在纸上练习用栈的迭代遍历能减少此类错误。
3. Stack and Queue Misapplications | 栈与队列的误用
A common exam scenario asks which data structure is suitable for a given problem, such as a printer spooler or function call management. Many candidates incorrectly assign a queue to function call returns, not recognising that the LIFO nature of a stack matches the nested call-return sequence perfectly. A printer buffer, with FIFO serving, needs a queue.
考试常见情境是问哪种数据结构适合于打印机后台打印或函数调用管理。许多考生错误地把函数调用返回指派给队列，却没有意识到栈的后进先出(LIFO)特性完美匹配嵌套的调用-返回顺序。打印机缓冲按先进先出(FIFO)服务，需要队列。
Describing operations with precise terminology is essential. Some students write push/pop for a queue, which is inaccurate; the correct terms are enqueue and dequeue. For a stack, peek or top must not be confused with pop, which removes the element. Exams often test understanding by tracing a sequence of operations and asking for the final state.
用精确的术语描述操作至关重要。有些学生为队列写push/pop，这不准确；正确的术语是enqueue和dequeue。对于栈，peek或top不能与pop混淆，后者会移除元素。考试常通过跟踪一系列操作并询问最终状态来测试理解。
Watch for underflow and overflow errors. Attempting to pop from an empty stack triggers underflow; trying to push onto a full fixed-size stack causes overflow. In queue simulations, circular array wrap-around logic is a notorious source of indexing errors.
注意下溢和上溢错误。试图从空栈中pop会触发下溢；试图向已满的固定大小栈push会导致上溢。在队列模拟中，循环数组的绕回逻辑是出名的索引错误来源。
4. Pipeline Hazards in CPU | CPU流水线冲突
A frequent misconception is that pipelining always increases the speed of every instruction without complications. WJEC papers often probe the drawbacks: data hazards, control hazards, and structural hazards. A data hazard arises when an instruction depends on the result of a previous instruction still in the pipeline, leading to a stall or a bubble if not handled.
一个常见误解是流水线总能毫无问题地提高每条指令的速度。WJEC试卷常考察其缺点：数据冲突、控制冲突和结构冲突。数据冲突发生在一条指令依赖于仍在流水线中的前一条指令的结果时，如果不处理，就会发生停顿或气泡。
Control hazards, caused by branch instructions, are another weak area. Students may forget that the pipeline does not know which instruction to fetch next until the branch is resolved. This can cause a misprediction penalty, flushing incorrectly fetched instructions. The simple solution of inserting NOPs (no-operation instructions) is often required in exam answers.
由分支指令引起的控制冲突是另一个薄弱点。学生可能忘记，在分支被解决之前，流水线不知道下一步要取出哪条指令。这会导致预测错误惩罚，清除错误取出的指令。考试答案中常要求插入NOP（空操作指令）这个简单方案。
Furthermore, structural hazards occur when two instructions require the same hardware resource simultaneously, e.g., both needing memory access in the same cycle. Many candidates incorrectly claim pipelining removes all hazards; in reality, it introduces them and requires specific hardware or compiler techniques to manage.
此外，结构冲突发生在两条指令同时需要同一硬件资源时，例如同一周期内都需要访存。许多考生错误地声称流水线消除了所有冲突；实际上它引入了冲突，需要特定硬件或编译技术来管理。
5. Boolean Simplification Pitfalls | 布尔化简陷阱
A common error in Boolean algebra is misapplying De Morgan's laws, especially when negating an entire parenthesised expression. For example, simplifying ¬(A + B) correctly yields ¬A • ¬B, but students often leave it as ¬A + ¬B or forget to change the operator. When double negation appears, like ¬(¬A • B), the proper result is A + ¬B, yet many fail to distribute the overbar correctly.
布尔代数中一个常见错误是误用德摩根定律，特别是在对整个括号表达式取反时。例如，化简¬(A + B)正确结果为¬A • ¬B，但学生经常保留为¬A + ¬B或忘记改变运算符。当出现双重否定时，如¬(¬A • B)，正确结果是A + ¬B，但许多人无法正确分配反号。
Another pitfall is simplification using Karnaugh maps (K-maps) where students group incorrectly, breaking the rule that groups must be rectangular with size a power of 2. A group of 3 cells is invalid, yet candidates often draw it, hoping to simplify. The adjacency also wraps around edges – a common oversight that loses marks.
另一个陷阱是使用卡诺图化简时错误分组，违反了组必须是矩形且大小为2的幂的规则。3个单元格的组是无效的，但考生经常画出来以期化简。同时，边沿相邻也环绕——这个常见疏忽也会失分。
When converting a truth table directly to a Boolean expression, the sum-of-products approach demands care. Picking rows where output is 1, candidates sometimes forget to invert the appropriate variable when its value is 0 in that row. This leads to an incomplete minterm and a drastically wrong final circuit.
当直接从真值表转换为布尔表达式时，积之和方法需要留心。在选择输出为1的行时，考生有时忘记对该行中值为0的变量取反。这导致不完整的最小项和完全错误的最终电路。
6. Recursion Return Value Confusion | 递归返回值混淆
ll, causing the final result to be lost. For instance, a factorial function factorial(n): if n==1 return 1 else n * factorial(n-1) works correctly, but a student writing else factorial(n-1) alone discards the product.
递归在WJEC考试中经常通过一个累积结果的函数来考查。一个典型错误是没有从递归调用中返回值，导致最终结果丢失。例如，阶乘函数factorial(n): 如果n==1返回1，否则n * factorial(n-1)正确工作，但如果学生只写else factorial(n-1)，就会丢弃乘积。
Infinite recursion due to a missing or misplaced base case is another classic. Examiners often provide code with the base case after the recursive call or with a condition that is never met, expecting candidates to trace and identify that the stack will overflow. Tracing with a table that records each call's parameter and return value helps uncover logical flaws.
因缺少或错放基案而导致的无限递归是另一个经典问题。考官常提供将基案放在递归调用之后或条件永远不满足的代码，希望考生跟踪并识别出栈将溢出。用表格记录每次调用的参数和返回值有助于发现逻辑缺陷。
Tail recursion is occasionally examined. Students confuse tail recursion with simply calling the function at the end. True tail recursion requires that no operation is pending after the recursive call returns, allowing compiler optimisation. An example of non-tail recursion is n + sum(n-1), where the addition waits for the call to finish.
尾递归偶尔会被考查。学生将尾递归与简单地在末尾调用函数混淆。真正的尾递归要求在递归调用返回后没有待执行的操作，从而允许编译器优化。非尾递归的例子是n + sum(n-1)，其中加法需要等待调用完成。
7. SQL JOIN Clauses Gone Wrong | SQL JOIN 子句常见错误
s, including those without any orders. Many candidates write an INNER JOIN, which eliminates customers with NULL order entries. The correct choice is a LEFT JOIN on Customer.CustomerID = Order.CustomerID, keeping all rows from the left table.
每年都有学生在SQL JOIN，尤其是INNER JOIN与LEFT JOIN上丢分。考题可能要求列出所有客户及其订单，包括没有订单的客户。许多考生写INNER JOIN，这会排除订单条目为NULL的客户。正确选择是对Customer.CustomerID = Order.CustomerID使用LEFT JOIN，保留左表所有行。
Misunderstanding the condition in the ON clause leads to unintended Cartesian products when a join condition is omitted. Writing FROM A, B without a WHERE clause returns every combination of rows, which is rarely desired. Always specify a join predicate, and test with small data sets in your head.
误解ON子句中的条件，当缺少连接条件时会导致非预期的笛卡尔积。写FROM A, B而没有WHERE子句会返回所有行组合，这很少是想要的结果。一定要指定连接谓词，并在脑中用小数据集测试。
Aggregate functions with GROUP BY also trip up students. A common error is including a non-aggregated column in the SELECT list that is not in the GROUP BY clause, which produces an error in most DBMS. For example, SELECT CustomerName, COUNT(OrderID) FROM ... GROUP BY CustomerName is fine, but adding OrderDate without aggregating it is illegal.
聚合函数与GROUP BY也会绊倒学生。一个常见错误是在SELECT列表中包含未在GROUP BY子句中出现的非聚合列，这会在大多数DBMS中引发错误。例如，SELECT CustomerName, COUNT(OrderID) FROM ... GROUP BY CustomerName是正确的，但添加未聚合的OrderDate则是非法的。
8. Wireless Protocol Confusions (Wi-Fi vs Bluetooth) | 无线协议混淆 (Wi-Fi 与 蓝牙)
WJEC often asks students to compare Wi-Fi and Bluetooth for a given scenario. A typical mistake is stating that Bluetooth provides higher bandwidth or range. In reality, typical Bluetooth 5 offers up to 2 Mbps and ~240 m in ideal conditions, while Wi-Fi 6 can exceed 1 Gbps over shorter ranges but with much higher throughput. Matching protocol to application – e.g., Bluetooth for a wireless mouse, Wi-Fi for video streaming – is a common discriminator.
WJEC常要求学生针对给定场景比较Wi-Fi和蓝牙。一个典型错误是声称蓝牙能提供更高的带宽或范围。实际上，典型蓝牙5最高可达2 Mbps和理想条件下约240米，而Wi-Fi 6能在较短距离内超过1 Gbps，且吞吐量高得多。将协议匹配到应用——例如无线鼠标用蓝牙，视频流用Wi-Fi——是常见的区分点。
Encryption standards differ. Many candidates falsely claim Wi-Fi uses WEP by default (it is now insecure and replaced by WPA3). Bluetooth uses pairing with encryption, but the specifics are often mixed up in exams. A precise answer mentioning AES-CCMP for WPA2/WPA3 and E0 stream cipher for legacy Bluetooth can score high marks.
加密标准不同。许多考生错误地声称Wi-Fi默认使用WEP（现在已不安全且被WPA3取代）。蓝牙通过配对使用加密，但具体细节在考试中经常混淆。精确地提到WPA2/WPA3的AES-CCMP以及传统蓝牙的E0流密码可获得高分。
Frequency band overlap is another source of error. Both can operate in the 2.4 GHz ISM band, leading to interference. However, Wi-Fi also uses 5 GHz and 6 GHz bands, which can mitigate congestion. Understanding this helps recommend Wi-Fi over Bluetooth in crowded 2.4 GHz environments when high throughput is needed.
频段重叠是另一个错误来源。两者都能在2.4 GHz ISM频段运行，导致干扰。然而，Wi-Fi还使用5 GHz和6 GHz频段，可以减轻拥塞。理解这点有助于在需要高吞吐量时，在拥挤的2.4 GHz环境中推荐Wi-Fi而非蓝牙。
9. Object-Oriented Inheritance Misconceptions | 面向对象继承的错误观念
A prevailing error is treating inheritance as a mechanism to copy code. Candidates often write that a subclass contains a duplicate of the parent's attributes, failing to recognise the relationship is dynamic. In Python or Java, the subclass inherits behaviour and can override methods via polymorphism, but it does not physically replicate code.
一个普遍错误是把继承当作复制代码的机制。考生常写道子类包含父类属性的副本，没有认识到这是一种动态关系。在Python或Java中，子类继承行为并可通过多态重写方法，但不会物理地复制代码。
Multiple choice questions test the 'is-a' relationship. A classic mistake is using inheritance for a 'has-a' situation, e.g., making Car inherit from Engine. The correct approach is composition: Car has an Engine object. Exam answers that model inheritance incorrectly lose marks for flawed design.
选择题常测试“是一个”关系。一个经典错误是在“有一个”的场景中使用继承，例如让Car继承自Engine。正确方法是组合：Car有一个Engine对象。考试答案若错误地建模继承，会因设计缺陷而失分。
Understanding the difference between overriding and overloading also challenges students. Overriding redefines a parent method with the same signature in the subclass; overloading provides multiple methods with the same name but different parameters. Confusing these can lead to incorrect explanations of polymorphism.
理解重写(overriding)和重载(overloading)的区别也考验学生。重写是在子类中用相同签名重新定义父类方法；重载是提供名称相同但参数不同的多个方法。混淆两者可能导致对多态的解释错误。
10. Interrupt Handling Step-by-step Mistakes | 中断处理步骤错误
When asked to describe the sequence of handling an interrupt, many students omit critical steps or list them out of order. The correct sequence is: (1) The current instruction is completed; (2) The processor suspends execution of the current program; (3) The contents of the PC and other registers are saved onto the stack; (4) The interrupt flag is checked; (5) The interrupt service routine (ISR) address is loaded into the PC; (6) The ISR executes; (7) State is restored and the original program resumes.
当被要求描述处理中断的步骤序列时，很多学生遗漏关键步骤或顺序错误。正确的顺序是：(1) 当前指令完成；(2) 处理器暂停当前程序的执行；(3) PC和其他寄存器的内容被保存到栈中；(4) 检查中断标志；(5) 中断服务程序(ISR)的地址被加载到PC；(6) ISR执行；(7) 状态被恢复，原程序继续执行。
A frequent misconception is that the processor immediately jumps to the ISR upon receiving an interrupt, without finishing the current instruction. This violates the fetch-decode-execute cycle integrity. Some candidates also forget to mention saving the program counter, which is essential for resuming the original task correctly.
一个常见误解是，处理器一收到中断就立即跳转到ISR，而不结束当前指令。这违反了取指-译码-执行周期的完整性。有些考生还忘记提到保存程序计数器，这对正确恢复原任务至关重要。
Nested interrupts pose an additional challenge. Students should know that prioritisation is possible; a higher-priority interrupt can preempt a lower-priority ISR. Conversely, lower-priority handling can be masked. Examiners look for the term 'maskable' and 'non-maskable interrupts' (NMIs) for top priority.
嵌套中断带来额外挑战。学生应知道可以设置优先级；更高优先级的中断可以抢占低优先级的ISR。低优先级的处理可以被屏蔽。考官期望出现“可屏蔽”和用于最高优先级的“不可屏蔽中断”(NMI)这些术语。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图