📚 Common Misconceptions in Year 12 AQA Computer Science and How to Fix Them | Year 12 AQA 计算机科学常见误区与纠正方法
Many Year 12 students find AQA Computer Science challenging not because the concepts are inherently complex, but because subtle misunderstandings can trip them up in exams. This article highlights the most frequent pitfalls and provides clear explanations to build rock-solid understanding.
许多 Year 12 学生觉得 AQA 计算机科学难，并不在于概念本身有多复杂，而是因为考试中一些细微的误解让他们丢分。本文将梳理最常见的误区，并提供清晰的解释，帮助你打下扎实的基础。
1. Two's Complement Sign Bit: Not Just a ‘Minus Sign’ | 补码的符号位：不只是一个负号
Many students treat the most significant bit (MSB) in two's complement as a simple flag that flips the number to negative, forgetting that it also carries place value –(2n-1).
很多学生把补码的最高有效位（MSB）仅仅当作一个翻转正负的标志，却忘了它本身的位权是 –(2n-1)。
In an 8-bit two's complement system, 10000011 is not ‘1’ with a minus sign; you must add –128 + 2 + 1 = – o treat the MSB as a weighted negative often leads to wild errors in range and arithmetic.
在 8 位补码系统中，10000011 并不是“带负号的1”；你需要计算 –128 + 2 + 1 = –125 才能得到正确的十进制值。如果不把 MSB 当作带负权的位，就很容易在范围判断和算术运算中犯大错。
Correction: Always evaluate two's complement numbers by summing the weighted values, where the MSB contributes –(2n-1) and all other bits contribute +2i. When converting a negative decimal to two's complement, find the positive binary, flip all bits, then add 1.
纠正方法： 始终通过加权求和的方式计算补码，MSB 贡献 –(2n-1)，其余各位贡献 +2i。将负十进制转补码时，先求对应正数的二进制，全部取反，再加 1。
2. Floating Point: Confusing Mantissa and Exponent | 浮点数：混淆尾数与指数
Students often believe a larger exponent always means a larger number, ignoring that the mantissa carries the significant digits and that normalisation is required for accurate representation.
学生常误以为指数越大数值就越大，却忽略了尾数才携带有效数字，而且为了精确表示必须进行规格化。
For example, with 8-bit mantissa and 4-bit exponent, an unnormalised number like 0.0011010 0011 wastes precision. After normalisation to 0.1101000 0000, the exponent changes, and the value becomes as precise as the format allows. Mixing up the bit allocation or miscalculating the bias results in completely wrong decimal values.
例如，8 位尾数、4 位指数时，像 0.0011010 0011 这样的非规格化数会浪费精度。规格化为 0.1101000 0000 后，指数发生变化，数值才达到该格式所能允许的精度。搞错位分配或算错偏移量都会导致十进制值完全错误。
Correction: Memorise the format: sign bit, mantissa, exponent. Normalise by shifting the mantissa left until the first two bits after the binary point are different (usually 0.1 for positive). Remember the exponent uses excess representation, and always apply the bias when converting.
纠正方法： 牢记格式：符号位、尾数、指数。通过左移尾数直到小数点后前两位不同（通常正数为 0.1）来规格化。记住指数使用移码表示，转换时务必使用偏移量。
3. Logic Gate Simplification: Blindly Applying Boolean Algebra Rules | 逻辑门化简：盲目套用布尔代数规则
A common error is misapplying De Morgan's laws or absorption, leading to over-complicated circuits that are incorrect or inefficient.
常见错误是错误应用德摩根定律或吸收律，导致得出错误或低效的过于复杂的电路。
For example, simplifying ¬(A ∧ B) ∨ (¬A ∧ ¬B) many students write ¬A ∨ ¬B ∨ ¬A ∧ ¬B and stop, not realising this further reduces to just ¬A ∨ ¬B (which is themselves the NAND equivalent). Without careful truth table checking, these mistakes slip through.
例如，化简 ¬(A ∧ B) ∨ (¬A ∧ ¬B)，许多学生写出 ¬A ∨ ¬B ∨ ¬A ∧ ¬B 就停了，没有意识到可以进一步化简为 ¬A ∨ ¬B（本身就是 NAND 的等效）。不仔细用真值表检查，这些错误就会漏过去。
Correction: Always verify with a truth table or Karnaugh map after simplifying. Practise recognising patterns: double negation cancels, X ∨ (X ∧ Y) = X (absorption), and ¬(X ∧ Y) = ¬X ∨ ¬Y. On exam questions, draw the intermediate circuit to see if it matches the original behaviour.
纠正方法： 化简后始终用真值表或卡诺图验证。多练习识别模式：双重否定抵消，X ∨ (X ∧ Y) = X（吸收律），¬(X ∧ Y) = ¬X ∨ ¬Y。在考试题中，画出中间电路看看是否与原始行为匹配。
4. Recursion vs Iteration: Misunderstanding Base Case and Stack Usage | 递归与迭代：对基准情形和栈使用的误解
Many pupils confuse recursion with just ‘a function calling itself’, neglecting the critical role of the base case and the call stack, leading to infinite loops or stack overflow errors in trace questions.
很多学生把递归简单地理解为“函数调用自身”，忽略了基准情形和调用栈的关键作用，在跟踪题中导致无限循环或栈溢出错误。
In a recursive factorial function fact(n) = n × fact(n-1), if the base case fact(0) = 1 is missing or incorrect, the recursion never terminates. Additionally, each recursive call consumes stack space; students often lose marks by not showing the unwinding of the stack when tracing.
在递归阶乘函数 fact(n) = n × fact(n-1) 中，如果缺少或不正确定义基准情形 fact(0) = 1，递归就不会终止。而且每次递归调用都消耗栈空间；学生在跟踪时常常因为没展示栈的回退而丢分。
Correction: Always clearly state the base case(s) first. When tracing, draw a stack frame for each call and show the return values flowing back. Compare with iterative equivalents to understand the trade-offs in memory and readability.
纠正方法： 总是首先清晰陈述基准情形。跟踪时，为每次调用画出栈帧，并显示返回值的回传。与等价的迭代方案对比，理解内存和可读性上的权衡。
5. Arrays vs Linked Lists: Wrong Assumptions About Speed | 数组与链表：对速度的错误假设
A typical misunderstanding is that linked lists are always faster than arrays because insertion is O(1). Students overlook the need to traverse to the insertion position, which is O(n), and underestimate the cost of dynamic array resizing.
典型误解是认为链表因为插入是 O(1) 所以总比数组快。学生忽略了遍历到插入位置需要 O(n)，也低估了动态数组扩容的代价。
For instance, inserting at the end of an array (amortised O(1)) is often faster in practice than inserting at the end of a linked list if the tail pointer is cached, but the key is that the choice depends on the operation pattern. Many answers confuse the abstract Big O with real runtime.
例如，在数组末尾插入（均摊 O(1)）往往比在缓存了尾指针的链表末尾插入更快，但关键是根据操作模式选择。很多答案混淆了抽象的大 O 与实际运行时间。
Correction: Learn the operations table: array random access is O(1) vs linked list O(n); insertion/deletion at head for linked list is O(1) vs array O(n). Justify your choice based on the predominant operation required in the scenario, not just a general belief.
纠正方法： 掌握操作表：数组随机访问 O(1)，链表 O(n)；链表头插入/删除 O(1)，数组 O(n)。根据场景中主要操作来证明你的选择，而不是依靠一般性感觉。
6. Stacks and Queues: Misapplying LIFO and FIFO | 栈与队列：误用 LIFO 与 FIFO
Students frequently confuse the order of processing in stack (LIFO) and queue (FIFO), especially when tracing algorithm steps or describing the role of data structures in depth-first vs breadth-first search.
学生经常混淆栈（LIFO）和队列（FIFO）的处理顺序，尤其是在跟踪算法步骤或描述深度优先搜索与广度优先搜索中数据结构的作用时。
In a depth-first traversal, the last node discovered is explored first, which is stack behaviour. In breadth-first, nodes are explored in the order they were discovered, which is queue behaviour. Many write the correct data structure but then trace it as if it were the other.
在深度优先遍历中，最后发现的节点最先被探索，这是栈的行为。在广度优先中，节点按照发现的顺序被探索，这是队列的行为。许多人写对了数据结构，但跟踪时却像用了另一种一样。
Correction: Visualise a physical stack (plates) and queue (line). For stack, push and pop from the top; for queue, enqueue at the back and dequeue from the front. In exam traces, show the contents after each operation and confirm the order of removal matches LIFO or FIFO.
纠正方法： 将栈（盘子）和队列（排队）形象化。栈在顶部入栈、出栈；队列在队尾入队、队首出队。考试跟踪时，展示每次操作后的内容，并确认取出顺序与 LIFO 或 FIFO 一致。
7. Binary Tree Traversals: Order of Nodes in Pre-, In-, Post-order | 二叉树遍历：前序、中序、后序的节点顺序
A frequent pitfall is mixing up when the root is visited relative to its subtrees: pre‑order (root, left, right), in‑order (left, root, right), post‑order (left, right, root). This leads to garbled output in tree questions and incorrect expression tree evaluations.
常见陷阱是混淆根节点相对子树的访问时机：前序（根、左、右）、中序（左、根、右）、后序（左、右、根）。这会导致树问题中的输出混乱，以及表达式树计算错误。
For an expression tree representing (3+4)×5, a post‑order traversal gives 3 4 + 5 × (Reverse Polish notation), which evaluates uniquely. If a student uses in‑order, they get 3 + 4 × 5, which is ambiguous without brackets.
对于表示 (3+4)×5 的表达式树，后序遍历产生 3 4 + 5 ×（逆波兰表示法），可唯一求值。如果学生用中序，得到 3 + 4 × 5，没有括号就有歧义。
Correction: Label your tree clearly and stick to a rhyme or mnemonic. Practise writing out the traversal step‑by‑step, and always verify that post‑order yields a valid RPN expression. Apply the same discipline to binary search trees where in‑order yields sorted output.
纠正方法： 清晰地标注你的树，记住口诀。逐步写出遍历过程，并始终验证后序是否产生有效的逆波兰表达式。在二叉搜索树中同样严谨，其中中序遍历产生有序序列。
8. Finite State Machines (FSMs): Ignoring Unconditional Transitions and Accepting States | 有限状态机：忽略无条件转换和接受状态
Students often draw FSMs without specifying what happens on all possible inputs, or they confuse Moore and Mealy machines—disasters in exam design questions.
学生常画出没有指定所有可能输入的 FSM，或者混淆 Moore 和 Mealy 机——这在考试设计题中是灾难。
In a Moore machine, the output depends only on the state; in a Mealy, it depends on state and input. A typical mistake is assigning outputs to transitions in a Moore diagram, or forgetting that an FSM must have a defined behaviour for every input in each state, even if it just loops.
在 Moore 机中，输出仅取决于状态；在 Mealy 机中，取决于状态和输入。典型错误是在 Moore 图中将输出标注在转换上，或者忘了 FSM 必须在每个状态下为每一个输入定义行为，哪怕只是自循环。
Correction: Always label outputs inside the state circle for Moore, and on the transition arrow for Mealy. Draw a transition table to check completeness: each (state, input) pair must lead to exactly one next state. Clearly mark the start and accept states.
纠正方法： 对于 Moore 机，将输出标在状态圆圈内；对于 Mealy，标在转换箭头上。画出转换表检查完备性：每个（状态，输入）对必须恰好指向一个次态。清楚地标记起始状态和接受状态。
9. Operating System Scheduling: Miscalculating Average Wait Time | 操作系统调度：计算平均等待时间错误
When asked “calculate the average wait time for Round Robin (time slice=2)” that wait time is the total time a process is in the ready queue, not including execution.
当被要求“计算轮转调度（时间片=2）的平均等待时间”时，很多学生只是把执行时间相加再除以进程数，忘记了等待时间是进程在就绪队列中的总时间，并不包括执行时间。
For example, if P1 arrives at 0, burst 5; P2 at 2, burst 3; with time slice 2, the Gantt chart must be drawn. Errors come from forgetting context‑switch overhead (if specified) or miscalculating the waiting time as burst time minus last start. A precise table is needed.
例如，P1 在 0 时刻到达，执行时间 5；P2 在 2 时刻到达，执行时间 3；时间片 2。必须画出甘特图。错误来源于忘记上下文切换开销（如果题目指定）或者将等待时间误算为执行时间减去最后开始时间。精确的表格必不可少。
Correction: Draw the Gantt chart. For each process, wait time = (finish time – arrival time – , and wait time. Average across all processes. Include overhead if the question states it.
纠正方法： 画出甘特图。每个进程的等待时间 = （完成时间 – 到达时间 – 总执行时间）。用表格列出到达、执行、开始、完成和等待时间。对所有进程求平均。如果题目说明，要加上开销。
10. TCP/IP Stack: Wrong Order and Layer Responsibilities | TCP/IP 协议栈：顺序错误和层次职责模糊
A common misconception is that the Application layer of TCP/IP is the same as the Application layer of OSI, or that protocols like HTTP belong to the Transport layer. Many students also reverse the Transport and Internet layers.
常见误解是认为 TCP/IP 的应用层与 OSI 的应用层相同，或者认为 HTTP 属于传输层。很多学生还会颠倒传输层和互联网层的顺序。
In the 4-layer TCP/IP model, the correct top‑down order is: Application, Transport, Internet, Network Access. HTTP, FTP, SMTP sit at the Application layer; TCP/UDP at Transport; IP at Internet; Ethernet/Wi-Fi at Network Access. Mixing these up loses easy marks on identification questions.
在四层 TCP/IP 模型中，正确的自上而下顺序是：应用层、传输层、互联网层、网络接入层。HTTP、FTP、SMTP 位于应用层；TCP/UDP 位于传输层；IP 位于互联网层；Ethernet/Wi-Fi 位于网络接入层。搞混这些会在识别题中白白丢分。
Correction: Use a mnemonic “All Turtles In North America” (Application, Transport, Internet, Network Access). Remember what each layer adds: Application creates data; Transport adds port numbers and reliability; Internet adds IP addresses; Network Access turns into bits on the wire.
纠正方法： 用一个助记句帮助记忆：Application, Transport, Internet, Network Access。记住每层添加了什么：应用层生成数据；传输层添加端口号和可靠传输；互联网层添加 IP 地址；网络接入层将数据转换为线上的比特流。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图