📚 GCSE OCR Computer Science: Common Mistakes in Exam Questions Explained | GCSE OCR 计算机：易错题精讲
In GCSE OCR Computer Science, exam questions are designed to probe a deep understanding of core concepts, yet certain topics routinely trip up even well-prepared candidates. This article walks through a selection of common pitfalls gathered from past paper mark schemes and examiner reports, presenting typical mistakes and the correct reasoning needed to secure full marks. Each section addresses a specific topic area, pairing an explanation of the error with a step-by-step corrected approach.
在 GCSE OCR 计算机科学课程中，考试题目旨在考查学生对核心概念的深层理解，但有些知识点即使对准备充分的考生来说也经常容易出错。本文根据历年真题评分方案和考官报告，选取了一系列常见易错点，展示了典型错误以及获得满分所需的正确推理。每个小节介绍一个具体的易错主题，将错误分析与逐步纠正的方法配对讲解。
1. Binary Addition and Overflow | 二进制加法与溢出
A common mistake is performing binary addition correctly but failing to recognise when an overflow has occurred, or incorrectly stating that the result is invalid. Consider the question: ‘Add the 8-bit unsigned binary numbers 11001011 and 01110101. Explain if overflow occurs.’ Many students compute the sum as 110000000 (9 bits) and then simply drop the extra leftmost bit, treating the remaining 8 bits as the answer without flagging overflow.
一个常见错误是能正确进行二进制加法，但未能识别何时发生溢出，或者错误地指出结果无效。典型的题目是：“将 8 位无符号二进制数 11001011 与 01110101 相加，并说明是否发生溢出。”许多学生会算得结果为 110000000（9 位），然后直接将多出的最左位丢弃，把剩下的 8 位当作答案，却没有指出溢出。
In unsigned 8-bit addition, the valid range is 0 to 255. The two numbers are 203 + 117 = 320, which exceeds 255. When the sum produces a carry into a 9th bit, overflow has definitely occurred. The correct response is to show the full 9-bit sum, mark the carry out, and state that overflow happens because the result cannot be represented in 8 bits. The 8-bit result alone is meaningless without this acknowledgement.
在无符号 8 位加法中，有效范围是 0 到 255。这两个数分别是 203 + 117 = 320，超出了 255。当求和结果产生第 9 位的进位时，溢出绝对已经发生。正确的做法是写出完整的 9 位和，标出进位，并说明由于结果无法用 8 位表示而发生了溢出。若不承认溢出，仅给出 8 位结果本身是毫无意义的。
1 1 1 1 1 1 1 1 (carries)
11001011
+ 01110101
──────────
1 01000000 → Overflow
进位：1 1 1 1 1 1 1 1
11001011
+ 01110101
──────────
1 01000000 → 溢出
2. Two’s Complement and Negative Range | 补码与负数范围
When converting a negative denary number into 8-bit two’s complement, many students memorise the ‘flip the bits and add 1’ rule but stumble when applying it to the magnitude. For example, the question: ‘Represent -27 in 8-bit two’s complement.’ A typical error is to write +27 as 00011011, flip the bits to 11100100, and then incorrectly add 1 to the least significant bit, getting 11100101 but believing the answer should be a different pattern because they misread the bit positions.
当将负的十进制数转换为 8 位补码时，很多学生记住了“取反加一”的规则，但在应用绝对值时容易出错。例如，题目：“用 8 位补码表示 -27。”一个典型错误是写出 +27 为 00011011，取反得到 11100100，然后错误地在最低有效位加 1 时得到 11100101，却因为误读了位的位置而认为答案会是另一种模式。
The correct method: +27 in 8-bit binary is 00011011. Flip all bits: 11100100. Add 1: 11100100 + 1 = 11100101. This is indeed -27. The confusion often arises when students try to verify by converting back: starting from 11100101, they flip bits to 00011010, add 1 to get 00011011 (27), but then fail to attach the negative sign, or they forget that the most significant bit indicates negative. Another error is stating the range of 8-bit two’s complement as -128 to +128, when it is actually -128 to +127 because of the asymmetry.
正确方法：+27 的 8 位二进制是 00011011。将所有位取反：11100100。加 1：11100100 + 1 = 11100101。这确实就是 -27。当学生试图通过反向转换来验证时，往往会产生困惑：从 11100101 取反得到 00011010，加 1 得到 00011011（27），但忘记附上负号，或者忘记了最高有效位表示负数。另一个常见错误是说 8 位补码的范围是 -128 到 +128，而实际范围因不对称性应该是 -128 到 +127。
3. Hexadecimal and Binary Conversion Pitfalls | 十六进制与二进制转换易错点
OCR exams frequently ask for conversions between hexadecimal and binary, and a common slip is misgrouping bits or misreading nibbles. For instance, convert the binary number 10011110 to hex. Students sometimes split it as 1001 1110 correctly, translating 1001 to 9 and 1110 to E, giving 9E. The mistake occurs when they convert 1110 as 14 but write ‘D’ or ‘F’, or when the binary number has fewer than 8 bits and they do not pad with leading zeros before grouping.
OCR 考试经常要求十六进制与二进制之间的转换，一个常见的失误是位的分组错误或半字节（nibble）的误读。例如，将二进制数 10011110 转换为十六进制。学生们可能会正确地将其分成 1001 1110，并将 1001 转换为 9，1110 转换为 E，得到 9E。出错的情况是当他们将 1110 当作 14 却写成了字母 ‘D’ 或 ‘F’，或者当二进制数不足 8 位时，他们在分组之前没有在前面补零。
Always ensure the binary string has a multiple of 4 bits by adding leading zeros if needed. For the number 10101, pad to 00010101, then split into 0001 0101, giving 15₁₆. Also watch out for converting hex to binary: each hex digit must become exactly 4 bits. For 3F, 3 is 0011 and F is 1111, so the answer is 00111111 or simply 111111. Missing leading zeros can cost a mark, especially in questions that specify an 8-bit register.
务必确保二进制串的位数是 4 的倍数，必要时在前面补零。对于数字 10101，补零为 00010101，然后分成 0001 0101，得到 15₁₆。同时注意十六进制转二进制时，每个十六进制数字必须恰好变成 4 位。对于 3F，3 是 0011，F 是 1111，所以答案是 00111111 或直接写 111111。如果指定了 8 位寄存器，漏掉前导零就可能丢分。
4. Logic Gates: NAND vs NOR Confusion | 逻辑门：NAND 与 NOR 混淆
A classic exam pitfall is mixing up the symbols and truth tables for NAND and NOR gates, especially when completing a logic circuit diagram or writing a Boolean expression. The NAND gate output is 0 only when all inputs are 1; otherwise it is 1. The NOR gate output is 1 only when all inputs are 0. Students often apply the AND rule to NAND or the OR rule to NOR by writing the opposite of what is required.
一个经典的考试易错点是混淆 NAND 门和 NOR 门的符号与真值表，尤其是在补全逻辑电路图或编写布尔表达式时。NAND 门仅在所有输入都为 1 时输出 0，否则输出 1。NOR 门仅在所有输入都为 0 时输出 1。学生们常常将 AND 规则套用到 NAND，或将 OR 规则套用到 NOR，写出了与要求相反的结果。
| A | B | NAND | NOR |
|---|---|---|---|
| 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
To avoid confusion, remember the word origin: NAND = Not AND, so its output is the inverse of an AND gate. NOR = Not OR. If you can draw the AND gate output and then invert it, you get the NAND output. The same applies for NOR. Also, in Boolean algebra, A NAND B is written as ¬(A ∧ B); A NOR B is ¬(A ∨ B). When simplifying expressions, applying De Morgan’s laws incorrectly is another common error: ¬(A ∧ B) = ¬A ∨ ¬B, not ¬A ∧ ¬B.
为避免混淆，记住词源：NAND = Not AND，所以它的输出是 AND 门输出的反相。NOR = Not OR。如果你能画出 AND 门的输出再取反，就得到了 NAND 的输出。NOR 同理。此外，在布尔代数中，A NAND B 写作 ¬(A ∧ B)；A NOR B 写作 ¬(A ∨ B)。在简化表达式时错误地应用德摩根律是另一个常见错误：¬(A ∧ B) = ¬A ∨ ¬B，而不是 ¬A ∧ ¬B。
5. Primary vs Secondary Storage in Context | 主存与辅助存储的情境混淆
Questions that ask ‘Explain why a smartphone uses both RAM and flash storage’ often elicit answers that swap their roles. A frequent mistake is claiming that RAM is used to store apps permanently, or that flash memory provides the working memory for currently running programs. The critical distinction is that RAM is volatile and fast, used for data the CPU is actively processing, while flash storage (secondary) is non-volatile and holds the operating system, apps and user files when the power is off.
针对“解释为什么智能手机同时使用 RAM 和闪存”这类题目，经常会出现将这两者作用颠倒的答案。一个常见的错误是说 RAM 用来永久存储应用程序，或者说闪存为当前运行的应用程序提供工作内存。关键区别在于：RAM 是易失性且速度快，用于存放 CPU 正在处理的数据，而闪存（辅助存储）是非易失性的，在断电时保存操作系统、应用程序和用户文件。
Another nuance appears in embedded systems: some exam questions ask why ROM is used instead of a hard disk. Students confuse ROM with RAM and say ‘ROM is volatile’ or ‘ROM is used to store user data’. Actually, ROM is non-volatile and stores firmware / boot instructions. A common mark-losing mistake is using the term ‘memory’ without specifying ‘primary’ or ‘secondary’, and thereby mixing up characteristics like capacity and speed.
另一个细微差别出现在嵌入式系统中：有些考题会问为什么使用 ROM 而不是硬盘。学生们会将 ROM 与 RAM 混淆，说“ROM 是易失性的”或“ROM 用来存储用户数据”。实际上，ROM 是非易失性的，用于存放固件/引导指令。另一个经常导致丢分的错误是使用“内存”一词而不指明是“主存”还是“辅助存储”，进而混淆了容量和速度等特性。
6. Network Protocols and the TCP/IP Stack | 网络协议与 TCP/IP 协议栈
When asked to describe the layers of the TCP/IP model or match protocols to layers, students frequently misplace HTTP and FTP, or they confuse the Transport and Application layers. A typical error is stating ‘HTTP operates at the Transport layer’ because it uses TCP. In reality, HTTP is an Application layer protocol that relies on TCP at the Transport layer for reliable delivery.
当被要求描述 TCP/IP 模型的各层或将协议与层次进行匹配时，学生们经常会弄错 HTTP 和 FTP 的位置，或者混淆传输层和应用层。一个典型错误是说“HTTP 在传输层工作”，因为它使用了 TCP。实际上，HTTP 是一个应用层协议，它依赖于传输层的 TCP 来提供可靠交付。
The four-layer TCP/IP model (as per OCR) consists of Application, Transport, Internet, and Network Interface. Common protocol assignments: Application – HTTP, FTP, SMTP, DNS; Transport – TCP, UDP; Internet – IP; Network Interface – Ethernet, Wi-Fi. A mistake also occurs when students say ‘IP ensures reliable delivery’. It does not; TCP on the Transport layer handles reliability. Also, be careful with DNS: it uses UDP (or TCP) for transport, but itself sits in the Application layer.
根据 OCR 的四层 TCP/IP 模型，包括应用层、传输层、互联网层和网络接口层。常见的协议分配如下：应用层——HTTP、FTP、SMTP、DNS；传输层——TCP、UDP；互联网层——IP；网络接口层——以太网、Wi-Fi。学生们还会犯的一个错误是说“IP 保证可靠传输”。实际上 IP 并不保证，可靠传输是由传输层的 TCP 来处理的。另外要注意 DNS：它使用 UDP（或 TCP）进行传输，但它本身位于应用层。
7. Cybersecurity Threats: Phishing vs SQL Injection | 网络安全威胁：网络钓鱼与 SQL 注入
OCR examiners report that candidates often conflate different cyberattack methods, especially phishing, pharming, SQL injection and denial-of-service (DoS) attacks. A question might present a scenario: ‘A user receives an email claiming to be from their bank asking them to click a link and enter their password.’ The expected answer is phishing, but some students incorrectly label it as pharming or even a virus. The distinction: phishing uses deceptive emails to trick users into revealing personal data, whereas pharming redirects a website’s traffic to a fake site without the user’s knowledge.
OCR 考官报告指出，考生经常混淆不同的网络攻击方法，尤其是网络钓鱼、域欺骗、SQL 注入和拒绝服务（DoS）攻击。考题可能会给出一个场景：“用户收到一封声称来自银行的电子邮件，要求其点击链接并输入密码。”预期的答案是网络钓鱼，但有些学生错误地把它标记为域欺骗，甚至是病毒。其区别在于：网络钓鱼利用欺骗性邮件诱骗用户泄露个人数据，而域欺骗则是在用户不知情的情况下将网站流量重定向到伪造站点。
Another classic mix-up is describing SQL injection as a type of virus or saying ‘it encrypts data’. SQL injection is the act of inserting malicious SQL queries via input fields to manipulate a database. For example, entering ‘ OR ‘1’=’1′ into a username field to bypass authentication. Students should be able to identify the attack type and suggest mitigation, such as input validation, parameterised queries and using least privilege for database accounts.
另一个经典的混淆是将 SQL 注入描述为一种病毒，或者说“它加密数据”。SQL 注入是通过输入字段插入恶意 SQL 查询来操纵数据库的行为。例如，在用户名字段中输入 ‘ OR ‘1’=’1′ 来绕过认证。学生应能够识别攻击类型，并提出缓解措施，如输入验证、使用参数化查询以及为数据库帐户设置最小权限。
8. Pseudocode Loops: Off-by-One Errors | 伪代码循环：边界错误
Questions that require tracing or writing pseudocode for FOR and WHILE loops commonly catch students out with off-by-one mistakes. In a typical problem: ‘FOR i ← 1 TO n’ loops n times, but if the loop body uses i as an array index starting from 0, students may write array[i] instead of array[i-1] and then wonder why the output is shifted.
要求跟踪或编写 FOR 和 WHILE 循环伪代码的题目，经常会让学生犯下 off-by-one（差一）错误。一个典型题目：’FOR i ← 1 TO n’ 循环 n 次，但如果循环体使用 i 作为数组索引且索引从 0 开始，学生可能会写成 array[i] 而不是 array[i-1]，然后感到困惑为什么输出会错位。
Another scenario: ‘WHILE count < 5' runs while count is 0,1,2,3,4 – that is five iterations. Students often assume the loop stops when count equals 5, but they miscalculate the number of iterations as four. The same goes for 'REPEAT... UNTIL count = 5': this loop will execute 5 times (assuming count starts at 0) because the condition is checked at the end. Knowing the difference between pre-condition and post-condition loops is essential for trace table accuracy.
另一种情形：’WHILE count < 5' 会在 count 为 0、1、2、3、4 时运行——即五次迭代。学生们经常以为当 count 等于 5 时循环停止，却错误地认为迭代次数为四次。这对于 'REPEAT... UNTIL count = 5' 也是如此：该循环将执行 5 次（假设 count 从 0 开始），因为条件在末尾检查。理解前置条件循环与后置条件循环的区别，对于正确填写跟踪表至关重要。
9. Sorting Algorithms: Describing Steps Correctly | 排序算法：正确描述步骤
‘Describe how a bubble sort works on this list’ is a common 4–6 mark question, and marks are lost when students give an incomplete description, such as ‘swap the numbers if they are in the wrong order’ without mentioning passes or when the algorithm stops. The bubble sort repeatedly passes through the list, comparing adjacent pairs and swapping if they are out of order. It stops when a full pass is made with no swaps.
“描述冒泡排序如何对这个列表进行排序”是一类常见的 4–6 分题目，如果学生给出不完整的描述，比如只说“如果顺序不对就交换数字”，而不提及趟（passes）或者算法何时停止，就会丢分。冒泡排序重复遍历列表，比较相邻元素对，并在它们顺序错误时进行交换。当完成一趟遍历且没有发生任何交换时，算法停止。
Students must use correct vocabulary: ‘compare’, ‘swap’, ‘pass’. For insertion sort, another frequent exam algorithm, the common mistake is missing the step where items are ‘shifted’ to create space for the inserted element. Simply saying ‘put the element in the correct place’ is too vague; you must describe taking an unsorted element, comparing it with those in the sorted sublist, shifting larger elements right, and then inserting. Omitting ‘shift’ loses marks.
学生必须使用准确的词汇：“比较”、“交换”、“趟”。对于插入排序这种另一种常考的算法，常见的错误是遗漏了“移动”元素以便为插入元素腾出空间的步骤。简单地说“将元素放到正确位置”过于模糊；你必须描述从未排序部分取出一个元素，将其与已排序子列表中的元素比较，将较大的元素右移，然后进行插入。遗漏“移动”会导致失分。
10. Image Resolution and File Size Calculations | 图像分辨率与文件大小计算
Calculating the file size of a bitmap image trips up many candidates due to incorrect conversion of units or misunderstanding colour depth. A standard question: ‘An image has a resolution of 800 × 600 and uses 16-bit colour depth. Calculate the file size in kilobytes.’ The formula is: resolution width × height × colour depth (in bits). That gives total bits, which must be divided by 8 to get bytes, then by 1024 to get kilobytes. A common error is forgetting to convert bits to bytes, or dividing by 1000 instead of 1024.
计算位图图像文件大小这类题目之所以难倒很多考生，是因为单位换算错误或对色彩深度的误解。标准题目：“一幅图像的分辨率为 800 × 600，使用 16 位色彩深度。计算其文件大小，以千字节为单位。”公式是：分辨率宽 × 高 × 色彩深度（位）。这样可以得出总位数，必须除以 8 得到字节数，再除以 1024 得到千字节数。一个常见错误是忘记将位转换为字节，或者除以 1000 而不是 1024。
The correct calculation: 800 × 600 = 480,000 pixels. 480,000 × 16 bits = 7,680,000 bits. 7,680,000 / 8 = 960,000 bytes. 960,000 / 1024 = 937.5 KB. Students also confuse kilobytes (KB) with kibibytes (KiB) – OCR expects the binary 1024 divisor unless stated otherwise. Pay close attention to whether the question asks for KB or MB, and whether there is metadata to account for (usually ignored unless specified).
正确的计算：800 × 600 = 480,000 像素。480,000 × 16 位 = 7,680,000 位。7,680,000 / 8 = 960,000 字节。960,000 / 1024 ≈ 937.5 KB。学生们还会混淆千字节（KB）与 kibibyte（KiB）——OCR 期望使用二进制除数 1024，除非另有说明。要密切注意题目要求的是 KB 还是 MB，以及是否需要考虑元数据（除非指定，否则通常忽略）。
11. Sound Sampling: Bit Depth and Sample Rate | 声音采样：位深度与采样率
When asked to calculate the file size of a sampled sound, students frequently misuse the formula: duration (seconds) × sample rate (Hz) × bit depth × number of channels. A typical error is forgetting to multiply by the number of channels for stereo, or mixing up Hertz and kilohertz without converting. For example, ‘A 10-second stereo sound is sampled at 44.1 kHz with 16-bit samples. Calculate the file size in bytes.’
当要求计算采样声音的文件大小时，学生们经常误用公式：时长（秒）× 采样率（Hz）× 位深度 × 声道数。一个典型错误是忘了立体声需要乘以声道数，或者混淆了赫兹和千赫兹而未进行转换。例如，“一段 10 秒的立体声以 44.1 kHz 采样，16 位样本。计算文件大小（以字节为单位）。”
The correct steps: Sample rate = 44.1 × 1000 = 44,100 Hz. Total bits = 10 × 44,100 × 16 × 2 (stereo) = 14,112,000 bits. Convert to bytes: 14,112,000 / 8 = 1,764,000 bytes. Dividing by 1024 gives approximately 1722.66 KB. A mistake is treating stereo as just one channel or using 44.1 directly without multiplying by 1000 first. Also, confirm the required unit: sometimes they want the answer in MB; always perform all conversions step by step, showing working to secure method marks.
正确步骤：采样率 = 44.1 × 1000 = 44,100 Hz。总位数 = 10 × 44,100 × 16 × 2（立体声）= 14,112,000 位。转换为字节：14,112,000 ÷ 8 = 1,764,000 字节。再除以 1024 约等于 1722.66 KB。一个错误是将立体声当作单声道处理，或直接用 44.1 而不先乘以 1000。还要确认要求的单位：有时会要求以 MB 为单位的答案；务必逐步进行所有转换，展示计算过程以获取方法分。
12. Legal and Ethical Issues: Misapplying Acts | 法律与道德问题：误用法案
Questions on legislation such as the Computer Misuse Act, Data Protection Act, and Copyright Designs and Patents Act are designed to test application, not just recall. However, students frequently assign the wrong Act to a described scenario. For instance, ‘An employee steals customer data and sells it online’ – this is a breach of the Data Protection Act (unauthorised access to personal data), but some candidates write ‘Computer Misuse Act’, confusing theft of data with hacking. The Computer Misuse Act covers unauthorised access to computer material, and unauthorised acts with intent to impair operation.
关于计算机滥用法、数据保护法以及版权设计与专利法等立法的题目，旨在考查应用能力，而不仅仅是记忆。然而，学生们经常将错误的法案与描述的场景匹配。例如，“一名员工窃取客户数据并在网上出售”——这违反了数据保护法（未经授权访问个人数据），但有些考生会写“计算机滥用法”，混淆了数据盗窃与黑客行为。计算机滥用法涵盖未经授权访问计算机材料，以及意图破坏计算机运行的未经授权行为。
Another tricky area is the overlap between ethical and legal issues. A question might ask ‘Explain one ethical concern about a company using facial recognition without consent.’ Students sometimes respond with legal points (‘it’s illegal under the Data Protection Act’) without addressing ethics. Ethics relate to what is morally right or wrong, even if not illegal. Mistaking the Data Protection Act’s eight principles (in the UK at GCSE) or giving outdated details can also lose marks. Stay current with the principles: data must be processed lawfully, fairly, and transparently; used for specified, explicit purposes; adequate, relevant, and limited; accurate; kept no longer than necessary; and handled securely.
另一个棘手之处是道德与法律问题的交集。题目可能会问“解释公司在未经同意的情况下使用人脸识别的一个道德问题。”学生有时会从法律角度回答（“这在数据保护法下是违法的”），而没有真正涉及道德层面。道德关乎行为在道义上的对错，即使它并不违法。错误表述数据保护法的八项原则（GCSE 阶段英国适用）或提供过时的细节也会导致失分。应掌握最新原则：数据必须合法、公平、透明地处理；用于特定、明确的目的；充分、相关且不过量；准确；保存时间不超过必要期限；并安全处理。
Published by TutorHao | GCSE OCR Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导