Common Misconceptions in Year 12 Cambridge Computer Science | 剑桥 Year 12 计算机常见误区与纠正方法

📚 Common Misconceptions in Year 12 Cambridge Computer Science | 剑桥 Year 12 计算机常见误区与纠正方法

The Cambridge AS & A Level Computer Science (9618) syllabus demands not only factual knowledge but also accurate conceptual understanding. Year 12 students often carry subtle misunderstandings from earlier studies that can undermine exam performance. This article identifies the most persistent misconceptions across key topics, explains why they are wrong, and shows how to think correctly — with every point presented in both English and Chinese to strengthen bilingual comprehension.

剑桥 AS & A Level 计算机科学 (9618) 课程不仅要求掌握事实性知识，还要求准确的概念理解。Year 12 学生经常带着早期学习中的隐性误解，这些误解可能影响考试成绩。本文梳理了各重要主题中最顽固的常见误区，解释错误原因，并展示正确的思考方式——每个要点均以中英对照呈现，以强化双语理解。

1. RAM is permanent storage | 误区一：RAM 是永久存储器

Many students believe that data stays in RAM even after the computer is switched off. RAM (Random Access Memory) is volatile: all its content is lost when power is removed. The only truly permanent storage in a typical system is secondary storage such as a hard disk or SSD.

许多学生认为计算机关机后 RAM 中的数据仍会保留。RAM（随机存取存储器）是易失性的：断电后所有内容都会丢失。典型系统中真正永久保存数据的是硬盘或 SSD 等辅助存储器。

This confusion often arises because some modern laptops use ‘sleep’ modes that keep RAM powered. In a full shutdown, however, the operating system must reload everything from secondary storage. Understanding volatility is fundamental to explaining the role of ROM and the boot process.

这种混淆常来源于现代笔记本使用“睡眠”模式，维持 RAM 供电。但在完全关机后，操作系统必须从辅助存储重新加载一切。理解易失性是解释 ROM 角色和引导过程的基础。

Correction: RAM is volatile temporary workspace; permanent storage requires non‑volatile media.
纠正： RAM 是易失性的临时工作区；永久存储需要非易失介质。

2. A bit is the same as a byte | 误区二：位 (bit) 和字节 (byte) 相同

It is common to hear ‘bit’ and ‘byte’ used interchangeably in everyday language, but technically a bit is a single binary digit (0 or 1), while a byte is a group of 8 bits. Confusing the two leads to errors in data transfer rates and file size calculations.

日常用语中 ‘bit’ 和 ‘byte’ 经常混用，但从技术上讲，位 (bit) 是单个二进制数字（0 或 1），而字节 (byte) 是 8 个位的组合。混淆两者会导致数据传输速率和文件大小计算错误。

For example, network speeds are often quoted in megabits per second (Mbps), whereas file sizes are in megabytes (MB). 1 MB = 8 megabits. A 100 Mbps connection actually transfers at most 12.5 MB per second under ideal conditions.

例如，网络速度常以每秒兆位 (Mbps) 表示，而文件大小以兆字节 (MB) 表示。1 MB = 8 Mb。100 Mbps 的连接在理想条件下每秒最多传输 12.5 MB。

Correction: 1 byte = 8 bits. Always check units when comparing speeds and sizes.
纠正： 1 字节 = 8 位。比较速度和容量时务必检查单位。

3. Two’s complement is just sign-and-magnitude | 误区三：补码就是原码表示法

A frequent mistake is to treat two’s complement representation as identical to sign-and-magnitude. In sign-and-magnitude, the most significant bit (MSB) simply indicates the sign (0 for positive, 1 for negative) and the remaining bits hold the magnitude. Two’s complement, however, uses a different encoding where negative numbers are formed by inverting all bits and adding 1.

一个常见错误是将补码 (two’s complement) 等同于原码表示法。在原码中，最高有效位 (MSB) 仅表示符号（0 为正，1 为负），其余位存放数值大小。而补码采用不同编码，负数通过将所有位取反后加 1 形成。

This misunderstanding leads to incorrect binary arithmetic. In two’s complement, the MSB still indicates sign, but the value is not simply the magnitude. For an 8‑bit example, the binary pattern 11111111 in sign-and-magnitude would be –127, but in two’s complement it is –1.

这种误解导致错误的二进制算术。在补码中，MSB 仍指示符号，但数值并非简单的绝对值。以 8 位为例，二进制模式 11111111 在原码中为 –127，但在补码中为 –1。

Two’s complement negation: invert bits then add 1 → –X = ~X + 1

补码取负：按位取反后加 1 → –X = ~X + 1

Correction: Two’s complement is the standard for integer representation in modern computers because it simplifies arithmetic circuitry and avoids double representation of zero.
纠正： 补码是现代计算机中整数的标准表示法，因为其简化算术电路，并避免零的双重表示。

4. An AND gate outputs 1 if any input is 1 | 误区四：AND 门只要任一输入为 1 就输出 1

Some students confuse the behaviour of AND and OR gates. An AND gate only outputs 1 when all inputs are 1. If even a single input is 0, the output remains 0. This is a fundamental logic error that appears in circuit design and Boolean algebra questions.

有些学生混淆了 AND 门和 OR 门的行为。AND 门仅当所有输入均为 1 时才输出 1。只要有一个输入为 0，输出就为 0。这是电路设计和布尔代数题目中常见的基本逻辑错误。

The truth table for a two‑input AND gate is:

二输入 AND 门真值表如下：

A	B	Output (A AND B)
0	0	0
0	1	0
1	0	0
1	1	1

Correction: Remember the AND rule: ‘All 1s give 1’. OR rule: ‘Any 1 gives 1’.
纠正： 记住 AND 规则：“全 1 得 1”。OR 规则：“有 1 得 1”。

5. The operating system is the same as the user interface | 误区五：操作系统等同于用户界面

People often point to the desktop, icons, and menus and call that ‘the operating system’. In reality, the graphical user interface (GUI) is just one component. The operating system includes the kernel, memory manager, file system, I/O control, and security modules, many of which operate invisibly.

人们常指着桌面、图标和菜单称其为“操作系统”。实际上，图形用户界面 (GUI) 只是一个组件。操作系统包括内核、内存管理、文件系统、输入输出控制和安全模块等，其中许多部分在后台不可见地运行。

A command‑line interface (CLI) provides the same core OS functionality without any graphical elements. Understanding this distinction is crucial for topics on system software, virtual machines, and utility programs.

命令行界面 (CLI) 提供相同的核心操作系统功能，却没有任何图形元素。理解这一区别对于系统软件、虚拟机和实用程序等主题至关重要。

Correction: The operating system is the fundamental software that manages hardware and provides services; the user interface is merely one way to interact with it.
纠正： 操作系统是管理硬件并提供服务的基础软件；用户界面只是与之交互的一种方式。

6. The OSI model is a protocol | 误区六：OSI 模型是一种协议

The OSI (Open Systems Interconnection) model is often misinterpreted as a set of networking protocols. It is, in fact, a conceptual framework that standardises the functions of a telecommunication system into seven abstract layers. Protocols like TCP/IP implement similar functions but do not follow the OSI model exactly.

OSI（开放系统互连）模型经常被误解为一套网络协议。实际上，它是一个概念框架，将通信系统的功能标准化为七个抽象层。像 TCP/IP 这样的协议实现了类似功能，但并未精确遵循 OSI 模型。

Students need to recognise that the OSI model is a reference model — a teaching and design tool — while TCP/IP is a protocol suite that dominates the Internet. Saying ‘we use the OSI model to send data’ suggests a misunderstanding of its role.

学生需要认识到 OSI 模型是一种参考模型——教学和设计工具——而 TCP/IP 是主导互联网的协议族。如果说“我们用 OSI 模型发送数据”，则暗示对其角色的误解。

Correction: OSI model = a theoretical framework; TCP/IP = the practical set of protocols used on the Internet.
纠正： OSI 模型 = 理论框架；TCP/IP = 互联网实际使用的协议集合。

7. Stacks and queues are interchangeable | 误区七：栈和队列可互换使用

Both stacks and queues are abstract data types (ADTs) for storing collections, but their access rules are opposite. A stack is LIFO (Last In, First Out) — think of a pile of plates. A queue is FIFO (First In, First Out) — like a line of people waiting. Using one when the other is needed breaks the logic of algorithms.

栈和队列都是用于存储集合的抽象数据类型 (ADT)，但它们的访问规则相反。栈是 LIFO（后进先出）——像一摞盘子。队列是 FIFO（先进先出）——像排队的人群。在需要一种结构时错误使用另一种会破坏算法逻辑。

For example, backtracking algorithms (e.g. depth‑first search) rely on a stack to return to previous states, whereas breadth‑first search requires a queue to process in arrival order. Interchanging them would produce a completely different traversal.

例如，回溯算法（如深度优先搜索）依赖栈返回先前状态，而广度优先搜索需要队列按到达顺序处理。互换将导致完全不同的遍历结果。

Correction: Choose stack when you need to reverse order or go back; choose queue when order of arrival matters.
纠正： 需要逆序或回溯时选用栈；注重到达顺序时选用队列。

8. O(n²) always runs slower than O(n) | 误区八：O(n²) 在任何输入规模下都比 O(n) 慢

Big‑O notation describes how an algorithm’s running time grows relative to input size, not the absolute speed. For very small n, an O(n²) algorithm with a small constant factor can run faster than an O(n) algorithm with a large constant overhead.

大 O 表示法描述的是算法运行时间相对于输入规模的增长趋势，而非绝对速度。当 n 非常小时，一个常数因子较小的 O(n²) 算法可能比常数开销大的 O(n) 算法运行得更快。

This misunderstanding leads to premature optimisation. A classic example: insertion sort (O(n²)) often outperforms merge sort (O(n log n)) on tiny arrays because of lower overhead. The crossover point depends on hardware and implementation details.

这种误解会导致过早优化。一个经典例子：插入排序 (O(n²)) 在极小的数组上由于开销较低，常常优于归并排序 (O(n log n))。交叉点取决于硬件和实现细节。

Correction: Big‑O is about growth rate for large n. For small inputs, measure or consider constants.
纠正： 大 O 是关于 n 很大时的增长率。对于小输入，需要测量或考虑常数因子。

9. Primary key and foreign key are the same concept | 误区九：主键和外键是同一概念

A primary key uniquely identifies each record within a table (e.g., StudentID in a Students table). A foreign key is an attribute in one table that links to the primary key of another table to enforce referential integrity. They serve different roles in relational database design.

主键在表内唯一标识每条记录（例如，学生表中的 StudentID）。外键是一个表中的属性，它链接到另一个表的主键，以强制引用完整性。它们在关系数据库设计中担任不同角色。

Thinking they are interchangeable causes schema design errors — such as placing all data in one table to avoid foreign keys, which leads to redundancy and anomalies. Normalisation relies on distinguishing between these two types of key.

认为它们可以互换会导致模式设计错误——例如，为避免外键把所有数据放入一个表中，从而导致冗余和异常。规范化正依赖于区分这两种键。

Correction: Primary key = internal unique identifier; foreign key = cross‑table reference.
纠正： 主键 = 内部唯一标识符；外键 = 跨表引用。

10. A compiler and an interpreter do exactly the same job | 误区十：编译器和解释器完全相同

Superficially both translate high‑level source code into machine code, but a compiler translates the entire program at once, producing an independent executable file, while an interpreter translates and executes the source code line‑by‑line without creating a separate executable.

表面上看两者都将高级源代码转换为机器码，但编译器一次性翻译整个程序，产生独立的可执行文件；解释器则逐行翻译并执行源代码，不生成独立的可执行文件。

This distinction affects portability, debugging, and performance. Compiled programs generally run faster; interpreted programs are easier to test and modify. Hybrid approaches (e.g., Java with bytecode and JVM) further blur the line but still rely on a compilation step.

这种区别影响可移植性、调试和性能。编译型程序通常运行更快；解释型程序更易于测试和修改。混合方法（例如 Java 使用字节码和 JVM）进一步模糊了界限，但仍依赖编译步骤。

Correction: Compiler: whole‑program translation → standalone executable. Interpreter: line‑by‑line execution without generating a separate output file.
纠正： 编译器：全程序翻译 → 独立可执行文件。解释器：逐行执行，不生成单独的输出文件。

11. High‑level languages always run slower than assembly | 误区十一：高级语言总比汇编语言慢

There is a persistent belief that code written in a high‑level language like Python or Java is inherently slower than hand‑crafted assembly. Modern optimising compilers can produce machine code that rivals or even outperforms average hand‑written assembly for many tasks, thanks to advanced techniques like loop unrolling, instruction scheduling, and register allocation.

长久以来人们认为用 Python 或 Java 等高级语言编写的代码本质上比手工汇编慢。现代优化编译器通过循环展开、指令调度和寄存器分配等先进技术，可以为许多任务生成媲美甚至超越普通手写汇编的机器码。

Moreover, assembly language is processor‑specific and not portable, while high‑level languages save enormous development time and reduce errors. Performance depends far more on algorithm choice and data structures than on language level.

此外，汇编语言针对特定处理器且不可移植，而高级语言节省大量开发时间并减少错误。性能更多取决于算法选择和数据结构，而非语言层级。

Correction: With modern compilers, well‑written high‑level code can be extremely efficient. Assembly is used only when absolute control or hardware‑specific optimisation is essential.
纠正： 借助现代编译器，编写良好的高级代码可以极其高效。汇编仅在需要绝对控制或硬件特定优化时才使用。

12. All data in a computer is stored in ASCII | 误区十二：计算机中的所有数据都以 ASCII 存储

ASCII is one character encoding scheme that represents 128 characters using 7 bits. Today, much broader encoding standards like Unicode (e.g., UTF‑8, UTF‑16) are used to support international characters, emojis, and symbols. Multimedia files, executables, and encrypted data are stored as binary sequences, not as ASCII text.

ASCII 是一种字符编码方案，使用 7 位表示 128 个字符。如今，更广泛的编码标准如 Unicode（例如 UTF‑8、UTF‑16）被用于支持各国文字、表情符号等。多媒体文件、可执行文件和加密数据均以二进制序列存储，而非 ASCII 文本。

Confusing text encoding with general data representation leads to errors when interpreting file contents. A hex dump of an image file is not ‘ASCII’; it is a binary file whose bytes may coincidentally fall in the ASCII range.

混淆文本编码与通用数据表示会导致解读文件内容时出错。图像文件的十六进制转储并非“ASCII”；它是二进制文件，其字节偶尔落入ASCII范围而已。

Correction: ASCII is a specific character set. Modern systems use Unicode. Non‑text data is stored as raw binary without character encoding.
纠正： ASCII 是一种特定的字符集。现代系统使用 Unicode。非文本数据以原始二进制存储，不涉及字符编码。

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

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

Common Misconceptions in Year 12 Cambridge Computer Science | 剑桥 Year 12 计算机常见误区与纠正方法