Mastering Edexcel A-Level Programming: Core Constructs, Algorithms and Exam Technique | 精通 Edexcel A-Level 编程：核心结构、算法与应试技巧

📚 Mastering Edexcel A-Level Programming: Core Constructs, Algorithms and Exam Technique | 精通 Edexcel A-Level 编程：核心结构、算法与应试技巧

In Edexcel A-Level Computer Science, programming is assessed both through written pseudocode and through practical project work. A strong grasp of core constructs, data structures and common algorithms is essential for Paper 1 and the non-exam assessment. This revision guide breaks down the high-yield topics with paired English-Chinese notes.

在 Edexcel A-Level 计算机科学中，编程既通过书面伪代码考核，也通过实践项目评估。扎实掌握核心结构、数据结构和常见算法对 Paper 1 和课程作业至关重要。本复习指南以中英对照笔记拆解高频考点。

---

1. Understanding the Edexcel Programming Paper | 了解 Edexcel 编程试卷

Edexcel A-Level Computer Science Paper 1 (9CN0/01) uses an ‘Edexcel Pseudocode’ style, so you must trace code, correct errors and complete algorithms. Questions often ask you to dry-run loops, arrays and subroutines, so reading code is as important as writing it.

Edexcel A-Level 计算机科学 Paper 1（9CN0/01）使用 ‘Edexcel 伪代码’ 风格，因此你必须能跟踪代码、纠正错误并补全算法。题目经常要求手工执行循环、数组和子程序，因此读代码与写代码同样重要。

Key topics include data types, program flow, functions, file handling, recursion and SQL. The practical programming project is marked against coding style, robustness and problem decomposition.

关键主题包括数据类型、程序流程、函数、文件处理、递归和 SQL。实践编程项目的评分依据包括代码风格、健壮性和问题分解。

---

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

Use integer, real, Boolean, character and string types precisely. Python is dynamically typed but Edexcel pseudocode expects you to declare variables and choose suitable types, e.g. DECLARE age AS INTEGER.

准确使用整数、实数、布尔值、字符和字符串类型。Python 是动态类型，但 Edexcel 伪代码要求你声明变量并选择合适类型，例如 DECLARE age AS INTEGER。

Type conversions such as INT(), STR() and FLOAT() appear frequently; forgetting to convert input before arithmetic is a common error. Always initialise variables to avoid undefined-value errors in trace tables.

类型转换如 INT()、STR() 和 FLOAT() 经常出现；在算术运算前忘记转换输入是一个常见错误。始终初始化变量，以避免跟踪表中出现未定义值的错误。

---

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

The three basic constructs are sequence, selection (IF…ELSE, CASE) and iteration (FOR, WHILE, REPEAT…UNTIL). You must know when a WHILE loop can execute zero times and when a REPEAT loop always runs at least once.

三种基本结构是顺序、选择（IF…ELSE、CASE）和迭代（FOR、WHILE、REPEAT…UNTIL）。你必须知道 WHILE 循环何时可能执行零次，以及 REPEAT 循环何时至少执行一次。

Nested IF statements and loops are high-risk in trace-table questions, so indent clearly and check boundary conditions such as < versus <=. A single off-by-one error can make an algorithm fail hidden test data.

嵌套 IF 语句和循环在跟踪表问题中风险很高，所以要清晰缩进并检查边界条件，例如 < 与 <= 的区别。一个差一错误就可能让算法在隐藏测试数据中失败。

---

4. Subroutines and Parameter Passing | 子程序与参数传递

Procedures and functions break code into reusable blocks. A function returns a value; a procedure does not. Parameters may be passed by value or by reference, which affects whether changes persist outside the subroutine.

过程和函数将代码分解为可重用块。函数返回值，过程不返回值。参数可以按值或按引用传递，这会影响更改是否在子程序外持续存在。

Be able to write a function header such as FUNCTION calcArea(radius AS REAL) RETURNS REAL and trace local versus global variables. Local variables are destroyed when the subroutine ends, while global variables retain their values.

能够编写函数头，例如 FUNCTION calcArea(radius AS REAL) RETURNS REAL，并跟踪局部变量与全局变量。局部变量在子程序结束时销毁，而全局变量保留其值。

---

5. Recursion and Stack Frames | 递归与栈帧

Recursion means a subroutine calls itself. It needs a base case to stop and a recursive case that reduces the problem, such as factorial or Fibonacci. Each call creates a stack frame holding parameters and return address.

递归意味着子程序调用自身。它需要一个停止的基准情况和一个缩小问题的递归情况，例如阶乘或斐波那契。每次调用创建一个栈帧，保存参数和返回地址。

Stack overflow occurs if the base case is missing or never reached. You may be asked to trace recursive calls and show how values are returned back up the stack, so keep a separate column for the call stack in your trace table.

如果缺少基准情况或永远无法达到基准情况，就会发生栈溢出。你可能会被要求跟踪递归调用并展示值如何沿栈返回，因此在跟踪表中为调用栈单独留一列。

---

6. Arrays, Lists and 2D Structures | 数组、列表与二维结构

Arrays store multiple items under one identifier using indices. Edexcel pseudocode often uses square brackets: names[0] to names[4] for a five-element array. 2D arrays are useful for grids, tables and game boards, accessed as grid[row, column].

数组使用一个标识符和索引存储多个项目。Edexcel 伪代码通常使用方括号：names[0] 到 names[4] 表示五元素数组。二维数组适用于网格、表格和棋盘，访问方式为 grid[row, column]。

Know how to initialise arrays, find length, iterate through elements and avoid off-by-one errors when using 0-based indexing. Many exam questions ask you to complete an algorithm that searches, counts or totals values inside an array.

知道如何初始化数组、求长度、遍历元素，并在使用从 0 开始的索引时避免差一错误。许多考题要求你补全在数组中查找、计数或求和的算法。

---

7. String Handling and File I/O | 字符串处理与文件读写

String operations include concatenation, substring extraction, length, character access and case conversion. Edexcel questions may ask you to extract initials, count vowels or reverse a string using pseudocode.

字符串操作包括连接、提取子串、求长度、字符访问和大小写转换。Edexcel 题目可能要求你使用伪代码提取首字母、统计元音或反转字符串。

File handling requires OPEN, READ, WRITE and CLOSE. You should be able to process a text file line by line, testing for EOF and handling invalid data safely. Use a loop with WHILE NOT EOF to read until the end of the file.

文件处理需要 OPEN、READ、WRITE 和 CLOSE。你应该能逐行处理文本文件，测试 EOF 并安全处理无效数据。使用 WHILE NOT EOF 循环读取直到文件末尾。

---

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

Linear search has O(n) time; binary search needs a sorted list and has O(log n). You must be able to write both and explain why binary search is faster for large data sets.

线性查找的时间复杂度为 O(n)；二分查找需要有序列表，时间复杂度为 O(log n)。你必须能编写这两种算法，并解释为什么二分查找对大数据集更快。

Bubble sort, insertion sort and merge sort are common. Bubble sort compares adjacent items and swaps them; merge sort uses divide and conquer. Be ready to compare their efficiency and stability.

冒泡排序、插入排序和归并排序是常见算法。冒泡排序比较相邻项并交换；归并排序使用分治法。准备好比较它们的效率和稳定性。

Algorithm | 算法	Best | 最好	Worst | 最坏	Stable? | 稳定?
Bubble Sort | 冒泡排序	O(n)	O(n²)	Yes | 是
Insertion Sort | 插入排序	O(n)	O(n²)	Yes | 是
Merge Sort | 归并排序	O(n log n)	O(n log n)	Yes | 是

---

9. Trace Tables and Dry Runs | 跟踪表与手工执行

A trace table records variable values, conditions and outputs as each line executes. Always add columns for key variables, loop counters and Boolean tests, then update row by row.

跟踪表记录每行执行时的变量值、条件和输出。始终为关键变量、循环计数器和布尔测试添加列，然后逐行更新。

When a question says ‘complete the trace table’, show values after each iteration, including values that do not change, and mark final output

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

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