📚 Common Misconceptions in Year 10 Cambridge Computer Science and How to Fix Them | 剑桥10年级计算机常见误区与纠正方法
Starting IGCSE Computer Science can feel like learning a new language — and just like any language, it is easy to misunderstand key ideas early on. Students often memorise facts without fully grasping the underlying concepts, which leads to repeated mistakes in exams. This article identifies the most common traps Year 10 students fall into when studying the Cambridge syllabus, explains the correct way to think about each topic, and gives simple strategies to avoid losing marks.
开始学习 IGCSE 计算机科学就像学习一门新语言——和任何语言一样，很容易在一开始就误解关键概念。学生们常常死记硬背事实，却没有完全理解背后的原理，这会导致在考试中反复出错。本文指出了 10 年级学生在学习剑桥大纲时最容易掉入的陷阱，解释了正确理解每个主题的方式，并给出了避免失分的简单策略。
1. Binary and Denary Conversions – Misplacing Place Values | 二进制与十进制转换中的位权错误
tep to the left doubles the weight. A common error is to begin the headings from 2¹ or to read the bits in the wrong order, leading to completely wrong denary totals.
许多学生忘记二进制最右边的位具有最小的位权 (2⁰ = 1)，每向左移一位权值翻倍。常见错误是从 2¹ 开始计算权值，或者反向读取比特顺序，导致最终的十进制结果完全错误。
To convert reliably, always write a place value row above the binary digits. For an 8‑ 32+16+4+2 = 182 in denary. Practising with a drawn table removes guesswork and stops place‑value slips.
为了可靠地进行转换，始终在二进制数字上方写出一行位权。对于 10110110₂ 这样的 8 位数字，从左到右的表头分别是 128, 64, 32, 16, 8, 4, 2, 1。然后将出现 1 的位置的数值相加：128+32+16+4+2，得到十进制数 182。通过画出表格进行练习，可以消除猜测成分，避免位权错误。
2. Overflow vs Carry – Two Different Ideas | 溢出与进位——两个不同的概念
part of normal binary arithmetic. Overflow, however, occurs when the result of an addition is too large to fit into the fixed number of bits available for that data type, and the leftmost bit (often a sign bit) gets corrupted. Students often confuse the two, thinking any final carry must be an overflow.
当两个比特相加的结果超出了单个比特的表示范围时，就会产生进位 (1+1 = 0，进位 1)。这是正常二进制算术的一部分。然而，溢出是指加法结果太大，无法放入该数据类型可用的固定位数内，导致最左边的位（通常是符号位）被破坏。学生经常混淆两者，以为任何最终的进位都肯定是溢出。
A classic example in 8‑bit signed representation: adding 01111111 (+127) and 00000001 (+1) gives 10000000, which is –128 in two’s complement, not +128. A carry out of bit 7 occurs, but the value has also overflowed because the sign changed incorrectly. To tell the difference, check whether the result is still within the representable range. A carry into the sign bit that changes the expected sign signals overflow.
一个典型的 8 位有符号表示例子：将 01111111 (+127) 与 00000001 (+1) 相加，得到 10000000，这在二进制补码中是 –128，而不是 +128。虽然产生了向第 7 位之外的进位，但这个值也发生了溢出，因为符号位意外改变了。要区分两者，可以检查结果是否仍在可表示的范围内。如果有一个进入符号位的进位，并且改变了预期的符号，那就说明发生了溢出。
3. Logic Gate Truth Tables – AND and OR Confusion | 逻辑门真值表——与门和或门的混淆
The AND gate only outputs 1 when all inputs are 1. The OR gate outputs 1 if at least one input is 1. Under exam pressure, students sometimes swap these rules or misread a tiny dot (AND) and a curved plus sign (OR) on circuit diagrams. A single misread gate can make the entire logic statement incorrect.
与门只有在所有输入都为 1 时才输出 1。或门只要至少有一个输入是 1，输出就是 1。在考试压力下，学生有时会交换这些规则，或者看错电路图上的小圆点（与）和弯曲的加号（或）。只要看错一个门，整个逻辑语句就会出错。
Create a mental image: for AND, think 'narrow-minded' — every condition must be true. For OR, think 'easy‑going' — one true condition is enough. Practise quickly sketching a two‑input truth table for each gate and tracing signals through a logic circuit step by step. Remember that a NAND gate flips the AND output, and NOR flips OR, so revisit these after you have mastered the basics.
可以在脑海中建立形象：对于 AND，想象“非常挑剔”——每个条件都必须为真。对于 OR，想象“随和”——一个条件为真就够了。练习快速画出每个门的两个输入真值表，并逐步追踪信号通过逻辑电路的过程。记住，NAND 门是对 AND 的输出取反，NOR 是对 OR 的输出取反，因此在掌握基础知识后再复习这些。
4. High‑Level vs Low‑Level Languages – Wrong Categories | 高级语言与低级语言——分类错误
Many students believe that assembly language is a high‑level language just because it uses words like MOV and ADD. In reality, assembly is a low‑level language, as each mnemonic maps directly to a machine code instruction. Machine code (pure binary) and assembly are both low‑level; high‑level languages like Python and Java are abstracted away from the hardware.
许多学生认为汇编语言是高级语言，仅仅因为它使用了像 MOV 和 ADD 这样的单词。实际上，汇编语言是一种低级语言，因为每个助记符都直接对应一条机器码指令。机器码（纯二进制）和汇编语言都是低级语言；像 Python 和 Java 这样的高级语言则从硬件中抽象出来。
The key distinction is that low‑level languages are processor‑specific and require detailed knowledge of the architecture, whereas high‑level languages are portable and closer to human thinking. An assembly programmer can manipulate individual registers directly; a Python programmer does not need to know which memory address a variable uses. Revising this hierarchy — machine, assembly, high‑level — will help you answer classification questions correctly.
关键的区别在于，低级语言是特定于处理器的，并且需要详细的体系结构知识，而高级语言是可移植的，并且更接近人类的思维。汇编程序员可以直接操作各个寄存器；而 Python 程序员不需要知道变量使用的是哪个内存地址。复习这个层次结构——机器语言、汇编语言、高级语言——将帮助你正确回答分类问题。
5. Compiler and Interpreter – Different Translators | 编译器与解释器——不同的翻译器
A frequent misconception is that an interpreter produces a standalone executable file, just like a compiler. In fact, an interpreter reads, analyses and executes source code line by line without generating an object file, while a compiler translates the whole program into machine code before execution, creating an executable.
一个常见的误解是，解释器会像编译器一样生成独立的可执行文件。实际上，解释器是逐行读取、分析并执行源代码，而不生成目标文件；而编译器在执行前会将整个程序翻译成机器码，并生成一个可执行文件。
Think of a compiler as a translator who gives you the entire book in another language before you start reading. An interpreter is more like a live interpreter who translates each spoken sentence as the speaker speaks. This means compiled programs usually run faster once translated, but interpreted programs are easier to debug line by line. In the Cambridge exam, you may be asked to compare these features — always link the translation method to the presence or absence of a compiled machine‑code file.
可以把编译器想象成一位翻译，在你开始阅读之前就把整本书翻译成另一种语言交给你。解释器则更像一位同声传译，在说话者说话时一句一句地翻译。这意味着编译后的程序一旦翻译完成，通常运行得更快，但解释型程序更容易逐行调试。在剑桥的考试中，你可能会被要求比较这些特点——请始终将翻译方法与是否生成编译后的机器码文件联系起来。
6. RAM and ROM – Volatility and Purpose | RAM 与 ROM——易失性与用途
Students sometimes think RAM is non‑volatile because 'random access' sounds permanent, or they assume ROM is just a slower type of RAM. In reality, RAM is volatile — its contents are lost when power is turned off — and it holds the operating system, applications and data currently in use. ROM is non‑volatile and mainly stores firmware, such as the BIOS, which must survive a power cycle.
学生们有时认为 RAM 是非易失性的，因为“随机存取”这个词听起来像是永久的，或者他们以为 ROM 只是一种较慢的 RAM。实际上，RAM 是易失性的——断电后其内容就会丢失——它保存着当前使用的操作系统、应用程序和数据。ROM 是非易失性的，主要存储固件，比如 BIOS，这类内容必须在断电后仍然保留。
The name 'Random Access Memory' refers to the fact that any location can be accessed in roughly the same time, not to whether it keeps data. ROM originally stood for 'Read‑Only Memory', and while some types can be reprogrammed (like EEPROM), its main job is still to store essential startup instructions. A quick way to remember the difference: RAM is your desk — you use it while working but it is cleared at the end of the day. ROM is the instruction manual glued to the desk that stays there forever.
“随机存取存储器”这个名字指的是任何位置都可以在大致相同的时间内被访问，而不是指它能否保存数据。ROM 最初代表“只读存储器”，虽然有些类型可以进行重编程（例如 EEPROM），它的主要任务仍然是存储基本的启动指令。一个快速记住区别的方法：RAM 就像你的办公桌——你工作时使用它，但一天结束时会被清空。ROM 则是粘在桌子上的说明书，永远留在那里。
7. IP Address vs MAC Address – Wrong Layer | IP 地址与 MAC 地址——错误的层级
It is common for learners to mix up the roles of IP and MAC addresses, believing both are used to identify a device globally. An IP address is a logical address assigned by a network and can change when you move to a different Wi‑Fi. A MAC address is a hard‑coded physical address burnt into the network interface card at manufacture and normally stays the same forever.
学习者经常混淆 IP 地址和 MAC 地址的作用，认为两者都是用来在全球范围内标识设备的。IP 地址是由网络分配的逻辑地址，当你切换到不同的 Wi‑Fi 时，它可能会改变。MAC 地址是一个硬编码的物理地址，在制造时烧录到网络接口卡中，通常永远保持不变。
Think of the IP address as your postal address — it can change when you move house. The MAC address is like your fingerprint — it identifies the specific piece of hardware. In the OSI model, IP operates at the network layer (Layer 3) to route packets between networks, while MAC works at the data link layer (Layer 2) to deliver frames on the same local network. Questions often ask which address remains constant across networks; the answer is the MAC address.
可以把 IP 地址想象成你的邮寄地址——你搬家后它会改变。MAC 地址就像你的指纹——它识别的是特定的硬件。在 OSI 模型中，IP 工作在网络层（第3层），负责在不同网络之间路由数据包；而 MAC 工作在数据链路层（第2层），负责在同一个本地网络中传输帧。考题中经常问到哪个地址在不同网络间保持不变；答案是 MAC 地址。
8. Pseudocode Assignment vs Comparison – Using the Equals Sign | 伪代码中的赋值与比较——等号的使用
In Cambridge pseudocode, assignment is usually shown with an arrow (←, while the single equals sign (=) is reserved for comparison. A frequent slip is to write WHILE x = 5 when they intend to assign 5 to x, or conversely to use an arrow in an IF condition. Mixing these up can make an algorithm logic appear completely wrong to an examiner.
在剑桥的伪代码中，赋值通常用箭头 (←) 表示，而单等号 (=) 则保留给比较操作。一个常见的失误是，当学生想要将 5 赋给 x 时却写了 WHILE x = 5，或者反过来在 IF 条件中使用了箭头。把这些符号弄混会让阅卷人觉得算法逻辑完全错误。
- Assignment:
x ← 10— 'x becomes 10'. - Comparison:
IF x = 10 THEN— 'if x is equal to 10'.
- 赋值：
x ← 10——“x 变为 10”。 - 比较：
IF x = 10 THEN——“如果 x 等于 10”。
Before writing any loop or selection in the exam, pause and ask yourself whether you are checking a condition or updating a value. Using the correct symbol not only avoids syntax mistakes but also proves your understanding of algorithm design.
在考试中编写任何循环或选择结构之前，先停下来问问自己，你是在检查条件还是在更新数值。使用正确的符号不仅能避免语法错误，还能证明你对算法设计的理解。
9. Array Indexing – Starting from 0 or 1 | 数组索引——从 0 开始还是从 1 开始
A major source of off‑by‑one errors in pseudocode is uncertainty about whether array indices begin at 0 or 1. In many real‑world programming languages, indexing starts at 0. However, Cambridge IGCSE pseudocode typically declares arrays with a defined lower bound, such as DECLARE list : ARRAY[1:10] OF INTEGER, meaning the first element is at index 1. Students who assume 0‑based indexing will repeatedly access the wrong cell.
伪代码中造成“差一错误”的一个主要来源是，不确定数组索引是从 0 开始还是从 1 开始。在许多实际的编程语言中，索引是从 0 开始的。然而，剑桥 IGCSE 的伪代码通常声明数组时会定义下界，例如 DECLARE list : ARRAY[1:10] OF INTEGER，这意味着第一个元素位于索引 1 处。假定索引从 0 开始的学生会不断地访问错误的单元格。
Always check the declaration line. If an array is declared with [0:n], then index 0 is valid; if it is [1:n], index 1 is the first. In a question that does not specify the lower bound, look at any sample input/output or the variable table for clues. When tracing an algorithm, write down index numbers and current values on the side of the page to prevent simple counting mistakes.
一定要检查声明行。如果数组以 [0:n] 声明，那么索引 0 是有效的；如果是 [1:n]，那么索引 1 是第一个。在未指定下界的问题中，请从示例输入/输出或变量表中寻找线索。在跟踪算法时，在页面边缘写下索引编号和当前值，以防止简单的计数错误。
10. Primary Key and Foreign Key – Relating Tables | 主键与外键——表之间的关系
A primary key uniquely identifies each record in a table; it must be unique and not null. A foreign key is a field in one table that links to the primary key of another table, creating a relationship. Students often mistakenly think a foreign key can be null or that it has to be a separate, special type of field — it is simply a primary key from a different table that appears elsewhere.
主键唯一地标识表中的每一条记录；它必须是唯一的，且不能为空。外键是一个表中的字段，它链接到另一个表的主键，从而创建关系。学生经常错误地认为外键可以为空，或者它必须是一种特殊类型的字段——它实际上只是来自另一个表的主键，出现在了别的地方。
For example, in a Student table, StudentID is the primary key. In an Enrolment table, StudentID appears again as a foreign key to connect each enrolment to a specific student. The foreign key must respect referential integrity — it cannot contain values that do not exist in the referenced primary key column. When drawing entity‑relationship diagrams, clearly label which attribute is the primary key and which is the foreign key.
例如，在 Student 表中，StudentID 是主键。在 Enrolment 表中，StudentID 再次作为外键出现，将每次选课记录与特定的学生联系起来。外键必须遵守引用完整性——它不能包含在引用主键列中不存在的值。在绘制实体关系图时，请清楚地标注出哪个属性是主键，哪个是外键。
11. Units of Data Storage – KB vs KiB | 数据存储单位——KB 与 KiB
tates that 1 kilobyte (KB) = 1024 bytes, 1 megabyte = 1024 KB, and so on. Students who use the 1000‑ exam calculations will get incorrect file sizes, transfer times, or storage requirements.
在日常语境中，1 千字节通常表示 1000 字节（国际单位制定义）。然而，剑桥 IGCSE 计算机科学教学大纲明确指出，1 千字节 (KB) = 1024 字节，1 兆字节 = 1024 KB，以此类推。使用基于 1000 的换算来进行考试计算的学生，将会得出错误的文件大小、传输时间或存储需求。
are in a 5 KB file, use 5 × 1024 = 5120 bytes, not 5000. To avoid confusion, always double‑ disk capacities might use decimal prefixes (1000), but within pure computer science topics — memory addressing, bitmap image sizes, or data transmission — the 1024 rule applies as per the specification. Make a note in your revision guide: 'IGCSE CS = binary multiples'.
当计算 5 KB 文件有多少字节时，请使用 5 × 1024 = 5120 字节，而不是 5000。为了避免混淆，一定要仔细对照题目上下文。关于硬盘容量的题目可能会使用十进制前缀 (1000)，但在纯计算机科学主题中——内存寻址、位图图像大小或数据传输——按照大纲规定，要应用 1024 的规则。在你的复习指南中记下：“IGCSE 计算机科学 = 二进制倍数”。
12. HTTPS Encryption – Scope and Limitations | HTTPS 加密——范围与局限性
Many students believe that HTTPS encrypts everything a user does on a website, including the URL, the IP address of the client, and even the files stored on the server. In truth, HTTPS encrypts only the content of the communication between the browser and the server — the payload and possibly some header information — but the domain name, the client IP address, and the fact a connection is being made are still visible to network intermediaries.
许多学生认为 HTTPS 会加密用户在网站上所做的一切，包括 URL、客户端的 IP 地址，甚至服务器上存储的文件。事实上，HTTPS 仅加密浏览器和服务器之间通信的内容——负载以及可能的一些头部信息——但域名、客户端 IP 地址以及连接正在建立这一事实，对于网络中介来说仍然是可见的。
Think of HTTPS as sending a letter in a sealed, opaque envelope: the postman cannot read what is inside, but he can still see the address on the front. Similarly, an attacker snooping on a Wi‑Fi network would see that you visited www.examplebank.com, but could not read your password or account details inside the encrypted tunnel. This is why using HTTPS alone does not make you completely invisible — it protects the data, not the metadata.
可以把 HTTPS 想象成用密封、不透明的信封寄信：邮递员看不到里面的内容，但他仍然能看到信封正面的地址。同样，在 Wi‑Fi 网络上窃听的攻击者会看到你访问了 www.examplebank.com，但无法读取加密隧道内的密码或账户详情。这就是为什么单独使用 HTTPS 并不会让你完全隐形——它保护的是数据，而不是元数据。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图