High-Frequency Exam Topics and Common Mistakes in SQA Computing Science | Year 13 SQA 计算机：高频考点与易错题分析

📚 High-Frequency Exam Topics and Common Mistakes in SQA Computing Science | Year 13 SQA 计算机：高频考点与易错题分析

For Year 13 students tackling SQA Advanced Higher Computing Science, the step up from Higher is significant. You are now expected not just to apply knowledge but to evaluate, justify design decisions, and understand abstract concepts such as time complexity, recursive thinking, and database normalisation at a formal level. This article draws together the topics most commonly examined in the final written paper, alongside the subtle mistakes that even strong candidates make year after year. Use it to identify your own blind spots and refine your exam technique.

对于备战 SQA 高级更高计算机科学的 Year 13 学生来说，从 Higher 到 Advanced Higher 的跨越是很大的。你需要的不只是应用知识，更要能够评估、论证设计决策，并且在正式层面上理解时间复杂度、递归思维和数据库规范化等抽象概念。本文汇集了期末考试中最常出现的高频考点，以及即便是擅长该科目的考生也年复一年犯的错误。希望借此帮助你发现自己的盲区，优化考试技巧。

1. Algorithm Analysis and Big O Notation | 算法分析与大 O 表示法

One of the most heavily assessed areas in the Advanced Higher paper is the ability to state and compare the time complexity of algorithms using Big O notation. Candidates frequently confuse O(n), O(log n) and O(n²). For example, a binary search has O(log n) complexity, but many students mistakenly write O(n) or O(1) because they think of the best-case scenario. Always consider the worst-case number of comparisons required as the input size grows.

在高级更高试卷中，大 O 表示法是考查力度最大的部分之一。考生经常混淆 O(n)、O(log n) 和 O(n²)。例如，二分查找的复杂度是 O(log n)，但许多学生误写成 O(n) 或 O(1)，因为他们考虑的是最佳情况。请务必记住，大 O 关注的是随着输入规模增长时最坏情况下的比较次数。

Another common pitfall is comparing two nested loops with an algorithm that performs a linear pass followed by a sort. If you have a nested loop iterating over an array of size n for each element, the complexity is O(n²), not O(2n). O(2n) simplifies to O(n), but two nested loops multiply to n × n. In the exam, justify your answer by counting the fundamental operations and dropping constants and lower-order terms.

另一个常见陷阱是比较两层嵌套循环和“先遍历后排序”的算法。如果你对每个元素都执行一个规模为 n 的循环，那么复杂度是 O(n²)，而不是 O(2n)。O(2n) 可以简化为 O(n)，但嵌套循环是 n × n。在考试中，要通过统计基本操作，并忽略常数和低阶项来论证你的答案。

2. Recursion and Base Case Errors | 递归与基本情形错误

Recursion is examined both in tracing pseudocode and in writing recursive solutions for tasks such as factorial, Fibonacci, or tree traversal. The single most frequent error is a missing or wrong base case. If the base case condition is never met, the function recurses infinitely, leading to a stack overflow. Make sure you can identify, for a given recursive algorithm, what the base case is and how each recursive call reduces the problem size towards it.

递归在追踪伪代码和编写递归解决方案（如阶乘、斐波那契或树遍历）时都会考到。最常见的错误是缺失或写错基本情形。如果基本情形条件永远无法满足，函数就会无限递归，导致堆栈溢出。务必确保你能识别给定递归算法的基本情形，以及每次递归调用是如何将问题规模逐步缩小并向其靠拢的。

A typical exam question might ask you to dry-run a recursive function. Many candidates incorrectly substitute the call and then forget to return values up the call stack. Practice drawing a recursion tree with each call’s parameters and return values. Also be aware that recursion can often be replaced by iteration using a stack data structure – a favourite extension question.

典型的考题可能要求你手动跟踪一个递归函数。许多考生错误地代入调用，然后忘记了沿着调用栈向上返回值。练习画出递归树，标出每次调用的参数与返回值。此外，还要注意递归通常可以用栈结构改写为迭代——这是常见的扩展考题。

3. Data Structures: Stacks, Queues and Linked Lists | 数据结构：栈、队列与链表

Understanding how data structures such as stacks (LIFO), queues (FIFO), and linked lists are implemented with arrays or pointers is a core part of the SQA specification. A persistent misunderstanding is mixing up the operations and their conditions – for example, trying to pop from an empty stack or thinking a queue’s dequeue operation removes the most recently added element. Always link the behaviour to the abstract data type’s specification.

理解栈（后进先出）、队列（先进先出）和链表等数据结构如何用数组或指针实现，是 SQA 考纲的核心部分。一个长期存在的误解是混淆操作及其条件——例如，试图从空栈中弹出元素，或者认为队列的出队操作会移除最新加入的元素。请始终将行为与抽象数据类型的规范关联起来。

Another area where marks are lost is dynamically linked lists. When asked to insert a node into an ordered linked list, candidates often forget to update the previous node’s pointer before the current node’s pointer, thereby breaking the chain. Pseudocode must show the correct sequence of pointer assignments. Similarly, garbage collection or memory leakage concepts occasionally appear in extended response questions.

另一个容易丢分的点是动态链表。当题目要求向有序链表插入一个节点时，考生往往忘记先更新前一个节点的指针，再去更新当前节点的指针，从而导致链断裂。伪代码必须显示正确的指针赋值顺序。类似地，垃圾回收或内存泄漏的概念偶尔也会出现在扩展简答题中。

4. Object-Oriented Design Pitfalls | 面向对象设计的易错点

Advanced Higher candidates need to demonstrate understanding of encapsulation, inheritance, polymorphism, and design patterns. A common error is confusing aggregation with inheritance. For example, a ‘Car’ class may inherit from ‘Vehicle’ (is-a relationship), but a ‘Car’ has an ‘Engine’ object (has-a relationship). Using inheritance where aggregation should be used leads to rigidity in design and is heavily penalised in class-diagram questions.

高级更高的考生需要展示对封装、继承、多态和设计模式的理解。一个常见错误是混淆聚合与继承。例如，“汽车”类可以继承自“交通工具”（is-a 关系），但“汽车”拥有“引擎”对象（has-a 关系）。在本该使用聚合的地方使用了继承，会导致设计僵化，在类图题中会被严重扣分。

In code tracing questions, candidates often miss that a polymorphic method call resolves to the method of the actual object type at runtime, not the reference type. If a superclass reference points to a subclass object, the subclass’s overridden method is executed. Always check the object’s type, not just the variable declaration.

在代码追踪题中，考生经常忽略多态方法调用在运行时会解析为实际对象类型的方法，而非引用类型的方法。如果一个父类引用指向一个子类对象，执行的是子类重写的方法。务必检查对象的类型，而不仅仅是变量声明。

5. Database Normalisation Misfires | 数据库规范化的常见失误

Normalisation to Third Normal Form (3NF) is a guaranteed exam question. The classic mistake is treating a partial dependency as a transitive one, or vice versa. A partial dependency occurs when a non-key attribute depends on only part of a composite primary key. A transitive dependency occurs when a non-key attribute depends on another non-key attribute. Learners often see a dependency from A to B and immediately call it transitive without checking whether B is part of the key.

数据库规范化到第三范式（3NF）是必考题。经典错误是把部分依赖当作传递依赖，或者反过来。部分依赖是指一个非主属性只依赖于复合主键的一部分。传递依赖是指一个非主属性依赖于另一个非主属性。学生经常看到 A 到 B 的依赖关系就立即称其为传递依赖，而不检查 B 是否是主键的一部分。

Additionally, when asked to decompose a table into 3NF, candidates sometimes leave behind a relation that still contains a transitive dependency because they stopped after removing only the partial ones. Always apply the systematic approach: 1NF (remove repeating groups), 2NF (remove partial dependencies), 3NF (remove transitive dependencies). Check each resulting table’s key and dependencies methodically.

此外，当题目要求将一个表分解为 3NF 时，考生有时会遗留一个仍然包含传递依赖的关系，因为他们只去除了部分依赖就停止了。一定要系统地执行：1NF（去除重复组）、2NF（去除部分依赖）、3NF（去除传递依赖）。要条理清晰地检查每个结果表的键和依赖关系。

6. SQL Queries That Go Wrong | 易出错的 SQL 查询

SQL questions frequently feature JOINs, subqueries, aggregate functions and GROUP BY/HAVING. The most common error is forgetting the GROUP BY clause when using aggregate functions alongside non-aggregated columns. If you write SELECT student, AVG(score) FROM Results; without GROUP BY student, the DBMS will raise an error because the non-aggregated column must appear in the GROUP BY clause.

SQL 题目经常涉及 JOIN、子查询、聚合函数以及 GROUP BY/HAVING。最常见的错误是在同时使用聚合函数和非聚合列时，忘记了 GROUP BY 子句。如果你写 SELECT student, AVG(score) FROM Results; 却没有 GROUP BY student，数据库管理系统会报错，因为非聚合列必须出现在 GROUP BY 子句中。

Another trap is using WHERE to filter on the result of an aggregate function. WHERE filters rows before aggregation, whereas HAVING filters groups after aggregation. Many students write WHERE AVG(score) > 70 instead of HAVING AVG(score) > 70. Also, be careful with LEFT JOIN versus INNER JOIN: a LEFT JOIN returns all rows from the left table even if there is no match, which is a subtlety often examined.

另一个陷阱是用 WHERE 对聚合结果进行过滤。WHERE 在聚合前过滤行，而 HAVING 在聚合后过滤组。许多学生写 WHERE AVG(score) > 70，而不是 HAVING AVG(score) > 70。还要注意 LEFT JOIN 与 INNER JOIN 的区别：LEFT JOIN 会返回左表的所有行，即使没有匹配项，这是一个经常被考查的细微之处。

7. Web Development: Client-Side vs Server-Side Processing | 网页开发：客户端与服务器端处理

Questions on server-side scripting, session management, and client-side validation routinely expose gaps in understanding. A typical mistake is to argue that client-side validation is sufficient for security. JavaScript validation can be bypassed by disabling JavaScript or crafting a custom HTTP request; therefore, server-side validation must always be the backbone of security. Many candidates lose marks by ignoring this dual-layer approach.

有关服务器端脚本、会话管理和客户端验证的题目，经常暴露知识漏洞。一个典型错误是认为客户端验证就足以保证安全性。JavaScript 验证可以通过禁用 JavaScript 或构造自定义 HTTP 请求来绕过；因此，服务器端验证始终必须是安全性的基石。很多考生因为忽略了这种双层方法而失分。

Session management is another thorny topic. Confusion between cookies, session variables, and hidden form fields leads to vague answers. Remember: sessions are maintained on the server, typically identified by a session ID stored in a cookie on the client. When asked how to maintain state across multiple pages, explicitly mention that session data is stored server-side while the browser only holds a session identifier.

会话管理是另一个棘手的话题。cookie、会话变量和隐藏表单域的混淆会导致答案含糊不清。请记住：会话是在服务器端维护的，通常由存储在客户端 cookie 中的一个会话 ID 来标识。当被问及如何在多个页面之间保持状态时，要明确提到会话数据存储在服务器端，而浏览器仅持有一个会话标识符。

8. Computer Architecture: Pipelining and Cache | 计算机体系结构：流水线与缓存

The fetch-decode-execute cycle is well understood at Higher, but at Advanced Higher you need to explain how pipelining improves performance and what hazards might occur. A common mistake is describing pipelining as parallel execution of multiple instructions. In reality, pipelining overlaps the stages of different instructions; it does not execute them at the same instant. Data hazards, control hazards, and the resulting pipeline bubbles should be explained precisely.

在 Higher 阶段，取指-译码-执行周期理解较好；但在 Advanced Higher，你需要解释流水线如何提高性能，以及可能发生什么冒险。常见的错误是将流水线描述为多条指令的并行执行。实际上，流水线是重叠不同指令的不同阶段；它并非在同一瞬间执行多条指令。数据冒险、控制冒险以及由此产生的流水线气泡，都需要准确解释。

Cache memory is also frequently misunderstood. Candidates often think a larger cache always increases hit rate linearly, without considering the principle of locality or cache mapping schemes (direct, associative, set-associative). The exam may ask you to calculate average access time or to evaluate why increasing cache size yields diminishing returns. Don’t forget that cache coherency issues arise in multi-core systems.

缓存内存也经常被误解。考生往往认为更大的缓存总能线性地提高命中率，却没有考虑局部性原理或缓存映射方案（直接映射、相联映射、组相联映射）。考试可能会让你计算平均访问时间，或者评价为什么增加缓存大小会带来递减的收益。别忘了，多核系统中会出现缓存一致性问题。

9. Data Representation: Two’s Complement and Floating Point | 数据表示：二进制补码与浮点数

Two’s complement arithmetic is a perennial source of sign-related mistakes. When performing subtraction using two’s complement addition, students often forget to extend the sign bit when moving from 8-bit to 16-bit numbers, or they misinterpret the carry out. Remember that in two’s complement, the most significant bit (MSB) indicates sign, and overflow detection is based on comparing the carry into and out of the MSB.

二进制补码算术是长期存在的符号错误来源。在使用补码加法进行减法运算时，学生经常忘记在将 8 位数扩展到 16 位数时扩展符号位，或者误解进位输出。请记住，在补码中，最高有效位（MSB）表示符号，溢出检测是基于比较进入和离开 MSB 的进位。

Floating-point representation questions demand that you separate a number into sign, mantissa and exponent, then normalise it. The most frequent error is failing to align the mantissa and exponent correctly after a calculation, or not recognizing that the mantissa must start with 0.1 (for a positive number) or 1.0 (for a negative number) in normalised form. Always check your normalisation by ensuring the binary point is just after the sign bit with no leading zeros/ones in the mantissa.

浮点数表示题要求将数字拆分为符号、尾数和指数，然后进行规范化。最常见的错误是计算后未能正确对齐尾数和指数，或者没有识别出在规范化形式下尾数必须从 0.1（正数）或 1.0（负数）开始。务必通过确保二进制小数点紧接符号位之后，且尾数没有前导零/一来检查你的规范化结果。

10. Security Threats and Ethical Dilemmas | 安全威胁与伦理困境

SQA emphasises the ability to discuss security measures, including encryption, firewalls, SQL injection, and DDoS attacks. Candidates often provide generic descriptions (‘a firewall stops hackers’) without explaining that a firewall filters packets based on rules (stateful vs stateless) or that a proxy can hide internal addresses. For encryption, the common mistake is confusing symmetric and asymmetric key exchange; be able to explain how a public/private key pair works in a digital signature or TLS handshake.

SQA 强调讨论安全措施的能力，包括加密、防火墙、SQL注入和 DDoS 攻击。考生常常给出笼统的描述（“防火墙阻止黑客”），却没有解释防火墙如何基于规则过滤数据包（有状态与无状态），或者代理如何隐藏内部地址。对于加密，常见的错误是混淆对称与非对称密钥交换；要能够解释公钥/私钥对如何在数字签名或 TLS 握手中工作。

Ethical and legal topics such as the Data Protection Act (DPA), Computer Misuse Act, and GDPR appear regularly. A subtle error is mixing up what each act covers: DPA governs how personal data is processed and stored, while the Computer Misuse Act criminalises unauthorised access and malware creation. Also, be ready to discuss the ethical implications of AI bias or data harvesting, giving balanced arguments for and against.

伦理与法律话题，如《数据保护法》（DPA）、《计算机滥用法》和 GDPR 经常出现。一个细微的错误是混淆各项法案的管辖范围：DPA 规范个人数据的处理与存储，而《计算机滥用法》将未经授权的访问和恶意软件创作定为刑事犯罪。此外，准备好讨论 AI 偏见或数据收集的伦理影响，给出正反两方面的均衡论点。

---

Published by TutorHao | SQA Computing Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）