📚 Common Misconceptions and Corrections in Year 11 WJEC Computer Science | Year 11 WJEC 计算机常见误区与纠正方法
Many students lose marks not because they lack understanding, but because of small, persistent misconceptions that lead to avoidable errors. This article highlights ten of the most common misunderstandings in the Year 11 WJEC Computer Science course, and explains exactly how to correct them. By reading each misconception and its correction carefully, you can build a stronger, more accurate foundation for your exams.
很多学生丢分并不是因为完全不懂，而是因为一些顽固的小误解导致了本可避免的错误。本文整理了 Year 11 WJEC 计算机课程中最常见的十个误区，并逐一讲解正确的理解方法。请认真阅读每一个误区及其纠正，帮助你为考试打下更扎实、更准确的基础。
1. Binary and Hexadecimal Conversions | 二进制与十六进制转换
A widespread mistake is grouping bits from left to right when converting binary to hexadecimal. Learners often take a binary number like 101011 and group it as 1010 (A) and 11 (3) to give A3₁₆, but this only works if the binary string length is a multiple of four. The correct method is to group bits starting from the right, adding leading zeros if necessary. For 101011, we group from the right: 1010 followed by 1011? No, from right: last four bits 1011, then remaining 10 becomes 0010. So it is 0010 1011, giving 2B₁₆.
一个常见错误是在二进制转十六进制时从左向右分组。学生常将二进制数 101011 分组为 1010 (A) 和 11 (3)，得到 A3₁₆，但这仅在二进制串长度是 4 的倍数时才正确。正确的方法是从右向左分组，必要时在左边补零。对于 101011，从右分组：低四位 1011，剩余 10 补零为 0010，即 0010 1011，结果为 2B₁₆。
Another frequent error is treating hexadecimal digits above 9 as decimal values – for example interpreting the digit 'B' as 11 in decimal, but then writing the hex value as 11₁₆ instead of B, or mixing up case and thinking 'b' is different from 'B'. In WJEC answers, uppercase letters A–F must be used, and the hex value represents the actual digit, not its decimal equivalent in the conversion process.
另一个误区是将超过 9 的十六进制数当作十进制处理——例如把数字 'B' 理解为十进制 11，但却将十六进制写成 11₁₆ 而不是 B，或者混淆大小写，认为 'b' 与 'B' 不同。在 WJEC 答案中，必须使用大写字母 A–F，且十六进制数值本身代表该数位，转换时不能直接写十进制的数字。
2. Logic Gates and Truth Tables | 逻辑门与真值表
Students frequently confuse the OR gate with the XOR gate, assuming that OR means 'only one or the other' as in everyday English. In Boolean logic, OR outputs 1 when at least one input is 1, including when both are 1. XOR (exclusive OR), however, outputs 1 only if exactly one input is 1. This distinction is crucial when interpreting logic circuits or completing truth tables for a combination of gates.
学生常常把 OR 门与 XOR 门混淆，以为 OR 就像日常英语中表示“非此即彼”。在布尔逻辑中，OR 只要至少有一个输入为 1 时输出就为 1，两个都为 1 时输出也是 1。而 XOR（异或）仅在恰好一个输入为 1 时输出 1。在分析逻辑电路或填写组合门真值表时，这种区分至关重要。
Another common error involves constructing truth tables for NAND and NOR gates: students often write the opposite of AND/OR then invert the entire output incorrectly. For example, they may take the AND table and simply flip every output, but they forget to add an intermediate column for the AND result before applying NOT. The reliable approach is to build the truth table column by column: first AND/OR, then apply NOT to obtain NAND/NOR.
另一个常见错误出现在 NAND 和 NOR 真值表的构建上：学生经常先写出 AND/OR 的结果，然后错误地反转整个输出。例如，他们可能直接取 AND 表并把所有输出翻转，却忘记添加一个表示 AND 结果的中间列，再对其取反。可靠的方法是逐列构建真值表：先得 AND/OR 输出，再对该列应用 NOT 得到 NAND/NOR。
3. Assignment vs Equality in Programming | 编程中的赋值与比较
ers is using a single equals sign (=) for both assignment and equality testing. In Python, '=' assigns a value to a variable, while '==' checks whether two values are equal. Writing if x = 5: instead of if x == 5: causes a syntax error, but many learners do not understand why. They must internalise that assignment is not the same as comparison.
对初学者最具杀伤力的误区之一，就是把单等号 (=) 既用于赋值又用于比较。在 Python 中，'=' 用于给变量赋值，而 '==' 用于检查两个值是否相等。写出 if x = 5: 而不是 if x == 5: 会导致语法错误，但很多学生不明白原因。必须牢记赋值与比较不是一回事。
Related to this, students often misinterpret the meaning of a variable update like x = x + 1, thinking algebraically that 'x cannot equal x plus 1'. In programming, this is an instruction: take the current value of x, add 1, and store the result back into x. It is vital to understand that the expression on the right is evaluated first, then assigned to the variable on the left.
与之相关的是，学生常错误地将 x = x + 1 理解为代数上的恒等式，认为“x 不可能等于 x 加 1”。在编程中，这是一条指令：取出 x 的当前值，加 1，再把结果存回 x。必须理解右侧表达式先求值，再赋给左侧的变量。
4. Array Indexing and Off-by-One Errors | 数组索引与差一错误
In many programming languages, including Python, arrays and lists are zero-indexed, meaning the first element is at position 0. Students consistently assume the first element is at index 1, leading to off-by-one errors when looping through a list or accessing specific positions. For a list items = ['a', 'b', 'c'], items[1] returns 'b', not 'a'. This must become automatic.
在包括 Python 在内的许多编程语言中，数组和列表的索引从 0 开始，即第一个元素的位置是 0。学生总是假设第一个元素的索引为 1，导致在遍历列表或访问特定位置时出现差一错误。对于列表 items = ['a', 'b', 'c']，items[1] 返回的是 'b' 而不是 'a'。这一点必须形成条件反射。
When working with loops, the typical error is to write for i in range(len(items)): and then use items[i+1] without ensuring the index stays within bounds, or by setting a loop condition as i <= len(items) instead of i < len(items), causing an IndexError. The total number of elements is len(), but the maximum index is len()-1.
在使用循环时，典型错误是写出 for i in range(len(items)): 然后使用 items[i+1] 而没有确保索引不越界，或者将循环条件设为 i <= len(items) 而非 i < len(items)，导致 IndexError。元素总数是 len()，但最大索引是 len()-1。
5. IP and MAC Addresses | IP 与 MAC 地址
A very common confusion is thinking that a MAC address can be used to route data across the internet, or that an IP address is permanently tied to a device. In reality, MAC addresses are hardware identifiers that operate within a local network segment, while IP addresses are logical addresses used for routing between networks. A MAC address is fixed to the NIC (Network Interface Card), but an IP address can change as the device moves to different networks.
一个非常普遍的混淆是认为 MAC 地址可用于在互联网中路由数据，或者认为 IP 地址永久绑定在一台设备上。实际上，MAC 地址是硬件标识符，仅在本地网络段内运作，而 IP 地址是用于网络间路由的逻辑地址。MAC 地址固定于网络接口卡 (NIC)，但 IP 地址会随设备接入不同网络而改变。
Another mistake is assuming that IPv4 and IPv6 are just different formats of MAC addresses. IPv4 addresses (e.g. 192.168.1.1) and IPv6 addresses (e.g. 2001:0db8::1) are both types of IP addresses, not MAC addresses. MAC addresses are typically written as six pairs of hexadecimal digits separated by colons or hyphens (e.g. 00:1A:2B:3C:4D:5E). Understanding the difference is essential for networking questions.
另一个错误是认为 IPv4 和 IPv6 只是 MAC 地址的不同格式。IPv4 地址（如 192.168.1.1）和 IPv6 地址（如 2001:0db8::1）都是 IP 地址，而非 MAC 地址。MAC 地址通常写作六组十六进制数字，由冒号或连字符分隔（如 00:1A:2B:3C:4D:5E）。理解这些区别对网络相关题目至关重要。
6. Two's Complement Representation | 二进制补码表示
t of the magnitude or by flipping all bits without adding one. This leads to incorrect two' inary, invert all bits, then add 1 to the least significant bit. For example, to represent –5: +5 is 00000101; invert → 11111010; add 1 → 11111011.
许多学生尝试用二进制表示负数时，只是简单地在绝对值前加个负号，或者将所有位取反但不加 1。这会导致错误的补码值。对于 8 位有符号整数，正确的方法是：写出正数的二进制，将所有位取反，然后在最低有效位加 1。例如，表示 –5：+5 是 00000101；取反 → 11111010；加 1 → 11111011。
Another misconception is that the leftmost bit in two's complement is merely a sign bit that is separate from the magnitude. In reality, the most significant bit has a negative place value: in an 8-bit system, it represents –128 rather than +128. This means 10000000 is –128, not –0, and the range of an 8-bit signed integer is –128 to +127. Treating the MSB as just a sign flag leads to incorrect calculations of value range and overflow.
另一个误解是认为补码中最左边的位仅仅是一个与数值无关的符号位。实际上，最高有效位具有负权重：在 8 位系统中，它代表 –128 而不是 +128。这意味着 10000000 是 –128，不是 –0，并且 8 位有符号整数的范围为 –128 到 +127。仅将最高位当作符号标志会导致数值范围和溢出的错误计算。
7. Sorting and Searching Algorithms | 排序与搜索算法
Students often believe that a binary search can be applied to any list, regardless of whether it is sorted. Binary search requires the data to be sorted beforehand; otherwise, the algorithm cannot determine which half to discard and may report incorrect results. Linear search, by contrast, works on unsorted data because it checks each element sequentially.
学生常常认为二分搜索可以用于任何列表，无论是否已排序。二分搜索要求数据预先排序；否则算法无法确定丢弃哪一半，可能得出错误结果。而线性搜索则适用于未排序数据，因为它按顺序检查每个元素。
For sorting algorithms, a typical misconception is that bubble sort always makes one complete pass through the list and then finishes. In reality, bubble sort may require multiple passes, continuing until a complete pass occurs with no swaps. Students often miscount the number of passes or the maximum number of passes needed (n–1 for n items in the worst case). Understanding the termination condition is key to tracing algorithms accurately.
对于排序算法，一个典型误区是认为冒泡排序只需完整遍历一次列表就能完成。实际上，冒泡排序可能需要多次遍历，直到某次遍历没有发生任何交换为止。学生经常数错遍历次数，或弄错最坏情况下所需的最大遍历次数（n 个元素最多需要 n–1 次遍历）。理解终止条件对准确追踪算法执行过程至关重要。
8. Encryption vs Hashing | 加密与哈希
A dangerous misconception is that hashing is a form of encryption that can be reversed. Hashing is a one-way function that produces a fixed-size digest from input data, and it cannot be decrypted back to the original. Encryption, on the other hand, is reversible with the correct key. Students often describe storing hashed passwords as 'encrypted passwords', but without understanding the irreversible nature of hashing.
一个危险的误区是认为哈希是一种可以逆转的加密形式。哈希是一个单向函数，从输入数据生成固定长度的摘要，无法解密回原始数据。而加密则可以通过正确的密钥进行逆转。学生常将保存哈希密码描述为“加密密码”，却没有理解哈希的不可逆性。
In exam questions about secure data storage, many learners suggest encrypting passwords for verification, but the correct practice is to store a salted hash of the password. When a user logs in, the entered password is hashed and compared with the stored hash. If encryption were used, a stolen key would expose all passwords, whereas hashing provides better security if done properly.
在关于安全存储的考题中，许多考生建议对密码加密来进行验证，但正确做法是存储加盐后的哈希值。用户登录时，对输入的密码进行哈希运算并与存储的哈希值比较。如果使用加密，密钥一旦泄露将暴露所有密码，而正确实施哈希能提供更好的安全性。
9. RAM and ROM | 随机存储器与只读存储器
It is common to hear that 'RAM is where programs are stored permanently' or 'ROM is used to store the user's files'. In fact, RAM (Random Access Memory) is volatile – it loses all data when power is turned off – and is used to hold the operating system, application programs, and data currently in use. ROM (Read Only Memory) is non‑volatile and typically stores firmware or the BIOS, which is needed to boot the computer.
常听到“RAM 是永久存储程序的地方”或“ROM 用于存放用户文件”之类的说法。事实上，RAM（随机存储器）是易失性的——断电后所有数据都会丢失——它用于存放当前正在运行的操作系统、应用程序和数据。ROM（只读存储器）是非易失性的，通常存储固件或 BIOS，这些都是启动计算机所需的程序。
Another myth is that ROM cannot be written to under any circumstances. While traditional ROM is read-only, modern variants like EEPROM and flash memory can be rewritten, albeit more slowly and for specific purposes like firmware updates. For WJEC, it is safe to describe ROM as non-volatile memory that retains its contents permanently and is generally not changed during normal operation.
另一个误解是 ROM 在任何情况下都无法写入。虽然传统的 ROM 是只读的，但现代变体如 EEPROM 和闪存可以重写，尽管速度较慢，且用于特定目的（如固件更新）。针对 WJEC，可以将 ROM 描述为非易失性存储器，内容永久保留，且在正常操作期间通常不会被修改。
10. Primary and Foreign Keys in Databases | 数据库中的主键与外键
Many students confuse primary keys with foreign keys, thinking a foreign key is simply another candidate for primary key. A primary key uniquely identifies each record in a table. A foreign key is a field in one table that refers to the primary key in another table, creating a link between them. This distinction is fundamental to understanding relational databases and SQL queries involving joins.
许多学生将主键和外键混淆，认为外键就是另一个可以作为主键的字段。主键唯一标识表中每条记录。外键是某张表中的一个字段，它引用另一张表的主键，从而建立表之间的联系。这一区别是理解关系数据库和涉及联结的 SQL 查询的基础。
A common error when writing SQL is to forget that primary key values must be unique and not null. Students often attempt to insert a duplicate primary key value or leave it empty, causing errors. Additionally, they may not realise that referential integrity ensures that a foreign key value must match an existing primary key in the referenced table, or be null. These constraints must be respected to maintain a valid database.
编写 SQL 时，一个常见错误是忘记主键值必须唯一且不为空。学生经常试图插入重复的主键值或将其留空，从而导致错误。此外，他们可能没有意识到参照完整性要求外键值必须与引用表中存在的主键值匹配，或者为空。必须遵守这些约束条件才能维持数据库的有效性。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图