IGCSE WJEC Computer Science: Common Misconceptions | IGCSE WJEC 计算机：常见误区

📚 IGCSE WJEC Computer Science: Common Misconceptions | IGCSE WJEC 计算机：常见误区

Success in IGCSE Computer Science often depends not just on what you know, but on avoiding the small mistakes that can cost valuable marks. Many students repeatedly fall into the same traps when tackling binary arithmetic, logic circuits, programming concepts and networking topics. This article highlights the most frequent misconceptions seen in WJEC papers, explains the correct understanding, and shows how to steer clear of confusion.

在 IGCSE 计算机科学中取得好成绩，往往不仅取决于你掌握了什么，更取决于你是否能避开那些容易丢分的小错误。很多学生在处理二进制运算、逻辑电路、编程概念和网络主题时，会反复掉进相同的陷阱。这篇文章聚焦 WJEC 试卷中最常见的误区，讲解正确的理解方式，并告诉你如何绕开混淆点。

1. Misreading Place Values in Binary | 混淆二进制位权

A common error is treating the rightmost bit as the most significant bit or miscalculating powers of two. In an 8-bit binary number, the least significant bit (LSB) is on the far right and represents 2⁰ = 1. The most significant bit (MSB) on the far left represents 2⁷ = 128. Students often write 2¹ = 1 or forget that 2⁰ equals 1, causing the whole conversion to be wrong.

一个常见错误是把最右边的位当成最高有效位，或者错误地计算 2 的幂。在一个 8 位二进制数中，最低有效位在最右边，代表 2⁰ = 1；最左边的最高有效位代表 2⁷ = 128。学生常常把 2¹ 写成 1，或忘记 2⁰ 等于 1，导致整个转换错误。

Always remember the place values from right to left: 1, 2, 4, 8, 16, 32, 64, 128 for 8 bits. When converting, add only the place values where the bit is 1. Double-check with: 11111111₂ = 255₁₀.

请始终记住从右到左的位权：1, 2, 4, 8, 16, 32, 64, 128（适用于 8 位）。转换时，只把二进制位是 1 的位权相加。可以用 11111111₂ = 255₁₀ 来验证。

2. Confusing Hexadecimal with Denary Digits | 将十六进制字符与十进制数字混淆

Students frequently treat hex letters A–F as numbers 10–15 in denary but then use them incorrectly in conversions. For example, they might read 1A as 1 + 10 = 11 instead of (1 × 16) + 10 = 26. Another misunderstanding is thinking that A3 is smaller than 9F because 3 < F, ignoring the higher column.

学生经常把十六进制字母 A–F 当成十进制数字 10–15，但在转换时用错。例如，他们可能把 1A 算成 1 + 10 = 11，而正确的应该是 (1 × 16) + 10 = 26。另一个误解是认为 A3 比 9F 小，因为 3 < F，却忽略了高位列的影响。

Each hex digit’s position carries a weight of powers of 16. The leftmost digit in a two-digit hex number is the 16s column. A3 = (10 × 16) + 3 = 163, while 9F = (9 × 16) + 15 = 159, so A3 is actually larger.

每个十六进制位的位置权重是 16 的幂。两位十六进制数中，左边的数字代表 16 的倍数。A3 = (10 × 16) + 3 = 163，而 9F = (9 × 16) + 15 = 159，因此 A3 实际上更大。

3. Misunderstanding Two’s Complement for Negative Numbers | 对补码表示负数的误解

Many learners think that simply flipping the MSB of a positive binary number gives the negative version, without performing two’s complement properly. For instance, they believe +6 (00000110) becomes 10000110 for –6, but that would be –122 in two’s complement if interpreted as an 8-bit signed integer. The correct two’s complement of +6 is 11111010.

许多学习者认为只需将正数二进制的最高位翻转就能得到负数，而没有正确执行补码操作。比如，他们觉得 +6 (00000110) 变成 10000110 就是 –6，但如果当作 8 位有符号整数来解释，那其实是 –122。+6 的正确补码是 11111010。

To convert a positive number to its negative, invert all bits and add 1. Invert 00000110 to 11111001; add 1 gives 11111010. Practice with a few examples and verify by adding the two: 00000110 + 11111010 = 1 00000000 (the ninth bit is ignored, result 0).

要将正数转换为其负数，先对所有位取反，再加 1。对 00000110 取反得到 11111001；加 1 得到 11111010。多练习几个例子，并通过相加来验证：00000110 + 11111010 = 1 00000000（忽略第九位，结果为 0）。

4. Mixing Up Logic Gate Symbols and Truth Tables | 混淆逻辑门符号与真值表

It is surprising how often students confuse AND with OR gate shapes, or draw a NAND gate but write the truth table of NOR. A typical error is assuming an OR gate output is 1 only when both inputs are 1, which describes an AND gate. The OR gate outputs 1 if at least one input is 1.

令人惊讶的是，学生经常把与门和或门的形状搞混，或者画出一个与非门却写出了或非门的真值表。一个典型错误是认为或门输出只在两个输入都为 1 时才为 1，这其实描述的是与门。或门是当至少一个输入为 1 时输出就为 1。

Memorise the distinct symbols: AND has a D-shaped back, OR has a curved back and a pointed nose. NAND and NOR add a small circle at the output. Practice drawing truth tables for two-input gates until they become automatic.

记住不同的符号：与门的背后是 D 形，或门的背后是弧形，前面是尖的。与非门和或非门在输出端加一个小圆圈。多练习画两输入门的真值表，直到自动掌握。

AND: 0·0=0, 0·1=0, 1·0=0, 1·1=1

OR: 0+0=0, 0+1=1, 1+0=1, 1+1=1

NAND: opposite of AND; NOR: opposite of OR

5. Assignment vs. Equality in Programming | 编程中赋值与等号的混淆

Beginner programmers often write if x = 5 instead of if x == 5. In many languages, a single equals sign means assignment, not comparison. This mistake can lead to logical errors where a condition always evaluates to true because a value is being assigned, not compared.

初学编程的人经常写出 if x = 5 而不是 if x == 5。在很多语言中，单等号表示赋值，而不是比较。这个错误会导致逻辑错误，因为条件判断变成了赋值，永远为真。

Use == for equality testing. Pseudocode in WJEC may use ← for assignment and = for comparison, but students must be consistent. Always double-check your condition statements.

要用 == 来做相等比较。WJEC 的伪代码中可能用 ← 表示赋值，= 表示比较，但学生必须保持一致。务必反复检查你的条件语句。

6. Misunderstanding Loop Termination Conditions | 误解循环终止条件

A classic pitfall is assuming a WHILE loop will run exactly N times when the condition involves a counter. For example: counter ← 1; WHILE counter < 5 DO ... counter ← counter + 1 will execute 4 times, not 5, because when counter becomes 5 the condition is false. Many off-by-one errors stem from this.

一个经典陷阱是，当循环条件包含计数器时，认为 WHILE 循环恰好运行 N 次。例如：counter ← 1; WHILE counter < 5 DO ... counter ← counter + 1 会执行 4 次，而不是 5 次，因为当 counter 变成 5 时条件为假。很多差一错误就是由此而来。

Trace the values on paper. Check the initial value, the condition boundary and the increment step. For a loop that should run exactly 5 times with counter starting at 1, use counter <= 5 or counter < 6.

在纸上追踪变量值。检查初始值、条件边界和增量步长。如果希望循环恰好执行 5 次且计数器从 1 开始，应使用 counter <= 5 或 counter < 6。

7. Thinking Array Indices Start at 1 | 以为数组索引从 1 开始

In most programming contexts, including pseudocode used in WJEC, array indices begin at 0. A student may declare an array scores[5] and then try to access scores[5], which is actually the sixth element and often out of bounds. The valid indices are 0 to 4.

在大多数编程环境里，包括 WJEC 使用的伪代码，数组索引从 0 开始。学生可能声明一个数组 scores[5]，然后试图访问 scores[5]，这实际上是第六个元素，通常已越界。有效的索引是 0 到 4。

Always remember that an array of size N has positions 0, 1, 2, ..., N-1. When looping through an array, use a counter from 0 to length-1. If the question states indices 1–N, follow the given convention carefully, but default to 0-based indexing unless specified.

始终记住，大小为 N 的数组具有位置 0, 1, 2, ..., N-1。遍历数组时，让计数器从 0 到长度减 1。如果题目指定索引为 1 到 N，则严格按照题目规定，但若无说明，默认以 0 为起始。

8. Confusing Layers and Functions in Network Models | 混淆网络模型的分层与功能

Students often mix up the roles of the TCP/IP layers. For instance, they might say that IP addresses belong to the Application layer or that HTTP operates at the Transport layer. IP addressing and routing sit in the Internet layer, while HTTP is an Application layer protocol. Transport layer handles port numbers and reliable delivery (TCP) or simple delivery (UDP).

学生经常混淆 TCP/IP 各层的角色。例如，他们可能会说 IP 地址属于应用层，或者 HTTP 在传输层工作。IP 寻址和路由位于互联网层，而 HTTP 是应用层协议。传输层负责端口号以及可靠传输 (TCP) 或简单传输 (UDP)。

Create a simple table to memorise:

Layer	Key functions & protocols
Application	HTTP, FTP, SMTP, DNS
Transport	TCP, UDP, port numbers
Internet	IP addressing, routing
Link	MAC addresses, Ethernet frames

做一个简单的表格来帮助记忆：

层级	关键功能与协议
应用层	HTTP, FTP, SMTP, DNS
传输层	TCP, UDP, 端口号
互联网层	IP 寻址, 路由
链路层	MAC 地址, 以太帧

9. Equating Encryption with Hashing | 将加密与哈希等同

A very common misconception is thinking that hashing is a reversible encryption method. Students might state that a hashed password can be decrypted back to the original. In reality, hashing is a one-way function: it produces a fixed-length digest, and it should be computationally infeasible to retrieve the original input. Encryption, by contrast, is two-way and requires a key to decrypt.

一个非常普遍的误解是认为哈希是一种可逆的加密方法。学生可能会声称被哈希的密码可以解密回原文。实际上，哈希是一种单向函数：它产生一个固定长度的摘要，且在计算上应该无法还原出原始输入。与此相对，加密是双向的，需要用密钥来解密。

Think of hashing like a fingerprint: you can generate it from a person, but you cannot reconstruct the person from the fingerprint. Use this analogy to remember that stored passwords are hashed, not encrypted.

可以把哈希想象成指纹：你可以从一个人产生指纹，但无法从指纹重建那个人。用这个类比来记住，存储的密码是经过哈希处理的，而不是加密的。

10. Hardware vs. Software and Interdependence | 硬件与软件的区分及相互依赖

Some students believe a computer can function with only hardware or that software can run without any physical components. Others classify firmware incorrectly as pure software. Firmware is software stored in non-volatile memory, usually on a hardware chip, providing low-level control like BIOS.

一些学生认为计算机仅靠硬件就能工作，或者软件可以在没有任何物理组件的情况下运行。还有人错误地将固件归为纯软件。固件是存储在非易失性存储器中的软件，通常位于硬件芯片上，提供像 BIOS 这样的底层控制。

The CPU fetches, decodes and executes instructions from memory — this is the fundamental hardware-software interaction. Without an operating system, hardware resources cannot be managed. Without hardware, software has nothing to execute on.

CPU 从内存中取指令、解码并执行——这就是基本的硬件与软件交互。没有操作系统，硬件资源无法被管理；没有硬件，软件就没有执行平台。

11. Believing More Bits Always Improves Performance | 认为更多位宽一定提升性能

After learning about 8-bit, 16-bit, 32-bit and 64-bit architectures, many students overgeneralise that a higher bit width automatically means a faster computer. While a 64-bit processor can handle larger data chunks and address more memory, actual speed depends on clock frequency, number of cores, cache size and instruction set efficiency. A 32-bit processor with a higher clock speed can outperform a 64-bit one in certain tasks.

在学习了 8 位、16 位、32 位和 64 位架构后，许多学生过度概括，认为更高的位宽自然意味着计算机更快。虽然 64 位处理器能处理更大的数据块并寻址更多内存，但实际速度还取决于时钟频率、核心数量、缓存大小和指令集效率。一个时钟频率更高的 32 位处理器在某些任务上可以胜过 64 位处理器。

Also, software must be written to take advantage of 64-bit; otherwise, it runs in compatibility mode. Understanding the distinction between data bus width and processing speed is key to avoiding this trap.

此外，软件必须编写成能利用 64 位优势，否则只能在兼容模式下运行。理解数据总线宽度与处理速度之间的区别是避免这个误区的关键。

12. Forgetting that Lossy Compression Discards Data | 忘记有损压缩会丢失数据

Students often answer that a JPEG image can be decompressed to exactly the original Bitmap quality. Lossy compression permanently removes some data to reduce file size; the decompressed file is not identical to the original. This is acceptable for images and audio but disastrous for text or program files where lossless compression (e.g. ZIP, PNG) is required.

学生经常回答说 JPEG 图像可以解压回完全等同于原图品质的位图。有损压缩会永久性地去除一些数据以减小文件大小；解压后的文件与原文件并不相同。这对于图像和音频来说是可以接受的，但对于文本或程序文件，必须使用无损压缩（如 ZIP、PNG）。

Remember the key trade-off: lossy provides smaller file sizes at the cost of quality; lossless preserves exact data. When a question asks for a compression method for executable files, lossless is the only correct choice.

记住关键的权衡：有损压缩以牺牲品质为代价换取更小的文件；无损压缩则保持精确数据。当题目要求为可执行文件选择压缩方法时，只有无损压缩才是正确选项。

---

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

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