📚 Common Mistakes in Year 11 Eduqas Computer Science and How to Fix Them | Year 11 Eduqas 计算机常见误区与纠正方法
Year 11 students following the Eduqas GCSE Computer Science specification often run into the same tricky topics. This article identifies the most common misunderstandings and provides clear corrections to help you avoid losing marks in exams. Each point is presented in both English and Chinese to support bilingual learners.
学习 Eduqas GCSE 计算机课程的 Year 11 学生经常在一些具有欺骗性的知识点上犯同样的错误。本文梳理了最常见的误区，并给出清晰的纠正方法，帮助你在考试中避免丢分。每个要点都用中英双语呈现，方便双语学习者理解。
1. Binary to Denary Conversion – Weighting Order Errors | 二进制转十进制 – 权重顺序出错
A frequent mistake is assigning the wrong place values when converting binary to denary. Students might start from the right with weights 1, 2, 3, 4 instead of 1, 2, 4, 8, forgetting that each column represents a power of two.
将二进制转换为十进制时，最常见的错误是给错了位权。学生可能从右边开始把位权写成 1、2、3、4，而实际上应该是 1、2、4、8，忘记了每一列都代表 2 的幂。
Correction: Always begin from the least significant bit (rightmost) as 2⁰ (1), then the next as 2¹ (2), 2² (4), 2³ (8), and so on, doubling each time you move left. For an 8-bit number the weights are: 128, 64, 32, 16, 8, 4, 2, 1. Sum only the positions that contain a 1.
纠正方法：始终从最右边的最低有效位开始，权值为 2⁰ (1)，接着是 2¹ (2)，2² (4)，2³ (8)，向左每移一位权值加倍。对于 8 位二进制数，列权依次为：128, 64, 32, 16, 8, 4, 2, 1。只需将对应位为 1 的权值相加即可。
2. Logic Gate Symbols and Truth Tables | 逻辑门符号与真值表混乱
Many learners confuse the shapes and behaviours of AND, OR, NAND and NOR gates. They might treat a NAND gate as an OR or write the truth table of an AND gate for an OR gate.
很多学习者会混淆 AND、OR、NAND 和 NOR 门的形状和行为。他们可能把 NAND 门当作 OR 门，或者把 AND 门的真值表写到 OR 门上。
Correction: Recognise each gate by its distinctive shape: AND has a flat back and round nose (looks like a D); OR has a curved back and a pointed nose. The bubble at the output negates the result. NAND is an AND followed by a NOT bubble; its output is the opposite of AND. Memorise the truth tables: AND output is 1 only when all inputs are 1; OR output is 1 when at least one input is 1; NAND output is 0 only when all inputs are 1; NOR output is 1 only when all inputs are 0. De Morgan's laws help: a NAND gate is equivalent to an OR gate with inverted inputs, but in exams usually you just need to recall the truth tables directly.
纠正方法：根据独特的形状识别每一种门：AND 门背部平直、前端为圆弧（像 D）；OR 门背部弯曲、前端为尖头。输出端的小圆圈表示取反。NAND 就是一个 AND 加上非门小圈，其输出与 AND 相反。背诵真值表：AND 只有所有输入为 1 时输出才为 1；OR 只要至少一个输入为 1 输出就是 1；NAND 只有所有输入为 1 时输出才为 0；NOR 只有所有输入为 0 时输出才为 1。德摩根律也能帮助理解：NAND 门等效于输入取反后的 OR 门，但考试中通常只需直接记忆真值表。
3. Representing Images – Resolution vs. Colour Depth | 图像表示 – 分辨率与颜色深度
A common mix-up is to think that “resolution” olour depth (or bit depth) is the number of bits used to represent the colour of each pixel.
常见的混淆是以为“分辨率”指的是图像中的颜色数。事实上，分辨率是像素数量（宽 × 高），而颜色深度（也称位深）是用于表示每个像素颜色的二进制位数。
Correction: you convert to bytes by dividing by 8. A higher resolution gives sharper detail, while a higher colour depth allows more colours. For example, a colour depth of 1 bit gives only 2 colours (2¹), 8 bits give 256 colours (2⁸), and 24 bits give about 16.7 million colours (2²⁴). Students often forget to multiply by colour depth or treat resolution as colour information.
纠正方法：未压缩位图的文件大小可以用公式计算：宽 × 高 × 颜色深度（比特）。通常你还要除以 8 转换为字节。分辨率越高，图像越清晰；颜色深度越高，可用颜色越多。例如，1 位的颜色深度只能提供 2 种颜色（2¹）；8 位可提供 256 种颜色（2⁸）；24 位可提供约 1670 万种颜色（2²⁴）。学生经常忘记乘颜色深度，或者把分辨率当作颜色信息。
4. Sound Sampling – Sample Rate and Bit Depth | 声音采样 – 采样率与比特深度
Students often believe that only sample rate or only bit depth determines sound quality. Actually, both together affect the accuracy and file size of digital audio.
学生常常以为只有采样率或只有比特深度决定音质。实际上，两者共同影响数字音频的准确度和文件大小。
Correction: ency in the sound to reproduce it accurately. Bit depth is the number of bits used to record each sample; higher bit depth reduces quantisation noise and gives a wider dynamic range. File size per second = sample rate × bit depth × number of channels. For stereo, multiply by 2. Quality improves when both are higher, but so does file size.
纠正方法：采样率是每秒采样的次数（赫兹）。根据奈奎斯特定理，采样率必须至少是声音最高频率的两倍才能准确重现。比特深度是用于记录每个样本的比特数；更高的比特深度能降低量化噪声，提供更大的动态范围。每秒文件大小 = 采样率 × 比特深度 × 声道数。立体声需再乘以 2。两者同时提高可以提升音质，但文件也会变大。
5. Binary Shifts and Multiplication/Division | 二进制位移与乘除法
A common misunderstanding is to treat a left shift as simply “adding a zero at the front” without linking it to multiplication, or to confuse the direction of shifts with division.
一个常见的误解是，仅仅把左移看成“在前面加一个零”，没有把它与乘法联系起来，或者混淆移动方向与除法之间的关系。
Correction: (integer division, discarding remainder). For example, 00001100 (12 in denary) left-shifted once becomes 00011000 (24), which equals 12×2. Right-shifted once becomes 00000110 (6), which equals 12÷2. When shifting left, bits may fall off the left end – ting right may cause underflow if you need fractional results but can only store integers.
纠正方法：逻辑左移 n 位等于将无符号二进制数乘以 2ⁿ。逻辑右移 n 位等于将无符号二进制数除以 2ⁿ（整数除法，丢弃余数）。例如，00001100（十进制 12）左移一位得到 00011000（24），即 12×2。右移一位得到 00000110（6），即 12÷2。左移时，最左边的位可能被移丢——如果结果无法在有效位数中存储，就会发生溢出错误。右移时，如果需要小数结果但只能存储整数，就会发生下溢。
6. Integer Division (DIV) and Modulus (MOD) | 整数除法与取模
In programming tasks, students often misuse DIV and MOD. They might use MOD when they need the quotient, or forget that DIV gives the whole-number part of the division while MOD gives the remainder.
在编程作业中，学生常常误用 DIV 和 MOD。他们可能在本该求商的时候使用了 MOD，或者忘记 DIV 给出的是除法中的整数商，而 MOD 给出的是余数。
Correction: = 2. These are widely used in algorithms for extracting digits, checking divisibility, and converting between number bases. Always test with small numbers first to be sure you are using the right operation.
纠正方法：对于两个整数 a 和 b，a DIV b 返回整数商（忽略余数），而 a MOD b 返回余数。例如：17 DIV 5 = 3，17 MOD 5 = 2。它们在提取数字位、检查整除性以及进制转换等算法中非常常用。最好先用小数字测试，确保自己用的是正确的操作。
7. Array Indexing from Zero – Off-by-One Errors | 数组从零索引 – 差一错误
Many beginners assume that the first element of an array is at position 1. In most programming languages, including Python (which Eduqas uses), indexing starts at 0. Off-by-one errors lead to accessing the wrong data or ‘index out of range’ errors.
许多初学者想当然地认为数组的第一个元素位于位置 1。然而在大多数编程语言中，包括 Eduqas 使用的 Python，索引是从 0 开始的。差一错误会导致访问到错误的数据，或者引发“索引超出范围”错误。
Correction: gh 9. Accessing index 10 would be out of bounds. When writing loops, use for i in range(n) – this automatically gives i = 0,1,…,n−1. When manually referencing positions, double-check your index arithmetic.
纠正方法：请记住：如果一个数组有 n 个元素，有效索引值从 0 到 n-1。例如，包含 10 个元素的数组，其索引是 0 至 9。访问索引 10 会导致越界。编写循环时使用 for i in range(n)，它会自动产生 i = 0,1,…,n−1。手动引用位置时，一定要反复检查索引计算是否正确。
8. Sorting Algorithms – Bubble vs. Insertion | 排序算法 – 冒泡排序与插入排序
Students frequently confuse the number of passes and comparisons in bubble sort and insertion sort. Some believe bubble sort always requires fewer swaps, or that insertion sort performs the same number of comparisons regardless of initial order.
学生经常把冒泡排序和插入排序的趟数和比较次数搞混。有人以为冒泡排序总是需要更少的交换，或者认为无论初始顺序如何，插入排序的比较次数都是固定的。
Correction: Bubble sort works by repeatedly swapping adjacent items if they are in the wrong order. In the worst case, it requires (n−1) passes and about n(n−1)/2 comparisons. It always makes passes even if the list becomes sorted early unless a ‘swapped’ flag is used to stop. Insertion sort builds a sorted portion by taking one item at a time and inserting it into its correct position. It can perform fewer comparisons if the data is nearly sorted. Neither algorithm is the most efficient for large datasets, but you must be able to trace both for the exam.
纠正方法：冒泡排序通过重复交换相邻的逆序元素来工作。最坏情况下需要 (n−1) 趟和大约 n(n−1)/2 次比较。即使列表提前排好，它依然会跑完所有趟数，除非使用“已交换”标记提前终止。插入排序通过逐个将元素插入已排序部分的正确位置来构建有序序列。如果数据接近有序，它的比较次数会更少。这两种算法均非处理大数据集的最优解，但考试中你必须能够手工追踪它们的执行过程。
9. Networking – Star vs. Bus Topology | 网络拓扑 – 星型拓扑与总线型拓扑
Some students think a star network does not rely on a central device, or that a bus topology uses a switch just like a star. They also mix up the advantages related to fault tolerance and cost.
有些学生以为星型网络不依赖中心设备，或者认为总线型拓扑像星型一样使用交换机。他们还会混淆这两种拓扑在容错能力和成本方面的优点。
Correction: In a star topology, all nodes connect to a central switch or hub. If one cable fails, only that node is affected, but if the central device fails, the whole network goes down. It is generally more expensive due to cabling. In a bus topology, all nodes share a single backbone cable. A cable break can split the network or bring it all down. Bus is cheaper to set up but more difficult to troubleshoot. Be clear about the consequences of component failure for each topology.
纠正方法：在星型拓扑中，所有节点都连接到一台中央交换机或集线器上。如果某根线缆断了，只有该节点受影响；但如果中心设备故障，整个网络就会瘫痪。这种拓扑由于需要大量线缆，成本通常较高。在总线型拓扑中，所有节点共用一条主干电缆。线缆一处断裂可能会分割网络或导致全网中断。总线型建设成本较低，但排错更困难。务必清楚每种拓扑中部件失效所带来的后果。
10. Cybersecurity – Encryption vs. Hashing and Firewall vs. Anti‑virus | 网络安全 – 加密与哈希及防火墙与防病毒的区别
Learners often regard encryption and hashing as interchangeable, or think a firewall is the same as an anti‑virus program. These misconceptions lead to incorrect descriptions of security measures.
学习者常把加密和哈希看作可以互换的概念，或者以为防火墙和防病毒软件是一回事。这些误解会导致描述安全措施时出错。
Correction: Encryption scrambles data using a key; the process is reversible with the correct key (decryption). Hashing produces a fixed-length digest that cannot be reversed to retrieve the original data; it is used to verify data integrity and for storing passwords. A firewall monitors and filters incoming and outgoing network traffic based on predefined rules – it is a barrier between a trusted network and an untrusted one. An anti‑virus (or anti‑malware) program scans storage and memory for malicious software and removes or quarantines it. They complement each other but serve different purposes.
纠正方法：加密通过密钥将数据打乱，且这个过程是可以逆转的（通过正确的密钥解密）。哈希则生成固定长度的摘要，无法反向还原出原始数据，因此广泛用于验证数据完整性和存储密码。防火墙根据预定义规则监控并过滤进出网络的流量——它是可信网络与不可信网络之间的屏障。防病毒（或反恶意软件）程序会扫描存储器和内存中的恶意软件，并将其删除或隔离。两者互为补充，但用途不同。
11. High‑Level vs. Low‑Level Languages – Assembly and Machine Code | 高级语言与低级语言 – 汇编语言和机器码
A typical error is to claim that assembly language is the same as machine code. Students may also describe a high‑level language as being “understood directly by the processor” or overlook the need for translators.
一个典型错误是声称汇编语言就是机器码。学生还可能说高级语言“可以直接被处理器理解”，或者忽视翻译器的必要性。
Correction: Machine code is the binary instructions executed directly by the CPU – each instruction is a pattern of bits, difficult for humans to read. Assembly language uses mnemonics (e.g. LOAD, ADD, STORE) that have a one‑to‑one correspondence with machine code instructions, but it still requires an assembler to translate it into machine code. High‑level languages (Python, Java) use English‑like statements and must be translated by a compiler or interpreter. Knowing the differences in readability, portability, and translation process is essential for the exam.
纠正方法：机器码是 CPU 直接执行的二进制指令——每条指令都是一串位模式，人类很难阅读。汇编语言使用助记符（如 LOAD、ADD、STORE），与机器码指令一一对应，但仍然需要汇编器将其翻译成机器码。高级语言（如 Python、Java）使用接近自然语言的语句，必须经编译器或解释器翻译。理解它们在可读性、可移植性和翻译过程上的区别对考试至关重要。
12. Overflow Errors and Signed/Unsigned Binary | 溢出错误与有符号/无符号二进制
Students frequently perform binary addition and obtain a result with more bits than allowed, but they do not recognise that an overflow has occurred. Moreover, they may treat the result of a two’s complement addition as if it were an unsigned number, leading to a completely wrong value.
学生进行二进制加法后经常会得到一个超出允许位数的结果，却不认为自己发生了溢出。此外，他们可能把补码加法的结果当作无符号数来理解，从而得到完全错误的值。
Correction: When adding two n‑t binary numbers, an overflow occurs if the result needs n+1 bits to be stored. In a fixed‑ ving a wrong answer. With unsigned numbers, a carry out of the most significant bit indicates overflow. With two’s complement representation, the rules are different: overflow happens when the carry into the sign bit differs from the carry out of the sign bit. Practice detecting overflow in both contexts using simple examples like 0111 + 0001 (for 4‑ rflows because 8 needs 4 bits as 1000; for signed two’s complement, 0111 is +7, 0001 is +1, correct answer +8 cannot be represented in 4‑ ge −8..+7, so overflow occurs). Always check the expected range before accepting a result.
纠正方法：当两个 n 位二进制数相加时，如果结果需要 n+1 位来存储，便发生了溢出。在固定宽度的系统中，多出的位会丢失，导致答案错误。对于无符号数，最高位的进位表示溢出。在二进制补码表示法中，规则有所不同：当进入符号位的进位与符号位产生的进位不同时，溢出就会发生。建议通过简单例子练习两种情景下的溢出检测，比如 0111 + 0001（对于 4 位无符号数，这是 7+1=8，而 8 需要 4 位表示为 1000，因此溢出；对于 4 位有符号补码，0111 是 +7，0001 是 +1，正确结果 +8 无法在 −8..+7 的范围内表示，所以溢出）。在接纳结果之前，永远先检查允许的数值范围。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图