📚 Common Misconceptions in Year 11 CAIE Computer Science and How to Fix Them | CAIE 计算机 Year 11 常见误区与纠正方法
Many Year 11 students preparing for the CAIE Computer Science exam fall into the same traps—mistaking a half‑remembered definition for full understanding, or applying a rule where it does not belong. This article collects the most frequent misconceptions across the syllabus and explains, side by side in English and Chinese, exactly why they are wrong and how to correct them. The goal is to replace guesswork with clear, exam‑ready reasoning.
许多准备 CAIE 计算机科学考试的学生都会陷入同样的陷阱——把一知半解的定义当成透彻理解，或者在不适用的情况下生搬硬套规则。本文汇集了考纲中最常见的误区，并用中英对照的方式逐一说明错在哪里以及如何纠正，目的是用清晰且适合考试的推理取代猜测。
1. Binary Addition and Overflow | 二进制加法与溢出误区
A surprisingly common mistake is to treat binary addition exactly like decimal addition and ignore the concept of overflow. Students often add 1 + 1 and write '2', or forget that the result must stay within the fixed number of bits. In an 8‑bit system, for example, 11111111 + 00000001 does not produce 100000000 as a 9‑bit answer but causes an overflow error, because the extra 1 cannot be stored.
一个常见错误是把二进制加法完全当作十进制加法，并忽略溢出的概念。学生经常把 1 + 1 写成 '2'，或者忘记结果必须保留在固定位数内。例如，在 8 位系统中，11111111 + 00000001 并不会产生 9 位结果 100000000，而是导致溢出错误，因为额外的那一位无法存储。
Correction: Always work within the given bit width. The correct sum of two 8‑bit numbers is only the lowest 8 bits. Overflow is flagged when there is a carry into the bit position that does not exist—i.e. a carry out of the most significant bit.
纠正：始终在给定的位宽内运算。两个 8 位二进制数相加的正确结果只取最低的 8 位。当存在向不存在的位产生的进位——即最高位有进位输出时，就标记为溢出。
Example:
8‑ = 1 00001111 (9 bits). The extra 1 indicates overflow, and the stored result is 00001111.
示例：8 位：10101010 + 01100101 = 1 00001111（9 位）。多余的 1 表示溢出，存储的结果是 00001111。
2. Logic Gates and Truth Tables | 逻辑门与真值表误区
Many learners confuse the AND and OR truth tables or assume that NAND is simply a NOT gate placed after an OR gate. Another frequent error is constructing truth tables with the wrong number of rows. With n inputs, a complete truth table must have 2ⁿ rows—students often stop at n+1 or mix up the order of inputs.
许多学生混淆 AND 和 OR 的真值表，或者误以为 NAND 只是在 OR 门后面加一个 NOT。另一个常见错误是真值表的行数不对。有 n 个输入时，完整的真值表必须有 2ⁿ 行——学生常停在 n+1 行，或搞错输入值的排列顺序。
Correction: Memorise the core truth tables precisely, and understand that NAND is the opposite of AND (output 0 only when all inputs are 1), while NOR is the opposite of OR (output 1 only when all inputs are 0). Always list input combinations in binary counting order (e.g. 00, 01, 10, 11) to avoid missing any combination.
纠正：精确记忆核心真值表，并理解 NAND 是 AND 的取反（仅当所有输入为 1 时输出为 0），而 NOR 是 OR 的取反（仅当所有输入为 0 时输出为 1）。始终按二进制计数顺序列出输入组合（如 00、01、10、11），避免遗漏。
For a 3‑input AND gate, the output is 1 only for input 111; for a 3‑input OR gate, the output is 0 only for input 000.
对 3 输入与门，仅输入 111 时输出 1；对 3 输入或门，仅输入 000 时输出 0。
3. Pseudocode and Trace Tables | 伪代码与跟踪表误区
A frequent exam pitfall is ignoring the precise order of operations in pseudocode assignments and loops. Students often write a trace table that shows an updated variable value before the line has actually executed, or they forget that a loop condition is checked at the start (or end) of each iteration. This leads to off‑by‑one errors in output.
考试中一个常见陷阱是忽略伪代码中赋值和循环的精确执行顺序。学生编写的跟踪表常在语句实际执行之前就显示了更新后的变量值，或者忘记循环条件是在每次迭代开始时（或结束时）检查的。这会导致输出出现“差一错误”。
Correction: Build the trace table line by line, exactly as the computer would execute it. Record the value of a variable only after the assignment statement has run. When handling WHILE loops, test the condition before entering the loop body; for REPEAT…UNTIL, test at the end. Double‑check the number of iterations by running a small example mentally.
纠正：一行一行地构建跟踪表，完全按照计算机的执行顺序。只有在赋值语句运行之后才记录变量的值。处理 WHILE 循环时，先测试条件再进入循环体；REPEAT…UNTIL 则在末尾测试。通过心算一个小例子，仔细核对迭代次数。
For example: count ← 0
WHILE count < 3
OUTPUT count
count ← count + 1
ENDWHILE
The trace table must show count = 0 before the loop, and OUTPUT values 0, 1, 2 (not 3).
例如：count ← 0
WHILE count < 3
OUTPUT count
count ← count + 1
ENDWHILE
跟踪表必须在循环前显示 count = 0，且输出的值为 0、1、2（而不是 3）。
4. Data Transmission and Parity | 数据传输与奇偶校验误区
Students often treat parity as a method that can correct errors, rather than just detect an odd number of bit flips. They also forget to specify whether even or odd parity is being used, or they place the parity bit in the middle of the byte instead of the agreed position (usually the most significant bit or an extra bit).
学生常把奇偶校验误认为是一种能纠正错误的方法，而实际上它只能检测出奇数个比特翻转。他们还会忘记标明用的是偶校验还是奇校验，或者把校验位放在字节中间，而不是约定的位置（通常是最高位或额外的位）。
Correction: Parity checks only detect errors; they do not correct them. Even parity means the total number of 1s (including the parity bit) must be even. Odd parity requires an odd total. The sender and receiver must agree on both the type and position of the parity bit. If two bits flip, the parity may pass unnoticed—this is a key limitation.
纠正：奇偶校验只能检错，不能纠错。偶校验意味着 1 的总数（含校验位）必须为偶数，奇校验则要求总数为奇数。发送方和接收方必须事先约定校验位的类型和位置。如果翻转了两位，校验可能仍然通过——这是一个关键的局限性。
A 7‑bit ASCII character 'A' (1000001) with even parity needs a parity bit 1 to make the total number of 1s even (two 1s). The transmitted byte becomes 11000001 if the parity bit is placed at the MSB position.
7 位 ASCII 字符 'A'（1000001）若采用偶校验，需要校验位 1 使得 1 的总数为偶数（两个 1）。如果把校验位放在最高位，传输的字节就是 11000001。
5. Memory and Storage Units | 内存与存储单位误区
A classic misunderstanding is the distinction between RAM, ROM and secondary storage. Students frequently claim that RAM permanently stores data, or that ROM is used when the computer is switched off. Additionally, many struggle with the unit conversions: seeing 'mebibyte' (MiB) and 'megabyte' (MB) as identical, or confusing a kibibyte (1024 bytes) with a kilobyte (often treated as 1000 bytes in storage contexts).
一个经典误区是搞不清 RAM、ROM 和辅助存储器的区别。学生常说 RAM 可以永久存储数据，或者 ROM 用于计算机关机时。此外，很多人单位换算不清楚：把“兆比字节”（MiB）和“兆字节”（MB）看作一样，或混淆 kibibyte（1024 字节）和 kilobyte（存储语境下常视为 1000 字节）。
e (loses data when power is off) and holds currently running programs and data. ROM is non‑volatile and stores the boot‑ rs, stick to the syllabus: 1 KiB = 1024 bytes, 1 MiB = 1024 KiB, 1 GiB = 1024 MiB; but for storage media capacities, 1 GB is often defined as 10⁹ bytes (1000 MB). Always read the question carefully.
纠正：RAM 是易失性的（断电丢失数据），存放当前运行的程序和数据。ROM 是非易失性的，永久存储启动程序（固件）。辅助存储器（硬盘、固态硬盘）断电后也能保留数据，但 CPU 不能直接访问。考试答题时，按照考纲：1 KiB = 1024 字节，1 MiB = 1024 KiB，1 GiB = 1024 MiB；但涉及存储介质容量时，1 GB 常定义为 10⁹ 字节（1000 MB）。务必仔细审题。
A simple comparison table can help:
- RAM: volatile, read/write, holds running programs.
- ROM: non‑volatile, read‑only (mostly), holds bootstrap.
- Secondary storage: non‑volatile, large capacity, slower.
简单对比表有助记忆：
- RAM：易失性，可读可写，存放正在运行的程序。
- ROM：非易失性，只读（大多情况），存放引导程序。
- 辅助存储器：非易失性，容量大，速度慢。
6. High‑Level vs Low‑Level Languages | 高级语言与低级语言误区
Many students think that a compiler and an interpreter do the same thing at the same time, or that assembly language is the same as machine code. Another error is describing a high‑level language as 'easier for the computer to understand'—in reality, it is easier for the human, and must be translated into machine code for the computer.
许多学生认为编译器和解释器同时做同样的事，或者认为汇编语言和机器码是一回事。另一个错误是把高级语言描述为“计算机更容易理解”——实际上它是让人更容易理解，必须翻译成机器码后计算机才能执行。
Correction: A compiler translates the entire source code into machine code before execution, producing a standalone executable file (object code). An interpreter translates and executes line by line, without generating a separate executable. Assembly language uses mnemonics (e.g. MOV, ADD) that map one‑to‑one to machine instructions, but it still requires an assembler to convert to machine code. High‑level languages must be translated (compiled or interpreted) because the CPU only understands machine code.
纠正：编译器在执行前将全部源代码翻译成机器码，生成独立的可执行文件（目标代码）。解释器则逐行翻译并执行，不生成单独的可执行文件。汇编语言使用助记符（如 MOV、ADD），与机器指令一一对应，但仍需汇编器转换为机器码。高级语言必须经过翻译（编译或解释），因为 CPU 只懂机器码。
e exam, remember: compiler = whole program at once, interpreter = line by line. Also, high‑ table (can run on different machines with the right translator); machine code is processor‑specific.
在考试中为了避免混淆，记住：编译器 = 一次性处理整个程序，解释器 = 逐行处理。另外，高级语言具有可移植性（配合适当的翻译器可在不同机器上运行）；机器码则是特定于处理器的。
7. Cybersecurity Threats | 网络安全威胁误区
Students often blur the lines between malware types, for example confusing a virus with a worm, or calling a Trojan a virus. Phishing, pharming and social engineering are frequently lumped together without recognising the distinct techniques. This loses easy marks in definitions and comparisons.
学生经常模糊恶意软件类型之间的界限，比如混淆病毒和蠕虫，或者把特洛伊木马称为病毒。网络钓鱼、域名欺诈和社会工程也常被混为一谈，没有意识到它们不同的技术手段。这在定义和比较题中很容易丢分。
Correction: Use precise definitions. A virus attaches itself to a host file and requires human action to spread. A worm self‑replicates across networks without needing a host file. A Trojan disguises itself as legitimate software but carries a hidden malicious payload. Phishing uses deceptive emails/messages to trick users into revealing data; pharming redirects a legitimate website's traffic to a fake site; social engineering is the broader manipulation of people to break security procedures.
纠正：使用精确的定义。病毒附着在宿主文件上，需要人为操作才能传播。蠕虫无需宿主文件，可自行在网络中复制。特洛伊木马伪装成合法软件，但携带隐藏的恶意负载。网络钓鱼使用欺骗性的邮件/消息诱骗用户泄露数据；域名欺诈将合法网站的流量重定向到假冒网站；社会工程则是更广泛地通过操纵人来打破安全程序的攻击手段。
A quick reference table:
- Virus: needs host file, user action
- Worm: self‑replicating, network‑based
- Trojan: masquerades, no self‑replication
- Phishing: fake communications
- Pharming: fake websites/dns poisoning
快速对照表：
- 病毒：需要宿主文件，用户操作
- 蠕虫：自我复制，基于网络
- 木马：伪装，不自我复制
- 钓鱼：伪造通信
- 域名欺诈：假冒网站/DNS 投毒
8. Sorting Algorithms Efficiency | 排序算法效率误区
Misunderstanding how bubble sort and insertion sort actually work is surprisingly common. Students often say bubble sort compares adjacent items and swaps if they are in the wrong order—which is correct—but then claim it continues to the end of the array only once. In reality, bubble sort repeats passes until no swaps are needed. Many also think insertion sort is always faster than bubble sort, without referencing the nature of the data.
对冒泡排序和插入排序实际工作原理的误解非常普遍。学生常说冒泡排序比较相邻项，如果顺序错误就交换——这没错——但接着声称它只遍历数组一次。实际上，冒泡排序会重复执行多趟，直到没有交换发生。许多人还认为插入排序总是比冒泡排序快，而不考虑数据的性质。
Correction: Bubble sort makes multiple passes through the array. After each pass, the largest unsorted element 'bubbles' to its correct position at the end. The algorithm terminates when a complete pass makes no swaps. Insertion sort builds the sorted list one item at a time, taking each element and inserting it into its correct position within the already sorted part. For small or nearly sorted data, insertion sort is often more efficient, but for large random data, both are O(n²).
纠正：冒泡排序会对数组进行多趟遍历。每趟结束后，最大的未排序元素“冒泡”到末尾的正确位置。当某一趟遍历没有发生任何交换时，算法终止。插入排序则一次一个元素地构建有序列表，把每个元素插入已排序部分的正确位置。对于小规模或接近有序的数据，插入排序通常更高效，但对于大规模随机数据，两者均为 O(n²)。
Use a trace table or a step‑by‑step diagram in the exam to prove you understand the passes, not just the final sorted result.
在考试中，使用跟踪表或逐步图示来证明你理解多趟过程，而不只是最终的排序结果。
9. IP and MAC Addresses | IP与MAC地址误区
Many learners confuse the roles of IP and MAC addresses, or describe them as both being permanently assigned to a device. Another mistake is stating that an IP address is used to identify a device on a local network, while a MAC is used globally—which is the exact reverse of the truth.
很多学生混淆了 IP 地址和 MAC 地址的作用，或者将它们都描述为永久分配给设备的地址。另一个错误是声称 IP 地址用于在本地网络中标识设备，而 MAC 地址用于全球范围——这恰好与事实相反。
Correction: An IP address (e.g. 192.168.1.24) is a logical address that can change (dynamic) and is used to route data across networks (including the internet). A MAC address (e.g. 00:1A:2B:3C:4D:5E) is a physical address burnt into the NIC by the manufacturer; it is used within the same local network segment to identify devices and does not normally change. On the internet, packets are routed by IP addresses; within a LAN, frames use MAC addresses.
纠正：IP 地址（如 192.168.1.24）是逻辑地址，可以更改（动态），用于跨网络（包括互联网）路由数据。MAC 地址（如 00:1A:2B:3C:4D:5E）是制造商烧录在网卡中的物理地址；它用于同一本地网络段内标识设备，通常不会改变。在互联网上，数据包按 IP 地址路由；在局域网内，数据帧使用 MAC 地址。
Think of it this way: an IP address is like your postal address (could change if you move), while a MAC address is like your fingerprint (unique and permanent to the hardware).
可以这样理解：IP 地址好比你的邮寄地址（搬家可能会变），而 MAC 地址好比你的指纹（对硬件而言唯一且永久）。
10. Database Normalisation | 数据库规范化误区
A common misconception is that normalisation always makes a database faster and simpler. Students also often confuse 1NF, 2NF and 3NF, thinking that just removing repeated groups achieves 3NF. Some even believe that a primary key alone solves all redundancy issues.
一个常见误区是认为规范化总是让数据库更快、更简单。学生还常混淆 1NF、2NF 和 3NF，以为只要去除重复组就能达到 3NF。有些人甚至相信单靠主键就能解决所有冗余问题。
Correction: Normalisation reduces data redundancy and prevents update anomalies. 1NF requires atomic values, no repeating groups, and a primary key. 2NF requires 1NF plus all non‑key attributes must be fully functionally dependent on the whole primary key (no partial dependencies). 3NF requires 2NF plus no transitive dependencies (non‑key attributes should not depend on other non‑key attributes). While normalisation improves data integrity, it can lead to more complex queries with many JOINs, and sometimes denormalisation is used for performance.
纠正：规范化减少数据冗余并防止更新异常。1NF 要求原子值、无重复组，并有主键。2NF 在 1NF 基础上，要求所有非键属性必须完全函数依赖于整个主键（无部分依赖）。3NF 在 2NF 基础上，要求无传递依赖（非键属性不应依赖于其他非键属性）。虽然规范化能提高数据完整性，但可能导致需要大量 JOIN 的更复杂查询，有时为了性能会进行反规范化。
When answering exam questions, always check first for repeating groups (to decide 1NF), then look for partial dependencies (if the primary key is composite), then check for transitive dependencies. These sequential checks help you give a precise normalisation level.
在回答考试问题的时候，总是先检查是否有重复组（判断 1NF），然后查找部分依赖（当主键为复合键时），再检查传递依赖。这样按顺序检查有助于你给出精确的规范化级别。
Published by TutorHao | CAIE Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图