📚 AS Eduqas Computer Science: Case Study Practical Exercises | AS Eduqas 计算机：案例分析实战演练
Case study analysis is a core component of the AS Eduqas Computer Science specification, testing your ability to apply computational thinking to real-world scenarios. This article walks through a detailed case study task, from problem decomposition to algorithm design, data structures, testing, and evaluation. You will gain hands-on strategies for tackling the Component 2 practical programming and theory questions.
案例分析是 AS Eduqas 计算机科学课程的核心组成部分，考察你将计算思维应用于实际场景的能力。本文将通过一个详细的案例任务，从问题分解到算法设计、数据结构、测试和评估，手把手带你演练。你将获得应对 Component 2 实践编程和理论题的实用策略。
1. Understanding the Case Study Scenario | 理解案例背景
We are given a case study: a local library needs a digital reading challenge tracker. Young readers log books they have read; the system calculates points based on book difficulty (Easy = 1, Medium = 2, Hard = 3) and awards badges at milestone scores. Data must persist between sessions and allow a librarian to view leaderboards.
案例背景：一家本地图书馆需要一个数字化阅读挑战跟踪器。小读者记录他们读过的书；系统根据书籍难度计算积分（简单=1，中等=2，困难=3），并在达到里程碑分数时颁发徽章。数据必须在会话间持久保存，并允许图书馆员查看排行榜。
2. Problem Decomposition and Abstraction | 问题分解与抽象
Break the scenario into manageable modules: user registration, book logging, score calculation, badge awarding logic, data persistence, and librarian reporting. Identify key entities – Reader, Book, LogEntry, Badge – and their attributes. Abstract away library-specific details like book ISBN, focusing only on difficulty level and title for the challenge.
将场景分解为可管理的模块：用户注册、书籍记录、积分计算、徽章授予逻辑、数据持久化和馆员报告。识别关键实体——读者、书籍、记录条目、徽章——及其属性。抽象掉图书馆特有的细节如 ISBN，只关注难度级别和书名以服务于挑战。
3. Defining Functional and Non-Functional Requirements | 定义功能与非功能需求
Functional: The system shall allow a reader to create an account; log a book with title and difficulty; calculate cumulative points; award badges at 10, 25, and 50 points; display reader profile; generate a top-10 leaderboard. Non-functional: Response time under 1 second for logging, data saved in a text file, must handle 100 concurrent readers.
功能性：系统应允许读者创建账户；记录书名和难度；计算累积积分；在10、25和50分时授予徽章；显示读者个人资料；生成前十排行榜。非功能性：记录操作响应时间低于1秒，数据保存在文本文件中，必须能处理100个并发读者。
4. Designing Data Structures | 数据结构设计
Use a dictionary to store readers, where key is a unique reader ID and value is another dictionary holding name, total points, list of logged books, and earned badges. For persistence, read/write to a CSV file: readers.csv with columns id,name,points,badges (badges comma-separated). A separate logs.csv stores book entries per reader.
使用字典存储读者，键为唯一读者 ID，值为另一个包含姓名、总积分、已记录书单和已获徽章的字典。持久化方面，读写 CSV 文件：readers.csv 列有 id,name,points,badges（徽章逗号分隔）。单独的 logs.csv 存储每个读者的书籍记录条目。
- reader_dict = {101: {‘name’:’Alice’,’points’:12,’badges’:[‘Bookworm’]}, …}
- reader_dict = {101: {‘name’:’Alice’,’points’:12,’badges’:[‘Bookworm’]}, …}
- logs structure: reader_id, title, difficulty, date
- 日志结构：reader_id, title, difficulty, date
5. Algorithm Design – Score and Badge Logic | 算法设计 – 积分与徽章逻辑
Design a function calculate_score(difficulty) that returns points: Easy=1, Medium=2, Hard=3. Award badges by checking if points cross thresholds: after adding new points, compare old total and new total against [10,25,50]. For any threshold newly reached, append badge name. Use a loop with condition: if old < threshold ≤ new.
设计一个函数 calculate_score(difficulty) 返回积分：简单=1，中等=2，困难=3。通过检查积分是否跨过阈值来颁发徽章：添加新积分后，比较旧总分和新总分与[10,25,50]的关系。对任何新达到的阈值，追加徽章名称。使用条件循环：if old < threshold ≤ new。
new_total = old_total + calculate_score(diff)
thresholds = [10,25,50]
for t in thresholds:
if old_total < t and new_total >= t:
award_badge(t)
6. Writing Pseudocode for Key Processes | 关键过程的伪代码撰写
Eduqas expects clear, structured pseudocode. For logging a book:
Eduqas 期望清晰、结构化的伪代码。记录书籍的伪代码：
PROCEDURE log_book(reader_id, title, difficulty)
points = CALCULATE_SCORE(difficulty)
reader = reader_dict[reader_id]
old_total = reader.points
reader.points = old_total + points
FOR threshold IN [10,25,50]
IF old_total < threshold AND reader.points >= threshold THEN
reader.badges.APPEND(get_badge_name(threshold))
ENDIF
ENDFOR
SAVE_TO_FILE()
ENDPROCEDURE
The same logic must be implemented in Python for Component 2.
相同的逻辑必须在 Component 2 中用 Python 实现。
7. User Interface Design Considerations | 用户界面设计考量
For a console-based prototype, present a menu: 1. Register, 2. Log Book, 3. View My Profile, 4. Leaderboard, 5. Exit. Input validation is crucial: difficulty must be ‘Easy’,’Medium’,’Hard’; title cannot be empty; reader ID must exist for logging. Use exception handling for file not found.
对于基于控制台的原型，呈现菜单：1. 注册，2. 记录书籍，3. 查看我的资料，4. 排行榜，5. 退出。输入验证至关重要：难度必须是 ‘Easy’、’Medium’、’Hard’；书名不能为空；记录时读者 ID 必须存在。使用异常处理应对文件未找到的情况。
8. Testing Strategy – Normal, Boundary, Erroneous | 测试策略 – 正常、边界、异常
Design test cases: log a Medium book – expect 2 points added; log after reaching 9 points with Easy book (1 point) – expect badge ‘Bookworm’ at 10; attempt to log with non-existent ID – expect error message; log with difficulty ‘Impossible’ – rejected; maximum points boundary: test at 49 to 50 badge ‘Champion’.
设计测试用例：记录一本中等难度的书——预期增加 2 分；在达到 9 分后记录一本简单的书（1 分）——预期在 10 分时获得 ‘Bookworm’ 徽章；尝试用不存在的 ID 记录——预期错误消息；用难度 ‘Impossible’ 记录——被拒绝；最大积分边界：测试从 49 到 50 分获得 ‘Champion’ 徽章。
| Test ID | Input | Expected Outcome |
| T1 | diff=’Medium’, initial points=0 | Points = 2, no badge |
| T2 | diff=’Easy’, initial points=9 | Points = 10, badge ‘Bookworm’ |
| T3 | reader_id=999 (non-existent) | Error: reader not found |
9. Data Persistence and File Handling | 数据持久化与文件处理
Implement load_data() and save_data() functions. Use CSV files for simplicity. When the program starts, read readers.csv and populate reader_dict; on exit or after each log, rewrite the file. Ensure file format: id, name, points, badge1|badge2. Use a pipe separator for badges within the CSV to avoid comma clashes.
实现 load_data() 和 save_data() 函数。使用 CSV 文件以保持简单。程序启动时，读取 readers.csv 并填充 reader_dict；退出或每次记录后，重写文件。确保文件格式：id, name, points, badge1|badge2。在 CSV 中使用竖线分隔徽章以避免逗号冲突。
10. Evaluation and Refinement | 评估与优化
Evaluate against requirements: all functional needs met; non-functional: response time easily achieved with dictionary lookups. Limitations: file-based storage not suitable for concurrent writes; could be improved with a database. The badge system could be extended to include streak bonuses. The menu interface is simple but usable.
根据需求进行评估：所有功能需求均已满足；非功能性：使用字典查找响应时间轻松实现。限制：基于文件的存储不适合并发写入；可以通过数据库改进。徽章系统可以扩展以包含连续记录奖励。菜单界面简单但可用。
11. Common Pitfalls and Marking Insights | 常见错误与评分要点
In Eduqas exams, students often lose marks by not showing iterative development, neglecting input sanitisation, or failing to provide clear pseudocode/modular design. Always demonstrate the use of subroutines, parameter passing, and comment your code. For the written report, link back to the original requirements explicitly.
在 Eduqas 考试中，学生常因未展示迭代开发、忽略输入清理或未能提供清晰的伪代码/模块化设计而失分。务必展示子程序的使用、参数传递，并为代码添加注释。对于书面报告，明确地将内容联系回原始需求。
12. Practice Task – Extend the System | 扩展练习任务
Challenge: Modify the system to include reading streaks – if a reader logs a book every day for 7 consecutive days, award bonus 5 points. Design the data structure to store last login date, write pseudocode for checking streaks, and identify new test cases. This extension sharpens algorithmic thinking.
挑战：修改系统，增加连续阅读记录功能——如果读者连续 7 天每天记录一本书，奖励 5 分。设计存储最后登录日期的数据结构，编写检查连续记录的伪代码，并确定新的测试用例。此扩展任务可锻炼算法思维。
Published by TutorHao | AS Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply