Year 13 AQA Computer Science: Case Study Walkthrough | AQA 计算机科学案例分析实战演练

📚 Year 13 AQA Computer Science: Case Study Walkthrough | AQA 计算机科学案例分析实战演练

AQA Year 13 Computer Science exam papers often feature extended case-study questions that blend multiple topics from the specification. These questions assess your ability to read a realistic scenario, decompose its requirements, select appropriate data structures and algorithms, and justify your design decisions. In this article, you will find a structured approach to tackling these case studies through practical walkthroughs, key revision points, and common pitfalls to avoid.

AQA 13 年级计算机科学试卷中经常出现融合多个知识点的拓展案例分析题。这类题目考察你阅读真实场景、分解需求、选择恰当的数据结构与算法，并论证设计决策的能力。本文将提供一套结构化的方法，通过实战演练、关键复习点和常见陷阱分析，帮你有效应对案例分析题。

1. Understanding the Role of Case Studies | 理解案例分析的作用

Case studies in AQA Computer Science are not just about coding; they require systems thinking. You need to interpret a scenario, identify inputs, processes, outputs, constraints, and success criteria. The examiner wants to see evidence that you can apply abstract concepts like abstraction, decomposition, and computational thinking to a concrete problem.

AQA 计算机科学的案例分析远不止于编程，它要求系统化思维。你需要解读场景，识别输入、处理、输出、约束和成功标准。考官希望看到你能够将抽象、分解和计算思维等抽象概念应用于具体问题的证据。

These questions often appear in Paper 1 (programming and algorithms) and Paper 2 (computer systems, theory of computation). They may ask you to design a data structure, trace an algorithm, explain system architecture, or evaluate ethical and legal implications — all within one coherent scenario.

这类题目常出现在 Paper 1（编程与算法）和 Paper 2（计算机系统、计算理论）中。它们可能要求你在一个连贯的场景中设计数据结构、追踪算法、解释系统架构或评估伦理与法律影响。

2. Step 1: Read and Annotate the Scenario | 第一步：阅读并标注场景

Start by reading the scenario twice. On the first pass, underline key nouns (potential entities, data items) and verbs (actions, processes). On the second pass, annotate constraints such as ‘must run in real-time’, ‘handles up to 10,000 records’, or ‘user must be authenticated’. These annotations will later guide your choice of algorithms and data structures.

先阅读场景两遍。第一遍，划出关键名词（潜在实体、数据项）和动词（动作、过程）。第二遍，标注约束条件，例如 ‘必须实时运行’、’最多处理 10,000 条记录’ 或 ‘用户须认证’。这些标记随后将指导你选择算法和数据结构。

Create a quick table on your exam paper: list the functional requirements, non-functional requirements, and constraints separately. This decomposition is the first tangible output the examiner looks for. An example layout:

在试卷空白处快速画一个表格：分别列出功能需求、非功能需求和约束条件。这种分解是考官期待的第一个实质性输出。示例如下：

Functional	Non-functional	Constraints
Search book by title/author	Response time < 2 s	Available memory: 512 MB
Borrow and return items	99.9% uptime	Must integrate with legacy barcode system

3. Step 2: Choose the Right Abstract Data Types (ADTs) | 第二步：选择合适的抽象数据类型

Once the requirements are clear, map them to ADTs. For a library system ‘reservation queue’, a queue (FIFO) is appropriate. For a ‘most frequently borrowed books’ feature, a priority queue or a heap might be best. For storing book records with fast retrieval by ISBN, a hash table gives O(1) average lookup.

需求明确后，将其映射到抽象数据类型。对于图书馆系统的 ‘预约队列’，队列（FIFO）是合适的。对于 ‘最常借阅图书’ 功能，优先队列或堆可能最佳。对于通过 ISBN 快速检索的图书记录，哈希表可提供 O(1) 平均查找时间。

Always justify your choice by referring to the time and space complexity implied by the scenario. For example, if the scenario mentions that the user list is rarely updated but frequently searched, a binary search on a sorted array (O(log n) search) might be more memory-efficient than a hash table.

始终通过引用场景隐含的时间和空间复杂度来论证你的选择。例如，如果场景提到用户列表很少更新但频繁搜索，在有序数组上进行二分查找（O(log n) 搜索）可能比哈希表更节省内存。

A common trap is over-engineering: don’t suggest a B-tree if a simple array suffices. Refer back to the data volumes and performance targets you noted in Step 1. Examiners reward simplicity with sound reasoning.

一个常见陷阱是过度设计：如果简单数组就足够，不要建议 B 树。回顾第一步中你记录的数据量和性能指标。基于合理推论的简洁设计会得到考官加分。

4. Step 3: Algorithm Selection and Pseudocode Design | 第三步：算法选择与伪代码设计

For process-heavy requirements, pick classic algorithms. Searching might need binary search; sorting might be handled with merge sort (O(n log n)) if stability and worst-case guarantees matter. For graph-based scenarios like a transportation network, Dijkstra’s algorithm or A* might be expected. Reference your decision to well-known standard algorithms — AQA expects you to know them by name.

对于过程密集型需求，选择经典算法。搜索可能需要二分查找；如果稳定性和最坏情况保证很重要，排序可能用归并排序（O(n log n)）。对于像交通网络这样基于图的场景，可能需要 Dijkstra 或 A* 算法。引用你对知名标准算法的选择决策——AQA 期望你知道它们的名称。

Your pseudocode should be clear and AQA-style, not language-specific. Use indentation, WHILE…ENDWHILE, IF…ENDIF, and descriptive variable names. Even a rough pseudocode outline can earn marks if it demonstrates the correct logic.

你的伪代码应清晰且符合 AQA 风格，而非特定编程语言。使用缩进、WHILE…ENDWHILE、IF…ENDIF 以及描述性变量名。即使是粗略的伪代码大纲，只要展示出正确逻辑，就能得分。

Example: handling a library fine calculation.

PROCEDURE CalculateFine(daysLate)
    IF daysLate <= 0 THEN
        fine ← 0
    ELSE IF daysLate <= 7 THEN
        fine ← daysLate * 0.20
    ELSE
        fine ← 7 * 0.20 + (daysLate - 7) * 0.50
    ENDIF
    RETURN fine
ENDPROCEDURE

示例：处理图书馆罚款计算。

PROCEDURE CalculateFine(daysLate)
    IF daysLate <= 0 THEN
        fine ← 0
    ELSE IF daysLate <= 7 THEN
        fine ← daysLate * 0.20
    ELSE
        fine ← 7 * 0.20 + (daysLate - 7) * 0.50
    ENDIF
    RETURN fine
ENDPROCEDURE

5. Step 4: Data Representation and File Structures | 第四步：数据表示与文件结构

Often a case study involves persistent storage. Decide between flat files, CSV, XML, JSON, or relational databases — and justify your choice. If the data is highly structured with relationships, a relational database with SQL is appropriate. Mention normalisation (up to 3NF) to reduce redundancy. For simple key-value settings, a CSV file might be more efficient and easier to parse.

案例分析常涉及持久化存储。在平面文件、CSV、XML、JSON 或关系数据库之间做出选择，并说明理由。如果数据高度结构化且有关联，使用带 SQL 的关系数据库是合适的。提及规范化（至 3NF）以减少冗余。对于简单的键值场景，CSV 文件可能更高效且易于解析。

Consider transmission needs: if the system sends data over a network, a lightweight format like JSON might be favoured over XML. If data integrity and ACID transactions are critical, a database is essential. Always tie your rationale back to explicit or implicit scenario requirements.

考虑传输需求：如果系统通过网络发送数据，轻量级格式如 JSON 可能优于 XML。如果数据完整性和 ACID 事务至关重要，数据库是必需的。始终将你的理由与场景中明示或隐含的需求挂钩。

6. Step 5: System Architecture and Security | 第五步：系统架构与安全

Modern AQA scenarios often include security considerations. You might need to describe authentication (password hashing, 2FA), authorisation (access levels), encryption (symmetric vs. asymmetric), and protection against SQL injection or XSS. Even if the question doesn't ask directly, a mention can demonstrate synoptic knowledge.

现代 AQA 场景通常包含安全考量。你可能需要描述认证（密码哈希、2FA）、授权（访问级别）、加密（对称与非对称）以及防范 SQL 注入或 XSS。即使题目未直接要求，提及这些可展示你的综览知识。

For system architecture, know the difference between client-server and peer-to-peer models. Describe when a thin-client web application (all logic on server) is suitable versus a thick client (processing on local machine). Link your choice to factors like bandwidth, latency, and maintainability.

关于系统架构，要了解客户端-服务器与对等网络模型的区别。描述何时适合使用瘦客户端 Web 应用（所有逻辑在服务器）而非胖客户端（在本地机器处理）。将你的选择与带宽、延迟和可维护性等因素联系起来。

7. Step 6: Testing Strategy and Trace Tables | 第六步：测试策略与追踪表

Design a test plan covering normal, boundary, and erroneous data. For a library fine calculation, test daysLate = 0, 1, 7, 8, negative values, and very large values. Explain how you would use equivalence partitioning to reduce the number of test cases without sacrificing coverage.

设计一个覆盖正常、边界和错误数据的测试计划。对于图书馆罚款计算，测试 daysLate = 0、1、7、8、负值以及超大的值。解释如何使用等价类划分来减少测试用例数量而不牺牲覆盖率。

Trace tables are frequently asked. Practice constructing a table with columns for each variable and loop iteration. This shows the examiner you can dry-run an algorithm. Make sure you update variable values in the correct sequence and indicate changes clearly.

追踪表经常被考察。练习构建包含每个变量和循环迭代列的表。这向考官展示你可以干运行算法。确保按正确顺序更新变量值，并清晰标示变化。

8. Step 7: Evaluation and Justification | 第七步：评估与论证

Many case studies end with an evaluative question: 'Discuss the strengths and weaknesses of your solution' or 'How could the system be improved?'. Here you must be reflective. Acknowledge limitations: for example, a hash table approach might degrade if many collisions occur; you could suggest using a self-balancing tree as an alternative. Always propose at least one realistic improvement, such as adding indexing for faster queries or implementing caching.

许多案例研究以评估性问题结束：'讨论你方案的优缺点' 或 '该系统可如何改进？'。此时你必须反思。承认局限性：例如，如果发生大量冲突，哈希表方案可能性能下降；你可以建议使用自平衡树作为替代。始终提出至少一个现实的改进，例如添加索引以加速查询或实现缓存。

Consider broader impacts: discuss legal compliance (GDPR if personal data is involved), ethical issues (bias in algorithmic decisions), and environmental factors (energy consumption of server farms). These show mature, holistic thinking that AQA examiners value highly.

考虑更广泛的影响：讨论法律合规（如涉及个人数据的 GDPR）、伦理问题（算法决策中的偏见）和环境因素（服务器群的能耗）。这些展示出成熟、全面的思考，正是 AQA 考官高度赞赏的。

9. Real-World Example Walkthrough: Exam Booking System | 实战范例讲解：考试预约系统

Let's apply the steps to a typical AQA-style scenario: An online exam booking system allows students to reserve seats for modules. Each module has a limited capacity (30 students), and a student can only book if they have paid the exam fee. The system must prevent double-bookings and maintain a waiting list if a module is full.

让我们将这些步骤应用于一个典型的 AQA 风格场景：一个在线考试预约系统允许学生预约各模块考位。每个模块容量有限（30 名学生），学生只有在已付考试费后才能预约。系统必须防止重复预约，并在模块满员时维护等候名单。

Step 1 – Annotations: Entities: Student, Module, Booking. Actions: reserve, check payment, add to waiting list. Constraints: capacity 30, must check payment status, FIFO waiting list.

第一步 – 标注： 实体：学生、模块、预约。动作：预约、检查付款、添入等候名单。约束：容量 30、必须检查付款状态、先进先出等候名单。

Step 2 – ADTs: Module list could be a hash table keyed by module code (fast lookup). Waiting list for each module: a queue (FIFO). Student records: hash table or sorted array if frequent searches by ID. Booking records: stack if we only need the most recent, but a list is better for full history.

第二步 – 抽象数据类型： 模块列表可用以模块代码为键的哈希表（快速查找）。每个模块的等候名单：队列（FIFO）。学生记录：若按 ID 频繁搜索，用哈希表或有序数组。预约记录：若只需最新记录可用栈，但保存完整历史用列表更好。

Step 3 – Algorithm: When a student requests a module, check payment flag. If paid and module.capacity > 0, add booking; else if paid but full, add to queue. Ensure transaction atomicity to avoid race conditions. Provide pseudocode using IF-ELSE and WHILE for processing the queue when a seat becomes free.

第三步 – 算法： 当学生请求某个模块，检查付款标志。如果已付且 module.capacity > 0，添加预约；否则如果已付但满员，添加入队列。确保事务原子性以避免竞态条件。使用 IF-ELSE 和 WHILE 提供伪代码，在考位释放时处理队列。

Step 6 – Testing: Test cases: student with no payment, student with payment for a module with vacant spaces, module exactly at capacity, module full (trigger waiting list), and a cancellation that frees a seat (ensure waiting list FIFO). Trace table for waiting list operations.

第六步 – 测试： 测试用例：未付款的学生、已付款且模块有空位、模块恰好满员、模块满员（触发等候名单）以及取消预约释放考位（确保等候名单先进先出）。为等候名单操作绘制追踪表。

10. Common Mistakes and How to Avoid Them | 常见错误及如何避免

Students often lose marks by: (1) Ignoring constraints — if the scenario specifies limited memory, your solution must respect that. (2) Providing vague justifications — never just say 'because it is faster'; always quote O-notation or the specific number of operations. (3) Forgetting to mention error handling — state what happens if the input file is missing or a user enters invalid data. (4) Proposing overly complex solutions — simplicity is a virtue in exam answers.

学生常因以下情况失分：(1) 忽略约束——如果场景指定内存有限，你的解决方案必须遵守。(2) 提供模糊论证——绝不要只说 '因为它更快'，始终引用大 O 表示法或具体操作次数。(3) 忘记提及错误处理——说明如果输入文件缺失或用户输入无效数据会发生什么。(4) 提出过度复杂的方案——简洁在考试答案中是一种美德。

Another trap is not linking the solution back to the scenario. After you propose a data structure, explicitly say: 'This fulfils requirement X because it provides O(1) access while staying within the memory limit of Y MB mentioned in the brief.' This demonstrates real engagement with the problem.

另一个陷阱是未将解决方案与场景关联。在你提出一个数据结构后，明确说明：'这满足了需求 X，因为它提供 O(1) 访问，同时保持在简介中提到的 Y MB 内存限制内。' 这展示了对问题的真正投入。

11. Exam Command Words Decoded | 考试指令词解读

AQA uses specific command words. State requires a brief answer; Describe asks for a step-by-step account; Explain wants reasons; Compare needs similarities and differences; Justify requires evidence and reasoning. Recognising these ensures you structure your answer correctly and avoid wasting time on unnecessary detail.

AQA 使用特定的指令词。State 需要简要回答；Describe 要求逐步叙述；Explain 需要原因；Compare 需要相似点和不同点；Justify 需要证据和推理。识别这些可以确保你正确组织答案，避免在无关细节上浪费时间。

For case-study questions, Design and Implement are common. Even if you only produce pseudocode, follow a top-down modular design: break the problem into procedures/functions, and show how they interact. The examiner expects to see decomposition.

对于案例分析题，Design 和 Implement 很常见。即使你只输出伪代码，也要遵循自顶向下的模块化设计：将问题分解为过程/函数，并展示它们如何交互。考官希望看到分解过程。

12. Final Tips and Practice Routine | 终极提示与练习方法

Build a revision bank of case-study scenarios from past papers and the AQA specimen materials. Time yourself: allocate roughly 1 minute per mark. Practice annotating the scenario and drafting data structures before writing formal pseudocode. This planning phase is where high-scoring candidates differentiate themselves.

从历年真题和 AQA 样卷中收集案例分析场景，建立复习题库。计时练习：大约每 1 分分配 1 分钟。在撰写正式伪代码之前，练习标注场景和起草数据结构。这个规划阶段正是高分考生脱颖而出的地方。

Remember that AQA rewards clear communication. Use bullet points and tables in your answer where appropriate, label diagrams, and keep your pseudocode well-commented. The more you practice structuring your thought process, the more automatic it will become under exam conditions.

请记住，AQA 奖励清晰的表达。在答案中适当使用项目符号和表格，为图表标注，并保持伪代码有良好注释。你越多地练习结构化思维过程，在考试条件下就会变得越发自然。

Published by TutorHao | Computer Science Revision Series | aleveler.com

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

Year 13 AQA Computer Science: Case Study Walkthrough | AQA 计算机科学案例分析实战演练