IGCSE Computer Science: Common Mistakes & Exam-Focused Solutions | IGCSE 计算机：易错题精讲

📚 IGCSE Computer Science: Common Mistakes & Exam-Focused Solutions | IGCSE 计算机：易错题精讲

Too often, IGCSE Computer Science students lose marks not because they lack understanding, but because they fall into predictable traps set by examiners. This article walks you through eight high-frequency error areas – from binary overflow and logic gate simplification to database queries and encryption – providing clear, exam-ready corrections. Each section pinpoints the mistake, explains the correct approach, and reinforces the concept with a worked example. Use this as your targeted revision tool to turn common slips into secure marks.

在IGCSE计算机考试中，学生丢分往往不是因为不懂，而是掉进了出题人精心设计的陷阱。本文梳理了八个高频易错点——从二进制溢出、逻辑门化简到数据库查询和加密——为你提供清晰、可直接用于考试的纠正方案。每一节都直指典型错误，讲解正确思路，并通过实例强化理解。请将本文作为精准复习利器，把常见失误变成稳稳的得分点。

1. Binary Subtraction and Overflow | 二进制减法与溢出

A very common mistake is treating binary subtraction as if it were decimal subtraction without properly applying two’s complement. Students often forget that when subtracting a larger number from a smaller one, the result is negative and must be represented in two’s complement form. In addition, many ignore the overflow flag when dealing with 8-bit signed integers, assuming that a 9th bit simply appears. The correct method is to convert the subtrahend to its two’s complement, perform binary addition, and then check the overflow flag: overflow occurs when the carry into the sign bit is different from the carry out of the sign bit. For example, 01100110₂ (102) + 01001000₂ (72) gives 10101110₂, which is −82 in two’s complement when interpreted as signed, and overflow has occurred because the sum exceeds 127. Always verify whether the result is within the representable range (−128 to 127 for 8 bits).

一个非常常见的错误是把二进制减法当成十进制减法来做，而没有正确使用补码。学生常常忘记，当用较小的数减去较大的数时，结果是负数，必须用二进制补码表示。此外，很多人在处理8位有符号整数时忽略了溢出标志，误以为多出来的第9位会自然出现。正确的方法是：先将减数转换为其补码，再进行二进制加法，然后检查溢出标志——当进入符号位的进位与离开符号位的进位不同时，即发生溢出。例如，01100110₂ (102) + 01001000₂ (72) 得到 10101110₂，解释为有符号数时是−82，而溢出已经发生，因为结果超出了127。一定要验证结果是否在可表示范围内（8位时为−128到127）。

2. Logic Gate Simplification with NAND and NOR | 逻辑门化简：NAND与NOR的陷阱

Examiners love to ask for a circuit built entirely from NAND gates or NOR gates, yet students frequently attempt to reproduce AND/OR equivalents without realising that NAND and NOR are universal gates. A typical mistake is writing the Boolean expression A AND B and then simply replacing the AND symbol with a NAND gate, which alters the logic. The correct approach is to redraw the circuit using only NAND gates by converting each fundamental gate into its NAND equivalent: NOT is a NAND with tied inputs; AND is NAND followed by NOT (i.e., two NANDs); OR is NAND with inverted inputs, which can be constructed using three NANDs. For examination success, learn the standard NAND-only and NOR-only representations of AND, OR and NOT, and practise transforming simple circuits step by step. Always double-check the output by building a truth table in the margin.

出题人特别喜欢要求用纯与非门或纯或非门搭建电路，但学生常常试图直接复制与门、或门的结构，而没有意识到NAND和NOR是通用门。一个典型错误是写出布尔表达式 A AND B，然后简单地把与门符号换成与非门，这改变了逻辑功能。正确的方法是仅用与非门重画电路：每个基本门都转化为其与非门等效——非门是输入短接的与非门；与门是与非门后接非门（即两个与非门）；或门是带反相输入的与非门，可以用三个与非门实现。为在考试中拿分，请熟记与门、或门和非门的纯与非门及纯或非门的标准表达方式，并练习逐步转换简单电路。最好在草稿纸上建立真值表来二次验证输出。

3. Pseudocode Loop Tracing and Variable Updates | 伪代码循环追踪与变量更新

Loop tracing appears straightforward, yet it is one of the biggest score-drainers because students rush through the iterations and mishandle variable updates. A classic error is assuming that the loop condition is checked only at the start, or misreading a REPEAT…UNTIL loop as identical to a WHILE loop. In many exam scripts, students also forget to apply the increment statement at the correct point, especially when it appears inside an IF block. The fix: create a systematic trace table with columns for each variable and the condition. For a FOR loop, count exactly how many times the body executes – the final value of the control variable often causes off-by-one mistakes. When a variable is updated conditionally, highlight that row in the table to prevent oversight. Practice with loops containing nested conditions and verify your result by running the logic mentally in slow motion.

循环追踪看似简单，却是丢分最多的项目之一，因为学生匆忙遍历迭代过程，处理变量更新时频频出错。一个经典错误是假设循环条件只在开始时检查一次，或者误以为 REPEAT…UNTIL 循环与 WHILE 循环完全相同。在很多答卷中，学生还忘记在正确的位置执行递增语句，特别是当该语句位于 IF 语句块内部时。解决办法：建立一个系统化的追踪表格，为每个变量和条件设置列。对于 FOR 循环，要精确计算循环体执行了多少次——控制变量的最终值经常导致“差一”错误。当变量被有条件地更新时，在表中高亮该行以避免疏漏。通过带嵌套条件的循环进行练习，并用慢动作式的思维运行逻辑来验证结果。

4. Data Units: Kibibytes vs Kilobytes | 数据单位：KiB与KB的区别

The distinction between decimal prefixes (KB, MB) and binary prefixes (KiB, MiB) is explicitly tested in IGCSE Computer Science, yet confusion persists. Many students treat 1 KB as 1024 bytes in all contexts, which leads to calculation errors when a storage manufacturer uses decimal definitions (1 KB = 1000 bytes). The exam expects you to apply the correct conversion: powers of 10 for decimal units (kilo, mega) and powers of 2 for binary units (kibi, mebi). For example, when converting file size from bytes to kilobytes, dividing by 1000 gives the decimal value, while dividing by 1024 gives the kibibytes value. A typical trap: a file is 2 560 000 bytes; the question asks for the size in KB (decimal) – the answer is 2560 KB, not 2500 KiB. Memorise these equivalent pairs: 1 KiB = 1024 bytes, 1 MiB = 1024 KiB, 1 KB = 1000 bytes, 1 MB = 1000 KB, and always read the question for the required prefix.

十进制词头（KB、MB）与二进制词头（KiB、MiB）的区别是IGCSE计算机科学的明确考点，但混淆始终存在。很多学生认为1 KB在任何情况下都等于1024字节，当存储厂商使用十进制定义（1 KB = 1000字节）时，计算就会出错。考试要求你使用正确的换算：十进制单位使用10的幂（kilo、mega），二进制单位使用2的幂（kibi、mebi）。例如，将文件大小从字节转换为千字节时，除以1000得到十进制值，除以1024得到kibibytes值。一个典型陷阱：文件大小为2 560 000字节，题目要求给出以KB（十进制）为单位的大小——答案是2560 KB，而不是2500 KiB。请熟记这些对应关系：1 KiB = 1024字节，1 MiB = 1024 KiB，1 KB = 1000字节，1 MB = 1000 KB，并始终根据题目要求选择正确的前缀。

5. IP Addresses vs MAC Addresses | IP地址与MAC地址辨析

Questions asking to compare an IP address and a MAC address catch out many candidates who can define each but cannot highlight the functional differences in a network. The most frequent error is stating that both are used for identification without specifying the layers at which they operate. An IP address is a logical address assigned by the network and can change (e.g., via DHCP), functioning at the network layer to route packets across different networks. A MAC address is a physical identifier burnt into the NIC by the manufacturer, operating at the data link layer and used for communication within the same local network. When an exam asks why both are needed, the answer must mention that IP enables global addressing and routing, while MAC handles local frame delivery. Never write that a MAC address is ‘more secure’ because it is fixed – that is a misunderstanding of security concepts.

要求比较IP地址和MAC地址的题目经常让考生失分，他们能分别给出定义，但无法明确指出两者在网络中的功能差异。最常见的错误是说两者都用于标识，却没有说明它们工作在哪个层次。IP地址是由网络分配的逻辑地址，可更改（例如通过DHCP），工作在网络层，用于跨不同网络路由数据包。MAC地址是制造商烧录在网卡中的物理标识符，工作在数据链路层，用于同一本地网络内的通信。当考题问为什么两者都需要时，答案必须提及IP实现全球寻址和路由，而MAC处理本地帧交付。绝不要写出“MAC地址更安全因为它固定不变”——这是对安全概念的误解。

6. Parity Checks: Detection vs Correction | 奇偶校验：检测与纠错的误区

A very subtle error students make is claiming that parity checking can correct single-bit errors. Parity (even or odd) is a single-bit error detection method, not an error correction method. It can only determine whether an odd number of bits have been flipped; it cannot locate which bit is incorrect, let alone fix it. If a question asks for a method that can correct errors, the answer should be something like checksum with retransmission, or more advanced codes like Hamming code (though IGCSE typically sticks to parity and checksum basics). Additionally, many students forget that even parity sets the parity bit so that the total number of 1s (including the parity bit) is even, while odd parity makes the count odd. When tracing a parity check scenario, always count the number of 1s carefully after receiving the byte with parity bit. If parity matches, it is assumed no error; if not, an error is detected but not corrected.

学生一个非常微妙的错误是声称奇偶校验可以纠正单比特错误。奇偶校验（偶校验或奇校验）是一种单比特错误检测方法，而非纠错方法。它只能判断是否发生了奇数个比特翻转，却无法定位哪个比特出错，更不用说修复它。如果题目问“哪种方法可以纠正错误”，应当回答“带重传的校验和”之类，或更高级的编码如海明码（尽管IGCSE通常只涉及奇偶校验和校验和基础）。此外，许多学生忘记：偶校验是设置校验位使得1的总数（含校验位）为偶数，奇校验则使总数为奇数。在追踪奇偶校验情景时，务必在接收带校验位的字节后仔细数1的个数。如果校验匹配，假定无错；如果不匹配，则检测到错误但无法纠正。

7. Database Query Conditions and Logic | 数据库查询条件的逻辑陷阱

When writing SQL-style queries or interpreting query-by-example (QBE) grids, students frequently misapply AND and OR operators. The mistake often occurs because natural language is ambiguous: ‘Find all students whose age is 15 or 16 and who are in grade 10’ is interpreted by the learner as (age = 15 OR age = 16) AND grade = 10, which is correct, but when the brackets are omitted, the DBMS might evaluate it as age = 15 OR (age = 16 AND grade = 10), returning unintended results. On paper, IGCSE candidates must show precise conditions, typically in a grid where criteria on the same row use AND, and criteria on different rows use OR. Another pitfall is using the LIKE operator – forgetting that the wildcard % represents any sequence of characters, while _ represents a single character, and these must be placed correctly in the search string. Always test your query conditions with a few mental rows of data before finalising.

在编写SQL风格查询或解释示例查询（QBE）网格时，学生经常错误运用AND和OR运算符。这类错误通常源于自然语言的歧义：“查找所有年龄为15或16岁且就读于10年级的学生”被学生理解为 (age = 15 OR age = 16) AND grade = 10，这是正确的，但如果没有括号，数据库管理系统可能按 age = 15 OR (age = 16 AND grade = 10) 来计算，导致非预期的结果。在笔试中，IGCSE考生必须给出准确的条件，通常以网格形式呈现：同一行的条件使用AND，不同行的条件使用OR。另一个陷阱是使用 LIKE 运算符——忘记通配符 % 表示任意字符序列，而 _ 表示单个字符，这些通配符必须放在搜索字符串的正确位置。在最终确定前，先用几条数据在脑中测试查询条件。

8. Encryption: Symmetric vs Asymmetric Keys | 加密：对称密钥与非对称密钥

The concepts of symmetric and asymmetric encryption are frequently tested, but students often mix up which key is used for what purpose. A classic misstatement: ‘In asymmetric encryption, the public key is used to decrypt a message.’ The correct principle is that the public key encrypts, and the matching private key decrypts. Another mistake is failing to recognise that symmetric encryption uses a single shared key for both encryption and decryption, which makes key distribution a problem. Examiners also look for the application of encryption: symmetric for bulk data encryption due to speed, asymmetric for secure key exchange and digital signatures. If a question describes sending a secret key over the internet, the expected answer is to use asymmetric encryption to safely transmit the symmetric key, which then encrypts the actual data. Never say that hashing and encryption are the same – hashing is one-way and cannot be decrypted.

对称加密和非对称加密的概念经常被考查，但学生常常混淆哪个密钥用于什么目的。一个典型的错误说法是：“在非对称加密中，公钥用于解密消息”。正确的原则是：公钥加密，匹配的私钥解密。另一个错误是未能认识到对称加密使用单一共享密钥进行加解密，这就带来了密钥分发问题。考官还会关注加密的应用：由于速度较快，对称加密用于批量数据加密；非对称加密用于安全密钥交换和数字签名。如果题目描述了一个通过互联网发送秘密密钥的场景，预期答案是使用非对称加密安全地传输对称密钥，该对称密钥再用来加密实际数据。绝不要说哈希和加密是一回事——哈希是单向的，无法解密。

Published by TutorHao | IGCSE Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）