📚 Year 11 Eduqas Computer Science: High-Frequency Exam Topics and Common Mistakes Analysis | Year 11 Eduqas 计算机：高频考点与易错题分析
Preparing for the Year 11 Eduqas GCSE Computer Science examinations requires a thorough understanding of both theoretical concepts and practical application. This article identifies the most frequently assessed topics and analyses the mistakes students often make, helping you revise smarter and avoid losing marks on common pitfalls.
准备Eduqas GCSE计算机科学考试，需要深入理解理论概念和实际应用。本文梳理了最高频的考点，并分析了学生常犯的错误，帮助你高效复习，避开易失分点。
1. Binary and Hexadecimal Conversions | 二进制与十六进制转换
x, you must group from right in nibbles: 0010 1101 → 2D₁₆, not 1011 01 → B1₁₆. Students often forget to pad with leading zeros for the leftmost group.
最常犯的错误之一是在二进制和十六进制转换时分组错误。例如，将101101₂转换为十六进制，必须从右开始每四位分组：0010 1101 → 2D₁₆，而不是1011 01 → B1₁₆。学生经常忘记为最左侧的一组补上前导零。
When converting decimal to binary using the division-by-2 method, the binary result must be read from the last remainder to the first. Writing the remainders in the order they are obtained leads to an incorrect answer. Always list the remainders from bottom to top.
使用除2取余法将十进制转换为二进制时，必须从最后的余数开始读取，直到第一个余数。若按计算顺序写出余数，则会得到错误的结果。始终要自下而上读取余数。
Binary addition can cause errors when carry bits are mishandled. For instance, 1010₂ + 0111₂ yields 10001₂, but students often forget to carry the final 1 into a new column or misalign digits. Always align numbers to the right and check carries column by column.
二进制加法中处理进位时容易出错。例如，1010₂ + 0111₂ 结果是 10001₂，但学生常忘记将最后的进位1放入新的列，或者对齐错误。务必右对齐，逐列检查进位。
2. Data Representation: Sound and Image Calculations | 声音与图像数据计算
els. Students often forget to multiply by the number of channels for stereo audio, or confuse sample rate in kHz with Hz, leading to a factor-of-1000 error. For example, 44.1 kHz should be 44,100 Hz.
计算声音文件大小：大小（位）= 采样率（Hz） × 位深度 × 时长（秒） × 通道数。学生常忘记立体声要乘以通道数，或将kHz误认为是Hz，导致千倍误差。例如，44.1 kHz 应转换为 44,100 Hz。
age, raw file size = width × height × colour depth (bits). If the colour depth is given as '16-bit colour' Remember to divide by 8 for bytes, and by 1024 for kilobytes if required by the question.
对于图像，原始文件大小 = 宽度 × 高度 × 颜色深度（位）。若颜色深度为 "16位色"，直接计算即可，但许多学生保留位（bits）作答案，忽略了题目可能要求字节或千字节。记得除以8得到字节，若题目要求千字节则除以1024。
tting that a colour depth of 8 bits allows 256 colours, not 255. The number of colours = 2colour depth. Ensure you use the correct exponent and note that an indexed colour palette uses a limited number of colours, not the full bit range in the file size formula.
另一个陷阱是忘记8位颜色深度可表示256种颜色，而不是255。颜色数 = 2颜色深度，确保使用正确的指数，并注意索引调色板只使用有限颜色数，不影响文件大小公式中的位深度计算。
3. Logic Gates and Boolean Expressions | 逻辑门与布尔表达式
When constructing truth tables for a logic circuit, a systematic approach is crucial. A common mistake is to omit intermediate columns for each gate, leading to incorrect final outputs. Always list all input combinations (2ⁿ rows for n inputs) and work step by step, labelling intermediate outputs clearly.
构建逻辑电路的真值表时，系统性的方法至关重要。常见错误是漏掉每个门的中间列，导致最终输出错误。务必列出所有输入组合（n个输入有2ⁿ行），并逐步推导，清楚标注中间输出。
Another frequent pitfall is misinterpreting the NAND and NOR gates. NAND is equivalent to AND followed by NOT, but students often write the output as A AND B without inversion. Remember: the bubble indicates negation. For instance, A NAND B is NOT (A AND B), and its truth table has output 1 for all combinations except when both inputs are 1.
另一个常见陷阱是误解与非门和或非门。与非门等效于与门后接非门，但学生往往忘记取反，直接写A AND B。记住：小圆圈表示非。例如，A NAND B = NOT (A AND B)，真值表除两输入均为1时输出0外，其余均为1。
When simplifying Boolean expressions using laws such as De Morgan's, a frequent error is to misapply the inversion. For example, NOT (A OR B) equals (NOT A) AND (NOT B). Writing it as NOT A OR NOT B loses a mark. Draw the corresponding logic circuit to verify the equivalence.
使用德摩根等定律简化布尔表达式时，常见的错误是误用取反。例如，NOT (A OR B) 等于 (NOT A) AND (NOT B)，写成 NOT A OR NOT B 会失分。画出对应的逻辑电路可以帮助验证等价性。
4. Negative Binary: Sign-and-Magnitude and Two's Complement | 负数二进制：符号-数值与二的补码
In two' e number with a minus sign. Students frequently invert then add 1 but forget to treat the original as negative, or they try to subtract 1 first, which can cause confusion. The correct sequence is: complement → add 1 → attach minus sign.
在二的补码表示法中，求负数的值，需要先将所有位取反再加1，然后将结果当作正数，并在前面加负号。学生常犯的错误是先取反加1后，忘记原数是负数，或者尝试先减1再取反，导致混淆。正确步骤是：取反 → 加1 → 加负号。
When performing binary addition with two's complement, overflow must be checked. Overflow occurs when two positive numbers sum to a negative result, or two negatives sum to a positive. The carry-out from the most significant bit alone does not indicate overflow; you must compare the carry-in and carry-out to the sign bit. If they differ, overflow has occurred.
进行二的补码加法时，必须检查溢出。当两个正数相加得到负数，或两个负数相加得到正数时，发生溢出。仅最高位的进位输出不能指示溢出，需要比较符号位的进位输入和进位输出。若两者不同，则发生了溢出。
Sign-and-magnitude representation is simpler but has two zeros (0000 and 1000 for 4-bit), which can cause problems in calculations. Eduqas questions may ask you to identify the range: for n bits, the range is -(2ⁿ⁻¹-1) to +(2ⁿ⁻¹-1), whereas two's complement covers -2ⁿ⁻¹ to +(2ⁿ⁻¹-1). Confusing these ranges is a common error.
符号-数值表示法更简单，但存在两个零（如4位中的0000和1000），在计算中会出问题。Eduqas考题可能会要求辨识范围：对于n位，范围是 -(2ⁿ⁻¹-1) 到 +(2ⁿ⁻¹-1)，而二的补码是 -2ⁿ⁻¹ 到 +(2ⁿ⁻¹-1)。混淆这两个范围是常见错误。
5. Pseudocode and Trace Tables | 伪代码与追踪表
In Eduqas pseudocode, assignment uses the ← symbol, not the equals sign =. A common mistake is writing total = total + 1 instead of total ← total + 1 is can cost marks even if the logic is correct. Equally, for comparison you must use =, so IF score = 10 THEN is acceptable, but do not use ← for conditions.
在Eduqas伪代码中，赋值使用←符号，而非等号=。常见错误是写作 total = total + 1 而非 total ← total + 1。即使逻辑正确也会因此失分。同样，比较时必须使用=，例如 IF score = 10 THEN 是正确的，但条件中不要用←。
Trace tables require careful recording of variable values at each step. The most frequent error is updating variables in the wrong order, especially when a loop body includes multiple statements. Always follow the sequence exactly as written, using a new row for each line of code executed. If a variable is unchanged, write its current value again.
追踪表需要在每一步仔细记录变量值。最常见的错误是变量更新顺序不对，尤其是循环体包含多条语句时。务必严格按照代码执行顺序，每执行一行代码就使用新的一行。如果变量未改变，仍需写下当前值。
Loop boundaries catch many students out. In a FOR loop like FOR count ← 1 TO 5, the body runs exactly five times (count = 1,2,3,4,5). If the loop includes a conditional BREAK, make sure the trace table reflects the early exit and final values. Missing the final iteration or adding an extra one is a classic mistake.
循环边界让学生易错。例如 FOR count ← 1 TO 5，循环体执行恰好五次(count=1,2,3,4,5)。若循环内包含条件 BREAK，确保追踪表反映提前退出和最终值。遗漏最后一次迭代或凭空多执行一次是典型错误。
6. Network Protocols and Encryption | 网络协议与加密
A recurring exam question asks students to identify which layer of the TCP/IP model a protocol belongs to. Mixing up layers is very common. The four layers, from top to bottom, are Application, Transport, Internet, and Network Access. Protocols are assigned as follows:
经常有考题要求学生辨识协议属于TCP/IP模型的哪一层。混淆层次相当普遍。四层模型从上到下为：应用层、传输层、网际层、网络接入层。协议分配如下：
- Application layer: HTTP, HTTPS, FTP, SMTP, POP3, IMAP
- 应用层：HTTP, HTTPS, FTP, SMTP, POP3, IMAP
- Transport layer: TCP, UDP
- 传输层：TCP, UDP
- Internet layer: IP
- 网际层：IP
- Network Access layer: Ethernet, Wi-Fi
- 网络接入层：以太网、Wi-Fi
Students erroneously place FTP in the Transport layer because 'transfer' appears in its name. Always link the function: Application layer protocols support user-level services such as file transfer and web
Published by TutorHao | Year 11 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图