📚 GCSE AQA Computer Science: Common Exam Mistakes Explained | GCSE AQA 计算机：易错题精讲
Many students lose marks in the AQA GCSE Computer Science exams not because they do not understand the material, but because they fall into the same predictable traps. This article highlights the most common mistakes, explains the correct reasoning, and gives you the clarity needed to tackle tricky questions with confidence.
许多学生在 AQA GCSE 计算机科学考试中丢分，并非因为不理解知识，而是因为掉入了可预见的陷阱。本文重点讲解最常见的错误，阐释正确的推理过程，帮助你在面对难题时思路清晰、充满信心。
1. Binary Addition and Overflow Errors | 二进制加法与溢出错误
A common pitfall in binary addition is forgetting to carry correctly when a column sums to 2 or more. Students also often ignore the fixed word length specified in the question. If the question states that registers are 8 bits wide, adding two 8‑bit numbers must produce an 8‑bit result. Any carry into the ninth bit triggers an overflow error, meaning the result is invalid in that fixed width.
二进制加法中常见的陷阱是当某列相加等于 2 或更大时忘记正确进位。学生还经常忽略题目规定的固定字长。如果题目说明寄存器是 8 位宽，那么两个 8 位数相加必须产生 8 位结果。任何向第九位的进位都会引起溢出错误，意味着在该固定宽度下结果无效。
For example, when adding 1010 1100 and 0110 0110 in an 8‑bit system, the correct sum exceeds 1111 1111 and the carry into the 9th bit must be reported as an overflow. Many candidates write the full 9‑bit answer, losing the mark for recognising the overflow.
例如，在 8 位系统中将 1010 1100 与 0110 0110 相加时，正确和超过 1111 1111，向第 9 位的进位必须报告为溢出。许多考生写出完整的 9 位答案，却遗漏了识别溢出的得分点。
The arithmetic itself is straightforward, but always check the stated number of bits. If a question says ‘using 4 bits’, do not produce a 5‑bit answer.
算术本身很简单，但一定要检查题目给定的位数。如果问题是“使用 4 位”，就不要给出 5 位答案。
2. Logic Gates and Substituting Symbols | 逻辑门与符号替换
Students frequently confuse the symbols for AND and OR gates, or they misinterpret a NAND gate as an AND followed by a separate inverter. In AQA diagrams, the small circle indicates inversion, so a NAND gate is equivalent to an AND gate with its output inverted. A common mistake is constructing a truth table for an AND gate when the diagram clearly shows a NAND.
学生经常混淆 AND 门和 OR 门的符号，或者将 NAND 门误解为一个 AND 门后跟一个独立的非门。在 AQA 的图示中，小圆圈表示取反，因此 NAND 门相当于输出端带有取反的 AND 门。常见的错误是：当图中清楚地显示 NAND 门时，却为 AND 门构建真值表。
Another frequent error occurs when students substitute one gate symbol for another in a circuit diagram without adjusting the logic. Always redraw the truth table from the original circuit, not from a guessed simplification.
另一个常见错误发生在替换电路图中的门符号时，不相应地调整逻辑。务必从原电路重新绘制真值表，而不是根据猜测的简化来画。
Remember: A NAND gate outputs 0 only when all inputs are 1. An XOR gate outputs 1 only when the inputs are different. If you treat an XOR as an OR, your truth table will be completely wrong for half the input combinations.
请记住：NAND 门只有所有输入均为 1 时才输出 0。异或门只有输入不同时才输出 1。如果你把 XOR 当作 OR 处理，那么对一半的输入组合，真值表将完全错误。
3. Fetch‑Decode‑Execute Cycle Order | 取指‑译码‑执行周期顺序
One of the most common marks lost in the theory paper is describing the fetch‑decode‑execute cycle out of order. Students often write ‘the instruction is executed, then fetched, then decoded’. The correct sequence is always Fetch → Decode → Execute, with the program counter (PC) incrementing during the fetch stage to point to the next instruction.
理论试卷中最常见的丢分点之一就是描述取指‑译码‑执行周期时不按顺序。学生常写成“指令先执行，然后取指，然后译码”。正确的顺序永远是取指 → 译码 → 执行，且程序计数器（PC）在取指阶段递增，以指向下一条指令。
During fetch, the address in the PC is copied to the memory address register (MAR), the instruction is read into the memory buffer register (MBR), and then transferred to the current instruction register (CIR). During decode, the control unit interprets the instruction. During execute, the arithmetic and logic unit (ALU) performs the required operation. Many candidates forget the role of the CIR or mix up MAR and MBR.
在取指阶段，PC 中的地址被复制到存储器地址寄存器（MAR），指令读入存储器缓冲寄存器（MBR），然后传送到当前指令寄存器（CIR）。在译码阶段，控制单元解读指令。在执行阶段，算术逻辑单元（ALU）执行所需操作。很多考生会忘记 CIR 的作用，或者混淆 MAR 和 MBR。
A safe way to earn full marks is to memorise the registers involved at each stage and state clearly: ‘the PC is incremented ready for the next instruction’.
获得满分的稳妥方法是记住每个阶段涉及的寄存器，并明确指出：“PC 递增，为下一条指令做好准备”。
4. RAM vs ROM – Misunderstanding Volatility | RAM 与 ROM – 对易失性的误解
A classic exam trap is asking why a computer needs both RAM and ROM, and students answering that ‘ROM is faster’ or ‘RAM is non‑volatile’. In truth, RAM is volatile (loses data when power is off) and ROM is non‑volatile. ROM stores the bootstrap loader or BIOS, which must survive a power cycle. RAM holds currently running programs and data because it is fast to read and write, but it loses everything when the computer shuts down.
经典的考试陷阱是询问计算机为什么同时需要 RAM 和 ROM，而学生回答“ROM 更快”或“RAM 是非易失性的”。事实上，RAM 是易失性的（断电时丢失数据），ROM 是非易失性的。ROM 存储引导加载程序或 BIOS，这些必须在断电后仍然保留。RAM 存放当前正在运行的程序和数据，因为它读写速度快，但计算机关闭时所有内容都会丢失。
Another error is stating that the operating system is stored in ROM. While some embedded systems put the OS in ROM, a typical desktop computer loads the OS from secondary storage (HDD/SSD) into RAM. Telling the examiner that the OS sits permanently in ROM will cost you marks.
另一个错误是声称操作系统存储在 ROM 中。虽然某些嵌入式系统将操作系统放在 ROM 里，但典型的台式电脑是从辅助存储器（HDD/SSD）将操作系统加载到 RAM。如果告诉考官操作系统永久驻留在 ROM 中，你就会被扣分。
Always link volatility to purpose: ROM for permanent, unchangeable instructions; RAM for temporary workspace that must be fast.
始终将易失性与用途联系起来：ROM 用于永久的、不可更改的指令；RAM 用于必须快速读写的临时工作空间。
5. Network Topologies: Star vs Bus vs Mesh | 网络拓扑：星型、总线型与网状
Questions on network topologies often ask you to compare the impact of a cable break or a switch failure. A very common mistake is saying that in a star topology, if the central switch fails, ‘some computers can still communicate’. In reality, a star topology with a single central switch or hub is a single point of failure – if it fails, the entire network goes down. However, individual cable breaks only affect the connected device.
网络拓扑相关问题常要求比较电缆断裂或交换机故障的影响。一个非常普遍的错误是说在星型拓扑中，如果中央交换机故障，“部分计算机仍然可以通信”。实际上，带单台中央交换机或集线器的星型拓扑是一个单点故障——如果它坏了，整个网络都会瘫痪。不过，单条电缆断裂只影响所连接的设备。
In a bus topology, a single break in the backbone cable can bring down the whole segment, and terminators must be present at both ends to prevent signal reflection. Students often forget the terminator requirement.
在总线拓扑中，主干电缆的一处断裂就可能导致整个网段瘫痪，并且两端必须安装终端匹配器以防止信号反射。学生经常忘记终端匹配器的要求。
Mesh topologies (full or partial) provide high redundancy because multiple routes exist between nodes. Candidates sometimes write that mesh networks are ‘cheap’ because they use less cable. In fact, full mesh networks require a huge amount of cabling and are expensive, but they are very reliable.
网状拓扑（全连接或部分连接）提供高冗余，因为节点之间存在多条路径。考生有时会写网状网络“便宜”，因为使用更少的电缆。实际上，全连接网状网络需要极大量的电缆，成本昂贵，但非常可靠。
Use precise language: ‘single point of failure’, ‘redundancy’, ‘terminator’, ‘collision domain’ where appropriate.
要使用精确的用语，适当使用“单点故障”、“冗余”、“终端匹配器”、“冲突域”等术语。
6. Cyber Security: Phishing, Social Engineering, and Malware | 网络安全：钓鱼攻击、社会工程与恶意软件
Students frequently confuse phishing with pharming or malware with a virus specifically. AQA expects precise definitions. Phishing is a social engineering attack using fraudulent emails or messages that appear to come from a trusted source to trick users into revealing personal data. Malware is an umbrella term for malicious software, including viruses, worms, trojans, spyware, and ransomware. A virus specifically replicates by attaching itself to legitimate programs.
学生经常混淆钓鱼攻击与域欺骗，或恶意软件与病毒的具体区别。AQA 期望精确的定义。钓鱼攻击是一种社会工程攻击，使用看似来自可信来源的欺诈邮件或消息，诱骗用户泄露个人数据。恶意软件是恶意软件的总称，包括病毒、蠕虫、特洛伊木马、间谍软件和勒索软件。病毒则通过附加到合法程序上进行复制。
Another common error is describing a DDOS attack as simply ‘sending lots of emails’. A distributed denial‑of‑service attack floods a server with traffic from multiple compromised devices (a botnet) to overwhelm it and make a service unavailable. It does not necessarily steal data.
另一个常见错误是将 DDOS 攻击描述为仅仅是“发送大量电子邮件”。分布式拒绝服务攻击是利用由多台受控设备（僵尸网络）产生的流量淹没服务器，使其不堪重负并导致服务不可用。它不一定窃取数据。
When explaining prevention, avoid vague phrases like ‘use a firewall’. Instead, say ‘a firewall can filter incoming and outgoing traffic based on a set of rules, blocking malicious packets’. Similarly, anti‑malware software scans for known signatures and monitors behaviour.
在解释防护措施时，避免使用诸如“使用防火墙”之类的模糊表述。应该说“防火墙可以基于一组规则过滤进出流量，阻止恶意数据包”。类似地，反恶意软件会扫描已知特征码并监控行为。
7. Ethical, Legal, and Environmental Issues | 伦理、法律与环境问题
AQA frequently includes extended‑writing questions about the impact of computing technologies. A typical mistake is listing only one side of the argument or failing to name relevant legislation. For example, when discussing privacy, you must reference the Data Protection Act (DPA) 2018 / GDPR. When discussing online bullying or harassment, mention the Computer Misuse Act 1990 and its unauthorised access offences.
AQA 经常考查关于计算技术影响的论述题。典型的错误是只列出一个方面的论点，或未能写出相关法规。例如，在讨论隐私时，必须提及《2018 年数据保护法》/ GDPR。在讨论网络欺凌或骚扰时，要说《1990 年计算机滥用法》及其关于未经授权访问的罪名。
Many answers refer to the ‘Data Protection Act’ but fail to state its principles: data must be processed fairly, lawfully, and for specified purposes; it must be adequate, relevant, and not excessive; it must be accurate and kept up to date; it must not be kept longer than necessary; and it must be kept secure.
许多答案提及“数据保护法”，但未能陈述其原则：数据必须公平、合法地处理，并用于特定目的；数据必须充分、相关且不过量；必须准确且保持更新；保存时间不得超过必要期限；且必须安全保存。
Environmental impacts include energy consumption of data centres and e‑waste. Candidates sometimes write ‘computers are bad for the environment’ without explaining how. Mention the Carbon Footprint of manufacturing and the challenges of recycling rare‑earth metals.
环境影响包括数据中心的能源消耗和电子废弃物。考生有时写“计算机对环境有害”却不解释如何有害。要提及制造过程中的碳足迹以及回收稀土金属的挑战。
Cultural issues, such as the digital divide and global access to technology, are also easy marks if you give concrete examples, such as differences in broadband availability between urban and rural areas.
文化问题，如数字鸿沟和全球技术接入，只要给出具体例子，例如城乡宽带覆盖率的差异，也很容易得分。
8. Programming: Sequence, Selection, Iteration – Misplaced Logic | 编程：顺序、选择、迭代 – 逻辑错位
When tracing algorithms, students often misread selection statements (IF … ELSE IF … ELSE). A common slip is assuming an ELSE clause executes every time the IF condition is false, without checking whether an ELIF condition might be true instead. In a chain of IF‑ELIF‑ELSE, only the first true branch runs; all subsequent branches are skipped.
当跟踪算法时，学生常常误读选择语句（IF … ELSE IF … ELSE）。一个常见的疏漏是认为每次 IF 条件为假时 ELSE 子句都会执行，却没有检查是否有 ELIF 条件可能为真。在 IF‑ELIF‑ELSE 链中，只有第一个为真的分支会运行；后续所有分支都会被跳过。
For iteration, the classic error is getting the boundary condition wrong. A FOR loop that runs ‘FOR i = 0 TO 10’ in Python affects 11 values (0 through 10 inclusive). A WHILE loop might never execute if the condition is initially false. Students writing trace tables often forget to update the loop counter correctly, leading to an extra or missing iteration.
对于迭代，经典的错误是搞错边界条件。Python 中 “FOR i = 0 TO 10” 的 FOR 循环会影响 11 个值（从 0 到 10，包含 10）。而 WHILE 循环如果初始条件为假，就根本不会执行。写跟踪表的学生经常忘记正确更新循环计数器，导致多一次或少一次迭代。
Nested IFs inside loops are another hotspot. Always track the current value of all variables line‑by‑line and do not jump ahead. A trace table built systematically with one row per instruction execution is the safest way to secure full marks.
循环内嵌套的 IF 是另一个重灾区。一定要逐行跟踪所有变量的当前值，不要跳步。系统地为每条指令执行建立一行跟踪表，是获得满分最稳妥的方式。
9. Searching and Sorting: Bubble vs Merge | 搜索与排序：冒泡排序与归并排序
Students often describe bubble sort incorrectly. The algorithm repeatedly steps through the list, compares adjacent items, and swaps them if they are in the wrong order. The largest unsorted element ‘bubbles’ to the end after each pass. A common mistake is saying that bubble sort compares only the first two elements and then stops – it actually makes multiple passes until no swaps are needed.
学生常常错误描述冒泡排序。该算法反复遍历列表，比较相邻元素，如果顺序错误就交换它们。每一趟结束后，最大的未排序元素会“冒泡”到末端。常见的错误是说冒泡排序只比较前两个元素就停止——实际上它会进行多趟操作，直到不需要交换为止。
Merge sort is a divide‑and‑conquer algorithm that splits the list into smaller sub‑lists until each sub‑list contains a single element, then repeatedly merges the sub‑lists to produce sorted sub‑lists until one sorted list remains. When tracing merge sort, many candidates miss the fact that the splitting phase is purely structural; the actual sorting happens in the merging phase.
归并排序是一种分治算法，它将列表分割成越来越小的子列表，直到每个子列表只包含一个元素，然后反复合并子列表生成有序的子列表，直至得到一个完全有序的列表。在跟踪归并排序时，许多考生忽略了这样一个事实：分割阶段纯粹是结构性的，真正的排序发生在合并阶段。
Comparing efficiency: bubble sort has a worst‑case time complexity of O(n²) while merge sort is O(n log n). Use these terms precisely if the question asks about performance. Do not just say ‘merge sort is faster’ without explaining why.
效率比较：冒泡排序的最坏情况时间复杂度为 O(n²)，而归并排序为 O(n log n)。如果题目问及性能，请准确使用这些术语。不要仅仅说“归并排序更快”而不解释原因。
10. Data Representation: Character Sets and Image Depth | 数据表示：字符集与图像位深度
AQA candidates sometimes confuse ASCII with Unicode. ASCII uses 7 bits, providing 128 characters, while extended ASCII uses 8 bits (256 characters). Unicode uses up to 32 bits per character and can represent scripts from all languages worldwide. The mistake is claiming that ASCII supports Chinese characters or emoji – it does not.
AQA 考生有时会混淆 ASCII 与 Unicode。ASCII 使用 7 位，提供 128 个字符；扩展 ASCII 使用 8 位（256 个字符）。Unicode 每个字符最多可用 32 位，可表示世界上所有语言的文字。错误在于声称 ASCII 支持汉字或表情符号——它并不支持。
When calculating image file size, a common formula mistake is forgetting to multiply by the number of colours or bits per pixel correctly. File size (in bits) = width × height × colour depth (bits per pixel). If an image uses 16 colours, the colour depth is 4 bits (since 2⁴ = 16). Students often mistakenly use 16 as the bits per pixel, leading to enormous and incorrect answers.
计算图像文件大小时，常见的公式错误是忘记正确乘以颜色数或每像素位数。文件大小（以位为单位）= 宽度 × 高度 × 色深（每像素位数）。如果图像使用 16 种颜色，则色深为 4 位（因为 2⁴ = 16）。学生经常错误地将 16 当作每像素位数，导致答案过大且不正确。
Sound file size: duration (seconds) × sample rate (Hz) × bit depth (bits per sample) × number of channels. Do not forget to convert minutes to seconds if required, and always give your final answer in the requested unit (bits, bytes, kilobytes, etc.).
声音文件大小：时长（秒） × 采样率（Hz） × 位深度（每样本位） × 声道数。如有需要，不要忘记将分钟转换为秒，并始终以题目要求的单位（位、字节、千字节等）给出最终答案。
11. Compression: Lossy vs Lossless – When to Use | 压缩：有损与无损 – 何时使用
The choice between lossy and lossless compression is a frequent question, and many candidates state simply that ‘lossy makes the file smaller’. While true, this does not address suitability. Lossy compression permanently removes some data to reduce file size; it is suitable for images, audio, and video where a slight loss in quality is acceptable. Lossless compression preserves all original data and is essential for text documents, executable programs, and spreadsheets where any data loss would be catastrophic.
有损与无损压缩的选择是一个常见问题，许多考生只是简单地说“有损压缩让文件更小”。虽然没错，但这并没有说明适用场景。有损压缩会永久性地移除部分数据以减小文件大小；它适用于质量略降也可接受的图像、音频和视频。无损压缩则保留所有原始数据，对于文本文档、可执行程序和工作表等任何数据丢失都会造成灾难性后果的场景至关重要。
A typical misunderstanding is that repeatedly saving a lossy file (e.g., JPEG) does not degrade quality. In fact, each re‑compression removes more data, and the loss accumulates. This is known as generation loss.
一个典型的误解是反复保存有损文件（例如 JPEG）不会降低质量。实际上，每次重新压缩都会移除更多数据，损失会累积。这被称为代次损失。
When explaining algorithms, you don’t need to describe the full run‑length encoding or Huffman coding, but you should know that run‑length encoding replaces repeated values with a count and a value, which works well on data with long runs of the same element. It is lossless.
在解释算法时，你不需要完整描述游程编码或霍夫曼编码，但应该知道游程编码用计数和值来替换重复的值，这对于具有长段相同元素的数据效果很好。它是无损的。
12. Error Detection: Parity Bits, Parity Blocks, and Checksums | 错误检测：奇偶校验位、奇偶校验块与校验和
Many candidates think a parity bit can locate the exact bit that is errored, but it can only detect an odd number of bit errors. Even parity means the total number of 1‑bits (including the parity bit) is even. If a transmission uses even parity and the receiver counts an odd number of 1s, an error is detected, but the receiver cannot tell which bit is wrong.
许多考生认为奇偶校验位可以定位出具体出错的是哪一位，但它只能检测奇数个位错误。偶校验意味着包括校验位在内的 1 的总数为偶数。如果传输使用偶校验，而接收端数出的 1 为奇数，则检测到错误，但接收端无法判断是哪一位出了错。
A parity block (a two‑dimensional grid with row and column parity) can locate and even correct a single‑bit error. This is a common source of marks: you need to explain that the intersection of the failing row and failing column parity points to the erroneous bit. Students often forget to mention that the column parity is calculated over the whole block, not just the data.
奇偶校验块（一个带有行校验和列校验的二维网格）可以定位甚至纠正单比特错误。这是一个常见的得分点：你需要解释，出错的行校验和列校验的交叉点指出了错误的所在位。学生常常忘记提及列校验是针对整个块计算的，而不仅仅是数据部分。
Checksums work by adding up a block of data and transmitting the sum along with the data. The receiver calculates its own checksum and compares. A mismatch indicates a transmission error, but a checksum cannot pinpoint the location. Do not confuse checksum with hash values used in cryptography, although the principle is similar.
校验和的原理是将一块数据加起来，并将总和与数据一起发送。接收方计算自己的校验和并进行比较。不匹配说明存在传输错误，但校验和无法定位错误位置。不要将校验和与密码学中使用的哈希值混淆，尽管原理类似。
A final tip: when answering ‘why parity is used’, always link it to the fact that communication channels are subject to noise/interference, which can flip bits.
最后一点提示：在回答“为什么使用奇偶校验”时，一定要与通信信道易受噪声/干扰影响、可能翻转位值的客观事实联系起来。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导