Year 11 CAIE Computer Science: Practical Assessment Essentials | CAIE 11年级计算机科学：实践考核要点

📚 Year 11 CAIE Computer Science: Practical Assessment Essentials | CAIE 11年级计算机科学：实践考核要点

Mastering the practical assessment is crucial for achieving a top grade in the CAIE IGCSE Computer Science course. Paper 2: Problem-solving and Programming requires you to design algorithms, write and debug code, and demonstrate computational thinking under timed conditions. This guide outlines the key strategies and concepts you need to excel.

掌握实践考核对于在CAIE IGCSE计算机科学课程中取得优异成绩至关重要。试卷二：问题解决与编程要求你在限时条件下设计算法、编写和调试代码，并展示计算思维能力。本指南概述了取得优异表现所需的关键策略和概念。

1. Understanding the Assessment Objectives | 理解评估目标

Paper 2 assesses three main areas: algorithm design (representing solutions using pseudocode or flowcharts), program development (translating algorithms into high-level language code), and testing & evaluation (verifying functionality and identifying errors). The weighting is roughly 40% algorithm, 40% coding, and 20% testing, though this can vary slightly each session.

试卷二评估三个主要方面：算法设计（使用伪代码或流程图表示解决方案）、程序开发（将算法转换为高级语言代码）以及测试与评估（验证功能并识别错误）。权重分配大致为算法占40%，编码占40%，测试占20%，但每考季可能略有不同。

You must be familiar with the pre-release material, which includes a scenario description and a partial program. The exam questions will ask you to extend or modify this program, and sometimes to design new algorithms or functions. You are not allowed to bring the pre-release code into the exam hall, but you may bring up to two sides of A4 notes (check current regulations).

你必须熟悉预发布材料，其中包含场景描述和部分程序。考试题目会要求你扩展或修改该程序，有时还要求设计新算法或函数。你不得将预发布代码带入考场，但可以携带最多两面A4大小的笔记（请查看最新规定）。

2. Pre-release Material: Your Secret Weapon | 预发布材料：你的秘密武器

Treat the pre-release as your blueprint. Carefully analyze the given code, identify key variables, data structures, and functions. Understand the program’s logic completely. Create your own documentation, annotate the code, and rehearse possible modifications such as adding new features, handling additional inputs, or incorporating validation.

将预发布材料视为你的蓝图。仔细分析所提供的代码，识别关键变量、数据结构和函数。完全理解程序的逻辑。创建你自己的文档，为代码添加注释，并演练可能的修改，例如添加新功能、处理额外输入或加入验证。

Common exam tasks derived from pre-release include: changing a linear search to a binary search, adding a sorting algorithm, implementing file I/O for persistent data, or introducing a menu-driven interface. Practice these transformations extensively before the exam.

来自预发布的常见考试任务包括：将线性搜索改为二分搜索，添加排序算法，实现文件输入/输出以持久化数据，或引入菜单驱动界面。考前广泛练习这些转换。

3. Problem Analysis and Decomposition | 问题分析与分解

Before writing any code, break down the problem using decomposition. Identify inputs, processes, outputs, and any constraints. Use structure diagrams or simple comments to outline your plan. This clarifies thinking and earns marks for algorithm design.

在编写任何代码之前，使用分解法分析问题。识别输入、处理、输出以及任何约束条件。使用结构图或简单注释勾勒你的计划。这能理清思路，并为算法设计赢得分数。

For example, a task to calculate and store student grades might be decomposed into: input student marks, validate marks between 0 and 100, determine grade (A,B,C,Fail), store grade in file, display summary. Each sub-problem can then be solved individually.

例如，一个计算并存储学生成绩的任务可分解为：输入学生分数，验证分数在0到100之间，确定等级（A、B、C、不及格），将等级存储到文件中，显示摘要。然后可以逐一解决每个子问题。

4. Algorithm Design: Pseudocode and Flowcharts | 算法设计：伪代码与流程图

CAIE expects you to use a structured pseudocode style (not a specific syntax but consistent). Use indentation, descriptive variable names, and clear keywords like INPUT, OUTPUT, IF…THEN…ELSE…ENDIF, WHILE…DO…ENDWHILE, FOR…TO…NEXT, FUNCTION…ENDFUNCTION. Flowcharts must use standard symbols.

CAIE 希望你使用结构化的伪代码风格（不要求特定语法，但需一致）。使用缩进、描述性变量名以及清晰的关键字，如 INPUT、OUTPUT、IF…THEN…ELSE…ENDIF、WHILE…DO…ENDWHILE、FOR…TO…NEXT、FUNCTION…ENDFUNCTION。流程图必须使用标准符号。

Here is a simple example of pseudocode for finding the maximum value in an array:

FUNCTION findMax(arr)
    maxVal ← arr[0]
    FOR i ← 1 TO LENGTH(arr)-1
        IF arr[i] > maxVal THEN
            maxVal ← arr[i]
        ENDIF
    NEXT i
    RETURN maxVal
ENDFUNCTION

这是一个查找数组最大值的伪代码简单示例。使用箭头表示赋值，清晰展示循环结构。考试中伪代码的清晰度直接影响得分。

5. Programming Fundamentals: Variables, Data Types, and Operators | 编程基础：变量、数据类型与运算符

Declare variables with meaningful names and correct data types: INTEGER, REAL, BOOLEAN, CHAR, STRING. CAIE pseudocode uses primitive types; in the actual coding task you must use the appropriate types of your chosen language (e.g., Python: int, float, bool, str).

用有意义的名称和正确的数据类型声明变量：整数、实数、布尔、字符、字符串。CAIE伪代码使用基本类型；在实际编码任务中，你必须使用所选语言的适当类型（如 Python：int、float、bool、str）。

Operators: arithmetic (+, -, *, /, MOD, DIV), comparison (=, <>, <, >, <=, >=), logical (AND, OR, NOT). Be careful with exponentiation; in pseudocode use ^ but in code use ** (Python) or appropriate syntax.

运算符：算术（+、-、*、/、MOD、DIV）、比较（=、<>、<、>、<=、>=）、逻辑（AND、OR、NOT）。注意指数运算：伪代码中用 ^，但在代码中使用 **（Python）或相应语法。

Pseudocode	Python	Java
x ← 5	x = 5	int x = 5;
MOD	%	%
DIV (integer division)	//	/ (with ints)

常见运算符与值赋值在不同语言间的映射关系，确保你能准确转换。

6. Control Structures: Selection and Iteration | 控制结构：选择与迭代

Master IF-THEN-ELSE, CASE statements, and loops. For pre-release code, you often need to add multi-branch selections or convert an IF chain to a CASE structure for efficiency. Similarly, switch between WHILE (pre-condition) and REPEAT…UNTIL (post-condition) loops when suitable.

掌握 IF-THEN-ELSE、CASE 语句和循环。对于预发布代码，你经常需要添加多分支选择或将 IF 链转换为 CASE 结构以提高效率。类似地，在合适时在 WHILE（前条件）和 REPEAT…UNTIL（后条件）循环之间切换。

When using loops, ensure you have a termination condition to prevent infinite loops. In pseudocode, WHILE counter < 10 DO … counter ← counter + 1 … ENDWHILE. In Python, a for loop with range is common.

使用循环时，确保有终止条件以防止无限循环。伪代码中，WHILE counter < 10 DO … counter ← counter + 1 … ENDWHILE。在 Python 中，常使用带 range 的 for 循环。

7. Data Structures: Arrays and Lists | 数据结构：数组与列表

CAIE syllabus focuses on 1-D and 2-D arrays. You must be able to declare, initialise, traverse, and manipulate arrays. Pseudocode example: DECLARE arr : ARRAY[1:10] OF INTEGER. In Python, a list serves as an array; use indexing from 0. You must handle off-by-one errors carefully.

CAIE 教学大纲侧重于一维和二维数组。你必须能够声明、初始化、遍历和操作数组。伪代码示例：DECLARE arr : ARRAY[1:10] OF INTEGER。在 Python 中，列表用作数组；索引从 0 开始。你必须小心处理 off-by-one 错误。

Common tasks: finding sum, average, maximum/minimum; linear search; binary search (requires sorted array); sorting (bubble sort, insertion sort). Be ready to implement these from scratch or adapt given code.

常见任务：求和、求平均值、求最大/最小值；线性搜索；二分搜索（需要排序数组）；排序（冒泡排序、插入排序）。准备好从零实现这些算法，或改写给定代码。

8. Functions and Procedures: Modular Programming | 函数与过程：模块化编程

Use functions and procedures to break your program into manageable parts. A function returns a value; a procedure does not. CAIE expects you to write pseudocode FUNCTION … RETURN value … ENDFUNCTION. In the coding section, define functions with parameters and use return statements.

使用函数和过程将程序分解为可管理部分

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

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

Year 11 CAIE Computer Science: Practical Assessment Essentials | CAIE 11年级计算机科学：实践考核要点