📚 Common Misconceptions in Year 11 Eduqas Computer Science and How to Fix Them | 英国Eduqas计算机科学11年级常见误区与纠正方法
Many Year 11 students following the Eduqas Computer Science specification lose marks not because they do not understand the core ideas, but because they hold small but persistent misconceptions. These errors can affect answers on data representation, algorithms, programming, and networking topics. This article identifies the most common misunderstandings and provides clear correction methods, with each point presented in both English and Chinese to support bilingual learners.
不少正在学习Eduqas计算机科学课程的11年级学生丢分，并不是因为他们不理解核心概念，而是因为心中存有一些细小却顽固的误区。这些错误可能影响数据表示、算法、编程和网络等主题的回答。本文梳理了最常见的误解并给出了清晰的纠正方法，每一个要点都提供英文和中文对照解说，方便双语学习者掌握。
1. Misunderstanding Two's Complement for Negative Numbers | 误解二进制补码表示负数
Many students believe that the leftmost bit in a two' mplement number simply acts as a negative sign, so that 10000001 means -1. In reality, two' an 8-bit number, the MSB represents -128. Therefore, 10000001 is -128 + 1 = -127, not -1.
很多学生误以为二进制补码的最左位仅仅是一个负号，所以 10000001 就表示 -1。实际上，补码采用加权系统，最高有效位具有负的位权。对于 8 位数，MSB 代表 -128。因此，10000001 = -128 + 1 = -127，而不是 -1。
A safe method to convert a negative denary number to two's complement is: write the positive magnitude in binary, flip all bits, then add 1. For -1, the magnitude 1 is 00000001; flipped becomes 11111110; add 1 gives 11111111. This is the correct representation. To decode, if the MSB is 1, treat the value as negative and perform the same flip-and-add-1 procedure to find the magnitude.
将负十进制数转为补码的安全方法是：先写出其正数的二进制，所有位取反，再加 1。以 -1 为例，正数 1 是 00000001；取反得 11111110；加 1 得 11111111。这才是正确的表示。解码时，若 MSB 为 1，则视为负数，同样执行取反加 1 操作求出其绝对值。
Also, remember that an 8-bit two's complement can represent values from -128 to +127. Attempting to represent +128 leads to an overflow because the bit pattern 10000000 is reserved for -128.
还要记住，8 位补码能表示的范围是 -128 到 +127。试图表示 +128 会导致溢出，因位模式 10000000 已留给 -128。
2. Confusing Overflow with Carry Out | 混淆溢出与进位
Students often think that any carry out of the most significant bit during addition indicates an overflow. In two's complement arithmetic, a carry out alone is not an overflow; it is simply a carry that is discarded. An overflow occurs when the result exceeds the representable range, which is detected when the carry into the MSB differs from the carry out of the MSB.
学生常认为加法时最高位产生进位就一定发生了溢出。在补码运算中，单纯的进位只是被丢弃的进位，不等于溢出。溢出发生在结果超出可表示范围时，其检测条件是：进入最高位的进位与离开最高位的进位不同。
For example, adding 01111111 (+127) and 00000001 (+1) gives 10000000. No carry out occurs, but the result is -128, which is wrong for 127+1. The carry into MSB is 1 (from bit 6), the carry out is 0, so overflow is flagged. Conversely, adding 11111111 (-1) and 11111111 (-1) produces a carry out and a result of 11111110 (-2). The carry into MSB is 1, carry out is 1; no overflow, result is correct.
例如，01111111 (+127) 加 00000001 (+1) 得到 10000000。没有产生进位离开，但结果是 -128，对 127+1 来说错误。进入 MSB 的进位是 1，离开 MSB 的进位是 0，因此检测到溢出。反之，11111111 (-1) 加 11111111 (-1) 产生进位离开，结果为 11111110 (-2)。进入 MSB 进位为 1，离开 MSB 进位也为 1；无溢出，结果正确。
In your exam, always check the carry into and out of the MSB. Do not rely solely on the presence of a ninth bit.
考试时一定要检查进出最高位的两个进位，不要只盯着有没有第九位。
3. Bubble Sort vs. Insertion Sort: Algorithmic Differences | 冒泡排序与插入排序的算法区别
A common mistake is to describe bubble sort and insertion sort as if they are the same because they both involve comparisons and swaps. In bubble sort, adjacent pairs are compared and swapped if out of order, with the largest element 'bubbling' to its correct position after each pass. In insertion sort, the list is divided into a sorted and an unsorted part; each element from the unsorted part is taken and inserted into its correct place in the sorted part by shifting larger elements right.
常见错误是把冒泡排序和插入排序混为一谈，因为它们都涉及比较和交换。冒泡排序中，依次比较相邻元素，若顺序错误就交换，每轮扫描后最大元素“冒泡”到它正确的位置。插入排序则将列表分为已排序和未排序两部分；从未排序部分取出每个元素，通过将较大元素右移，把它插入到已排序部分的正确位置。
This difference affects pass structure and the state of the list after each iteration. For bubble sort, after one complete pass, the final element is guaranteed to be the largest. For insertion sort, after one pass, the first element alone is considered sorted; after the second pass, the first two elements are sorted, and so on.
这一区别影响每轮扫描的结构和列表状态。冒泡排序完成一轮完整扫描后，最右侧元素必定是最大值。插入排序第一轮后，仅第一个元素被视为已排序；第二轮后，前两个元素有序，以此类推。
Make sure you can trace both algorithms manually and identify the number of comparisons and swaps in a given scenario. Eduqas often asks you to show the list after each pass or to compare efficiency.
要确保你能够手动跟踪这两种算法，并确定给定情形下的比较次数和交换次数。Eduqas 常常要求你展示每一轮扫描后的列表，或者比较效率。
4. High-Level vs. Low-Level Languages: Not Just 'Easier' | 高级语言与低级语言：不仅仅是“更简单”
Students frequently oversimplify the difference by saying high-level languages are easy and low-level ones are hard. The meaningful distinction lies in the level of abstraction. High-level languages use English-like statements, are portable across platforms, and require translators like compilers or interpreters. Low-level languages, such as assembly, use mnemonics that map directly to machine code instructions and are specific to a processor's architecture.
学生经常过度简化，说高级语言简单，低级语言难。真正有意义的区别在于抽象层次。高级语言使用类似英语的语句，可跨平台移植，需要编译器或解释器这样的翻译程序。低级语言（如汇编）使用助记符，这些助记符与机器码指令直接对应，且与特定处理器架构绑定。
Another misconception is that assembly language is not translated: it still requires an assembler to convert mnemonics into binary. Even machine code is not directly 'understood' in a human sense; it is simply executed by the CPU.
另一个误区是认为汇编语言不需要翻译：它仍然需要汇编器将助记符转换为二进制。即便是机器码，也不是被人“理解”的，它只是由 CPU 直接执行。
When comparing languages, remember to mention portability, ease of debugging, memory usage, and execution speed. High-level languages are easier to read and maintain; low-level languages give finer control over hardware.
比较语言时，记得提及可移植性、调试难度、内存占用和执行速度。高级语言更易阅读和维护；低级语言对硬件的控制更精细。
5. Compilers vs. Interpreters: Translation Method, Not Just Speed | 编译器与解释器：翻译方式，不仅仅是速度
Many learners state that compilers are fast and interpreters are slow. While compiled code generally runs faster, the deeper difference is in how translation occurs. A compiler translates the entire source code into machine code once, producing a stand-alone executable file. An interpreter translates and executes the source code line by line, without generating a separate object file.
许多学习者说编译器速度快，解释器速度慢。虽然编译后的代码通常运行更快，但更深层的区别在于翻译方式。编译器一次性将整个源代码翻译成机器码，生成独立的可执行文件。解释器则逐行翻译并执行源代码，不产生单独的目标文件。
This leads to different error reporting: compilers report all syntax errors after compilation, while interpreters stop at the first error. Useful for exams: compilers produce an executable that can run without the translator; interpreted code needs the interpreter present each time.
这导致错误报告方式不同：编译器在编译结束后报告所有语法错误，而解释器遇到第一个错误就停止。考试实用点：编译器生成的可执行文件无需翻译器即可运行；解释型代码每次都需要解释器在场。
Do not confuse a compiler with an assembler. An assembler translates assembly language into machine code; a compiler translates high-level source code, often into object code or machine code.
不要把编译器和汇编器混淆。汇编器把汇编语言翻译成机器码；编译器将高级源代码翻译成目标代码或机器码。
6. Variable vs. Constant: Mutability Misunderstandings | 变量与常量：可变性误解
It is tempting to think that a constant is just a variable that is written in capital letters. The critical distinction is that a constant's value cannot be changed during program execution, while a variable's value can be updated. This is enforced by the programming language, not merely a naming convention.
容易认为常量只是用大写字母写的变量。关键区别是：常量的值在程序执行期间不可改变，而变量的值可以更新。这是由编程语言强制要求的，而不仅仅是命名约定。
For example, const VAT_RATE = 0.2 ython means any attempt to reassign VAT_RATE later will cause an error. A variable such as score can be incremented freely. Understanding this helps with maintenance and readability: constants protect values that should remain fixed, like mathematical constants or configuration settings.
例如，在伪代码或 Python 中的 const VAT_RATE = 0.2 意味着后续任何对 VAT_RATE 的重新赋值都会出错。变量如 score 则可以随意增加。理解这一点有助于维护和可读性：常量保护那些应该保持不变的值，比如数学常数或配置设定。
In trace table questions, treat constants as read-only. If an algorithm assigns a new value to a constant, you should flag it as an error or, depending on the context, follow the language rules specified.
在痕迹表问题中，把常量当作只读。如果算法给常量赋了新值，应根据上下文标记为错误，或遵循题目指定的语言规则。
7. Data Types and Casting: String + Integer Pitfalls | 数据类型与强制类型转换：字符串与整数陷阱
Students often assume that the operator '+' performs addition in all contexts. In most high-level languages, when a string is combined with an integer using '+', either an error occurs (Python raises TypeError) or the integer is implicitly cast to a string for concatenation (JavaScript). Eduqas usually expects explicit casting, for example using str() or int().
学生常以为运算符 '+' 在任何上下文里都执行加法。在多数高级语言中，当字符串与整数用 '+' 组合时，要么报错（Python 引发 TypeError），要么整数被隐式转换为字符串进行拼接（JavaScript）。Eduqas 通常期望显式强制类型转换，例如使用 str() 或 int()。
Another subtle error involves integer division. In many programming languages, dividing two integers using '/' might yield a float, but using '//' (floor division) gives an integer result. When tracing code, note the data type of the result, as it may affect subsequent operations.
另一个细微错误与整数除法有关。在很多编程语言中，用 '/' 除两个整数可能得到浮点数，而用 '//'（地板除）得到整数结果。在跟踪代码时，要注意结果的数据类型，因为它可能影响后续运算。
Always write down the data type of each variable in trace tables. When converting between types, show the conversion explicitly, e.g., number = int(input_string). This eliminates ambiguity in exam answers.
在痕迹表中务必写下每个变量的数据类型。进行类型转换时，显式展示转换，如 number = int(input_string)。这将消除考试答案中的歧义。
8. Algorithm Efficiency: Linear Search isn't Always Bad | 算法效率：线性搜索不一定总是差
A frequent mistake is to claim that linear search is useless because it is O(n) while binary search is O(log n). In the real world and in exam contexts, linear search has advantages: it works on unsorted data, does not require a sorted list, and performs well on small datasets. Binary search requires a sorted list first, and the sorting step itself costs time.
常见错误是声称线性搜索因为 O(n) 而无用，而二分搜索是 O(log n)。在真实场景和考试语境中，线性搜索有其优势：它可用于未排序数据，不需要预先排序的列表，并且在小数据集上表现良好。二分搜索需要先有一个已排序列表，而排序本身也耗时。
When asked to justify the choice of search algorithm, consider the size of the dataset, whether it is already sorted, and how often searches are performed. If the list is short and unsorted, linear search may be simpler and more efficient overall.
当需要论证选择哪种搜索算法时，要考虑数据集大小、是否已排序以及搜索频次。如果列表短且未排序，线性搜索可能整体上更简单高效。
Similarly, bubble sort is often dismissed as the worst sorting algorithm, but it can detect an already sorted list in one pass (with a swap flag) and then terminate early, giving O(n) best-case time. Insertion sort also performs well on nearly sorted data.
类似地，冒泡排序常被贬为最差的排序算法，但它可以通过一个交换标志在一轮扫描内检测到列表已排序，从而提前终止，获得 O(n) 最佳情况时间。插入排序在数据近于有序时也表现优异。
9. Network Protocols: Layers and Addressing Confusion | 网络协议：分层与寻址混淆
One of the trickiest areas is the distinction between IP and MAC addresses, and how they relate to protocol layers. Students often say that MAC addresses are used for communication across the internet, but MAC addresses only work within a local network segment. IP addresses provide logical addressing that can route packets across different networks.
最容易混淆的领域之一是 IP 地址和 MAC 地址的区别，以及它们与协议分层的关系。学生常说 MAC 地址用于互联网通信，但 MAC 地址仅在同一局域网段内有效。IP 地址则提供逻辑寻址，能够跨不同网络路由数据包。
In the TCP/IP stack, the network access layer (or link layer) uses MAC addresses to deliver frames between devices on the same local network. The internet layer uses IP addresses to move packets end-to-end, possibly across many routers. Protocols like ARP bridge the two by finding the MAC address corresponding to a known IP.
在 TCP/IP 协议栈中，网络接入层（或链路层）使用 MAC 地址在同一本地网络的设备间投递帧。互联网层使用 IP 地址进行端到端的数据包传递，可能跨越多个路由器。像 ARP 这样的协议通过查找已知 IP 对应的 MAC 地址来衔接两者。
Another common error is to confuse the roles of TCP and UDP. TCP provides reliable, ordered delivery with error checking and flow control; UDP is connectionless and faster but does not guarantee delivery. Use a table to remember the differences.
另一个常见误区是混淆 TCP 和 UDP 的角色。TCP 提供可靠的、有序的传送，具备差错校验和流量控制；UDP 是无连接的，速度更快，但不保证送达。可以用表格来记住区别。
| Protocol | Connection | Reliability | Typical Use |
| TCP | Connection-oriented | Guaranteed delivery, ordered | Web browsing, email |
| UDP | Connectionless | No guarantee, faster | VoIP, video streaming |
10. Logic Gates: Truth Tables and Circuit Design | 逻辑门：真值表与电路设计
A subtle mistake is thinking that the output of a logic gate is always a single 0 or 1, forgetting that real circuits have propagation delays, but for Boolean logic we ignore that. A more exam-relevant error is constructing a truth table for a multi-level circuit incorrectly by not following the operator precedence. Always work from the innermost gates outward, annotating intermediate outputs.
一种细微的误解是认为逻辑门的输出总是单个 0 或 1，忘了实际电路存在传播延迟，但布尔逻辑中我们忽略这点。与考试更相关的错误是：构造多层电路的真值表时，没有遵循运算顺序。一定要从最内层门电路向外计算，并标注中间输出。
Another common confusion is between AND, OR, and XOR. Students sometimes treat XOR as simply 'either A or B is 1', including the case where both are 1. XOR (exclusive OR) outputs 1 only when inputs are different. For the AND gate, output is 1 only when all inputs are 1. Use clear truth tables:
另一个常见混淆是 AND、OR 与 XOR 的区别。学生有时将 XOR 仅理解为“A 或 B 为 1”，连两者均为 1 也算进去。实际上异或门 (XOR) 仅在输入不同时输出 1。与门 (AND) 则只在所有输入均为 1 时输出 1。使用清晰的真值表：
AND gate truth table:
- 0 AND 0 = 0
- 0 AND 1 = 0
- 1 AND 0 = 0
- 1 AND 1 = 1
XOR gate truth table:
- 0 XOR 0 = 0
- 0 XOR 1 = 1
- 1 XOR 0 = 1
- 1 XOR 1 = 0
When given a logic diagram, carefully label each wire with its expression, e.g., A AND B, then apply the next gate. Practice converting between Boolean expressions and gate diagrams, and be comfortable with De Morgan's laws for simplifying circuits.
拿到逻辑图时，仔细给每根线标上表达式，如 A AND B，然后套用下一个门。练习布尔表达式和门电路图之间的转换，并熟练掌握用于简化电路的德摩根定律。
In Eduqas papers, you might also be asked about the NOT gate feeding into an AND gate, producing a NAND function if both inputs are united. Avoid shortcuts: draw the full truth table when uncertain.
在 Eduqas 考卷中，还可能遇到非门输出接与门的情形，如果两输入合一则产生与非功能。不确定时不要走捷径：画出完整的真值表。
11. CPU and Von Neumann Architecture: Misunderstanding the Fetch-Decode-Execute Cycle | CPU 与冯·诺依曼架构：误解取指-解码-执行周期
Many students think that the CPU simply executes instructions in one step. The Von Neumann architecture specifies a cycle: Fetch the instruction from memory (address in PC), Decode it in the CU, then Execute it (often involving the ALU). The Program Counter (PC) holds the address of the next instruction; after fetching, it increments. Without this cycle, the CPU cannot function.
许多学生以为 CPU 一步就执行完指令。冯·诺依曼架构规定了一个周期：从内存中取指（地址在 PC 中），在控制单元中解码，然后执行（往往涉及 ALU）。程序计数器 (PC) 存有下一条指令的地址；取指后它递增。没有这个周期，CPU 无法工作。
Another misconception: the amount of RAM directly determines the processing speed. RAM size affects how many programs or data can be held simultaneously, not the clock speed. A larger RAM can reduce the need for virtual memory paging, but does not make the processor faster.
另一个误区：内存 (RAM) 的大小直接决定处理速度。RAM 容量影响能同时存放多少程序或数据，而不影响时钟频率。更大的 RAM 可能减少虚拟内存页面交换，但不会让处理器更快。
Correct definitions: the ALU performs arithmetic and logic operations; the CU coordinates all activities, sends control signals; registers like ACC, MAR, MDR are small, fast storage locations inside the CPU. Knowing the difference between address bus, data bus, and control bus is essential. The address bus carries memory addresses (unidirectional), the data bus carries actual data (bidirectional), and the control bus carries timing and control signals.
准确定义：ALU 执行算术与逻辑运算；CU 协调所有活动，发送控制信号；寄存器如 ACC、MAR、MDR 是 CPU 内部的小容量高速存储位置。了解地址总线、数据总线和控制总线的区别至关重要。地址总线传送内存地址（单向），数据总线传送实际数据（双向），控制总线传送时序与控制信号。
12. Cybersecurity and Ethical Misconceptions | 网络安全与伦理误区
Students frequently conflate a virus with a worm, or think that firewalls prevent all attacks. A virus attaches itself to a host program and requires user action to spread; a worm is self-replicating and spreads over networks without human intervention. A firewall monitors incoming and outgoing traffic based on predetermined rules but cannot stop infected USB drives or social engineering attacks.
学生经常混淆病毒和蠕虫，或认为防火墙能阻止一切攻击。病毒附加在宿主程序上，需要用户操作才能传播；蠕虫则是自我复制，无需人为干预就能通过网络扩散。防火墙根据预设规则监控进出流量，但无法阻止受感染的 U 盘或社会工程攻击。
Encryption misconceptions: some learners think encryption makes data unhackable. Strong encryption, using modern algorithms like AES, makes data unreadable without the key, but does not prevent denial of service attacks or keylogging. Also, remember the difference between plaintext, ciphertext, and key.
关于加密的误区：有些学习者以为加密能使数据无法被破解。使用现代算法如 AES 的强加密确实能使数据在无密钥时不可读，但不能预防拒绝服务攻击或键盘记录。同时，要记住明文、密文和密钥之间的区别。
On ethical and legal points, Eduqas often asks about the Data Protection Act, Computer Misuse Act, and ethical issues like e-waste. A common mistake is stating that using copyrighted software without permission is 'illegal but not unethical'. In most cases, it is both. Distinguish between legislation and ethical considerations clearly: legislation is the law; ethics is about right and wrong, even when no law is broken.
在伦理与法律要点上，Eduqas 常考《数据保护法》《计算机滥用法》以及电子废弃物等伦理问题。常见的错误是说未经许可使用版权软件“违法但不违背伦理”。多数情况下，这既违法也不道德。要清楚区分立法与伦理考量：立法是法律；伦理关乎对错，即使不违法也需考虑。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图