Case Study Hands-On: School Sports Day Registration System | 案例分析实战演练：学校运动会报名系统

📚 Case Study Hands-On: School Sports Day Registration System | 案例分析实战演练：学校运动会报名系统

In this case study, we will follow a step-by-step approach to designing and building a simple registration system for a school sports day. The system must allow students to sign up for events, check if an event is full, store registration data, and produce a final list of participants. By working through this real-world scenario, you will practise key computational thinking skills: decomposition, pattern recognition, abstraction, and algorithm design, as well as testing and evaluation. This mirrors the types of practical tasks found in the AQA KS3 Computer Science curriculum.

在本案例中，我们将遵循分步方法，为学校运动会设计并构建一个简单的报名系统。该系统必须允许学生报名参加比赛、检查某个项目是否已满、存储报名数据并生成最终参赛者名单。通过完成这个真实场景的任务，你将练习关键的计算思维技能：问题分解、模式识别、抽象和算法设计，以及测试与评估。这与AQA KS3计算机科学课程中的实践任务类型相呼应。

---

1. Understanding the Problem | 理解问题

Before writing any code, we must clarify exactly what the system needs to do. The school runs a sports day with four events: 100 m sprint, long jump, relay race, and tug-of-war. Each event has a maximum capacity. Students can register for up to two events. The system should prevent duplicate registrations and reject registrations when an event is full. It must also display a summary of all registrations.

在编写任何代码之前，我们必须明确系统需要做什么。学校举办运动会，设有四个项目：100米短跑、跳远、接力赛和拔河。每个项目有人数上限。学生最多可以报名两个项目。系统应防止重复报名，并在项目满员时拒绝报名。它还必须显示所有报名情况的摘要。

We can record the requirements as a simple list: accept student name and chosen events, validate input, store data, enforce capacity limits, and output a report. Identifying these requirements early helps us design a solution that meets the user’s real needs.

我们可以将需求记录成一份简单的列表：接受学生姓名和所选项目、验证输入、存储数据、执行人数限制，并输出报告。尽早明确这些需求有助于我们设计出满足用户真实需求的解决方案。

---

2. Decomposition | 问题分解

Decomposition means breaking down a complex problem into smaller, manageable parts. For our system, we can divide the task into several sub-problems: handling user input, checking event availability, storing registrations, updating capacity, and generating the final list. Each sub-problem can be solved independently and then combined.

问题分解是指将一个复杂问题拆分成更小、更易于处理的部分。对于我们的系统，我们可以将任务分解为若干子问题：处理用户输入、检查项目是否有空位、存储报名信息、更新剩余名额以及生成最终名单。每个子问题都可以独立解决，然后再组合起来。

• Input module: ask for student name and event choices.
• Validation module: ensure the name is not empty, choices are valid, and no duplicate entries.
• Capacity checker: compare current registration count with maximum limit.
• Storage: use a suitable data structure to hold all registrations.
• Output: format and display the participation list.

这种分解让我们能专注处理每个子任务，而不会感到不知所措。

• 输入模块：询问学生姓名和项目选择。
• 验证模块：确保姓名不为空、选项有效且无重复报名。
• 名额检查器：将当前报名人数与上限进行比较。
• 存储：使用合适的数据结构保存所有报名信息。
• 输出：格式化并显示参赛名单。

---

3. Pattern Recognition and Abstraction | 模式识别与抽象

We look for patterns that can simplify our work. Each event has the same behaviour: it has a name, a maximum capacity, and a current number of participants. Instead of writing separate code for each event, we can generalise the concept into an ‘Event’ object with shared attributes. The registration process follows the same pattern for every student: input name, choose event, check capacity, store record.

我们寻找可以简化工作的模式。每个项目都有相同的行为：它有一个名称、一个最大人数上限和一个当前参赛人数。我们无需为每个项目单独编写代码，而是可以将概念概括为一个具有共享属性的 “项目” 对象。报名流程对每个学生都遵循相同的模式：输入姓名、选择项目、检查名额、存储记录。

Abstraction then lets us focus on the essential details. We do not need to know the student’s age, class, or favourite colour; we only need their name and event choices. We can represent an event simply by its name, maximum capacity, and a list of registered students. This simplification makes our program easier to build and maintain.

抽象则让我们专注于关键细节。我们不需要知道学生的年龄、班级或最喜欢的颜色；我们只需要他们的姓名和所选项目。我们可以仅用项目名称、最大容量和已报名学生列表来表示一个项目。这种简化让我们的程序更易于构建和维护。

---

4. Designing the Algorithm – Flowchart | 算法设计 – 流程图

An algorithm is a step-by-step solution to a problem. Here we design the main algorithm for processing a single registration. The flowchart below (described textually) shows the decision points.

算法是解决问题的分步方案。这里我们设计处理单次报名的主算法。下面的流程图（以文字描述）展示了决策点。

START → INPUT name → INPUT event choice → IF event is full THEN OUTPUT ‘Event full’ and END

ELSE IF student already registered in 2 events THEN OUTPUT ‘Max events reached’ and END

ELSE add student to event list → increase event count → OUTPUT ‘Registration successful’ → END

This structure ensures all rules are checked before a registration is accepted. The flowchart uses standard symbols: oval for start/end, parallelogram for input/output, diamond for decision, and rectangle for process. Drawing such a diagram helps visualise the logic before coding.

这种结构确保在接受报名之前检查所有规则。流程图使用了标准符号：椭圆形表示开始/结束，平行四边形表示输入/输出，菱形表示判断，矩形表示处理。在编码前绘制这样的图有助于将逻辑可视化。

---

5. Pseudocode for Core Logic | 核心逻辑的伪代码

Pseudocode bridges the gap between flowchart and actual code. It uses simple, human-readable statements. Here is the pseudocode for the registration procedure:

伪代码在流程图和实际代码之间架起了桥梁。它使用简单、人类可读的语句。以下是报名过程的伪代码：

PROCEDURE register_student(name, chosen_event)

IF name is empty THEN OUTPUT ‘Invalid name’ RETURN

IF chosen_event not in valid_events THEN OUTPUT ‘Unknown event’ RETURN

IF student_event_count(name) >= 2 THEN OUTPUT ‘Limit reached’ RETURN

IF event_is_full(chosen_event) THEN OUTPUT ‘Event full’ RETURN

ADD name TO chosen_event.registrations

OUTPUT ‘Success’

END PROCEDURE

Notice how each condition is checked in order and the procedure stops early if any rule fails. This is called ‘guard clauses’ and makes the logic clear and safe.

请注意每个条件是如何按顺序检查的，如果任何规则不满足，过程会提前停止。这叫作 “守卫子句”，使逻辑清晰且安全。

---

6. Data Structures and Variables | 数据结构与变量

We need to store the registration data in memory. A good choice is a dictionary where each key is an event name and the value is a list of student names. We also store maximum capacities in a separate dictionary. A third dictionary can track how many events each student has signed up for.

我们需要在内存中存储报名数据。一个不错的选择是使用字典，其中每个键是一个项目名称，值是一个学生姓名的列表。我们还可以将最大容量存储在另一个字典中。第三个字典可以记录每个学生已报名的项目数。

Structure	Example
events_capacity	{‘Sprint’: 4, ‘Long Jump’: 3, ‘Relay’: 5, ‘Tug-of-war’: 8}
events_registrations	{‘Sprint’: [‘Alice’, ‘Bob’], ‘Long Jump’: [], …}
student_event_counts	{‘Alice’: 2, ‘Bob’: 1}

Using separate but related structures keeps the data organised. We can quickly check if an event is full by comparing the length of its registration list to its capacity. This design is both efficient and easy to extend if new events are added.

使用独立但相互关联的结构可以使数据井井有条。通过比较报名列表的长度与容量，我们可以快速检查项目是否已满。这种设计既高效又易于在添加新项目时进行扩展。

---

7. Implementing in Python | Python 编程实现

We will now translate our design into Python code. The implementation uses simple functions and global dictionaries. Input is taken via console for demonstration. Below is a key fragment of the code built around the pseudocode.

现在我们将设计转换为Python代码。该实现使用了简单的函数和全局字典。为便于演示，输入通过控制台获取。以下是围绕伪代码构建的关键代码片段。

def register(name, event):

if not name.strip():

print(‘Invalid name’)

return

if event not in events_capacity:

print(‘Unknown event’)

return

if student_event_counts.get(name, 0) >= 2:

print(‘You can only sign up for 2 events’)

return

if len(events_registrations[event]) >= events_capacity[event]:

print(‘Event is full’)

return

events_registrations[event].append(name)

student_event_counts[name] = student_event_counts.get(name, 0) + 1

print(‘Registration successful!’)

The code reads almost like the English pseudocode. Because we decomposed the problem and used clear abstraction, writing the program became straightforward. KS3 students can easily experiment with this by adding a loop to register multiple students.

这段代码读起来几乎就像英文伪代码。由于我们分解了问题并使用了清晰的抽象，编写程序变得简单明了。KS3学生可以轻松地进行实验，例如添加一个循环来注册多名学生。

---

8. Testing and Debugging | 测试与调试

Testing is essential to ensure the system behaves correctly. We need to create test cases for both normal and edge situations. A test plan helps us be systematic.

测试对于确保系统行为正确至关重要。我们需要为正常情况和边缘情况创建测试用例。测试计划有助于我们进行系统化测试。

Test case	Input	Expected output
Valid registration	name=’Tom’, event=’Sprint’	‘Registration successful!’
Empty name	name=’ ‘, event=’Relay’	‘Invalid name’
Event full	Register 4 students to Sprint, then a 5th	‘Event is full’ for 5th
Max events	Same student registers for 3rd event	‘You can only sign up for 2 events’
Unknown event	name=’Sue’, event=’Swim’	‘Unknown event’

Running these tests reveals any logic errors. If a bug is found, we debug by tracing through the code line by line, checking variables at each step. This process teaches the importance of careful checking and attention to detail.

运行这些测试可以揭示任何逻辑错误。如果发现bug，我们会通过逐行跟踪代码、检查每一步的变量来进行调试。这个过程教会了我们仔细检查和关注细节的重要性。

---

9. Evaluation and Improvements | 评估与改进

After building a working system, we reflect on its strengths and weaknesses. The current system is simple and fulfills the basic requirements. However, it stores data only while the program is running; all registrations are lost when the program ends. A useful improvement would be to save data to a file or a simple database so registrations persist.

构建出一个可以运行的系统之后，我们反思其优缺点。当前的系统很简单，并且满足了基本需求。然而，它仅在程序运行时存储数据；程序结束时所有报名信息都会丢失。一项有用的改进是将数据保存到文件或简单数据库中，以便报名信息能够持久化。

Another improvement could be a graphical user interface (GUI) instead of the console, making it easier for non-technical staff to use. We might also add features like viewing registrations per event, a waiting list, or automatic generation of heat lists. Evaluation helps us think like professional developers who always look for ways to make software better.

另一项改进可以是使用图形用户界面（GUI）而非控制台，使非技术职员更容易使用。我们还可以增加诸如查看每个项目的报名情况、设置等待列表或自动生成预赛名单等功能。评估帮助我们像专业开发者一样思考，他们总是在寻找让软件变得更好的方法。

---

10. Wider Ethical Considerations | 更广泛的伦理考量

When designing systems that store personal names, we must consider data protection and privacy. Even at KS3, it is important to understand that personal data should be kept secure and used only for the intended purpose. In our example, after sports day, the registration list should be deleted to protect students’ privacy.

在设计存储个人姓名的系统时，我们必须考虑数据保护和隐私。即使在KS3阶段，理解个人数据应安全保存且仅用于预期目的也很重要。在我们的例子中，运动会结束后，应删除报名列表以保护学生隐私。

We also think about fairness: the system should treat every student equally and not allow any bias in registration. By considering these ethical dimensions, we learn that computing is not just about code, but also about responsible design that respects people’s rights and dignity.

我们还要考虑公平性：该系统应平等对待每位学生，不允许报名过程中存在任何偏见。通过思考这些伦理维度，我们了解到计算不仅仅是关于代码，还关乎尊重人们权利与尊严的负责任设计。

---

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

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