📚 Mastering CIE IGCSE Computer Science Practical Assessment | 掌握CIE IGCSE计算机科学实践考核
The CIE IGCSE Computer Science practical paper (Paper 2: Problem-solving and Programming) challenges you to demonstrate computational thinking through algorithm design, pseudocode, flowcharts, and trace tables. Success requires both a deep understanding of programming constructs and a methodical approach to testing. This guide distills the key skills, common pitfalls, and revision strategies you need to perform with confidence.
CIE IGCSE计算机科学实践卷（卷二：问题解决与编程）要求你通过算法设计、伪代码、流程图和跟踪表来展示计算思维。成功既需要透彻理解编程结构，也需要有条理的测试方法。本指南提炼了关键技能、常见陷阱和复习策略，帮助你自信应考。
1. Understanding the Practical Assessment | 理解实践考核
Paper 2 is a written exam, not an on-screen coding test. You will be presented with real-world scenarios and must design solutions using pseudocode, complete trace tables, and draw or interpret flowcharts. The paper targets your ability to think like a programmer, not just to memorise syntax. Marks are awarded for logical correctness, appropriate use of constructs, and clear structure.
卷二是一场书面考试，而非上机编码测试。你将面对现实场景，必须用伪代码设计解决方案、完成跟踪表、绘制或解读流程图。试卷考察的是你像程序员一样思考的能力，而不仅仅是记忆语法。逻辑正确性、结构运用的恰当性和表达的清晰性都会得分。
2. Problem Decomposition and Algorithm Design | 问题分解与算法设计
Before writing any pseudocode, break the problem down using top-down design. Identify the inputs, define the required outputs, and work out the processing steps in between. Write a brief outline in plain English first, then refine each step until it can be translated directly into pseudocode. Always check for special cases, such as empty input or boundary values.
在编写任何伪代码之前，先用自顶向下设计分解问题。识别输入，定义所需的输出，然后梳理中间的加工步骤。先用简明英语写出提纲，然后细化每一步，直到能直接转换为伪代码。务必检查特殊情况，例如空输入或边界值。
3. Writing Clear, Examiner-Friendly Pseudocode | 编写清晰、阅卷人友好的伪代码
Your pseudocode must be unambiguous and consistent. Use the standard keywords: INPUT, OUTPUT, IF...THEN...ELSE...ENDIF, CASE OF...ENDCASE, FOR...TO...NEXT, WHILE...DO...ENDWHILE, REPEAT...UNTIL. Indent each block to show logical structure. Avoid language-specific shortcuts and never use shorthand that obscures meaning. If you need to explain, a brief comment preceded by // is acceptable.
你的伪代码必须无歧义且风格一致。使用标准关键字：INPUT、OUTPUT、IF...THEN...ELSE...ENDIF、CASE OF...ENDCASE、FOR...TO...NEXT、WHILE...DO...ENDWHILE、REPEAT...UNTIL。每个代码块都要缩进以显示逻辑结构。避免特定语言的快捷方式，绝不要使用模糊含义的简写。如果需要解释，可在 // 后添加简短注释。
4. Drawing Accurate Flowcharts | 绘制准确的流程图
Use approved symbols: an oval for Start and End, a parallelogram for Input/Output, a rectangle for a Process (assignment, calculation), and a diamond for a Decision. All decision branches must be labelled with Yes/No or True/False. Flow lines should run from top to bottom and left to right, with arrows to indicate direction. Neatness matters, so sketch lightly in pencil before finalising.
使用认可的符号：椭圆表示开始和结束，平行四边形表示输入/输出，矩形表示处理（赋值、计算），菱形表示判断。所有判断分支必须标上 Yes/No 或 True/False。流程线应从上到下、从左到右，并用箭头指示方向。整洁性很重要，因此先用铅笔轻轻画草图再定稿。
5. Variables, Constants and Data Types | 变量、常量与数据类型
TE. Use CONSTANT for fixed values to improve readability. Remember that STRING concatenation often uses the '+' operator in pseudocode, but compare strings with '='. Type casting, such as STRING_TO_INT, should be explicit.
在伪代码开头用清晰的标识符声明变量，并指定其数据类型：INTEGER、REAL、CHAR、STRING、BOOLEAN 或 DATE。使用 CONSTANT 表示固定值以提高可读性。记住，在伪代码中字符串连接常用 '+' 运算符，但比较字符串用 '='。类型转换，如 STRING_TO_INT，应显式写出。
6. Mastering Selection and Iteration | 掌握选择与循环结构
Choose between IF (single/double branch) and CASE OF (multiple branches) based on the number of conditions. For loops, use FOR when the number of iterations is known in advance, WHILE when the condition is tested before each iteration, and REPEAT...UNTIL when the loop must run at least once. Always ensure a loop has a reachable exit condition to avoid infinite loops.
根据条件数量选择 IF（单/双分支）或 CASE OF（多分支）。对于循环，当迭代次数预先知道时使用 FOR，当每次迭代前测试条件时使用 WHILE，当循环至少执行一次时使用 REPEAT...UNTIL。务必确保循环有可到达的退出条件，以避免无限循环。
7. Using Arrays and 2D Structures | 使用数组与二维结构
Arrays store multiple items of the same type and are indexed, typically starting from 0 or 1 (clarify in your answer). To work with arrays, use loops to traverse, sum, or search. For 2D arrays, treat them as tables: arr[row, column]. Pseudocode must clearly show the indices used. Remember that array bounds must not be exceeded.
数组用于存储多个相同类型的项，并使用索引，通常从 0 或 1 开始（在答案中需说明）。处理数组时，使用循环进行遍历、求和或搜索。对于二维数组，将其视作表格：arr[row, column]。伪代码必须清晰显示所用索引。记住，不得超出数组边界。
8. File Handling and Input/Output | 文件处理与输入/输出
Questions may ask you to process data from a text file. Typical pseudocode operations include OPENFILE and CLOSEFILE, READFILE (reading a line or record), and WRITEFILE (writing a line). Use a WHILE NOT EOF loop to process every record. Always check for empty files and handle the end condition gracefully.
题目可能要求你处理文本文件中的数据。典型的伪代码操作包括 OPENFILE 和 CLOSEFILE、READFILE（读取一行或一条记录）以及 WRITEFILE（写入一行）。使用 WHILE NOT EOF 循环处理每条记录。务必检查空文件并妥善处理结束条件。
9. Testing with Trace Tables | 用跟踪表进行测试
A trace table is a manual way to step through your algorithm, recording the values of variables and outputs after each instruction. This is a crucial exam skill: you must maintain correct columns and update values methodically. Below is an example trace table for a loop that sums even numbers from 2 to 6.
跟踪表是一种手动逐步执行算法的方法，记录每条指令后变量和输出的值。这是一项关键的考试技能：你必须正确设置列并有条不紊地更新数值。下面是一个将 2 到 6 之间的偶数相加的循环的跟踪表示例。
| Instruction | count | total | count <= 6? | OUTPUT |
|---|---|---|---|---|
| Initialise | 2 | 0 | True | |
| Inside Loop 1 | 2 | 2 | True | |
| count = count + 2 | 4 | 2 | True | |
| Inside Loop 2 | 4 | 6 | True | |
| count = count + 2 | 6 | 6 | True | |
| Inside Loop 3 | 6 | 12 | True | |
| count = count + 2 | 8 | 12 | False | |
| After loop | 8 | 12 | False | 12 |
Follow the same discipline in the exam: list every variable that changes, and only update the row after completing the step. This method exposes off-by-one errors and faulty conditions.
在考试中遵循同样的纪律：列出每一个变化的变量，仅在完成该步骤后才更新行内容。这种方法能发现差一错误和错误的条件。
10. Common Errors and Debugging Approaches | 常见错误与调试方法
Watch out for uninitialised variables, forgetting to close files, using '=' for assignment instead of '←' ions, highlight the exact outputs required; many students lose marks by producing incorrect formats.
要警惕未初始化的变量、忘记关闭文件、用 '=' 代替 '←' 或未遵循正确的伪代码风格进行赋值，以及写出无限循环。在算法定稿前，用简单的测试数据进行桌面检查。阅读考题时，标出所要求的确切输出；许多学生因格式错误而失分。
11. Exam Technique and Time Management | 考试技巧与时间管理
Study the pre-release material if provided (CIE IGCSE Computer Science usually does not have pre-release, but scenarios may be lengthy). Read the entire question before starting. Allocate time based on marks: for a 15-mark algorithm question, spend about 20-25 minutes. Leave the trace table until you have completed your pseudocode, then work through it methodically. If a flowchart is requested, ensure your logic matches the pseudocode version.
如有预发布材料（CIE IGCSE 计算机科学通常没有，但场景可能很长），要仔细研读。开始作答前通读整个题目。根据分值分配时间：对于 15 分的算法题，大约花费 20-25 分钟。把跟踪表留到写完伪代码之后，再有条理地填写。如果要求画流程图，确保逻辑与伪代码版本一致。
12. Final Revision Checklist | 最终复习清单
Make sure you can confidently: write pseudocode for linear search, bubble sort, counting occurrences, and calculating totals from file data; draw flowcharts with correct decision loops; complete a trace table for a nested loop; and identify errors in given algorithms. Practise past Paper 2 under timed conditions and review the mark schemes to understand where marks are awarded for structure and annotation.
确保你能自信地完成以下任务：为线性搜索、冒泡排序、统计出现次数、从文件数据计算总和编写伪代码；绘制带有正确判断循环的流程图；为嵌套循环填写跟踪表；识别给定算法中的错误。在限时条件下练习历年卷二真题，并仔细阅读评分标准，了解结构和注释在何处得分。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图