Edexcel A Level Programming: Core Concepts and Problem Solving | Edexcel A Level 编程：核心概念与问题求解

📚 Edexcel A Level Programming: Core Concepts and Problem Solving | Edexcel A Level 编程：核心概念与问题求解

Programming is central to Edexcel A Level Computer Science. This revision guide covers the core programming constructs, data structures, algorithm design and problem-solving techniques that appear frequently in Paper 1 and Paper 2. It also aligns with the style of Pearson ActiveLearn resources such as the OPS combined programming material.

编程是 Edexcel A Level 计算机科学的核心内容。本篇复习指南涵盖编程核心结构、数据结构、算法设计与问题求解技巧，这些内容在 Paper 1 和 Paper 2 中频繁出现。同时，本指南与 Pearson ActiveLearn 的 OPS combined 编程资源风格保持一致。

1. Computational Thinking and Algorithm Design | 计算思维与算法设计

Computational thinking involves breaking down problems using abstraction, decomposition and pattern recognition before designing step-by-step algorithms. A good algorithm must be clear, finite, precise and capable of producing the correct output for all valid inputs.

计算思维包括使用抽象、分解和模式识别来拆解问题，然后设计逐步执行的算法。一个好的算法必须清晰、有限、精确，并且能够对所有有效输入产生正确输出。

In Edexcel A Level exams, you are often asked to design an algorithm from a scenario, identify errors in a given algorithm, or trace an algorithm with sample data. Practice writing pseudocode before coding in Python, Java or C#.

在 Edexcel A Level 考试中，你经常需要根据情景设计算法、找出给定算法中的错误，或用示例数据追踪算法。建议先练习写伪代码，再用 Python、Java 或 C# 实现。

Abstraction removes unnecessary detail to focus on the key features.
Decomposition splits a large problem into smaller, manageable modules.
Pattern recognition identifies repeated structures to simplify solutions.

抽象去除不必要的细节，聚焦关键特征；分解将大问题拆分为更小、可管理的模块；模式识别发现重复结构以简化解决方案。

2. Pseudocode Conventions and Flowcharts | 伪代码规范与流程图

Edexcel uses a specific pseudocode style that you should reproduce in exams. Use consistent identifiers, assignment with = or ←, clearly indented control structures, and keywords such as IF, THEN, ELSE, ENDIF, FOR, ENDFOR, WHILE, ENDWHILE, FUNCTION and ENDFUNCTION.

Edexcel 使用特定的伪代码风格，考生在考试中应遵循。使用一致的标识符、用 = 或 ← 赋值、保持控制结构清晰缩进，并使用 IF、THEN、ELSE、ENDIF、FOR、ENDFOR、WHILE、ENDWHILE、FUNCTION 和 ENDFUNCTION 等关键字。

Flowcharts are a visual alternative to pseudocode. Rounded rectangles represent start and end points, parallelograms represent input and output, diamonds represent decisions, and rectangles represent processes. You must be able to convert between pseudocode and flowcharts.

流程图是伪代码的可视化替代方案。圆角矩形表示开始和结束，平行四边形表示输入和输出，菱形表示判断，矩形表示处理。你必须能够在伪代码和流程图之间进行转换。

Flowchart symbol	Meaning	含义
Rounded rectangle	Start / End	开始 / 结束
Parallelogram	Input / Output	输入 / 输出
Diamond	Decision	判断
Rectangle	Process	处理

3. Data Types, Variables and Constants | 数据类型、变量与常量

Variables store data that can change while a program runs. Constants store data that should not change after initialisation. You must choose the correct data type for each value and be aware of storage implications.

变量存储程序运行期间可以改变的数据。常量存储初始化后不应改变的数据。你必须为每个值选择正确的数据类型，并注意存储空间的影响。

Data type	Typical use	中文说明
Integer	Whole numbers such as age, count	整数，如年龄、计数
Real / Float	Numbers with decimal parts such as price, temperature	实数，如价格、温度
Boolean	True or False only	布尔值，只能是真或假
Character	Single letter, digit or symbol	单个字符，如字母、数字或符号
String	Sequence of characters such as name, postcode	字符串，如姓名、邮编

Type conversion is often tested. Casting changes one data type to another, for example converting a string input to an integer before arithmetic. Always validate input before conversion to avoid runtime errors.

类型转换经常出现在考试中。强制类型转换可将一种数据类型转换为另一种，例如在算术运算前将字符串输入转换为整数。转换前务必验证输入，以避免运行时错误。

4. Operators and Expressions | 运算符与表达式

Expressions combine operators and operands to produce new values. You must be confident with arithmetic, comparison, logical and string operators, and you must apply correct operator precedence in pseudocode.

表达式将运算符和操作数组合以产生新值。你必须熟练掌握算术、比较、逻辑和字符串运算符，并在伪代码中应用正确的运算优先级。

Operator type	Examples	示例
Arithmetic	+ – * / MOD DIV	加、减、乘、除、取余、整除
Comparison	= ≠ < > ≤ ≥	等于、不等于、小于、大于、小于等于、大于等于
Logical	AND OR NOT	与、或、非
String	& or + for concatenation	字符串连接使用 & 或 +

In most programming languages, multiplication and division are evaluated before addition and subtraction unless parentheses are used. Logical AND is usually evaluated before OR. Use brackets to make your intended order explicit.

在大多数编程语言中，乘法和除法先于加法和减法运算，除非使用括号。逻辑与通常先于逻辑或运算。建议使用括号明确你的运算顺序。

5. Selection: IF and CASE Statements | 选择结构：IF 与 CASE 语句

Selection allows a program to choose between different paths based on a condition. The IF statement handles one or more Boolean conditions, while a CASE or SELECT statement can manage multiple possible values of a single expression more cleanly.

选择结构允许程序根据条件在不同路径之间进行选择。IF 语句处理一个或多个布尔条件，而 CASE 或 SELECT 语句可以更清晰地管理单个表达式的多个可能值。

IF age >= 18 THEN
OUTPUT “Adult”
ELSE
OUTPUT “Minor”
ENDIF

IF 年龄 ≥ 18 THEN
输出 “成年”
ELSE
输出 “未成年”
ENDIF

Nested IF statements can become difficult to read. In Edexcel pseudocode, ELIF can be used for multiple branches, but you must ensure every IF has a matching ENDIF and that conditions are mutually exclusive where appropriate.

嵌套 IF 语句可能变得难以阅读。在 Edexcel 伪代码中，可以使用 ELIF 表示多个分支，但必须确保每个 IF 都有匹配的 ENDIF，并且条件在适当情况下互斥。

6. Iteration: Count-Controlled, Condition-Controlled and Nested Loops | 迭代：计数循环、条件循环与嵌套循环

Iteration repeats a block of code. Count-controlled loops such as FOR run a fixed number of times. Condition-controlled loops such as WHILE and REPEAT UNTIL run while a condition is true or until a condition becomes true.

迭代会重复执行一段代码。计数循环如 FOR 运行固定次数。条件循环如 WHILE 和 REPEAT UNTIL 在条件为真时运行，或直到条件变为真为止。

FOR i = 1 TO 5
OUTPUT i
ENDFOR

FOR i = 1 TO 5
输出 i
ENDFOR

A WHILE loop checks the condition before each iteration. A REPEAT UNTIL loop checks the condition after each iteration, so its body always runs at least once. Nested loops are useful for 2D arrays, grids and matrices.

WHILE 循环在每次迭代前检查条件。REPEAT UNTIL 循环在每次迭代后检查条件，因此其循环体至少执行一次。嵌套循环适用于二维数组、网格和矩阵。

7. Procedures and Functions | 过程与函数

Modular programming splits a large program into smaller named blocks. A procedure carries out a task but does not return a value. A function carries out a task and returns a value using the RETURN keyword.

模块化编程将大型程序拆分为更小的命名块。过程执行任务但不返回值。函数执行任务并通过 RETURN 关键字返回一个值。

FUNCTION square(x)
RETURN x * x
ENDFUNCTION

Parameters pass values into a procedure or function. Local variables only exist inside the module, while global variables are visible throughout the program. Using local variables reduces side effects and makes code easier to debug.

参数将值传入过程或函数。局部变量仅在模块内部存在，而全局变量在整个程序中可见。使用局部变量可以减少副作用，并使代码更易于调试。

8. Data Structures: Arrays, Lists and Records | 数据结构：数组、列表与记录

Data structures organise multiple related values. A 1D array is a fixed-size collection of elements of the same data type, accessed by index. A 2D array is an array of arrays, often used for tables, grids and matrices.

数据结构用于组织多个相关值。一维数组是固定大小的同类型元素集合，通过索引访问。二维数组是数组的数组，常用于表格、网格和矩阵。

Records group fields of different data types under one name, such as a Student record containing name, age and grade. Lists are dynamic structures that can grow and shrink, unlike static arrays.

记录将不同数据类型的字段组合在一个名称下，例如 Student 记录包含姓名、年龄和成绩。列表是可以增长和缩小的动态结构，与静态数组不同。

DECLARE student : RECORD
name : STRING
age : INTEGER
grade : STRING
ENDRECORD

声明 student : 记录
姓名 : 字符串
年龄 : 整数
成绩 : 字符串
结束记录

9. Searching and Sorting Algorithms | 查找与排序算法

Searching algorithms locate a target value in a data structure. Linear search checks each element in order, so it works on unsorted data and has average time complexity O(n). Binary search repeatedly halves a sorted list and has time complexity O(log n).

查找算法用于在数据结构中定位目标值。线性搜索按顺序检查每个元素，因此它适用于未排序数据，平均时间复杂度为 O(n)。二分搜索反复将有序列表减半，时间复杂度为 O(log n)。

Sorting algorithms arrange data into order. Bubble sort repeatedly swaps adjacent misordered items. Merge sort divides the list, sorts each part recursively and merges them back. Insertion sort builds a sorted list one item at a time.

排序算法将数据按顺序排列。冒泡排序反复交换相邻的乱序项。归并排序将列表分割，递归地对各部分排序后再合并。插入排序一次一个元素地构建有序列表。

Algorithm	Worst-case time	中文说明
Linear search	O(n)	线性搜索
Binary search	O(log n)	二分搜索
Bubble sort	O(n²)	冒泡排序
Merge sort	O(n log n)	归并排序
Insertion sort	O(n²)	插入排序

10. Object-Oriented Programming Concepts | 面向对象编程概念

Object-oriented programming (OOP) models real-world entities as objects. A class is a blueprint that defines attributes and methods. An object is an instance of a class. You should be able to interpret simple class diagrams and pseudocode involving classes.

面向对象编程将现实世界实体建模为对象。类是一个定义属性和方法的蓝图。对象是类的一个实例。你应该能够解释简单的类图以及涉及类的伪代码。

Encapsulation hides internal state and forces access through methods. Inheritance allows a subclass to reuse and extend a base class. Polymorphism allows the same method name to behave differently in different classes. These concepts are assessed through tracing and design questions.

封装隐藏内部状态并强制通过方法访问。继承允许子类复用和扩展基类。多态允许相同的方法名在不同类中表现不同。这些概念通过追踪和设计题进行考查。

CLASS Vehicle
PRIVATE speed : REAL
PUBLIC FUNCTION getSpeed()
RETURN speed
ENDFUNCTION
ENDCLASS

CLASS Vehicle
PRIVATE 速度 : 实数
PUBLIC FUNCTION getSpeed()
RETURN 速度
ENDFUNCTION
ENDCLASS

11. Testing, Evaluation and Debugging | 测试、评估与调试

Testing verifies that a program meets its requirements. You must test normal, boundary and erroneous data. Boundary data includes values at the edges of valid ranges, such as minimum and maximum accepted values. Erroneous data should be rejected gracefully.

测试用于验证程序是否满足需求。你必须测试正常、边界和错误数据。边界数据包括有效范围边缘的值，如最小和最大可接受值。错误数据应被优雅地拒绝。

Trace tables track variable values as an algorithm runs. They are an essential exam skill. Debugging tools include breakpoints, step-through execution, variable watches and error message analysis.

Published by TutorHao | A-Level 编程 Revision Series | aleveler.com

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

Edexcel A Level Programming: Core Concepts and Problem Solving | Edexcel A Level 编程：核心概念与问题求解