Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧

📚 Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧

This article is a focused revision guide for Edexcel A-Level Computer Science, covering the programming fundamentals that appear regularly in Paper 1 and Paper 2. It brings together language paradigms, data representation, control flow, subroutines, recursion and object-oriented ideas in one place, with exam-style prompts and common mistakes highlighted along the way.

本文是面向 Edexcel A-Level 计算机科学的重点复习指南，梳理 Paper 1 和 Paper 2 中经常出现的编程基础知识。文章将语言范式、数据表示、控制流程、子程序、递归以及面向对象思想整合在一起，并逐步标注考试题型与常见错误。

1. Programming Paradigms and Language Classification | 编程范式与语言分类

Edexcel expects you to recognise that programming languages are grouped into paradigms such as procedural, object-oriented and functional. A procedural program is written as a sequence of instructions that change the program state, while an object-oriented program models the world as interacting objects that hold data and behaviour.

Edexcel 要求你识别编程语言可按范式分类，例如过程式、面向对象和函数式。过程式程序写成一连串改变程序状态的指令，而面向对象程序则把世界建模为相互交互、包含数据与行为的对象。

Compiled languages like C translate the whole source code before execution, which usually gives faster runtime but requires a separate compile step. Interpreted languages like Python translate and execute line by line, which helps debugging but can be slower.

C 等编译型语言在执行前先将全部源代码翻译成机器码，通常运行速度更快，但需要单独的编译步骤。Python 等解释型语言逐行翻译执行，有助于调试，但速度可能较慢。

Procedural: focuses on procedures and step-by-step instructions.
Object-oriented: focuses on classes, objects, inheritance and encapsulation.
Functional: focuses on pure functions, recursion and immutable data.
过程式：关注过程和逐步指令；面向对象：关注类、对象、继承和封装；函数式：关注纯函数、递归和不可变数据。

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

A variable is a named storage location whose value can change during execution, whereas a constant is bound to a value that cannot be modified. In A-Level pseudocode, constants are often declared with the keyword CONSTANT or final, and variables with a data type such as INTEGER, REAL, BOOLEAN, CHAR or STRING.

变量是命名的存储位置，其值在执行过程中可以改变；常量则绑定到一个不可修改的值。在 A-Level 伪代码中，常量常用 CONSTANT 或 final 声明，变量则使用 INTEGER、REAL、BOOLEAN、CHAR 或 STRING 等数据类型。

Choosing the right data type affects accuracy and memory. For example, REAL is used for fractional values, but floating-point arithmetic can introduce rounding errors, while INTEGER arithmetic is exact within range.

选择正确的数据类型会影响精度和内存。例如，REAL 用于带小数的值，但浮点运算可能引入舍入误差；INTEGER 运算在范围内则是精确的。

Data type \| 数据类型	Typical use \| 典型用途
INTEGER	Whole numbers such as counts or indices
REAL	Measurements, currency, scientific values
BOOLEAN	True/false flags and conditions
CHAR / STRING	Single characters or text data

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

Expressions combine values, variables and operators to produce a result. Arithmetic operators include +, −, ×, ÷ and MOD; comparison operators include =, ≠, <, >, ≤ and ≥; Boolean operators include AND, OR and NOT. Operator precedence determines the order of evaluation.

表达式将值、变量和运算符组合起来产生结果。算术运算符包括 +、−、×、÷ 和 MOD；比较运算符包括 =、≠、<、>、≤ 和 ≥；布尔运算符包括 AND、OR 和 NOT。运算符优先级决定求值顺序。

Integer division and MOD are common exam questions. In pseudocode, 17 DIV 5 gives 3, while 17 MOD 5 gives 2. Always check whether the language uses DIV/MOD or // and %.

整除与取模是常见考试内容。在伪代码中，17 DIV 5 得 3，17 MOD 5 得 2。务必确认语言使用 DIV/MOD 还是 // 和 %。

17 DIV 5 = 3 and 17 MOD 5 = 2

4. Control Structures: Sequence, Selection, Iteration | 控制结构：顺序、选择、迭代

All programming problems can be built from three control structures: sequence, selection and iteration. Sequence means instructions execute one after another; selection uses IF…THEN…ELSE…ENDIF or CASE statements to choose paths; iteration repeats code using FOR, WHILE or REPEAT…UNTIL loops.

所有编程问题都可以由三种控制结构构建：顺序、选择和迭代。顺序指指令逐条执行；选择使用 IF…THEN…ELSE…ENDIF 或 CASE 语句选择路径；迭代使用 FOR、WHILE 或 REPEAT…UNTIL 循环重复代码。

A common exam skill is converting a FOR loop into an equivalent WHILE loop. For example, FOR i ← 1 TO 10 can be rewritten as i ← 1; WHILE i ≤ 10 DO … i ← i + 1 ENDWHILE.

常见的考试技能是把 FOR 循环改写成等价的 WHILE 循环。例如，FOR i ← 1 TO 10 可改写为 i ← 1；WHILE i ≤ 10 DO … i ← i + 1 ENDWHILE。

FOR i ← 1 TO 10 ≡ i ← 1; WHILE i ≤ 10 DO … i ← i + 1 ENDWHILE

5. Subroutines, Parameters and Return Values | 子程序、参数与返回值

A subroutine is a named block of code that can be called from elsewhere. Procedures perform a task without returning a value, whereas functions return a single value. Parameters are values passed into the subroutine; they can be passed by value or by reference.

子程序是可从别处调用的命名代码块。过程执行任务而不返回值，函数则返回一个值。参数是传入子程序的值；参数传递方式有按值传递和按引用传递。

In exams, you must trace parameter passing accurately. If a parameter is passed by value, the subroutine works on a copy, so the original variable is unchanged. If passed by reference, changes affect the caller’s variable.

考试中必须准确追踪参数传递。如果按值传递，子程序操作的是副本，原变量不会改变。若按引用传递，修改会影响调用者的变量。

6. Local and Global Variables | 局部变量与全局变量

A local variable is declared inside a subroutine and exists only while that subroutine is running. A global variable is declared outside subroutines and can be accessed throughout the program. Local variables make subroutines easier to test and reuse because their effect is contained.

局部变量在子程序内部声明，仅在子程序运行期间存在。全局变量在子程序外部声明，可在整个程序中访问。局部变量使子程序更易于测试和复用，因为其影响是受限的。

Excess use of global variables can lead to side effects and make debugging difficult. In tracing questions, draw a table showing the stack or scope of each variable, and update it line by line.

过度使用全局变量可能导致副作用并使调试困难。在追踪题中，画出表格显示每个变量的栈或作用域，并逐行更新。

7. Recursion and the Call Stack | 递归与调用栈

Recursion occurs when a subroutine calls itself. A correct recursive definition must have at least one base case that stops the recursion and at least one recursive case that reduces the problem towards the base case. Each recursive call creates a new stack frame containing local variables and return address.

递归发生在子程序调用自身时。正确的递归定义必须至少有一个停止递归的基例，以及至少一个将问题向基例缩小问题规模的递归例。每次递归调用都会创建一个新的栈帧，包含局部变量和返回地址。

The classic factorial can be defined as factorial(n) = 1 when n = 0, otherwise n × factorial(n − 1). The call stack grows as n decreases; when n reaches 0, the frames are popped and the multiplications are completed in reverse order.

经典阶乘可定义为：当 n = 0 时 factorial(n) = 1，否则为 n × factorial(n − 1)。调用栈随 n 减少而增长；当 n 到达 0 时，栈帧被弹出，乘法以相反顺序完成。

Recursion can make code elegant, but it uses extra memory for stack frames. A missing base case causes infinite recursion and eventually a stack overflow error. Some problems, such as traversing tree structures, are naturally recursive.

递归使代码简洁，但会为栈帧占用额外内存。缺少基例会导致无限递归，最终引发栈溢出错误。某些问题，如遍历树结构，天然适合递归。

8. Object-Oriented Programming: Classes and Objects | 面向对象编程：类与对象

A class is a blueprint that defines the attributes and methods of a type. An object is an instance of a class. For example, a Car class might have attributes such as colour and fuelLevel, and methods such as startEngine() and accelerate().

类是定义类型属性和方法的蓝图。对象是类的实例。例如，Car 类可以有 colour 和 fuelLevel 等属性，以及 startEngine() 和 accelerate() 等方法。

Encapsulation means hiding the internal state of an object and exposing only necessary methods. In pseudocode, attributes are often declared as private and accessed through public get and set methods. This protects data integrity.

封装意味着隐藏对象的内部状态，只公开必要的方法。在伪代码中，属性通常声明为私有，并通过公共的 get 和 set 方法访问。这样可以保护数据完整性。

9. Inheritance, Encapsulation and Polymorphism | 继承、封装与多态

Inheritance allows a child class to inherit attributes and methods from a parent class, using the keyword inherits or extends. The child class can add new members or override inherited methods to provide its own behaviour.

继承允许子类从父类继承属性和方法，使用 inherits 或 extends

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

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

Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧