📚 Common Misconceptions in Year 10 CIE Computer Science and How to Fix Them | Year 10 CIE 计算机科学常见误区与纠正方法
Many students working towards their CIE IGCSE Computer Science qualification develop certain misunderstandings that can hold them back in exams and practical work. This article identifies ten common misconceptions for Year 10 learners and explains clearly how to correct them. By addressing these errors early, you can build a stronger foundation and tackle topics from data representation to programming with confidence.
许多正在备考 CIE IGCSE 计算机科学的学生会产生一些误解，这些误解可能会在考试和实践中拖后腿。本文针对 Year 10 学生总结了十个常见误区，并清晰地讲解了纠正方法。尽早消除这些错误，能帮助你打牢基础，从容应对从数据表示到程序设计等各个主题。
1. RAM is Permanent Storage | 误区：RAM 是永久存储器
A widespread error is to think that Random Access Memory (RAM) holds data permanently, much like a hard disk or SSD. In reality, RAM is volatile – it loses all its contents the moment the computer is powered off. Its purpose is to provide fast, temporary workspace for the CPU during active tasks.
一个常见的误解是认为随机存取存储器（RAM）会像硬盘或固态硬盘那样永久保存数据。实际上，RAM 是易失性的——计算机关机后，其中的所有内容都会丢失。它的作用是为 CPU 在运行时提供快速、临时的工作空间。
A good way to remember the difference is that secondary storage (HDD, SSD, USB flash drive) keeps data when the power is off, while primary storage (RAM) does not. For the CIE exam, you must be able to state that RAM is volatile memory used to store currently running programs and data being processed.
记住区别的一个好方法是：辅助存储器（硬盘、固态硬盘、U 盘）在断电后仍能保留数据，而主存储器（RAM）则不能。在 CIE 考试中，你必须能够说明 RAM 是易失性内存，用于存储当前正在运行的程序和正在处理的数据。
2. ASCII Can Represent All Characters | 误区：ASCII 能表示所有字符
Students often assume that the ASCII character set is enough for any text. In truth, standard ASCII uses only 7 bits, giving 128 possible characters. This is sufficient for basic English letters, digits, and punctuation, but it cannot represent characters from other languages, mathematical symbols, or emojis.
学生常常认为 ASCII 字符集足以表示任何文本。事实上，标准 ASCII 只用 7 位，共有 128 个可能的字符。这对于基本的英文字母、数字和标点足够了，但无法表示其他语言的字符、数学符号或表情符号。
Unicode was developed to solve this problem, using up to 32 bits per character to encode over a million code points, covering virtually every writing system. For your exam, you need to contrast ASCII and Unicode, pointing out that Unicode uses more bits per character and has a much larger character repertoire.
统一码（Unicode）的诞生正是为了解决这个问题，每个字符最多使用 32 位，编码超过一百万个码点，几乎涵盖所有书写系统。在考试中，你需要对比 ASCII 和 Unicode，指出 Unicode 每个字符使用更多位，且字符集大得多。
3. Higher Clock Speed Always Means Better CPU Performance | 误区：时钟频率越高 CPU 性能一定越好
Many learners believe that a CPU with a higher clock speed will always outperform one with a lower clock speed. Clock speed (measured in GHz) indicates how many cycles per second the processor can execute, but it is only one factor affecting performance.
许多学生认为时钟频率更高的 CPU 一定比频率低的性能好。时钟频率（以 GHz 为单位）表示处理器每秒能执行多少个周期，但这只是影响性能的因素之一。
Other crucial factors include the number of cores, the size of cache memory, and the processor's architecture (e.g., how many instructions it can execute per cycle). A dual‑core CPU at 3 GHz can often outperform a single‑core CPU at 3.5 GHz when running multiple tasks. Moreover, modern processors can do more work per clock cycle thanks to pipelining and superscalar design. In CIE questions, always discuss multiple factors rather than clock speed alone.
其他重要因素还包括核心数量、高速缓存大小以及处理器架构（例如每个周期能执行多少条指令）。一个 3 GHz 的双核 CPU 在执行多任务时，通常比 3.5 GHz 的单核 CPU 表现更好。此外，得益于流水线和超标量设计，现代处理器在每个时钟周期内能做更多工作。在 CIE 试题中，讨论性能时一定要提及多种因素，而不仅仅是时钟频率。
4. An Algorithm’s Efficiency Is Just About Number of Lines of Code | 误区：算法效率只看代码行数
It is tempting to judge an algorithm by how short its source code looks. In computer science, however, efficiency is measured by time complexity (how the running time grows with input size) and space complexity (how memory usage scales).
人们很容易用源代码行数的多少来评判算法。然而在计算机科学中，效率是通过时间复杂度（运行时间随输入规模增长的情况）和空间复杂度（内存使用随规模增长的情况）来衡量的。
For example, a linear search in three lines of code can check an entire array but takes, in the worst case, n steps. A binary search requires a few more lines and a sorted array, but its worst‑case time is only log₂ n steps. The smarter algorithm is not the one with fewer lines, but the one that scales better. CIE expects you to understand and apply linear search and binary search, and to compare their efficiencies using simple reasoning.
例如，用三行代码实现的线性搜索可以遍历整个数组，但最坏情况下需要 n 步。二分查找需要多几行代码且要求数组有序，但最坏情况只需 log₂ n 步。更聪明的算法并不是行数更少的那个，而是扩展性更好的那个。CIE 希望你理解并应用线性搜索和二分查找，并能够用简单的推理解释它们的效率差异。
5. "Off‑by‑one" Errors in Loops | 误区：循环中的“差一错误”
When writing loops, beginners often get the boundary conditions wrong. A typical mistake is using <= when < is needed, or missing the first or last element of an array. These are called off‑by‑one errors.
在编写循环时，初学者经常把边界条件弄错。一个典型的错误是，在应该使用 < 的地方误用了 <=，或者遗漏了数组的第一个或最后一个元素。这些被称为“差一错误”。
Consider a 0‑indexed array of length 10. A correct loop to process every element would use for i = 0 to 9 or for i = 0 while i < 10. Using i <= 10 would try to access the non‑existent element at index 10, causing an error. In pseudocode or trace table questions, always double‑check your start and end conditions, and test with small values (e.g., array size 1 or 2) to verify the logic.
考虑一个长度为10、索引从0开始的数组。要处理每个元素，正确的循环是 for i = 0 to 9 或 for i = 0 while i < 10。如果使用 i <= 10，就会尝试访问索引10处并不存在的元素，从而导致错误。在伪代码或跟踪表题目中，请务必反复检查起始与结束条件，并可以用小规模数据（如长度为1或2的数组）来验证逻辑。
6. Confusing IP and MAC Addresses | 误区：混淆 IP 地址与 MAC 地址
Many students think IP and MAC addresses serve the same purpose, or that one can replace the other. They are fundamentally different. A MAC (Media Access Control) address is a unique hardware identifier assigned to a network interface card (NIC) by the manufacturer. It is used within a local network (LAN) and does not change as a device moves.
很多学生认为 IP 地址和 MAC 地址作用相同，或者可以互相替代。它们本质上是不同的。MAC（介质访问控制）地址是由制造商分配给网卡（NIC）的唯一硬件标识符，在局域网（LAN）内部使用，且不会随设备移动而改变。
An IP (Internet Protocol) address, on the other hand, is a logical address assigned by the network, either manually or via DHCP. It can change when you connect to different networks. IP addresses are used for routing data between networks. To pass CIE network topics, you should be able to compare their characteristics: MAC is 48‑bit, static, and operates at the data link layer, while IP (IPv4) is 32‑bit, dynamic, and operates at the network layer.
另一方面，IP（互联网协议）地址是由网络手动或通过 DHCP 分配的逻辑地址，当你连接到不同网络时可能会改变。IP 地址用于在不同网络之间进行数据路由。要学好 CIE 网络部分，你需要能够对比它们的特性：MAC 是 48 位、静态的，工作在数据链路层；而 IP（IPv4）是 32 位、动态的，工作在网络层。
7. Thinking All Programming Languages are Compiled | 误区：以为所有编程语言都是编译型
A common belief is that every programming language must be translated into machine code by a compiler before it can run. While this is true for languages like C++ or Pascal, many languages (Python, JavaScript) are interpreted instead. An interpreter reads and executes the source code line by line, without producing a standalone executable file.
一种常见的观念是，每种编程语言在运行前都必须由编译器翻译成机器码。对于 C++ 或 Pascal 这样的语言来说确实如此，但许多语言（Python、JavaScript）采用的却是解释执行。解释器逐行读取并执行源代码，不会生成独立的可执行文件。
CIE expects you to differentiate between a compiler and an interpreter. Key points: a compiler translates the entire program and produces an executable file that can run without the compiler; an interpreter translates and executes one line at a time, requiring the interpreter to be present each time the program runs. Discuss the advantages—compiled code runs faster, interpreted code is easier to debug and more portable.
CIE 要求你区分编译器与解释器。要点包括：编译器会翻译整个程序，并生成一个无需编译器即可运行的可执行文件；解释器则逐行翻译并执行，每次运行程序都需要解释器在场。还需讨论其优势——编译后的代码运行更快，而解释执行的代码更易于调试且更具可移植性。
8. Misreading Logic Gate Symbols and Truth Tables | 误区：误读逻辑门符号与真值表
Logic gates are a core part of the CIE Computer Science syllabus, but students often mix up the symbols and truth tables for AND, OR, NOT, NAND, and NOR gates. For example, they might forget that an AND gate output is 1 only when all inputs are 1, or that a NAND gate is simply an AND followed by a NOT.
逻辑门是 CIE 计算机科学大纲的核心部分，但学生常常混淆 AND、OR、NOT、NAND 和 NOR 门的符号与真值表。例如，他们可能会忘记 AND 门仅在所有输入均为 1 时输出才为 1，或者 NAND 门其实就是 AND 门后面接一个 NOT。
To avoid mistakes, always draw the truth table and verify it against the gate symbol. Here is a quick comparison:
| Gate | Symbol (shape) | Truth Table Summary |
|---|---|---|
| AND | D-shaped with flat left | Output 1 if A=1 AND B=1 |
| OR | Curved left, pointed right | Output 1 if A=1 OR B=1 |
| NOT | Triangle with small circle | Output opposite of input |
| NAND | AND gate + small circle | Inverted AND output |
| NOR | OR gate + small circle | Inverted OR output |
避免错误的最佳方法是先画出真值表，再对照门符号进行核对。上表是一个快速参考。多做逻辑电路和布尔表达式的练习，直到你能够快速准确地识别各个门。
9. Binary Subtraction: Incorrect Borrows | 误区：二进制减法借位错误
When students perform binary subtraction by hand, they often forget that borrowing from a column brings “2” (in decimal terms) to the next right column, or they mishandle cases where multiple consecutive borrows are needed. A classic mistake is treating binary subtraction exactly like decimal subtraction without considering that each place value is a power of two.
学生在手算二进制减法时，常常忘记从一列借位会给右列带来“2”（十进制意义），或者处理不好连续借位的情况。一个典型的错误是，完全像十进制减法那样进行二进制减法，却没有考虑到每个数位的权重是 2 的幂。
To subtract 0011 (3) from 1000 (8) in binary, many learners incorrectly write 0111 thinking they borrow once. The correct method shows that you must borrow across multiple columns, ultimately turning 1000 into 0112 (where the final 2 represents binary 10 in that column), and then subtract to get 0101 (5). Always work column by column from right to left, and remember that a borrowed 1 from the left column adds 2 to the current column. Practise with varied examples and verify your answers by converting to decimal.
要在二进制中将 0011 (3) 从 1000 (8) 中减去，许多学生错误地写下 0111，以为只借了一次位。正确的方法需要跨多列借位，最终将 1000 变为 0112（其中最后的 2 表示该列的二进制 10），然后相减得到 0101 (5)。始终从右往左逐列计算，并记住从左列借来的 1 会给当前列增加 2。多做不同的练习，并通过转换为十进制来验证答案。
10. Assuming Higher‑level Languages Are Always Slower to Execute | 误区：假设高级语言执行一定更慢
It’s a common generalization: “code written in a high‑level language (HLL) like Python runs slower than equivalent code in a low‑level language like assembly.” While compiled HLL programs can be less efficient than hand‑optimised assembly, modern compilers produce highly optimised machine code that often matches or even exceeds the performance of handwritten assembly for complex tasks.
一个常见的概括是：“用 Python 这样的高级语言（HLL）编写的代码，执行起来一定比汇编等低级语言的等价代码慢。” 虽然编译型高级语言程序的效率可能不如手工优化的汇编代码，但现代编译器能够生成高度优化的机器码，在复杂任务上其性能常常可以匹敌甚至超过手写汇编。
Additionally, the speed of development, readability, and portability offered by HLLs often far outweigh any minor runtime performance differences. The CIE syllabus expects you to compare high‑ and low‑level languages, mentioning that low‑level languages give direct control over hardware and are used for embedded systems, while HLLs are easier for programmers and are used for most applications. Don’t simply claim HLLs are “slower”; instead, explain that the performance depends on the compiler and the nature of the task.
而且，高级语言带来的开发速度、可读性和可移植性往往远超微小的运行性能差异。CIE 大纲要求你对比高级语言与低级语言，提及低级语言能直接控制硬件，用于嵌入式系统，而高级语言对程序员更友好，用于大多数应用。不要简单地说高级语言“更慢”；而应说明，性能取决于编译器及任务的性质。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图