Year 12 WJEC Computer Science: High-Frequency Exam Topics & Common Mistake Analysis | WJEC 12年级计算机：高频考点与易错题分析

📚 Year 12 WJEC Computer Science: High-Frequency Exam Topics & Common Mistake Analysis | WJEC 12年级计算机：高频考点与易错题分析

Year 12 students studying the WJEC A-Level Computer Science specification often encounter a range of challenging topics where small misunderstandings can cost valuable marks. From binary arithmetic to database normalisation, high-frequency exam questions reveal patterns of common mistakes. This article dissects these pitfalls and offers clear corrections to help you avoid them in your revision.

学习WJEC A-Level计算机科学课程的12年级学生常会遇到一系列具有挑战性的主题，细微的误解可能导致丢分。从二进制算术到数据库规范化，高频考题揭示了常见错误的模式。本文将剖析这些陷阱并提供清晰的纠正方法，助你在复习中避开它们。

1. Binary and Hexadecimal Conversions | 二进制与十六进制转换

When converting between binary and hexadecimal, a frequent blunder is misaligning nibble (4-bit) groups. Without padding leading zeros, candidates may misread a binary string like 1101110₂ as 0110 1110, which yields 6E₁₆; forgetting the leading zero can lead to an incorrect hex digit such as 6F₁₆.

在二进制和十六进制间转换时，一个常见错误是半字节（4位）分组未对齐。若忘记在左侧补零，考生可能将 1101110₂ 误读为 0110 1110，正确应为 6E₁₆；遗忘前导零则可能导致如 6F₁₆ 的错误结果。

Another typical pitfall arises when interpreting unsigned binary values as signed two’s complement. For instance, 10001100₂ is often mistakenly read as 140 in unsigned; however, in 8-bit two’s complement, the most significant bit indicates a negative number. The correct value is –(01110100₂) = –116. Always check the representation context.

另一个典型陷阱是将无符号二进制值误当作有符号补码解读。例如，10001100₂ 常被误读为无符号数 140；但在8位补码中，最高位表示负数，正确的值是 –(01110100₂) = –116。务必根据上下文确认表示方式。

2. Two’s Complement Overflow and Carry | 补码溢出与进位

Arithmetic in two’s complement often trips up students who confuse the carry-out from the most significant bit with the overflow flag. Carry is a normal by-product of addition, while overflow indicates the result cannot fit within the given number of bits for signed numbers. Overflow occurs only when the addition of two positive numbers yields a negative, or two negatives yield a positive.

补码算术常常使学生混淆最高位的进位与溢出标志。进位是加法的正常副产物，而溢出表示在给定位数内无法表示正确的有符号结果。仅当两个正数相加得负数，或两个负数相加得正数时，才发生溢出。

Consider adding 01101001₂ (+105) and 01001010₂ (+74). The sum is 10110011₂, which as two’s complement equals –77. No carry-out appears, but the overflow flag should be set because the magnitude of the result exceeds +127. Inspecting the signs of operands and result is the key, not just the hardware carry bit.

试将 01101001₂ (+105) 与 01001010₂ (+74) 相加。和为 10110011₂，补码表示为 –77。此时无进位输出，但溢出标志应置位，因为结果的绝对值超出了 +127。关键在于检查操作数与结果的符号，而非仅看硬件进位位。

3. Boolean Algebra Simplification | 布尔代数化简

Simplification of Boolean expressions using identities and De Morgan’s laws is highly examined. A frequent slip is misapplying the distributive law, such as incorrectly rewriting A ∧ (B ∨ C) as (A ∧ B) ∨ (A ∧ C) correctly, but then expanding A ∨ (B ∧ C) to (A ∨ B) ∧ (A ∨ C) – forgetting that the distributive law also holds for OR over AND. Another error is incomplete application of De Morgan: ¬(A ∧ B) becomes ¬A ∨ ¬B, yet students sometimes incorrectly write ¬A ∧ ¬B.

利用恒等式和德摩根律化简布尔表达式是高频考点。常见失误是误用分配律，例如正确地将 A∧(B∨C) 化为 (A∧B)∨(A∧C)，但将 A∨(B∧C) 展开为 (A∨B)∧(A∨C) 时遗忘或运算对与运算也满足分配律。另一个错误是德摩根定律应用不彻底：¬(A∧B) 应得 ¬A∨¬B，但考生有时误写成 ¬A∧¬B。

Double negation and absorption laws also cause trouble. For instance, simplifying A ∧ (¬A ∨ B) to A ∧ B using absorption requires a careful step; missing the identity A ∧ ¬A = 0 leads to lost marks. A systematic approach with truth tables or algebraic steps helps avoid such errors.

双重否定和吸收律也容易出错。例如，利用吸收律简化 A∧(¬A∨B) 为 A∧B 时，若遗漏 A∧¬A=0 的恒等式就会丢分。用真值表或逐步代数推导可避免此类错误。

4. Data Structures: Stacks and Queues | 数据结构：栈与队列

WJEC questions often require tracing stack or queue operations. A common mistake is mixing LIFO (Last In, First Out) with FIFO (First In, First Out). For a stack, the pop operation retrieves the most recently pushed item; for a queue, dequeue retrieves the earliest enqueued item. In dry-run tables, students might pop an element that was not at the top, losing the logical order.

WJEC 试题常要求跟踪栈或队列的操作。常见错误是混淆 LIFO（后进先出）与 FIFO（先进先出）。栈的 pop 操作取出的是最近 push 的项；队列的 dequeue 则取出最早入队的项。在手工演算表中，学生可能弹出非栈顶的元素，打乱逻辑顺序。

Another frequent oversight is neglecting overflow and underflow conditions. Attempting to pop from an empty stack or push onto a full stack (if size is bounded) must be flagged. In pseudocode, these checks are easily forgotten, especially when nested inside loops.

另一个常见疏忽是忽略溢出和下溢条件。试图从空栈弹出或向已满栈（若有大小限制）压入时，必须标记错误。在伪代码中这些检查很容易被遗忘，特别是嵌套在循环中时。

5. Sorting and Searching Algorithm Errors | 排序与搜索算法错误

When simulating bubble sort, many candidates miscalculate the number of passes or the number of comparisons. For a list of n items, bubble sort requires at most n−1 passes. The inner loop comparisons decrease with each pass, a pattern easily misdrawn. A common slip is continuing to compare already sorted elements beyond the necessary inner loop bounds.

模拟冒泡排序时，许多考生错误计算遍数或比较次数。对含 n 项的列表，冒泡排序最多需要 n−1 遍；内层循环的比较次数随遍数递减，这个规律容易被画错。常见失误是在超出必要内层循环范围时继续比较已排序元素。

Binary search tripping points include off-by-one errors when calculating the midpoint mid = (low + high) / 2. Using integer division in pseudocode without floor can cause infinite loops; also, failing to exit when low > high leads to an incorrect ‘not found’ condition. A further pitfall is not adjusting the search space correctly when the target is greater than the midpoint value.

二分搜索的易错点包括在计算中点 mid = (low + high) / 2 时出现差一错误。伪代码中使用整数除法但未取整可能导致无限循环；另外，当 low > high 时未退出循环会导致错误的“未找到”判断。当目标值大于中点值时未正确调整搜索区间也是一个陷阱。