📚 Edexcel A-Level Programming Masterclass: Core Constructs, Data Structures and Algorithms | 爱德思A-Level编程大师课：核心结构、数据结构与算法
Programming is the heart of Edexcel A-Level Computer Science Paper 2. In the on-screen exam, you must read, trace, write and correct algorithms using a high-level language such as Python 3, or the Pearson Edexcel pseudocode.
编程是爱德思A-Level计算机科学Paper 2的核心。在机考中，你需要使用Python 3等高级语言或Pearson Edexcel伪代码来阅读、追踪、编写和修正算法。
This guide covers the core programming constructs, data structures and algorithms that appear most often in the Edexcel specification. Each section pairs English explanation with Chinese explanation so you can revise key terms efficiently.
本指南涵盖爱德思考试大纲中最常出现的核心编程结构、数据结构和算法。每一节都采用英文与中文对照讲解，帮助你高效复习关键术语。
1. Programming Fundamentals and Exam Context | 编程基础与考试背景
Edexcel A-Level programming is assessed through computational thinking tasks rather than long theory essays. Marks come from writing correct code, completing trace tables, identifying logic errors and suggesting valid test data.
爱德思A-Level编程通过计算思维任务进行考核，而不是长篇理论论述。分数来自编写正确代码、完成追踪表、识别逻辑错误以及提出有效的测试数据。
You need to be fluent in three layers: problem decomposition, algorithm design and code implementation. The more you practise translating between pseudocode and actual code, the faster you become in the exam.
你需要熟练三个层次：问题分解、算法设计和代码实现。你越多练习伪代码与实际代码之间的转换，考试中就会越快。
Common programming languages accepted in Edexcel centres include Python, Java, C# and Visual Basic. Python 3 is popular because its syntax is close to the Edexcel pseudocode style.
爱德思考试中心接受的常见编程语言包括Python、Java、C#和Visual Basic。Python 3之所以流行，是因为它的语法接近Edexcel伪代码风格。
2. Data Types, Variables and Constants | 数据类型、变量与常量
Every value in a program has a data type. Edexcel expects you to choose the correct type for a given value and to understand how types affect operations and storage.
程序中的每个值都有数据类型。爱德思希望你能够为给定值选择正确的类型，并理解类型如何影响操作和存储。
| Data type | 中文 | Example |
|---|---|---|
| Integer | 整数 | 42 |
| Real / Float | 实数/浮点 | 3.14 |
| Boolean | 布尔 | True / False |
| Character | 字符 | ‘A’ |
| String | 字符串 | “hello” |
| Array / List | 数组/列表 | [1, 2, 3] |
A constant is a named value that cannot change while the program runs. A variable is a named memory location whose value can change during execution.
常量是在程序运行期间不能更改的命名值。变量是内存中的命名位置，其值在执行期间可以改变。
In Pearson Edexcel pseudocode, you can declare variables with statements such as DECLARE age AS INTEGER and constants with CONSTANT PI = 3.14. Always declare variables clearly before tracing an algorithm.
在Pearson Edexcel伪代码中，你可以使用DECLARE age AS INTEGER声明变量，用CONSTANT PI = 3.14声明常量。在追踪算法之前，一定要清楚地声明变量。
3. Operators and Expressions | 运算符与表达式
Operators build expressions from values and variables. Arithmetic operators include +, -, *, /, MOD and DIV. DIV gives the whole-number quotient, while MOD gives the remainder.
运算符用值和变量构建表达式。算术运算符包括+、-、*、/、MOD和DIV。DIV给出整数商，而MOD给出余数。
Comparison operators include =, ≠, <, >, ≤ and ≥. Logical operators include AND, OR and NOT, which are essential for combining multiple conditions in selection and iteration.
比较运算符包括=、≠、<、>、≤和≥。逻辑运算符包括AND、OR和NOT，它们在选择和迭代中组合多个条件时非常重要。
17 MOD 5 = 2 | 17 DIV 5 = 3 | NOT True = False
Remember that integer division and remainder are not the same as real division. In Python, you can use // for integer division and % for modulo.
请记住，整数除法和余数与实数除法不同。在Python中，你可以使用//进行整数除法，使用%进行取模运算。
4. Sequence, Selection and Iteration | 顺序、选择与迭代
All structured programs are built from three control constructs: sequence, selection and iteration. Sequence means instructions run one after another in order.
所有结构化程序都由三种控制结构构成：顺序、选择和迭代。顺序意味着指令按顺序一条接一条执行。
Selection allows a program to choose between different paths. Edexcel pseudocode uses IF…THEN…ELSE…ENDIF and CASE…OF…ENDCASE for multi-way decisions.
选择允许程序在不同路径之间进行选择。Edexcel伪代码使用IF…THEN…ELSE…ENDIF以及CASE…OF…ENDCASE进行多分支决策。
IF score ≥ 70 THEN
OUTPUT “Distinction”
ELSE
OUTPUT “Pass”
ENDIF
Iteration repeats a block of code. Count-controlled loops use FOR…NEXT, while condition-controlled loops use WHILE…ENDWHILE or REPEAT…UNTIL.
迭代重复执行一段代码。计数控制循环使用FOR…NEXT，而条件控制循环使用WHILE…ENDWHILE或REPEAT…UNTIL。
Use a FOR loop when you know how many times to repeat. Use a WHILE loop when the number of repetitions depends on a condition, and use REPEAT…UNTIL when the loop body must run at least once.
当你知道需要重复多少次时，使用FOR循环。当重复次数取决于某个条件时，使用WHILE循环；当循环体必须至少执行一次时，使用REPEAT…UNTIL。
5. Subroutines: Procedures and Functions | 子程序：过程与函数
A subroutine is a named block of code that can be called from elsewhere in a program. Edexcel distinguishes between procedures, which do not return a value, and functions, which always return a value.
子程序是可以在程序其他地方调用的命名代码块。爱德思区分过程与函数：过程不返回值，而函数始终返回一个值。
Parameters allow data to be passed into a subroutine. By value parameters copy the original data, while by reference parameters allow the subroutine to modify the original variable.
参数允许将数据传递给子程序。按值传递的参数会复制原始数据，而按引用传递的参数允许子程序修改原始变量。
Local variables exist only inside a subroutine, while global variables are accessible throughout the whole program. You should use local variables where possible to reduce side effects.
局部变量只存在于子程序内部，而全局变量可以在整个程序中访问。你应尽量使用局部变量，以减少副作用。
FUNCTION add(a, b) RETURN a + b ENDFUNCTION
In Python, you define a function with def. A function with no explicit return value still returns None, so keep the Edexcel procedure/function distinction clear when writing pseudocode.
在Python中，你使用def定义函数。没有显式返回值的函数仍然会返回None，因此在编写伪代码时要明确区分爱德思的过程与函数。
6. Arrays, Lists and Records | 数组、列表与记录
An array is a collection of data items of the same type stored under one name. Elements are accessed using an index, which usually starts at 0 in Python and at 1 in some exam pseudocode examples.
数组是存储在同一个名称下、类型相同的数据项集合。元素通过索引访问，Python中的索引通常从0开始，而在某些考试伪代码示例中从1开始。
A one-dimensional array is a simple list, while a two-dimensional array is like a table with rows and columns. You must be able to read and update array elements in trace tables.
一维数组是简单的列表，而二维数组就像带行和列的表格。你必须能够在追踪表中读取和更新数组元素。
Lists in Python are more flexible than arrays because they can store mixed types and change size. A record stores related fields of possibly different types, such as a student record with name, age and grade.
Python中的列表比数组更灵活，因为它们可以存储混合类型并且大小可变。记录存储可能不同类型的相关字段，例如包含姓名、年龄和成绩的学生记录。
scores[0] = 85 | matrix[1][2] = 7 | student.name = “Ali”
7. String Handling and File Operations | 字符串处理与文件操作
String manipulation questions are common in Edexcel Paper 2. You need to know how to find length, access characters, extract substrings and concatenate strings.
字符串处理题在爱德思Paper 2中很常见。你需要知道如何求长度、访问字符、提取子串以及连接字符串。
LENGTH(“hello”) = 5 | SUBSTRING(“Computer”, 1, 4) = “Comp” | “A” + “B” = “AB”
File handling operations include opening a file in read, write or append mode, reading data from it, writing data to it and closing it. Always close files to avoid data loss.
文件处理操作包括以读取、写入或追加模式打开文件，从文件读取数据，向文件写入数据以及关闭文件。始终关闭文件以避免数据丢失。
In exam questions, look for the mode of file access: read mode does not change the file, write mode creates or overwrites it, and append mode adds data at the end.
在考试题中，注意文件访问模式：读取模式不会更改文件，写入模式会创建或覆盖文件，追加模式在文件末尾添加数据。
8. Searching and Sorting Algorithms | 搜索与排序算法
Edexcel requires you to understand linear search and binary search. Linear search checks every item from start to finish, while binary search repeatedly divides a sorted list in half.
爱德思要求你理解线性搜索和二分搜索。线性搜索从头到尾检查每一项，而二分搜索将有序列表反复分成两半。
Binary search is much faster on large sorted lists, but it requires the data to be sorted first. Linear search works on unsorted data but has O(n) time complexity.
二分搜索在大型有序列表上要快得多，但它要求数据先排序。线性搜索适用于未排序数据，但时间复杂度为O(n)。
| Algorithm | 中文 | Average time |
|---|---|---|
| Linear search | 线性搜索 | O(n) |
| Binary search | 二分搜索 | O(log₂ n) |
| Bubble sort | 冒泡排序 | O(n²) |
| Merge sort | 归并排序 | O(n log₂ n) |
| Quick sort | 快速排序 | O(n log₂ n) |
| Insertion sort | 插入排序 | O(n²) |
You should be able to write sorting steps in pseudocode, particularly bubble sort and merge sort. Exam questions often ask you to complete a pass or compare two algorithms.
你应该能够用伪代码编写排序步骤，尤其是冒泡排序和归并排序。考试题经常要求你完成一轮排序或比较两种算法。
9. Recursion and Divide-and-Conquer | 递归与分治法
Recursion is a technique where a subroutine calls itself to solve a smaller version of the same problem. Every recursive algorithm must have a base case to stop the recursion.
递归是一种子程序调用自身来解决同一问题较小版本的技术。每个递归算法都必须有一个基准情形来停止递归。
factorial(n) = n × factorial(n – 1), base case: factorial(0) = 1
Recursion is widely used in divide-and-conquer algorithms such as merge sort and quick sort. The problem is split into smaller subproblems, solved recursively, then combined.
递归广泛用于归并排序和快速排序等分治算法。问题被分成较小的子问题，递归地解决，然后再组合起来。
When tracing a recursive function, use a call stack to show how each call is pushed and popped. Exam questions may ask you to write the output of a recursive algorithm for a given input.
追踪递归函数时，使用调用栈来展示每个调用如何入栈和出栈。考试题可能要求你写出给定输入下递归算法的输出。
10. Testing, Trace Tables and Debugging | 测试、追踪表与调试
Testing proves that a program works correctly. Edexcel expects you to know normal, boundary and erroneous test data, and to explain why each type is important.
测试证明程序能正确运行。爱德思希望你知道正常、边界和错误测试数据，并解释为什么每种类型都很重要。
A trace table records the changing values of variables as an algorithm runs. It is a vital skill for Paper 2 because you may be asked to complete one or identify where an error occurs.
追踪表记录算法运行时变量的变化值。这是Paper 2的重要技能，因为考试可能要求你完成追踪表或找出错误发生的位置。
Line | n | i | output
1 | 5 | – | –
2 | 5 | 1 | –
3 | 5 | 1 | “5 × 1 = 5”
Debugging strategies include checking syntax, tracing values by hand, testing isolated parts of code and using print statements. Always look for off-by-one errors in loops.
调试策略包括检查语法、手动追踪数值、测试代码的独立部分以及使用print语句。始终注意循环中的差一错误。
11. Exam Technique for Edexcel Paper 2 | Edexcel Paper 2 考试技巧
Start by reading the whole question and identifying inputs, processes and outputs. Write a quick decomposition before coding so your final answer is structured and logical.
先阅读整道题，确定输入、处理和输出。在编码前快速进行分解，使最终答案结构清晰、逻辑合理。
When writing pseudocode, use Edexcel-style keywords and indentation clearly. If you write Python, keep variable names meaningful and add comments where helpful.
编写伪代码时，使用Edexcel风格的关键字并清晰地缩进。如果你用Python编写，请使用有意义的变量名，并在有帮助的地方添加注释。
Always test your algorithm mentally with the sample data given. If the output does not match, trace the loop counters and condition checks before changing the logic.
始终用题目给出的示例数据在头脑中测试算法。如果输出不匹配，在修改逻辑之前追踪循环计数器和条件判断。
Manage your time: spend roughly one minute per mark, and leave a few minutes at the end to check trace tables, data types and boundary cases.
合理分配时间：大约一分钟一分，并在最后留出几分钟检查追踪表、数据类型和边界情况。
12. Summary and Revision Checklist | 总结与复习清单
Before the exam, make sure you can define each data type, write selection with IF and CASE, write count-controlled and condition-controlled loops, and explain parameters by value and by reference.
考试前，确保你能定义每种数据类型，使用IF和CASE编写选择结构，编写计数控制和条件控制循环，并解释按值传递和按引用传递的参数。
You should also be able to trace linear search, binary search, bubble sort and merge sort, use trace tables confidently, and write recursive solutions with a base case.
你还应该能够追踪线性搜索、二分搜索、冒泡排序和归并排序，熟练使用追踪表，并编写具有基准情形的递归解决方案。
Use this checklist every time you finish a past paper: Did I choose the correct data type? Are my loop conditions correct? Does my subroutine return the right type? Have I tested boundary values?
每次做完一套真题后，使用这份清单：我是否选择了正确的数据类型？循环条件是否正确？子程序是否返回了正确的类型？我是否测试了边界值？
Consistent practice with Edexcel-style pseudocode questions will build the speed and accuracy you need for the real on-screen exam.
坚持练习Edexcel风格的伪代码题，将帮助你积累真实机考所需的速度和准确性。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply