📚 Common Misconceptions in Year 10 WJEC Computer Science and How to Correct Them | 常见误区与纠正方法
Year 10 students starting the WJEC Computer Science course often bring habits from mathematics or everyday language that can lead to misunderstandings of key concepts. This article identifies ten common misconceptions, explains why they occur, and provides clear strategies to correct them. By addressing these pitfalls early, learners will build a more robust foundation for computational thinking, programming, and theory units.
开始学习 WJEC 计算机课程的 Year 10 学生，常常会把数学或日常语言中的习惯带入编程与理论，从而产生关键概念的误解。本文梳理了十个常见误区，分析其产生原因，并给出清晰纠正方法。及早解决这些易错点，能帮助学习者建立更扎实的计算思维、编程与理论基础。
1. Variables as Algebraic Unknowns | 把变量当作代数中的未知数
Many students first encounter the word 'variable' in mathematics, where it represents a fixed but unknown value. In programming, a variable is a named storage location that can hold different values at different times. The statement x = x + 1 es the current value of x, adds one, and stores the result back into x. This is an assignment, not an equation.
许多学生第一次接触'变量'一词是在数学课上，那里它表示未知但固定的值。在编程中，变量是一个命名的存储位置，可以在不同时间保存不同的值。语句 x = x + 1 会让学生感到困惑，因为在代数里它意味着 0 = 1。而在代码中，它仅仅取出 x 的当前值，加一，再把结果存回 x。这是赋值，而不是等式。
To correct this, introduce the box analogy: imagine a box labelled x. You can look inside, read the number, do a calculation, and place a new number back. Draw memory diagrams showing the state before and after each line of code. Emphasise that the equals sign in most programming languages means 'is assigned the value of', not 'is equal to'. Practise short sequences of assignments and ask students to predict the final value in each box.
纠正方法：引入盒子类比——想象一个贴着 x 标签的盒子，你可以往里看，读取数字，进行计算，再把新数字放回。画出内存图示，展示每一行代码执行前后的状态。强调大多数编程语言中的等号表示'被赋值为'，而不是'相等'。练习简短的赋值序列，让学生预测每个盒子中的最终值。
2. Confusing Assignment (=) with Equality (==) | 混淆赋值（=）与相等（==）
After accepting that a single equals sign means assignment, students often write if x = 5 when they mean if x == 5. This can lead to silent bugs or syntax errors depending on the language. In Python, = inside a condition is invalid, but in C-family languages it is valid yet always true, which can be devastating to debug.
在接受了单等号表示赋值之后，学生常常把'如果 x 等于 5'写成 if x = 5，而正确写法是 if x == 5。根据语言不同，这可能导致隐藏的 bug 或语法错误。在 Python 中，条件里的 = 是非法的；但在 C 系语言中它合法且永远为真，调试起来非常麻烦。
A simple mnemonic is: 'One equals means "make it so"; two equals means "ask a question".' Have students read their conditions aloud using 'is equal to?' for == and 'becomes' liberately plant a bug swapping = and == in a class exercise and ask the class to find it.
一个简单的口诀：'一个等号是"动手做"，两个等号是"提问题"。'让学生把条件大声读出来，用'等于吗？'来读 ==，用'变成'来读 =。使用跟踪表逐步执行同时包含赋值和比较的代码，注意每一栏的区别。故意在课堂练习中植入一个把 = 和 == 弄反的 bug，请全班找出错误。
3. Off‑by‑One Errors in Loops | 循环中的差一错误
When writing a loop to repeat exactly ten times, some students will write for i = 1 to 10 while others write for i = 0 to 9. Both can be correct, but confusion arises when mixing zero‑based and one‑based indexing without understanding the range. In WJEC‑style pseudocode or Python, for i in range(10) produces values 0, 1, 2, …, 9 – that is ten numbers starting from zero. Students who expect 1 to 10 may find their array index out of bounds or their output one step short.
当编写一个重复恰好十次的循环时，有的学生写 for i = 1 to 10，有的写 for i = 0 to 9。两者都可以正确，但在不清楚范围的情况下混合使用从零开始和从一开始的索引就会产生混淆。在 WJEC 风格伪代码或 Python 中，for i in range(10) 会生成 0, 1, 2, …, 9——即从零开始的十个数字。期待 1 到 10 的学生可能会碰到数组索引越界或输出少一次。
Always draw the loop counter on a number line, highlighting start and stop values. Use the fence‑post analogy: if you need ten fence panels, you need eleven posts. Relate this to list slicing and length. Practise with exercises where students must predict the output of for i in range(3, 7) or write a loop that prints 'Hello' exactly six times. Encourage the use of range(len(list)) when iterating over indices.
始终在数轴上画出循环计数器，高亮起始和终止值。使用栅栏柱子类比：如果你要十块栅栏板，你需要十一根柱子。将这与列表切片和长度联系起来。练习要求学生预测 for i in range(3, 7) 的输出，或编写一个恰好打印六次 'Hello' 的循环。鼓励在遍历索引时使用 range(len(list))。
4. Array Indexing Must Start at 1 | 数组索引必须从 1 开始
Students often feel that the first element of a list or array should logically be number 1. When they first encounter zero‑based indexing, they may try to access element 0 and think it returns the second item, or they add 1 unnecessarily to their indices. This leads to off‑by‑one bugs during exam questions on linear search or reading pseudocode that assumes indexing from 0.
学生常常觉得列表或数组的第一个元素在逻辑上应该是 1 号。当他们第一次遇到从零开始的索引时，可能会试图访问 0 号元素却以为那返回的是第二项，或者不必要地在索引上加 1。这会在涉及线性搜索的考题或阅读假定从 0 开始索引的伪代码时导致差一错误。
1 cm mark is 1 unit from the start, but the start itself is 0. Show how memory addresses are calculated: base_address + index × element_size. Repeatedly practise converting between a list drawn on paper and its corresponding index numbers. Use real objects like numbered boxes and ask 'What is the index of the red box?' when the red box is first in line.
解释索引代表的是从起点算起的偏移量。0 号元素离起点零步。用尺子演示：1 厘米标记距离起点 1 个单位，但起点本身是 0。展示内存地址如何计算：基地址 + 索引 × 元素大小。反复练习在纸上画的列表与其对应索引号之间的转换。使用编号盒子等实物，问'红色盒子的索引是多少？'当红色盒子排在第一时。
5. Binary Addition Overflow and Result Size | 二进制加法溢出与结果位数
When adding two 8‑bit binary numbers, students often forget that the result may be a 9‑bit number. They either discard the carry‑out without explanation or try to squeeze it into an 8‑bit answer, losing marks. In processor terms, the extra bit is stored in the carry flag, but in exam questions they are expected to show it clearly and state that overflow has occurred.
在做两个 8 位二进制数加法时，学生经常忘记结果可能是 9 位。他们要么不加解释地丢弃进位，要么试图把进位挤进 8 位答案中，从而失分。在处理器术语中，多余的一位存放在进位标志中；但在考题中，要求清晰展示该位并说明发生了溢出。
Always leave a ninth column to the left when adding bytes. Label it 'carry out'. After adding, circle the carry out and explicitly write 'Overflow occurred because the result exceeded 8 bits'. Practise with sums that produce and do not produce overflow, comparing the decimal result to confirm that 255 + 1 does not fit in 8 bits. Use the analogy of a car odometer rolling over.
做字节加法时，左边总是留出第九列，标上'进位输出'。加法完成后，把进位输出圈起来，并明确写出'由于结果超过 8 位，发生了溢出'。练习产生与不产生溢出的加法题，用十进制结果验证 255 + 1 确实装不进 8 位。用车载里程表归零的类比来帮助理解。
6. Logic Gate Truth Tables – AND vs OR | 逻辑门真值表——与和或的混淆
Students easily recall that AND outputs 1 only when both inputs are 1, and OR outputs 1 when at least one input is 1. However, under exam pressure they can reverse these, especially for three‑input gates. They also tend to copy the truth table of one gate onto another when the question asks for a combination of gates.
学生容易记住：与门仅在两个输入都为 1 时输出 1，或门在至少一个输入为 1 时输出 1。但在考试压力下，他们可能把它们弄反，尤其是三输入门。当题目要求画出组合门真值表时，他们也容易把一个门的真值表复制到另一个门上。
Create memorable phrases: 'ANDy needs all high to be high' and 'ORa wants any high to be high'. Draw the symbol shapes and associate them with the conditions – an AND gate looks like a shield that requires all components. Solve mixed‑gate circuits step by step, writing intermediate output labels. Practise with function tables that hide one column, asking students to deduce the missing input. Flashcards with gate icons on one side and truth tables on the other work very well.
创造易记的口诀：'AND 要全高才高'，'OR 要随便一个高就高'。画出符号形状并与条件关联——与门像一个需要所有部件的盾牌。分步求解混合门电路，标注中间输出。练习用隐藏某一列的函数表，让学生推断缺失的输入。一面是门图标、一面是真值表的闪卡效果很好。
7. Character Encoding: ASCII, Bitmap, Vector | 字符编码：ASCII、位图、矢量图的混淆
Students often think ASCII can represent characters from all languages, or they mix up the concepts of bitmap and vector graphics. They may say that a vector image stores the colour of every pixel, or that bitmaps are resolution‑independent. These errors appear in questions comparing storage, scalability, and suitable use cases for each type of representation.
学生常常以为 ASCII 可以表示所有语言的字符，或者混淆位图和矢量图的概念。他们可能说矢量图存储每个像素的颜色，或者位图与分辨率无关。这些错误会出现在比较存储方式、可缩放性和各自适用场景的考题中。
Start with the idea that ASCII uses 7 or 8 bits, giving just 128 or 256 possibilities – enough for English but not for Chinese or emoji. Unicode extends this. For graphics, show a simple black‑and‑white bitmap with a grid and binary codes, then demonstrate how scaling up makes it blocky. Contrast this with a vector drawing of a circle stored as 'circle, centre (50,50), radius 30', which scales smoothly. Use practical tasks where students manually encode and decode small images.
从 ASCII 使用 7 位或 8 位只有 128 或 256 种组合讲起，足够英语但不够中文或表情符号。Unicode 对其进行了扩展。对于图形，展示一个简单的黑白位图网格和对应的二进制编码，然后演示放大后变得斑驳。与之对比，存储为'圆, 圆心(50,50), 半径30'的矢量图可以平滑缩放。安排手工编解码小图像的实际任务。
8. Storage Units – Bits, Bytes, Kilobytes | 存储单位——位、字节、千字节
s acceptable (decimal units), but in computer science exam specifications, the binary definitions often apply: 1 KiB = 1024 bytes, 1 MiB = 1024 KiB. Students also confuse bits and bytes, writing '8MB' when they mean '8Mb' (megabits), which is 1/8 the data amount.
学生把千字节当作正好 1000 字节、兆字节当作正好 1000 千字节的情况极为常见。在许多语境中，这是可以接受的（十进制单位），但在计算机科学的考试规范中，通常适用二进制定义：1 KiB = 1024 字节，1 MiB = 1024 KiB。学生还会混淆位和字节，想写 8Mb（兆位）却写成 8MB，两者数据量差八倍。
Teach the distinction between kB (1000) and KiB (1024) explicitly, using the exam board's notation. Create a conversion staircase: multiply by 8 to go from bytes to bits; multiply by 1024 to go up to KiB, MiB, GiB. Always underline the unit in answers and check the context of the question. Real‑world examples such as a 1 Gbps internet connection vs a 1 GB file download time help cement the difference.
明确教授 kB（1000）与 KiB（1024）的区别，使用考试局指定的符号。制作一个转换阶梯：从字节到位乘以 8；到 KiB、MiB、GiB 每级乘以 1024。在答案中给单位加下划线，并核对题目语境。诸如 1 Gbps 网络连接与 1 GB 文件下载时间的真实例子，有助于巩固这一区别。
9. Network Security – Phishing, Malware, and Encryption Misconceptions | 网络安全——网络钓鱼、恶意软件与加密的误区
When asked about network threats, students often label any scam email as 'a virus' or say that encryption prevents phishing. They may think a firewall stops all threats, or that a strong password alone guarantees safety. Such over‑simplifications lose marks because they fail to show understanding of the layered approach to security.
当被问及网络威胁时，学生常把任何诈骗邮件都标为'病毒'，或者说加密能防止网络钓鱼。他们可能以为防火墙能阻挡所有威胁，或单靠强密码就能保证安全。这类过度简化会失分，因为没能展示对分层安全方法的理解。
Define each term precisely: phishing is a social engineering attack, malware is malicious software (virus, worm, trojan), encryption scrambles data to protect confidentiality during storage or transmission. Explain that a firewall filters traffic based on rules but cannot read encrypted malicious payloads; two‑factor authentication complements passwords. Use case‑study style questions: 'A user receives an email asking for their bank details. Name the threat and suggest two preventative measures.'
精确定义每个术语：网络钓鱼是一种社会工程攻击，恶意软件是恶意软件（病毒、蠕虫、特洛伊木马），加密在存储或传输过程中扰乱数据以保护机密性。解释防火墙根据规则过滤流量，但无法读取加密的恶意载荷；双因素认证是对密码的补充。使用案例式题目：'一位用户收到一封索要银行信息的邮件。请说出威胁名称并建议两条防范措施。'
10. Tracing Algorithms – Sequence, Selection, Iteration Confusion | 跟踪算法——顺序、选择、迭代的混淆
When asked to complete a trace table for an algorithm, many students forget to update variables in order, jump out of loops prematurely, or confuse the condition of a while loop with an if statement. They may treat the loop condition as evaluated only once, or run the loop one extra time because they read the output before evaluating the condition.
当被要求为一个算法完成跟踪表时，许多学生忘记按顺序更新变量、过早跳出循环，或者把 while 循环的条件与 if 语句混淆。他们可能以为循环条件只评估一次，或者在评估条件之前就读取输出而多跑了一次循环。
Teach a strict ritual: line number, condition evaluated, variables updated. Every time a loop condition is reached, write a new row. Use WHILE loops with a condition that becomes false in the middle of the loop body to show that the remainder of the body still executes before the next test. Provide partially filled trace tables and ask students to spot the error. Emphasise that in an IF‑THEN‑ELSE, only one branch executes, whereas in a WHILE, the whole body may execute many times.
教授一套严格的仪式：行号、条件评估、变量更新。每次到达循环条件时，写新的一行。使用在循环体中间条件变为假的 WHILE 循环来展示，在下次测试前循环体的剩余部分仍会执行。提供部分填好的跟踪表，让学生找出错误。强调在 IF‑THEN‑ELSE 中，只有一条分支执行，而在 WHILE 中，整个循环体可能执行多次。
11. Search Algorithms – Linear vs Binary | 搜索算法——线性与二分的误解
A common error is to apply binary search to an unsorted list, or to forget the midpoint recalculation. Students may state that binary search compares the target to the first and last elements only, or that it always checks half the items. Linear search is sometimes assumed to be slower in all cases, ignoring that for very small or unsorted data it is simpler and often fast enough.
一个常见错误是对未排序的列表进行二分查找，或者忘记重新计算中点。学生可能说二分查找只把目标与首尾元素比较，或者它总是检查一半项目。有时假定线性搜索在所有情况下都更慢，而忽视了对于很小或未排序的数据，它更简单且往往足够快。
Reinforce the pre‑condition: binary search requires sorted data. Paper‑based demonstrations with numbered cards and the class acting as the algorithm: 'Is it greater or smaller? Discard this half.' Show trace tables with low, high, mid, and found flag. Compare the maximum number of comparisons for linear (n) vs binary (log₂ n) for a list of 1000 items, but also discuss that linear search does not require sorting overhead. Always check exam questions for the phrase 'sorted list'.
强调前提条件：二分查找需要已排序的数据。用编号卡片进行纸质演示，让全班扮演算法：'是更大还是更小？丢弃这一半。'展示带 low、high、mid 和 found 标志的跟踪表。比较对于 1000 个项目的列表，线性搜索最多比较次数 (n) 与二分查找 (log₂ n)，但也讨论线性搜索不需要排序开销。始终检查考题中是否有'排序列表'字样。
12. Flowchart Symbols – Misusing Decision Diamonds | 流程图符号——菱形判断框的误用
Students frequently draw a diamond for any question, include ambiguous decision labels, or forget to label exit arrows with 'Yes'/'No' or 'True'/'False'. Some place processing instructions inside a decision symbol, or use a rectangle when a decision is needed. These small errors accumulate in paper‑based algorithm design questions and can make the intended logic unclear.
学生经常在任何提问的地方都画菱形，决策标签含糊，或者忘记在出口箭头上标'是'/'否'或'真'/'假'。有些把处理指令放进判断符号内，或者在需要判断时用了矩形框。这些小错误在纸面算法设计题中越积越多，可能使预期逻辑变得不清。
Provide a stencil or a cheat sheet: oval for start/stop, rectangle for process, parallelogram for input/output, diamond for decision. Every decision must have exactly two exits, and the exit lines must be labelled. Walk through sample algorithms and ask 'Is this a question that can be answered Yes or No?' If not, it belongs in a rectangle. Use colour coding: red for decisions, blue for processes. Encourage students to sketch the flowchart path with a pencil before inking.
提供一套模板或速查卡：椭圆代表开始/结束，矩形代表处理，平行四边形代表输入/输出，菱形代表判断。每个判断必须有且仅有两条出口，出口线必须标注。遍历例题算法，问'这是一个能用是或否回答的问题吗？'如果不是，就该放在矩形里。使用颜色编码：红色代表判断，蓝色代表处理。鼓励学生先用铅笔描出流程图路径，再用墨水笔描实。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图