Year 13 SQA Computing: Unit Test Mock Paper Analysis | SQA 计算机：单元测试模拟卷解析

📚 Year 13 SQA Computing: Unit Test Mock Paper Analysis | SQA 计算机：单元测试模拟卷解析

This article provides a detailed walkthrough of a typical SQA Advanced Higher Computing unit test mock paper. We examine the structure, key question types, and common marking points. For each section you will find worked answers, examiner-style commentary, and revision strategies that target the highest marks. This resource is designed to help you move from simply recalling facts to applying analytical thinking under timed conditions.

本文对一份典型的 SQA 高级计算机单元测试模拟卷进行逐题精讲。我们将剖析试卷结构、重点题型和常见得分点，每节配有参考答案、阅卷人视角的点评以及冲刺高分的复习策略。这份资料旨在帮助你在限时条件下，从简单复述事实提升到应用分析与推理的层次。

1. Exam Structure and Marking Guidelines | 试卷结构与评分标准

The mock paper typically consists of two sections. Section 1 contains 20 multiple-choice questions worth 20 marks, assessing breadth of knowledge across the entire Higher syllabus. Section 2 comprises structured and extended-response questions totalling 50 marks, often including a programming problem, a database design task, and an analysis of a given scenario. You are allowed 90 minutes in total. Marks are awarded for accuracy, use of appropriate terminology, and justification of choices. Where a question asks you to “explain” or “describe”, bullet-point lists are acceptable only if they form complete sentences. Diagrams must be clearly labelled.

模拟卷通常分为两部分。第一部分为 20 道选择题，共 20 分，考查对整个 Higher 教学大纲的广度掌握。第二部分是结构化与拓展回答题，共 50 分，往往包括一个编程问题、一个数据库设计任务以及一个给定情境的分析。总时长 90 分钟。分数根据准确性、术语运用和选择理由给予。凡是要求“解释”或“描述”的问题，仅当项目符号构成完整句子时才被接受；图表必须清晰标注。

Section	Question Types	Marks	Time Guide
1	Multiple choice	20	25 min
2	Structured / extended response	50	65 min

试卷分为两部分：选择题 20 分，建议用时 25 分钟；结构化题 50 分，建议用时 65 分钟。

2. Multiple Choice: Data Structures and Complexity | 选择题解析：数据结构与复杂度

A classic question asks: “Which data structure operates on a Last-In-First-Out (LIFO) principle?” The answer is a stack. The queue is First-In-First-Out (FIFO). A common distractor is the array, which allows indexed access but has no inherent LIFO behaviour. Other high-frequency topics include identifying the worst-case time complexity of linear search (O(n)) and binary search (O(log n)). Be ready to label an algorithm as O(1), O(n), O(n2) or O(2n) based on nested loops.

一道经典选择题是：“哪种数据结构按后进先出（LIFO）原则工作？”答案为栈。队列是先进先出（FIFO）。常见干扰项为数组，数组允许索引访问但没有固定的 LIFO 行为。其他高频考点包括线性查找的最坏时间复杂度 O(n) 和二分查找的 O(log n)。需要你根据嵌套循环判断算法是 O(1)、O(n)、O(n²) 还是 O(2ⁿ)。

“Which search algorithm requires the data to be sorted?” → Binary search.
“哪种查找算法要求数据已排序？” → 二分查找。

For example, a code snippet with two nested loops each iterating from 0 to n-1 gives O(n2). If a loop halves the problem size each time, it is O(log n). Time complexity notations always use the worst case unless otherwise stated.

例如，两个嵌套循环各自遍历 0 到 n-1 的代码片段，时间复杂度为 O(n²)。如果一个循环每次将问题规模减半，则为 O(log n)。除非另有说明，时间复杂度总使用最坏情况表示。

3. Algorithm Analysis: Tracing and Efficiency | 算法分析：跟踪与效率

A typical Section 2 question gives a pseudocode algorithm for finding the maximum value in an array. You are asked to trace the algorithm with a given dataset and then state its time complexity. The trace must show the changing values of key variables (e.g., index and current maximum) at each iteration. When stating efficiency, write O(n) and justify it: the algorithm inspects every element once, so the number of operations grows linearly with the input size.

典型的第二部分题目会给出一个在数组中查找最大值的伪代码算法，要求你使用给出的数据集进行跟踪，然后说明其时间复杂度。跟踪过程必须展示每次迭代中关键变量（如索引和当前最大值）的变化。在说明效率时，应写出 O(n) 并给出理由：算法检查每个元素一次，因此操作次数随输入规模线性增长。

max ← arr[0]
FOR i ← 1 TO LEN(arr)-1
IF arr[i] > max THEN max ← arr[i]
END FOR

Common mistakes include omitting the initialisation step, confusing best case with worst case, and failing to mention that the array indexing starts at 0. Always link the loop structure directly to the O(n) conclusion. If the algorithm contains a nested loop, explicitly count the total executions.

常见错误包括遗漏初始化步骤、混淆最佳情况与最坏情况、以及未说明数组索引从 0 开始。务必把循环结构直接与 O(n) 结论联系起来。如果算法含有嵌套循环，要明确计算总执行次数。

4. Object-Oriented Programming: Inheritance and Polymorphism | 面向对象编程：继承与多态

Questions on object-oriented design often present a class diagram with superclass and subclasses. You may be asked to write a class definition in pseudocode, explaining how inheritance reduces code duplication. The subclass inherits attributes and methods from the superclass using the extends or inherits keyword. Overriding a method in the subclass demonstrates polymorphism: the same method name produces different behaviour depending on the object type.

面向对象设计的题目通常给出包含超类和子类的类图，要求你用伪代码写出类定义，并解释继承如何减少代码重复。子类使用 extends 或 inherits 关键字从超类继承属性和方法。在子类中重写方法体现了多态性：相同的方法名根据对象类型产生不同的行为。

For example, a superclass Vehicle has method displayInfo(). Subclasses Car and Bike each override displayInfo(). When a program iterates through a list of Vehicle references, calling displayInfo() on each object invokes the overridden version. This is dynamic binding, a core concept for the SQA Advanced Higher. Marks are awarded for correct syntax, clear labelling of overridden methods, and an explanation of runtime method dispatch.

例如，超类 Vehicle 有方法 displayInfo()，子类 Car 和 Bike 各自重写 displayInfo()。当程序遍历一个 Vehicle 引用列表并对每个对象调用 displayInfo() 时，实际执行的是重写后的版本。这就是动态绑定，是 SQA 高级课程的核心概念。正确的语法、清晰标注重写方法以及解释运行时方法分派，均可获得分数。

5. Database Design and SQL Queries | 数据库设计与 SQL 查询

The mock paper frequently includes an entity-relationship (ER) diagram and asks you to write SQL statements. You must be able to identify primary keys, foreign keys, and cardinality (one-to-many, many-to-many). A linking table is required for many-to-many relationships. SQL commands tested include SELECT with WHERE, ORDER BY, GROUP BY with aggregate functions (COUNT, SUM, AVG), and JOIN operations. Always use INNER JOIN when matching records across tables, and LEFT JOIN only if you need to retain all records from the left table.

模拟卷经常包含实体关系图并要求撰写 SQL 语句。你必须能够识别主键、外键和基数（一对多、多对多）。多对多关系需要使用链接表。常考的 SQL 命令包括含 WHERE、ORDER BY 的 SELECT、带聚合函数（COUNT、SUM、AVG）的 GROUP BY 以及 JOIN 操作。跨表匹配记录时始终使用 INNER JOIN，仅当需要保留左表所有记录时才用 LEFT JOIN。

Task	SQL Example
Find total orders per customer	SELECT customer_id, COUNT(*) FROM orders GROUP BY customer_id;
Join customers and orders	SELECT name, order_date FROM customers INNER JOIN orders ON customers.id = orders.customer_id;

Data integrity is a key theme: referential integrity ensures foreign key values match existing primary keys. When updating or deleting, ON DELETE CASCADE or ON UPDATE CASCADE may be specified to maintain consistency. Normalisation may be tested by asking you to reduce redundancy, but the emphasis is on practical SQL and design choices.

数据完整性是重要主题：引用完整性确保外键值与现有主键匹配。在更新或删除时，可指定 ON DELETE CASCADE 或 ON UPDATE CASCADE 来保持一致性。规范化可能通过要求减少冗余来考查，但重点是实际的 SQL 和设计选择。

6. Computer Architecture: Fetch-Execute Cycle and Processor Components | 计算机体系结构：取指执行周期与处理器组件

You are likely to encounter a description of the fetch-execute cycle. Be prepared to explain the role of the program counter (PC), memory address register (MAR), memory data register (MDR), current instruction register (CIR), and the accumulator. The cycle steps are: PC places the address in MAR, the instruction is fetched into MDR then CIR, the PC increments, the control unit decodes the instruction, and the ALU executes it.

你很可能遇到取指执行周期的描述题。要准备好解释程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器的作用。周期步骤为：PC 将地址放入 MAR，指令被取出放入 MDR 再到 CIR，PC 递增，控制单元解码，ALU 执行。

Questions often ask how increasing the clock speed or number of cores affects performance. A higher clock speed allows more cycles per second but generates more heat. Multiple cores enable true parallel execution for multi-threaded programs. However, not all tasks can be parallelised; Amdahl’s law limits the speedup. Marks are given for precise use of terms like “pipeline” and “cache hit rate”.

题目经常询问提高时钟频率或增加核心数如何影响性能。更高的时钟频率允许每秒更多周期，但会产生更多热量。多核心使多线程程序真正并行执行。但并非所有任务都可并行化；阿姆达尔定律限制加速比。准确使用“流水线”和“缓存命中率”等术语会获得加分。

7. Networking: Protocols and the TCP/IP Stack | 网络：协议与 TCP/IP 协议栈

The SQA Advanced Higher expects you to describe the four layers of the TCP/IP model: Application, Transport, Internet, and Network Access. You should map common protocols to layers – HTTP/HTTPS and FTP at Application, TCP and UDP at Transport, IP at Internet. Explain the difference between TCP (connection-oriented, reliable) and UDP (connectionless, faster but no guarantee of delivery). The three-way handshake (SYN, SYN-ACK, ACK) is a favourite exam detail.

SQA 高级课程要求你描述 TCP/IP 模型的四个层次：应用层、传输层、互联网层和网络访问层。你需要把常见协议映射到各层 — HTTP/HTTPS 和 FTP 在应用层，TCP 和 UDP 在传输层，IP 在互联网层。要解释 TCP（面向连接、可靠）与 UDP（无连接、更快但不保证交付）的区别。三次握手（SYN、SYN-ACK、ACK）是常考的细节。

If a question asks you to justify using UDP for video streaming, mention that occasional packet loss is acceptable for real-time transfer, and the overhead of TCP handshake and retransmission would cause unacceptable latency. Address resolution (ARP) and the role of switches and routers may appear in the Network Access layer context. Always link your answer back to the scenario.

如果考题要求论证为何视频流使用 UDP，要提到对于实时传输偶尔丢包可以接受，而 TCP 握手和重传的开销会导致不可接受的延迟。地址解析（ARP）以及交换机和路由器的作用可能出现在网络访问层内容中。始终将答案与给定情境关联起来。

8. Software Development Models: Waterfall vs. Agile | 软件开发模型：瀑布与敏捷

Mock papers often feature a short case study describing a project, and you must recommend a development methodology. The waterfall model is linear and phase-based, suitable when requirements are well understood and unlikely to change. Its stages are analysis, design, implementation, testing, deployment, and maintenance. Agile models (e.g., Scrum, XP) use iterative cycles, delivering working software in sprints, and welcome changing requirements through continuous customer collaboration.

模拟卷中常有一个简短的案例研究描述项目，要求你推荐开发方法。瀑布模型是线性的、基于阶段的，适用于需求明确且不太可能变化的项目。其阶段包括分析、设计、实现、测试、部署和维护。敏捷模型（如 Scrum、XP）使用迭代周期，通过冲刺交付可用软件，并通过持续客户协作欢迎需求变更。

When justifying a choice, link features to the scenario: “Because the client is unsure about the final interface, an iterative approach with regular prototypes would reduce risk.” Acknowledge limitations: waterfall makes it hard to go back once a phase ends, while Agile requires disciplined team communication and extensive user involvement. The SQA expects balanced evaluation, not a one-sided argument.

在论证选择时，将特点与情境联系起来：“因为客户对最终界面不确定，带定期原型的迭代方法可降低风险。”也要承认局限性：瀑布模型一旦阶段结束就很难回溯，而敏捷则需要严格的团队沟通和深度的用户参与。SQA 期望做出平衡评估，而非片面的论点。

9. Programming Challenge: From Pseudocode to Code | 编程挑战：从伪代码到代码

You might be given pseudocode with a deliberate error or inefficiency. For instance, a search algorithm that does not stop after the target is found, wasting CPU cycles. The task is to rewrite the corrected version in a real programming language, such as Python or Java, and comment on the improvement. Ensure you use meaningful variable names and proper indentation. Marks are awarded for syntax correctness, logical efficiency, and commentary.

你可能会遇到带有故意错误或低效之处的伪代码。例如，一个查找算法在找到目标后仍未停止，浪费 CPU 周期。任务是在真实编程语言（如 Python 或 Java）中重写纠正后的版本，并对改进加以评论。务必使用有意义的变量名和正确的缩进。语法正确性、逻辑效率和评注都能得分。

A common follow-up asks: “How would you test this code?” Discuss black-box testing (input/output without looking at code) and white-box testing (examining paths, branches). Mention boundary values, such as an empty array or a target at the first/last index. A short test table listing test input, expected output, and actual output will often secure full marks.

常见的后续问题是：“你如何测试这段代码？” 讨论黑盒测试（只看输入输出）和白盒测试（检查路径和分支）。提及边界值，如空数组或目标位于第一个/最后一个索引处。列出测试输入、预期输出和实际输出的简短测试表，通常能拿到满分。

10. Common Pitfalls and Revision Tips | 常见错误与备考建议

The most frequent errors include confusing a stack with a queue, writing SQL without specifying a join condition (resulting in Cartesian product), forgetting to initialise variables in pseudocode, and mixing up layers of the TCP/IP model. In the extended writing, giving a vague description instead of using technical terms costs marks. Always answer in the context of the question stem; generic statements gain no credit.

最常见的错误包括混淆栈与队列、在 SQL 中未指定连接条件（导致笛卡尔积）、伪代码中忘记初始化变量以及混淆 TCP/IP 模型各层。在拓展写作中，使用模糊的描述而非专业术语会丢分。始终结合题干情境作答；泛泛而谈不会得分。

Active revision: complete past papers under timed conditions, then mark using the SQA marking scheme.
主动复习：在限时条件下完成历年试卷，然后根据 SQA 评分方案自行批改。
Flashcards for definitions: e.g., “polymorphism”, “referential integrity”, “fetch-decode-execute”.
用闪卡记忆定义：例如“多态”、“引用完整性”、“取指-解码-执行”。
Draw diagrams from memory: CPU architecture, ER diagrams, TCP/IP stack.
默画图表：CPU 架构、ER 图、TCP/IP 协议栈。

Finally, allocate the last 5 minutes of the exam to check for omitted units, unlabelled axes on graphs, and any unanswered sub-parts. Even one extra mark can raise your grade. Approach the mock paper as a rehearsal; every mistake you correct now is a mark saved in the final exam.

最后，在考试结束前留出 5 分钟检查遗漏的单位、未标注的图轴以及未回答的小问。即使多拿一分也可能提升等级。把模拟卷当作彩排；现在纠正的每一个错误，都是大考中守住的分数。

Published by TutorHao | Computing Revision Series | aleveler.com

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

Year 13 SQA Computing: Unit Test Mock Paper Analysis | SQA 计算机：单元测试模拟卷解析