Case Study Practical Exercises for OCR GCSE Computer Science | 案例分析实战演练 (OCR GCSE 计算机科学)

📚 Case Study Practical Exercises for OCR GCSE Computer Science | 案例分析实战演练 (OCR GCSE 计算机科学)

This article walks you through a realistic case study in the style of the OCR GCSE Computer Science exam, focusing on the development of a simple library book reservation system. You will practise decomposition, algorithm design, trace tables, coding, testing, and evaluation — exactly the skills assessed in Component 2. By working step by step, you gain confidence in handling any scenario the exam might present.

本文将带你演练一个 OCR GCSE 计算机科学风格的真题式案例研究，主题是简易图书馆图书预约系统的开发。你会依次练习问题分解、算法设计、跟踪表、编程实现、测试和评估，全面覆盖试卷第二部分所考查的技能。逐步演练能帮你从容应对考试中可能出现的任何情景。

1. Understanding the Scenario | 理解案例情景

The local library wants a program that lets members reserve up to three books. A member enters their ID, then the ISBN of the book they wish to reserve. The system must check whether the member already has three reservations, whether the book exists, and whether copies are available. If all checks pass, the reservation is added and the available stock is reduced by one. The system should also allow a librarian to view all active reservations sorted by member ID.

当地图书馆需要一个程序，允许会员预约最多三本书。会员输入自己的 ID 和想要预约的图书 ISBN。系统必须检查该会员是否已有三个预约、图书是否存在、以及是否有可借副本。所有检查通过后，预约将被添加，同时可用库存减少一本。系统还应允许图书管理员查看所有活跃预约，并按会员 ID 排序。

2. Breaking Down the Problem | 问题分解

Decomposition is the first essential step in computational thinking. Here we break the system into manageable modules: Input (member ID, ISBN), Process (validation checks, stock update, reservation storage), and Output (confirmation, error messages, reservation list). Additionally, we identify sub-problems: a function to check membership validity, a function to check stock, a function to count existing reservations, and a sorting routine for the librarian’s view.

分解是计算思维中首要的关键步骤。我们把系统拆分为可管理的模块：输入（会员 ID、ISBN）、处理（验证检查、库存更新、预约存储）和输出（确认信息、错误提示、预约列表）。此外，我们识别出若干子问题：验证会员有效性的函数、检查库存的函数、统计现有预约数量的函数，以及用于管理员视图的排序例程。

3. Designing with Flowcharts | 流程图设计

Before writing any code, we sketch a flowchart for the main reservation process. The flowchart begins with two inputs. A decision diamond checks ‘Is the member ID valid?’ If no, output an error and stop. If yes, proceed to ‘Number of current reservations >= 3?’ leading to error if true. Next, ‘Does the ISBN exist?’ and ‘Is stock > 0?’. If all conditions pass, add the reservation record and decrement stock. Flowcharts help visualise the sequence and branching clearly.

在写任何代码之前，我们先为预约主流程绘制一张流程图。流程图从两个输入开始。一个判断菱形检查“会员 ID 是否有效？”如果无效，输出错误并停止。如果有效，继续检查“当前预约数量是否 ≥3？”，若真则输出错误。接着询问“ISBN 是否存在？”以及“库存是否 >0？”。所有条件都满足后，添加预约记录并扣减库存。流程图有助于清晰地可视化顺序和分支。

4. Writing Pseudocode | 编写伪代码

Pseudocode bridges the gap between design and implementation. Using the OCR pseudocode style, we can outline the main algorithm:

伪代码是设计与实现之间的桥梁。按照 OCR 伪代码风格，我们可以勾勒出主算法：

PROCEDURE reserve_book(memberID, ISBN)
    IF memberID NOT IN members THEN
        RETURN "Invalid member"
    ENDIF
    reservationCount ← COUNT reservations WHERE memberID = memberID
    IF reservationCount >= 3 THEN
        RETURN "Reservation limit reached"
    ENDIF
    IF ISBN NOT IN books THEN
        RETURN "Book not found"
    ENDIF
    stock ← books[ISBN].available
    IF stock <= 0 THEN
        RETURN "No copies available"
    ENDIF
    reservations.append({memberID, ISBN, date})
    books[ISBN].available ← stock - 1
    RETURN "Reservation successful"
ENDPROCEDURE

The pseudocode uses clear conditional statements and a data structure approach. It mirrors the flowchart logic in a text-based form that can later be directly translated into Python or another language.

这段伪代码使用了清晰的条件语句和数据结构思路。它以文本形式复现了流程图逻辑，随后可以直接翻译成 Python 或其他语言。

5. Tracing the Logic | 逻辑跟踪

A trace table is vital for verifying correctness before coding. Let's trace an example: member 'M01' has two reservations, book ISBN '978-0-12-345678-9' has 3 copies. We step through the pseudocode line by line, updating variables: memberID ← 'M01', ISBN ← '978-0-12-345678-9', valid member → TRUE, reservationCount ← 2 (less than 3), book exists → TRUE, stock ← 3 (>0), append reservation, stock becomes 2. The trace shows the expected output 'Reservation successful'.

跟踪表是在编码前验证正确性的重要工具。我们跟踪一个例子：会员 'M01' 已有两个预约，图书 ISBN '978-0-12-345678-9' 有 3 本。逐行执行伪代码，更新变量：memberID ← 'M01'，ISBN ← '978-0-12-345678-9'，会员有效 → TRUE，reservationCount ← 2（小于3），图书存在 → TRUE，stock ← 3（>0），添加预约记录，stock 变为 2。跟踪结果显示预期输出为“预约成功”。

A trace table can be laid out as follows:

跟踪表可以如下设计：

Step	currentReservations	stock	Output
1	2	3	-
2	2	2	Reservation successful

6. Implementing in Python | Python 代码实现

Translating the design into a working Python program tests our understanding of syntax and data structures. A possible implementation uses dictionaries for members and books, and a list for reservations.

将设计转化为可运行的 Python 程序，可以检验我们对语法和数据结构的理解。一个可行的实现方案使用字典存储会员和图书，用列表存储预约。

members = {'M01':'Alice', 'M02':'Bob', 'M03':'Charlie'}
books = {'978-0-12-345678-9': {'title':'Computing 101', 'available':3},
         '978-0-98-765432-1': {'title':'Algorithms Unlocked', 'available':1}}
reservations = []

def reserve_book(member_id, isbn):
    if member_id not in members:
        return "Invalid member ID"
    count = sum(1 for r in reservations if r['member'] == member_id)
    if count >= 3:
        return "Reservation limit reached"
    if isbn not in books:
        return "Book not found"
    if books[isbn]['available'] <= 0:
        return "No copies available"
    reservations.append({'member': member_id, 'isbn': isbn})
    books[isbn]['available'] -= 1
    return "Reservation successful"

The code uses a list comprehension to count existing reservations efficiently. Functions encapsulate the core logic, making the program modular and easy to test.

代码使用列表推导式高效地统计现有预约数量。函数封装了核心逻辑，使程序模块化且易于测试。

7. Testing and Validation | 测试与验证

A rigorous test plan ensures the program behaves correctly in all scenarios. We design tests for normal, boundary, and erroneous cases. For example: test a valid reservation, attempt a fourth reservation (limit boundary), try an invalid ISBN, and attempt a reservation when stock is zero. Each test records the input, expected outcome, and actual outcome.

严格的测试计划能确保程序在所有场景下都能正确运行。我们针对正常、边界和错误情况设计测试用例。例如：测试有效预约、尝试第四次预约（上限边界）、输入无效 ISBN、在库存为零时尝试预约。每个测试记录输入、预期结果和实际结果。

Test ID	Input	Expected Output	Type
1	M01, 978-0-12-345678-9	Reservation successful	Normal
2	M01 (with 3 reservations), valid ISBN	Reservation limit reached	Boundary
3	M99, valid ISBN	Invalid member ID	Erroneous
4	M02, 978-0-98-765432-1 (stock 0)	No copies available	Boundary

Validation includes checking input data types and lengths, but here the core validation is handled by the existence and numeric conditions.

验证包括检查输入数据类型和长度，但本例的核心验证由存在性和数值条件处理。

8. Evaluating the Solution | 评估解决方案

After building and testing, we reflect on the system's strengths and weaknesses. The solution meets the core requirements: it controls reservation limits, updates stock dynamically, and allows for extensions. However, it lacks persistent storage (all data is in memory) and does not handle concurrent access. In an exam, you would discuss how to refine the system, perhaps by using a file or database, adding a graphical interface, or implementing a more sophisticated search.

完成构建和测试后，我们反思该系统的优点和不足。该方案满足了核心需求：控制预约上限、动态更新库存，并具备可扩展性。但它缺少持久化存储（数据均在内存中），也未处理并发访问。在考试中，你会讨论如何优化系统，例如使用文件或数据库、添加图形界面，或实现更复杂的搜索功能。

Evaluating also means considering the efficiency of algorithms. The current solution uses linear search when counting reservations; for large datasets a hash-based approach or database indexing would be faster. Highlighting such improvements shows a deeper understanding.

评估还意味着考虑算法效率。当前方案在统计预约时使用线性搜索；对于大型数据集，基于哈希的方法或数据库索引会更快。指出这类改进能展现出更深入的理解。

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

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

Case Study Practical Exercises for OCR GCSE Computer Science | 案例分析实战演练 (OCR GCSE 计算机科学)