📚 Year 13 WJEC Computer Science: High-Frequency Exam Topics and Common Mistake Analysis | Year 13 WJEC 计算机：高频考点与易错题分析
Year 13 WJEC Computer Science covers a wide range of theoretical and practical topics, and certain concepts consistently appear in exams while causing repeated mistakes. This article highlights the most frequently tested areas and analyses the typical errors students make, helping you sharpen your revision and avoid losing marks on common pitfalls.
Year 13 WJEC 计算机科学涵盖了广泛的理论和实践主题，其中一些概念一再出现在考试中，同时反复引发错误。本文重点梳理最高频的考点，并剖析学生的典型错误，帮助你精准复习，避开常见丢分点。
1. Recursion Depth and Stack Frames | 递归深度与栈帧跟踪
A very common exam question asks you to trace a recursive function and show the state of the call stack at each step. Many students lose marks by forgetting that each recursive call creates a new stack frame with its own local variables and return address.
一个非常常见的考题要求你追踪递归函数，并展示每一步调用栈的状态。许多学生丢分是因为忘记了每次递归调用都会创建一个新的栈帧，拥有自己的局部变量和返回地址。
When you trace recursion on paper, always draw a new box for each invocation and note the parameter values at that level. Do not attempt to ‘flatten’ the recursion into a loop in your head—examiners want to see that you understand the stack mechanism.
在纸上追踪递归时，始终为每次调用画一个新方框，并记录该层的参数值。不要试图在脑中将递归“展平”成循环——考官希望看到你理解栈机制。
The base case must be clearly identified; failing to stop recursion leads to stack overflow. In WJEC papers, you might also be asked to rewrite a recursive algorithm iteratively, which tests your understanding of explicit stack usage.
必须明确识别基准条件；未能停止递归会导致栈溢出。在 WJEC 试卷中，你还可能被要求将递归算法改写为迭代形式，这考查你对显式使用栈的理解。
2. Big O Notation and Time Complexity Analysis | 大O表示法与时间复杂度分析
Students frequently confuse worst-case, best-case, and average-case complexity. For Year 13, you need to be able to analyse nested loops, recursive algorithms, and standard operations on data structures like binary search trees.
学生经常混淆最坏情况、最好情况和平均情况复杂度。在 Year 13 阶段，你需要能够分析嵌套循环、递归算法以及二叉搜索树等数据结构的标准操作。
A typical mistake is to assume that two nested loops always imply O(n²) complexity. You must check whether the inner loop’s iterations depend on the outer loop variable in a way that creates a triangular number pattern, potentially giving O(n log n) or linear complexity.
一个典型错误是假设两个嵌套循环总是意味着 O(n²) 复杂度。你必须检查内层循环的迭代次数是否以产生三角数模式的方式依赖于外层循环变量，从而可能得到 O(n log n) 或线性复杂度。
When handling recursive divide-and-conquer algorithms (like merge sort), use the recurrence relation T(n) = 2T(n/2) + n. Many students forget to include the cost of the merging step (+n) and end up with an incorrect O(n log n) for algorithms where the merging cost is non-linear.
在处理递归分治算法（如归并排序）时，使用递推关系式 T(n) = 2T(n/2) + n。许多学生忘记包含合并步骤的代价（+n），结果在合并代价非线性的算法中得出错误的 O(n log n)。
3. Tree Traversal Algorithms: Pre-order, In-order, Post-order | 树的遍历算法：前序、中序、后序
Binary tree traversal questions are almost guaranteed on the WJEC A2 paper. Students often confuse the order of visiting nodes, especially when the tree is not drawn neatly or is presented as an expression tree.
二叉树的遍历问题几乎必定出现在 WJEC A2 试卷上。学生经常混淆访问节点的顺序，尤其当树没有整齐地画出或通过表达式树给出时。
Remember: pre-order is root-left-right, in-order is left-root-right, post-order is left-right-root. A common pitfall is to apply these rules mechanically and forget that ‘left’ means the left subtree, not just the immediate left child.
记住：前序是根-左-右，中序是左-根-右，后序是左-右-根。一个常见陷阱是机械地应用这些规则，并忘记“左”指的是左子树，而不仅仅是直接的左子节点。
When reconstructing a tree from two traversal orders, one must be in-order. A frequent error is trying to build a tree from pre-order and post-order alone, which is not uniquely possible unless the tree is full and strictly binary.
从两种遍历顺序重建树时，必须包含中序。一个常见错误是试图仅从前序和后序构建树，除非树是完全且严格的二叉树，否则无法唯一确定。
4. Graph Data Structures and Dijkstra’s Algorithm | 图数据结构与 Dijkstra 算法
Dijkstra’s shortest path algorithm appears regularly in WJEC exams, often requiring a step-by-step execution trace. The most common mistake is overlooking that the algorithm does not work with negative edge weights, leading to incorrect justifications in comparison with algorithms like Bellman-Ford.
Dijkstra 最短路径算法定期出现在 WJEC 考试中，通常要求逐步展示执行过程。最常见的错误是忽略了该算法无法处理负权边，导致与 Bellman-Ford 等算法比较时给出错误理由。
When manually tracing Dijkstra, always maintain a priority queue or table of unvisited nodes and update their distances as you relax edges. Students often miss updating a node’s distance when a shorter path is found, causing the final answer to be non-optimal.
手动追踪 Dijkstra 时，务必维护一个未访问节点的优先队列或表格，并在松弛边时更新其距离。学生经常在找到更短路径时忘记更新节点的距离，导致最终结果不是最优的。
Additionally, be comfortable with adjacency matrices and adjacency lists. A typical mistake is confusing the space complexity: adjacency lists use O(V+E) while matrices use O(V²), which matters when the graph is sparse.
此外，要熟悉邻接矩阵和邻接表。一个典型错误是混淆空间复杂度：邻接表使用 O(V+E) 而矩阵使用 O(V²)，这在图稀疏时很重要。
5. Object-Oriented Principles: Inheritance vs Composition | 面向对象原则：继承与组合
WJEC Year 13 tests deep understanding of OOP, especially the trade-off between inheritance (is-a) and composition (has-a). Many students blindly use inheritance for code reuse, leading to tight coupling and violation of the Liskov Substitution Principle.
WJEC Year 13 考查对面向对象编程的深入理解，尤其是继承（is-a）与组合（has-a）之间的权衡。许多学生盲目使用继承来重用代码，导致高耦合并违反里氏替换原则。
A frequent mistake is extending a class just to override a few methods, breaking the contract of the superclass. Examiners look for awareness that composition (using an object as a field) often provides greater flexibility and better encapsulation.
一个常见错误是仅仅为了覆盖少数方法而扩展一个类，从而破坏了超类的约定。考官希望看到你意识到组合（将对象作为字段使用）通常提供更大的灵活性和更好的封装。
Be prepared to read and write class diagrams showing inheritance (empty triangle arrow) and composition (filled diamond). Confusing the two symbols is an avoidable error that pops up consistently in notation questions.
准备好阅读和绘制展示继承（空心三角箭头）和组合（实心菱形）的类图。混淆这两个符号是一个可以避免的错误，在符号题中屡见不鲜。
6. Finite State Machines and Regular Languages | 有限状态机与正则语言
FSM questions require you to design a machine for a given language or to parse a string against a given FSM. The classic mistake is forgetting to specify start and accept states clearly, or producing a non-deterministic FSM where the question demands a deterministic one.
有限状态机问题要求你为给定语言设计一个机器，或根据给定的 FSM 解析字符串。经典错误是忘记明确指定起始状态和接受状态，或当问题要求确定性 FSM 时产生了一个非确定性 FSM。
When converting a regular expression to an FSM, many students omit necessary epsilon transitions or fail to handle the empty string correctly. Practise the standard construction rules for union, concatenation, and Kleene star so you can apply them under exam pressure.
在将正则表达式转换为 FSM 时，许多学生遗漏了必要的 ε 转移或未能正确处理空字符串。练习并集、连接和 Kleene 星号的标准构造规则，以便在考试压力下也能应用自如。
Another recurring error is confusing the concept of regular languages with context-free languages. Remember that FSM cannot count arbitrarily; if a language requires matching nested parentheses, it is not regular and needs a pushdown automaton.
另一个反复出现的错误是混淆了正则语言与上下文无关语言的概念。记住 FSM 不能任意计数；如果一种语言需要匹配嵌套括号，它就不是正则的，而需要下推自动机。
7. Normalisation to Third Normal Form (3NF) | 数据库规范化至第三范式 (3NF)
Normalisation is a guaranteed topic. The most frequent mistake is not identifying all partial dependencies (non-key attributes depending on part of a composite primary key), which leads to an incorrect 2NF decomposition and cascades errors into 3NF.
规范化是必考主题。最常见的错误是没有识别出所有部分依赖（非主属性依赖于复合主键的一部分），这导致错误的 2NF 分解，并将错误连带到 3NF。
Always carefully list all functional dependencies from the given scenario before splitting tables. A partial dependency occurs if a determinant is a proper subset of the primary key. A transitive dependency is when a non-key attribute determines another non-key attribute.
在拆分表之前，务必仔细列出给定场景中的所有功能依赖。部分依赖发生在决定因素是主键的真子集时。传递依赖是指一个非主属性决定另一个非主属性。
Students also lose marks by creating redundant tables or introducing unnecessary foreign keys that do not match the original relations. Your final 3NF schema should have no repeating groups, no partial dependencies, and no transitive dependencies.
学生还会因为创建冗余表或引入与原始关系不匹配的非必要外键而丢分。你最终的 3NF 模式应没有重复组、没有部分依赖，也没有传递依赖。
8. SQL Query Pitfalls: GROUP BY, HAVING, and Joins | SQL 查询陷阱：GROUP BY、HAVING 和连接
Writing SQL queries for a given scenario is heavily tested. A typical error is using HAVING instead of WHERE for row-level conditions before grouping. WHERE filters rows before aggregation, whereas HAVING filters groups after aggregation.
根据给定场景编写 SQL 查询是被重点考查的。一个典型错误是在分组之前将行级条件用于 HAVING 而非 WHERE。WHERE 在聚合之前筛选行，而 HAVING 在聚合之后筛选分组。
Another common pitfall involves JOINs: students often forget to specify the join condition in an INNER JOIN, resulting in a Cartesian product that produces incorrect results. Always check you can justify each join logically.
另一个常见陷阱涉及连接：学生经常忘记在 INNER JOIN 中指定连接条件，导致笛卡尔积并产生错误结果。务必检查你能从逻辑上解释每个连接。
When using aggregate functions like COUNT, SUM, AVG with GROUP BY, remember that any column in the SELECT clause that is not aggregated must appear in the GROUP BY clause. Violating this rule will cause a syntax error in most RDBMS and will be marked wrong.
在将 COUNT、SUM、AVG 等聚合函数与 GROUP BY 一起使用时，记住 SELECT 子句中未聚合的任何列都必须出现在 GROUP BY 子句中。违反此规则在大多数 RDBMS 中会造成语法错误，并会被判为错误。
9. Compiler vs. Interpreter, and Virtual Machines | 编译器与解释器及虚拟机
WJEC asks you to compare compilers and interpreters, but Year 13 extends this to just-in-time (JIT) compilation and virtual machines like the Java JVM. Students often oversimplify by saying ‘compiled languages are faster’ without discussing platform independence or runtime optimisation.
WJEC 要求你比较编译器和解释器，但 Year 13 将此扩展到即时编译及 Java JVM 等虚拟机。学生常常过于简化地说“编译语言更快”，而不讨论平台独立性或运行时优化。
Understand that a compiler translates the whole source code into machine code (or intermediate code) before execution, while an interpreter translates and executes line by line. A common mistake is stating that an interpreter produces an executable file—it does not.
要理解编译器在执行前将整个源代码翻译为机器码（或中间代码），而解释器逐行翻译并执行。一个常见错误是声称解释器生成可执行文件——它不会。
For virtual machines, you should explain how intermediate bytecode achieves cross-platform compatibility. The phrase ‘write once, run anywhere’ is acceptable, but you must link it to the role of the VM as an abstraction layer over hardware.
对于虚拟机，你应该解释中间字节码如何实现跨平台兼容。“一次编写，到处运行”这一说法可以接受，但你必须将其与 VM 作为硬件之上的抽象层这一角色联系起来。
10. Network Security: Symmetric vs Asymmetric Encryption | 网络安全：对称与非对称加密
Encryption questions frequently test both the mechanics and the use cases. A critical misunderstanding is that asymmetric encryption is always ‘better’; students fail to recognise its computational expense and thus why real protocols (TLS) use a hybrid model.
加密问题常常同时考查机制和使用场景。一个关键的误解是认为非对称加密总是“更好”；学生未能认识到其计算开销，因此不理解为什么实际协议（TLS）使用混合模式。
Symmetric encryption uses a single shared key and is fast, suitable for bulk data encryption. Asymmetric uses a public/private key pair and is slower, typically used for secure key exchange and digital signatures. Confusing the two in an application context loses easy marks.
对称加密使用单一共享密钥，速度快，适合大量数据加密。非对称加密使用公钥/私钥对，速度较慢，通常用于安全密钥交换和数字签名。在应用情境中混淆两者会丢掉容易的分数。
Also, be precise with key distribution: symmetric keys must be exchanged securely before communication, often using asymmetric encryption to encrypt the symmetric key. A typical exam blunder is saying ‘the public key decrypts’—only the private key can decrypt what the public key encrypts.
此外，要精确说明密钥分发：对称密钥必须在通信前安全地交换，通常使用非对称加密来加密对称密钥。一个典型的考试失误是说“公钥解密”——只有私钥才能解用公钥加密的内容。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply