Core Programming Techniques for Edexcel A-Level | Edexcel A-Level 核心编程技术

📚 Core Programming Techniques for Edexcel A-Level | Edexcel A-Level 核心编程技术

Programming is the heart of the Edexcel A-Level Computer Science specification. This article consolidates the essential techniques you must master, from fundamental data types to algorithm design and testing. Use it alongside your class notes and pseudocode practice to build confidence for Paper 2 and the programming project.

编程是 Edexcel A-Level 计算机科学考试的核心。本文总结了必须掌握的关键技术，从基本数据类型到算法设计与测试。结合课堂笔记和伪代码练习，能帮助你在 Paper 2 和编程项目中建立信心。

1. Data Types and Variables | 数据类型与变量

In Edexcel A-Level Computer Science, a data type defines the set of values a variable can hold and the operations that can be performed on it. Common primitive data types include integer, real/float, Boolean, character and string. Choosing the correct type prevents runtime errors and makes code easier to understand.

在 Edexcel A-Level 计算机科学中，数据类型定义了变量可存储的值集合以及可对其执行的操作。常见的基本数据类型包括整数、实数/浮点数、布尔值、字符和字符串。选择正确的类型可以防止运行时错误，并使代码更易理解。

Integer: whole numbers, e.g. 5, -3, 0
整数：如 5、-3、0
Real/Float: decimal numbers, e.g. 3.14, -0.5
实数/浮点数：如 3.14、-0.5
Boolean: TRUE or FALSE
布尔值：TRUE 或 FALSE
Character: single symbol, e.g. ‘A’, ‘7’, ‘?’
字符：单个符号，如 ‘A’、’7’、’?’
String: sequence of characters, e.g. “hello”
字符串：字符序列，如 “hello”

A variable is a named storage location whose value can change during execution. Declaring variables with clear names such as studentName or totalScore improves readability and reduces logical errors.

变量是命名的存储位置，其值在程序执行期间可以改变。使用清晰的变量名（如 studentName 或 totalScore）进行声明，可以提高可读性并减少逻辑错误。

2. Constants and Operators | 常量与运算符

A constant is similar to a variable, but its value cannot change after it is assigned. Constants are useful for fixed values such as VAT_RATE = 0.20 or MAX_STUDENTS = 30. Using constants makes programs easier to maintain because a change only needs to be made in one place.

常量与变量类似，但一经赋值便无法更改。常量适用于固定值，例如 VAT_RATE = 0.20 或 MAX_STUDENTS = 30。使用常量可以使程序更易于维护，因为只需在一处进行修改。

Operators are symbols that perform operations on values. Arithmetic operators include +, -, *, /, MOD and DIV. Comparison operators include =, ≠, <, >, ≤ and ≥. Logical operators include AND, OR and NOT, while string concatenation is often represented by & or +.

运算符是对值执行操作的符号。算术运算符包括 +、-、*、/、MOD 和 DIV。比较运算符包括 =、≠、<、>、≤ 和 ≥。逻辑运算符包括 AND、OR 和 NOT，而字符串连接通常用 & 或 + 表示。

total ← num1 + num2

The order of operations follows standard mathematical precedence: parentheses, then exponentiation, then multiplication/division, then addition/subtraction. Always use parentheses to make the intended order explicit.

运算顺序遵循标准数学优先级：先括号，再乘方，然后乘除，最后加减。始终使用括号明确预期的计算顺序。

3. Sequence, Selection and Iteration | 顺序、选择与迭代

All programs are built from three basic control structures: sequence, selection and iteration. Sequence means statements are executed one after another in the order written. Selection allows the program to choose between different paths based on a condition.

所有程序都由三种基本控制结构构成：顺序、选择和迭代。顺序意味着语句按书写顺序逐条执行。选择允许程序根据条件在不同路径之间进行选择。

Iteration repeats a block of code. Definite iteration uses FOR loops when the number of repetitions is known, while indefinite iteration uses WHILE or REPEAT loops when the loop continues until a condition changes.

迭代重复执行一段代码。当重复次数已知时，使用 FOR 循环实现确定迭代；当循环持续到条件改变时才停止，使用 WHILE 或 REPEAT 循环实现非确定迭代。

IF score >= 60 THEN grade ← ‘Pass’ ELSE grade ← ‘Fail’

Nested control structures are common in exam questions. You must be able to trace through nested IF statements and loops to predict output or identify the final value of a variable.

嵌套控制结构在考试题中很常见。你必须能够追踪嵌套的 IF 语句和循环，以预测输出或确定变量的最终值。

4. Arrays and Lists | 数组与列表

An array is a collection of elements of the same data type stored under one identifier. Each element is accessed by an index. In most pseudocode used by Edexcel, indices start at 0 or 1 depending on the language context, so always check the question.

数组是同一数据类型元素的集合，存储在一个标识符下。每个元素通过索引访问。在 Edexcel 使用的大多数伪代码中，索引根据语言上下文从 0 或 1 开始，因此务必检查题目。

A one-dimensional array is like a single row; a two-dimensional array is like a table with rows and columns. Array traversal using a FOR loop is a very common skill, for example calculating the total of all elements.

一维数组就像一行数据；二维数组就像一个包含行和列的表格。使用 FOR 循环遍历数组是一项非常常见的技能，例如计算所有元素的总和。

FOR i ← 0 TO 4 DO total ← total + numbers[i]

Lists are similar to arrays but can often change size dynamically and may hold mixed data types in some languages. In pseudocode, list operations may include append, insert, remove and slice.

列表与数组类似，但在某些语言中可以动态改变大小，并且可以存放混合数据类型。在伪代码中，列表操作可能包括追加、插入、删除和切片。

5. Records and Files | 记录与文件

A record is a data structure that groups related fields of different data types into one logical unit. For example, a Student record may contain fields for name, age, tutor group and average mark. Records are useful when data items describe a single entity.

记录是一种数据结构，它将不同数据类型的相关字段组合成一个逻辑单元。例如，Student 记录可以包含姓名、年龄、导师组和平均分等字段。当数据项描述单个实体时，记录非常有用。

File handling is tested frequently. You need to know how to open, read, write, append and close text files. Pseudocode examples often use statements such as OPENFILE “data.txt” FOR READ or WRITE.

文件处理是常考内容。你需要知道如何打开、读取、写入、追加和关闭文本文件。伪代码示例通常使用 OPENFILE “data.txt” FOR READ 或 WRITE 等语句。

Operation	Purpose
READ	Get data from a file
WRITE	Add data to a file, overwriting existing content
APPEND	Add data to the end of an existing file

When reading files, be careful with end-of-file checks. A WHILE NOT EOF loop is commonly used to process every line until the end of the file is reached.

读取文件时，注意文件结束检查。通常使用 WHILE NOT EOF 循环处理每一行，直到到达文件末尾。

6. Procedures and Functions | 过程与函数

A procedure is a named block of code that performs a task but does not return a value. A function always returns a single value. Both help to achieve modular design, making programs easier to debug, test and reuse.

过程是执行任务但不返回值的命名代码块。函数总是返回单个值。两者都有助于实现模块化设计，使程序更易于调试、测试和复用。

Local variables are declared inside a subroutine and exist only while it runs. Global variables are accessible throughout the program. Overusing global variables can cause unexpected side effects, so examiners expect you to justify the use of local variables.

局部变量在子程序内部声明，并且只在子程序运行时存在。全局变量在整个程序中都可访问。过度使用全局变量可能导致意外的副作用，因此考官希望你能够说明使用局部变量的理由。

Subroutines improve maintainability by avoiding repeated code. If a calculation changes, you only update the subroutine once instead of every place it was copied.

子程序通过避免重复代码来提高可维护性。如果某个计算发生变化，你只需更新子程序一次，而不必修改所有复制过的位置。

7. Parameter Passing | 参数传递

Parameters allow subroutines to receive input values. Passing by value gives the subroutine a copy of the data, so changes inside the subroutine do not affect the original variable. Passing by reference gives access to the original memory location, so changes are retained after the subroutine ends.

参数允许子程序接收输入值。按值传递将数据副本交给子程序，因此子程序内部的更改不会影响原始变量。按引用传递则允许访问原始内存位置，因此子程序结束后更改仍然保留。

PROCEDURE Swap(BYREF x, BYREF y)

Exam questions often ask you to identify whether a parameter is passed by value or by reference, and to trace what happens when a procedure modifies its parameters. Always write the word BYVAL or BYREF clearly in your pseudocode answers.

考试题经常要求你判断参数是按值传递还是按引用传递，并追踪过程修改参数时发生了什么。在伪代码答案中始终清楚写出 BYVAL 或 BYREF。

8. Recursion | 递归

Recursion occurs when a subroutine calls itself. A recursive algorithm must have a base case that stops the recursion and a recursive case that reduces the problem towards the base case. Without a base case, the program will cause a stack overflow.

当子程序调用自身时，就发生了递归。递归算法必须包含停止递归的基线条件，以及将问题缩小到基线条件的递归条件。没有基线条件，程序将导致栈溢出。

A classic example is the factorial function: n! = n × (n – 1)!. The base case is 0! = 1. Recursion produces elegant solutions but may be less efficient than iteration because of repeated function call overhead.

经典例子是阶乘函数：n! = n × (n – 1)!。基线条件是 0! = 1。递归能产生简洁的解决方案，但由于重复的函数调用开销，可能比迭代效率低。

FUNCTION Factorial(n): IF n = 0 THEN RETURN 1 ELSE RETURN n * Factorial(n – 1)

You should be able to trace recursive calls step by step, showing how each call is placed on the call stack and how return values are combined after the base case is reached.

你应该能够逐步追踪递归调用，展示每次调用如何放入调用栈，以及在到达基线条件后返回值如何组合。

9. Searching Algorithms | 搜索算法

Linear search examines each element in turn until the target is found or the end is reached. It works on unsorted data and has a worst-case time complexity of O(n), meaning the number of steps grows linearly with the number of items.

线性搜索依次检查每个元素，直到找到目标或到达末尾。它适用于未排序的数据，最坏情况的时间复杂度为 O(n)，即步骤数随元素数量线性增长。

Binary search repeatedly divides a sorted list in half. It compares the target with the middle element and discards the half that cannot contain the target. Binary search has a time complexity of O(log n), so it is much faster for large sorted lists.

二分搜索反复将有序列表分成两半。它将目标与中间元素进行比较，然后丢弃不可能包含目标的那一半。二分搜索的时间复杂度为 O(log n)，因此对于大型有序列表，其速度快得多。

mid ← (low + high) DIV 2

However, binary search requires the data to be sorted. If the data is unsorted, you must sort it first, which may add extra time and affect overall efficiency.

然而，二分搜索要求数据已经排序。如果数据未排序，则必须先进行排序，这可能会增加额外时间并影响整体效率。

10. Sorting Algorithms | 排序算法

Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. It has an average and worst-case time complexity of O(n²). Although simple to understand, it is inefficient for large data sets.

冒泡排序反复比较相邻元素，如果顺序错误则交换它们。其平均和最坏情况的时间复杂度均为 O(n²)。虽然简单易懂，但对于大型数据集效率较低。

Insertion sort builds the sorted list one element at a time by inserting each new element into its correct position. It is efficient for small or nearly sorted lists. Merge sort uses a divide-and-conquer approach with a time complexity of O(n log n), but it requires extra memory.

插入排序通过将每个新元素插入到正确位置，逐个构建有序列表。它对于小型或接近有序的列表效率较高。归并排序采用分治策略，时间复杂度为 O(n log n)，但需要额外的内存。

Algorithm	Best	Worst
Bubble sort	O(n)	O(n²)
Insertion sort	O(n)	O(n²)
Merge sort	O(n log n)	O(n log n)

Understanding the strengths and weaknesses of each sorting algorithm helps you choose the most appropriate one and justify your choice in extended answer questions.

了解每种排序算法的优缺点，有助于你选择最合适的算法，并在扩展回答题中说明选择理由。

11. Testing and Debugging | 测试与调试

Testing is not just running the program once. You should design test data that covers normal, boundary and erroneous cases. Normal data is valid and typical, boundary data is at the limits of acceptance, and erroneous data is invalid and should be rejected.

测试不只是运行一次程序。你应该设计覆盖正常、边界和错误情况的测试数据。正常数据是有效且典型的，边界数据处于可接受范围的极限，错误数据是无效的，应被拒绝。

A trace table is a table showing the values of variables as a program runs line by line. It is a powerful tool for finding logic errors and is a common Edexcel exam requirement.

跟踪表是显示程序逐行运行时变量值的表格。它是查找逻辑错误的有力工具，也是 Edexcel 考试中常见的要求。

Debugging techniques include using breakpoints, stepping through code line by line, adding output statements and checking variable values at key points. Always identify the type of error: syntax, runtime or logic.

调试技术包括使用断点、逐行单步执行代码、添加输出语句以及检查关键点的变量值。始终要辨别错误类型：语法错误、运行时错误或逻辑错误。

12. Programming Paradigms | 编程范式

A programming paradigm is a style or way of programming. The procedural paradigm organises code into procedures and functions, focusing on what the program does step by step. It is the main paradigm used in Edexcel pseudocode questions.

编程范式是一种编程风格或方式。过程式范式将代码组织为过程和函数，侧重于程序逐步执行的操作。它是 Edexcel 伪代码题中使用的主要范式。

The object-oriented paradigm models real-world entities using classes and objects. A class is a blueprint, and an object is an instance. Key principles include encapsulation, inheritance and polymorphism. Edexcel may ask you to compare paradigms at a conceptual level.

面向对象范式使用类和对象对现实世界实体进行建模。类是蓝图，对象是实例。关键原则包括封装、继承和多态。Edexcel 可能要求你在概念层面比较不同范式。

Whichever paradigm you use, the quality of an algorithm depends on clarity, efficiency and maintainability. Always structure your code so another programmer can understand and modify it easily.

无论使用哪种范式，算法的质量都取决于清晰性、效率和可维护性。始终以让其他程序员能轻松理解和修改的方式组织代码。

Published by TutorHao | A-Level Computer Science Programming Revision Series | aleveler.com

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

Core Programming Techniques for Edexcel A-Level | Edexcel A-Level 核心编程技术