📚 A-Level Edexcel Programming: Core Concepts and Constructs | A-Level Edexcel 编程：核心概念与结构
This revision guide covers the essential programming techniques required for the Edexcel A-Level Computer Science specification. It explains core constructs, data structures, algorithms and programming paradigms in a clear, exam-focused way. You should use these concepts to analyse pseudocode, trace algorithms and write structured solutions under timed conditions.
本复习指南涵盖 Edexcel A-Level 计算机科学考试大纲所要求的基本编程技术。它以清晰、紧扣考点的方式解释核心结构、数据结构、算法和编程范式。你应该使用这些概念来分析伪代码、追踪算法并在限时条件下写出结构化答案。
1. Programming Fundamentals and Variables | 编程基础与变量
In Edexcel A-Level Computer Science, programming is assessed through pseudocode questions and practical coding tasks. A variable is a named storage location whose value can change while a program runs. You must declare variables clearly and use meaningful identifiers such as totalMarks or isComplete. Constants are similar to variables, but their values cannot change after they are assigned.
在 Edexcel A-Level 计算机科学中，编程通过伪代码问题和实践编码任务进行考查。变量是一个有名称的存储位置，其值在程序运行期间可以改变。你必须清晰声明变量并使用有意义的标识符，如 totalMarks 或 isComplete。常量与变量类似，但其值在赋值后不能改变。
Assignment is written with an arrow or equals sign. The expression on the right is evaluated first, and the result is stored in the variable on the left. For example, the statement below increases a counter by one:
赋值使用箭头或等号书写。右侧的表达式先被求值，结果存储到左侧的变量中。例如，下面的语句将计数器增加一：
total ← total + 1
When tracing code, track every variable change in a trace table. This helps you identify how values flow through loops and conditionals, which is a common Edexcel exam skill.
追踪代码时，在追踪表中记录每一个变量变化。这有助于你识别值如何在循环和条件语句中流动，这是 Edexcel 考试中常见的技能。
2. Data Types and Type Conversion | 数据类型与类型转换
Edexcel programming questions require you to recognise and choose appropriate data types. The main primitive types are integer, real, Boolean, character and string. Selecting the correct type affects memory use, validation and the operations that can be performed on a value.
Edexcel 编程题要求你识别并选择合适的数据类型。主要的原始类型有整数、实数、布尔、字符和字符串。选择正确的类型会影响内存使用、验证以及可对值执行的操作。
| Data type | Meaning | Example |
|---|---|---|
| Integer | Whole number | 42 |
| Real | Number with fractional part | 3.14 |
| Boolean | True or false only | TRUE |
| Character | Single symbol | ‘A’ |
| String | Sequence of characters | “A-Level” |
Type conversion changes a value from one type to another. For example, converting the string ’42’ to the integer 42 is necessary before arithmetic. In pseudocode, functions like INT(), REAL(), STR() and BOOL() are often used explicitly to avoid type errors.
类型转换将一个值从一种类型转换为另一种类型。例如，在进行算术运算前，需要先将字符串 ’42’ 转换为整数 42。在伪代码中，通常显式使用 INT()、REAL()、STR() 和 BOOL() 等函数以避免类型错误。
3. Operators and Expressions | 运算符与表达式
Expressions combine operands and operators to produce new values. Arithmetic operators include addition, subtraction, multiplication, division, integer division and modulus. Integer division and modulus are particularly useful for problems involving remainders, digits or repeated cycles.
表达式将操作数和运算符组合起来产生新值。算术运算符包括加法、减法、乘法、除法、整数除法和取模。整数除法和取模对于涉及余数、数字位或重复周期的问题特别有用。
17 DIV 5 = 3 17 MOD 5 = 2
Comparison operators such as =, ≠, <, >, ≤ and ≥ return Boolean values. Logical operators AND, OR and NOT are used to combine conditions in selection statements. Operator precedence follows standard rules: brackets first, then arithmetic, then comparisons, then logical operations.
比较运算符（如 =、≠、<、>、≤ 和 ≥）返回布尔值。逻辑运算符 AND、OR 和 NOT 用于在选择语句中组合条件。运算符优先级遵循标准规则：先括号，然后算术运算，再比较，最后是逻辑运算。
For example, the condition score ≥ 60 AND score < 80 is true only when both comparisons are true. Understanding precedence prevents errors such as testing age > 18 OR age < 30 AND isStudent without brackets.
例如，条件 score ≥ 60 AND score < 80 只有在两个比较都为真时才为真。理解优先级可以防止错误，例如在没有括号时测试 age > 18 OR age < 30 AND isStudent。
4. Selection and Iteration | 选择与迭代
Selection allows a program to choose between different paths. The most common construct is the IF statement, which can include ELSE and ELSE IF branches. A CASE or SWITCH statement is clearer when one variable is tested against several specific values.
选择允许程序在不同的路径之间进行选择。最常见的结构是 IF 语句，它可以包含 ELSE 和 ELSE IF 分支。当一个变量要针对多个特定值进行测试时，CASE 或 SWITCH 语句更清晰。
IF score ≥ 80 THEN grade ← ‘A’ ELSE IF score ≥ 60 THEN grade ← ‘B’ ELSE grade ← ‘C’
Iteration repeats a block of code. Count-controlled loops, such as FOR, run a known number of times. Condition-controlled loops, such as WHILE or REPEAT UNTIL, repeat while or until a condition is met. Edexcel trace-table questions often require you to update variables for each pass through a loop.
迭代重复执行一段代码。计数控制循环（如 FOR）运行已知次数。条件控制循环（如 WHILE 或 REPEAT UNTIL）在满足条件时重复执行。Edexcel 追踪表题通常要求你对循环的每一次执行都更新变量。
Always identify the loop type, the exit condition and the body being repeated. A common mistake is confusing a WHILE loop that may run zero times with a REPEAT UNTIL loop that always runs at least once.
始终要识别循环类型、退出条件和被重复执行的主体。一个常见错误是混淆了 WHILE 循环（可能执行零次）和 REPEAT UNTIL 循环（至少执行一次）。
5. Arrays and Lists | 数组与列表
An array is a static data structure that stores multiple values of the same type under one identifier. Each element is accessed by an index, usually starting at 0 or 1 depending on the pseudocode convention. Edexcel pseudocode often uses square brackets, for example scores[0] or scores[1].
数组是一种静态数据结构，它在一个标识符下存储多个相同类型的值。每个元素通过索引访问，索引通常根据伪代码约定从 0 或 1 开始。Edexcel 伪代码通常使用方括号，例如 scores[0] 或 scores[1]。
A one-dimensional array is a simple list. A two-dimensional array is a table with rows and columns. You must be able to iterate through arrays, update elements and check indices against lower and upper bounds to avoid out-of-bounds errors.
一维数组是一个简单列表。二维数组是一个具有行和列的表。你必须能够遍历数组、更新元素并检查索引是否在下界和上界之间，以避免越界错误。
Lists are dynamic data structures that can grow or shrink. Unlike fixed-size arrays, lists support operations such as append, insert, remove and length. Edexcel questions may compare the advantages of arrays and lists in terms of memory allocation and flexibility.
列表是可以增长或收缩的动态数据结构。与固定大小的数组不同，列表支持追加、插入、删除和求长度等操作。Edexcel 题目可能会比较数组和列表在内存分配和灵活性方面的优缺点。
6. Functions, Procedures and Parameters | 函数、过程与参数
A function is a named block of code that returns a single value. A procedure performs a task but does not return a value. Modular programs are easier to test, debug and reuse. Edexcel requires you to understand how parameters pass data into these subroutines.
函数是一个有名称的代码块，它返回一个单一的值。过程执行一个任务但不返回值。模块化程序更易于测试、调试和复用。Edexcel 要求你理解参数如何将数据传入这些子程序。
Parameters can be passed by value or by reference. Passing by value copies the data, so changes inside the subroutine do not affect the original variable. Passing by reference shares the memory location, so changes inside the subroutine do affect the original variable.
参数可以按值传递或按引用传递。按值传递会复制数据，因此子程序内部的更改不会影响原始变量。按引用传递共享内存位置，因此子程序内部的更改会影响原始变量。
A function that calculates the area of a circle might be written as follows. The parameter radius is passed by value, and the function returns a real number.
一个计算圆面积的函数可以写成如下形式。参数 radius 按值传递，函数返回一个实数。
FUNCTION circleArea(radius) RETURN π × radius²
When answering exam questions, state clearly whether a subroutine is a function or a procedure. Also explain the difference between parameters and arguments: parameters are declared in the subroutine header, while arguments are the actual values passed in the call.
回答考试题时，要明确说明子程序是函数还是过程。还要解释参数和实参之间的区别：参数在子程序头中声明，而实参是调用时传入的实际值。
7. Recursion | 递归
Recursion is a technique in which 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 and a recursive case that reduces the problem. Without a base case, the recursion continues until a stack overflow occurs.
递归是一种技术，其中子程序调用自身来解决同一问题的较小版本。每个递归算法必须有一个用于停止递归的基本情况，以及一个减小问题规模的递归情况。如果没有基本情况，递归会一直持续直到发生栈溢出。
Factorial is a classic example. The factorial of n is defined as n multiplied by the factorial of n minus one, with the base case 0! = 1.
阶乘是一个经典例子。n 的阶乘定义为 n 乘以 n 减 1 的阶乘，基本情况为 0! = 1。
factorial(n) = n × factorial(n – 1) factorial(0) = 1
Recursion can produce elegant solutions for tree traversal, binary search and certain mathematical problems. However, it is often less memory-efficient than iteration because each recursive call uses stack space. Edexcel questions may ask you to trace recursive calls and show the call stack.
递归可以为树遍历、二分搜索和某些数学问题提供简洁的解决方案。然而，它的内存效率通常低于迭代，因为每次递归调用都会使用栈空间。Edexcel 题目可能会要求你追踪递归调用并展示调用栈。
8. Abstract Data Types and Dictionaries | 抽象数据类型与字典
Abstract data types describe how data can be organised and accessed without specifying implementation details. A stack is a last-in-first-out structure with PUSH and POP operations. A queue is a first-in-first-out structure with ENQUEUE and DEQUEUE operations.
抽象数据类型描述了如何组织并访问数据，而不指定实现细节。栈是一种后进先出结构，具有 PUSH 和 POP 操作。队列是一种先进先出结构，具有 ENQUEUE 和 DEQUEUE 操作。
Stacks are used for undo features, expression evaluation and call stacks in recursion. Queues are used for print spooling, keyboard buffers and breadth-first traversal. You should be able to describe what happens when a stack or queue is empty or full, as these are common edge cases.
栈用于撤销功能、表达式求值和递归中的调用栈。队列用于打印假脱机、键盘缓冲区和广度优先遍历。你应该能够描述当栈或队列为空或已满时会发生什么，因为这些是常见的边界情况。
A dictionary, also called a hash map or associative array, stores key-value pairs. Each key is unique and is used to retrieve its linked value. Dictionaries support efficient lookup, insertion and deletion, and they are useful for problems involving frequency counting or mapping identifiers to records.
字典（也称为哈希映射或关联数组）存储键值对。每个键都是唯一的，并用于检索其关联的值。字典支持高效的查找、插入和删除，对于涉及频率计数或将标识符映射到记录的问题非常有用。
9. Searching and Sorting Algorithms | 搜索与排序算法
Linear search checks each element in turn until the target is found or the end of the list is reached. It works on unsorted data and has average time complexity O(n). Binary search repeatedly divides a sorted list in half, giving O(log n) time complexity, but it requires the list to be sorted first.
线性查找依次检查每个元素，直到找到目标或到达列表末尾。它适用于未排序数据，平均时间复杂度为 O(n)。二分查找不断将有序列表一分为二，时间复杂度为 O(log n)，但它要求列表首先是有序的。
Bubble sort compares adjacent items and swaps them if they are in the wrong order. It is simple but inefficient, with worst-case complexity O(n²). Insertion sort builds a sorted portion by inserting each new element into its correct position, also O(n²) in the worst case.
冒泡排序比较相邻项，并在顺序错误时交换它们。它简单但效率低，最坏时间复杂度为 O(n²)。插入排序通过将每个新元素插入到正确位置来构建有序部分，最坏情况下也是 O(n²)。
Merge sort is a divide-and-conquer algorithm that splits the list, sorts each half recursively and then merges the halves. It has O(n log n) time complexity in all cases, which is more efficient than bubble or insertion sort for large lists. Edexcel exams often ask you to complete passes of a sort or compare algorithm efficiency.
归并排序是一种分治算法，它将列表拆分，递归地排序每一半，然后合并这些半部分。它在所有情况下都具有 O(n log n) 时间复杂度，对于大型列表比冒泡排序或插入排序更高效。Edexcel 考试常要求你完成排序过程或比较算法效率。
10. Object-Oriented Programming | 面向对象编程
Object-oriented programming organises code around objects rather than functions. A class is a blueprint that defines attributes and methods. An object is an instance of a class. For example, a Car class may have attributes such as colour and registration, and methods such as accelerate and brake.
面向对象编程围绕对象而不是函数来组织代码。类是一个定义属性和方法的蓝图。对象是类的实例。例如，Car 类可以具有 colour 和 registration 等属性，以及 accelerate 和 brake 等方法。
Encapsulation hides internal state and only exposes necessary methods. This protects data from accidental modification. Inheritance allows a subclass to inherit attributes and methods from a superclass, enabling code reuse and hierarchical relationships such as ElectricCar inheriting from Car.
封装隐藏内部状态，只公开必要的方法。这保护数据免受意外修改。继承允许子类从超类继承属性和方法，实现代码复用和层次关系，例如 ElectricCar 继承自 Car。
Polymorphism means that different object types can respond to the same method name in different ways. For instance, both Dog and Cat classes might implement a makeSound method, but Dog returns ‘Bark’ while Cat returns ‘Meow’. This supports flexible and maintainable code design.
多态意味着不同的对象类型可以对同一个方法名以不同的方式作出响应。例如，Dog 和 Cat 类都可能实现 makeSound 方法，但 Dog 返回 ‘Bark’，而 Cat 返回 ‘Meow’。这支持灵活且可维护的代码设计。
11. Exception Handling and Debugging | 异常处理与调试
Exceptions are runtime errors that disrupt normal program flow, such as dividing by zero or accessing an invalid array index. Robust programs use exception handling to catch these conditions and respond gracefully instead of crashing. This may involve displaying a message, logging an error or asking for valid input.
异常是扰乱正常程序流程的运行时错误，例如除以零或访问无效的数组索引。健壮的程序使用异常处理来捕获这些情况并优雅地响应，而不是崩溃。这可能涉及显示消息、记录错误或要求有效输入。
Debugging is the process of finding and correcting errors. Syntax errors occur when code breaks language rules and are usually detected at translation time. Runtime errors occur during execution. Logic errors do not stop the program, but they produce incorrect results because the algorithm is flawed.
调试是发现并纠正错误的过程。语法错误在代码违反语言规则时发生，通常在翻译时被检测出来。运行时错误在执行期间发生。逻辑错误不会停止程序，但由于算法有缺陷而会产生错误结果。
Common debugging tools include trace tables, breakpoints, stepping and watch variables. Edexcel questions may present a faulty program and ask you to identify the error type, explain why it occurs, and suggest a correction. Always test boundary values such as empty lists, zero and maximum input sizes.
常见的调试工具包括追踪表、断点、单步执行和监视变量。Edexcel 题目可能会给出一个有错误的程序，要求你识别错误类型、解释错误原因并提出更正建议。始终测试边界值，如空列表、零和最大输入大小。
12. File Handling and Modular Design | 文件处理与模块化设计
Programs often need to read data from files and write output back to files. Edexcel pseudocode typically includes OPEN, READ, WRITE and CLOSE commands. When reading a text file line by line, a loop checks for end-of-file to prevent reading beyond the available data.
程序通常需要从文件读取数据并将输出写回文件。Edexcel 伪代码通常包括 OPEN、READ、WRITE 和 CLOSE 命令。逐行读取文本文件时，循环会检查文件结束标志，以防止读取超出可用数据。
File handling is useful for persistent storage, batch processing and maintaining records between program runs. You should be able to describe the difference between text files and binary files, and explain why files must be closed after use to release system resources.
文件处理对于持久存储、批处理以及程序运行之间维护记录非常有用。你应该能够描述文本文件和二进制文件之间的区别，并解释为什么文件在使用后必须关闭以释放系统资源。
Modular design breaks a large program into smaller, self-contained subroutines or modules. This makes code easier to understand, test and maintain. Libraries of reusable functions reduce duplication and support collaborative development. Edexcel exams reward clear explanations of how modularity improves readability and reliability.
模块化设计将大型程序分解为更小、自包含的子程序或模块。这使代码更易于理解、测试和维护。可复用函数库减少了重复代码并支持协作开发。Edexcel 考试奖励那些清晰解释模块化如何提高可读性和可靠性的答案。
Published by TutorHao | Programming Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导