Year 10 Cambridge Computer Science: Case Study Practical Drill | 剑桥10年级计算机：案例分析实战演练

📚 Year 10 Cambridge Computer Science: Case Study Practical Drill | 剑桥10年级计算机：案例分析实战演练

Case study practical drills are a key component of the Cambridge IGCSE Computer Science syllabus, especially in Year 10. They test your ability to analyse a real-world problem, design a solution using pseudocode and flowcharts, and rigorously test your logic. In this walkthrough, we will tackle a library management system example, covering everything from initial decomposition to exam-style practice questions.

案例分析实战演练是剑桥IGCSE计算机科学课程的重要组成部分，特别是在10年级。它们测试你分析现实世界问题、使用伪代码和流程图设计解决方案以及严格测试逻辑的能力。在本次演练中，我们将处理一个图书馆管理系统示例，涵盖从初始分解到考试式练习题的所有内容。

1. Understanding the Problem | 理解问题

The first step in any case study is to break down the problem into its component parts. The library system requires handling data about books, each with an ISBN, title, author, and status. We need to provide a menu-driven interface. The inputs will be user choices and book details. The processing involves adding records, searching, updating status, and sorting. The output should display appropriate messages and lists. We also need to store data persistently in a file. By clearly defining the Input, Process, and Output (IPO), we create a solid foundation for design.

在任何案例分析中，第一步都是将问题分解为各个组成部分。这个图书馆系统需要处理书籍数据，每本书都有ISBN、标题、作者和状态。我们需要提供一个菜单驱动的界面。输入包括用户选择和书籍详细信息。处理过程包括添加记录、搜索、更新状态和排序。输出需要显示适当的消息和列表。我们还需要将数据持久地存储在文件中。通过清晰地定义输入、处理、输出（IPO），我们为设计奠定了坚实的基础。

2. Designing a Solution: Flowcharts | 设计解决方案：流程图

A flowchart provides a visual representation of the system’s logic. The main program can be depicted as: Start → Display menu → Input choice → If choice is 1, call add book procedure; if 2, call search; if 3, call borrow; if 4, call return; if 5, call display sorted; if 6, exit; else display error. Each procedure is then expanded. Decision diamonds represent conditions, and parallelograms show inputs/outputs. Using structured flowcharts helps avoid logic errors and clarifies the flow for eventual coding.

流程图提供了系统逻辑的可视化表示。主程序可以描述为：开始 → 显示菜单 → 输入选择 → 如果选择是1，调用添加书籍过程；如果是2，调用搜索；如果是3，调用借阅；如果是4，调用归还；如果是5，调用排序显示；如果是6，退出；否则显示错误。然后每个过程分别展开。决策菱形表示条件，平行四边形表示输入/输出。使用结构化流程图有助于避免逻辑错误，并为最终编码理清思路。

3. Pseudocode for Input Validation | 输入验证的伪代码

Validating user input is crucial to prevent crashes. To ensure the menu choice is between 1 and 6, we can use a REPEAT…UNTIL loop. For an ISBN, we check that it is not an empty string. In pseudocode: REPEAT OUTPUT “Enter ISBN: ” INPUT ISBN UNTIL ISBN <> “”. Similarly, a function to validate a menu option might look like: FUNCTION getChoice() RETURNS INTEGER OUTPUT “Enter choice (1-6): ” INPUT choice WHILE choice < 1 OR choice > 6 DO OUTPUT “Invalid, try again” INPUT choice ENDWHILE RETURN choice ENDFUNCTION. Such validation routines make the program robust.

验证用户输入对于防止程序崩溃至关重要。为了确保菜单选择在1到6之间，我们可以使用REPEAT…UNTIL循环。对于ISBN，我们检查它是否是空字符串。在伪代码中：REPEAT OUTPUT “Enter ISBN: ” INPUT ISBN UNTIL ISBN <> “”。类似地，验证菜单选项的函数可能如下：FUNCTION getChoice() RETURNS INTEGER OUTPUT “Enter choice (1-6): ” INPUT choice WHILE choice < 1 OR choice > 6 DO OUTPUT “Invalid, try again” INPUT choice ENDWHILE RETURN choice ENDFUNCTION。这样的验证例程使程序更加健壮。

4. Searching Algorithms: Linear Search | 搜索算法：线性搜索

Searching for a book by title requires a linear search unless the array is sorted by title. The librarian enters a search term, and the algorithm compares it with each book’s title. In pseudocode: FUNCTION searchByTitle(searchTerm) FOR i = 1 TO numBooks IF books[i].title = searchTerm THEN OUTPUT “Found: “, books[i].ISBN, books[i].author ENDIF NEXT IF not found THEN OUTPUT “Book not found” ENDIF. This algorithm checks every record sequentially. Its time complexity is O(n). It is simple but effective for small datasets. We can also discuss case-insensitive matching by converting both to lowercase.

按标题搜索书籍需要线性搜索，除非数组已按标题排序。用户输入搜索词，算法将其与每本书的标题进行比较。伪代码：FUNCTION searchByTitle(searchTerm) FOR i = 1 TO numBooks IF books[i].title = searchTerm THEN OUTPUT “Found: “, books[i].ISBN, books[i].author ENDIF NEXT IF not found THEN OUTPUT “Book not found” ENDIF。该算法按顺序检查每条记录，时间复杂度为O(n)。对于小数据集来说简单有效。我们还可以讨论通过转换为小写来实现不区分大小写的匹配。

5. Sorting Data: Bubble Sort | 排序数据：冒泡排序

To list books alphabetically by title, we can use a bubble sort. The algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Pseudocode: PROCEDURE sortBooks() FOR i = 1 TO numBooks-1 FOR j = 1 TO numBooks-i IF books[j].title > books[j+1].title THEN swap books[j] and books[j+1] ENDIF NEXT NEXT ENDPROCEDURE. After sorting, the books array is in ascending order. Bubble sort is easy to understand but has O(n²) performance, which is acceptable for the small number of books typically managed by a local library. A trace table helps verify correctness.

要按标题字母顺序列出书籍，我们可以使用冒泡排序。该算法反复遍历列表，比较相邻元素，如果顺序错误则交换它们。伪代码：PROCEDURE sortBooks() FOR i = 1 TO numBooks-1 FOR j = 1 TO numBooks-i IF books[j].title > books[j+1].title THEN swap books[j] and books[j+1] ENDIF NEXT NEXT ENDPROCEDURE。排序后，books数组按升序排列。冒泡排序容易理解，但性能为O(n²)，这对于本地图书馆通常管理的小量书籍来说是可以接受的。追踪表有助于验证正确性。

6. File Handling in Pseudocode | 伪代码中的文件处理

Persistent storage is achieved by reading and writing to a text file. When the program starts, it reads the existing data file to populate the books array. Upon exit or after changes, it saves the array back. Typical file handling commands: OPENFILE “books.txt” FOR READ, READFILE “books.txt”, ISBN, title, author, status, CLOSEFILE “books.txt”. For writing: OPENFILE “books.txt” FOR WRITE, WRITEFILE “books.txt”, ISBN, title, author, status. We must handle end-of-file (EOF) detection: WHILE NOT EOF(“books.txt”). This ensures data persistence across sessions.

持久化存储通过对文本文件进行读写来实现。程序启动时，它读取现有数据文件以填充books数组。在退出时或更改后，它将数组保存回去。典型的文件处理命令：OPENFILE “books.txt” FOR READ、READFILE “books.txt”, ISBN, title, author, status、CLOSEFILE “books.txt”。对于写入：OPENFILE “books.txt” FOR WRITE、WRITEFILE “books.txt”, ISBN, title, author, status。我们必须处理文件结束（EOF）检测：WHILE NOT EOF(“books.txt”)。这确保了跨会话的数据持久性。

7. Testing with Normal, Abnormal, Boundary Data | 使用正常、异常、边界数据进行测试

Testing should cover normal cases (e.g., adding a new book, borrowing an available book), abnormal cases (e.g., entering a non-numeric menu choice, borrowing a book already borrowed), and boundary cases (e.g., searching when the library is empty, adding the first book). A test table is useful: