📚 Edexcel A-Level Programming: Core Techniques, Data Structures and Algorithms | 爱德思 A-Level 编程：核心技巧、数据结构与算法
Programming is at the centre of Edexcel A-Level Computer Science. A strong grasp of control structures, data structures and algorithms is essential for both the written examination and the practical programming project.
编程是爱德思 A-Level 计算机科学的核心。扎实掌握程序控制结构、数据结构和算法，对笔试和编程项目都至关重要。
1. Sequence, Selection and Iteration | 顺序、选择与迭代
Every imperative program can be built from three fundamental control structures: sequence, selection and iteration. These are the building blocks of pseudocode and real programming languages.
每个命令式程序都可以由三种基本控制结构组成：顺序、选择和迭代。它们是伪代码和真实编程语言的构建模块。
Sequence means statements are executed one after another in the order they are written. This is the default behaviour in most languages.
顺序意味着语句按照编写顺序逐条执行。这是大多数语言中的默认行为。
Selection allows a program to choose different paths based on a condition. Common forms include IF…THEN…ELSE and CASE or SWITCH statements.
选择允许程序根据条件选择不同的执行路径。常见形式包括 IF…THEN…ELSE 以及 CASE 或 SWITCH 语句。
Iteration repeats a block of code. Edexcel candidates should be able to use count-controlled loops and condition-controlled loops accurately.
迭代会重复执行一段代码。爱德思考生应能准确使用计数控制循环和条件控制循环。
- FOR loops are count-controlled. | FOR 循环属于计数控制。
- WHILE loops test the condition before each iteration. | WHILE 循环在每次迭代之前测试条件。
- REPEAT…UNTIL loops test the condition after at least one iteration. | REPEAT…UNTIL 循环至少执行一次后再测试条件。
Nested constructs are frequently examined. For example, a WHILE loop may contain an IF statement, and an IF statement may contain a FOR loop.
嵌套结构在考试中经常出现。例如，WHILE 循环内部可以包含 IF 语句，IF 语句内部也可以包含 FOR 循环。
2. Data Types and Variables | 数据类型与变量
Understanding data types helps candidates write correct expressions and avoid errors. The main primitive types are integer, real or float, Boolean, character and string.
理解数据类型有助于考生写出正确的表达式并避免错误。主要的基本类型包括整型、实型或浮点型、布尔型、字符型和字符串型。
| Data Type | Typical Value | Use |
|---|---|---|
| Integer | 42 | Whole numbers |
| Real/Float | 3.14 | Decimal numbers |
| Boolean | TRUE or FALSE | Logical decisions |
| Character | ‘A’ | Single symbol |
| String | “Hello” | Text |
Variables must be declared with a meaningful identifier. Constants are fixed values that cannot change during execution.
变量必须使用有意义的标识符进行声明。常量是在程序执行期间不能更改的固定值。
Type casting converts a value from one data type to another, such as changing an integer to a real number before division.
类型转换会将值从一种数据类型转换为另一种数据类型，例如在除法之前将整数转换为实数。
Scope describes where a variable can be accessed. Local variables exist only inside a subroutine, while global variables are visible throughout the program.
作用域描述变量可以在哪里被访问。局部变量仅存在于子程序内部，而全局变量在整个程序中都可以访问。
3. Functions, Procedures and Parameter Passing | 函数、过程与参数传递
Subroutines break a large problem into manageable parts. A procedure performs a task but does not return a value; a function performs a task and returns a value.
子程序将大问题分解为易于管理的部分。过程执行任务但不返回值；函数执行任务并返回一个值。
Parameters allow values to be passed into subroutines. Edexcel distinguishes between passing by value and passing by reference.
参数允许将值传递给子程序。爱德思考试区分按值传递和按引用传递。
When a parameter is passed by value, the subroutine works with a copy. Changes inside the subroutine do not affect the original argument.
当参数按值传递时，子程序使用参数的副本。子程序内部的更改不会影响原始参数。
When a parameter is passed by reference, the subroutine receives the memory address of the original argument. Changes inside the subroutine do affect the original variable.
当参数按引用传递时，子程序接收原始参数的内存地址。子程序内部的更改会影响原始变量。
Parameters can be used to produce modular, reusable code. This is important in the practical programming project, where maintainability is assessed.
参数可用于生成模块化、可复用的代码。这在编程项目中非常重要，因为可维护性是评分标准之一。
A subroutine signature includes its name, parameter list and return type. Clear signatures make code easier to read and test.
子程序签名包括其名称、参数列表和返回类型。清晰的签名使代码更易于阅读和测试。
4. Arrays, Records and Files | 数组、记录与文件
Arrays store multiple items of the same data type under one identifier. A one-dimensional array is useful for lists; a two-dimensional array can represent tables or grids.
数组可以在一个标识符下存储多个相同数据类型的元素。一维数组适用于列表；二维数组可以表示表格或网格。
Array indexing must be handled carefully. In many languages indexing starts at 0, but pseudocode and some languages may start at 1, so candidates should follow the given convention.
数组索引必须小心处理。在许多语言中索引从 0 开始，但伪代码和某些语言可能从 1 开始，因此考生应遵循题目给定的约定。
Records are user-defined data structures that can store values of different data types in named fields. A record can represent a student, a product or a card.
记录是用户自定义的数据结构，可以在命名字段中存储不同数据类型的值。一条记录可以表示学生、产品或卡片。
Files allow programs to store data permanently. Sequential files must be read in order, while random-access files allow direct access to any record.
文件允许程序永久存储数据。顺序文件必须按顺序读取，而随机访问文件允许直接访问任意记录。
When processing files, candidates should be able to open, read, write and close them. Error handling should also be considered, such as checking for the end of a file.
在处理文件时，考生应能够打开、读取、写入和关闭文件。还应考虑错误处理，例如检查文件是否到达末尾。
5. Object-Oriented Programming Basics | 面向对象编程基础
Object-oriented programming, or OOP, models real-world entities as objects. A class is a blueprint, and an object is an instance of a class.
面向对象编程（OOP）将现实世界的实体建模为对象。类是蓝图，对象是类的实例。
Attributes store the state of an object, while methods define the behaviours that operate on that state. A constructor initialises a new object.
属性存储对象的状态，而方法定义操作该状态的行为。构造函数用于初始化新对象。
Encapsulation hides internal data and restricts access to certain attributes. This protects the object from being changed in unexpected ways.
封装隐藏内部数据并限制对某些属性的访问。这可以防止对象以意外方式被更改。
Inheritance allows one class to extend another. A child class inherits attributes and methods from a parent class and can add or override behaviour.
继承允许一个类扩展另一个类。子类继承父类的属性和方法，并可以添加或覆盖行为。
Polymorphism means that the same method name can behave differently depending on the object that calls it. This supports flexible and maintainable design.
多态性意味着同一个方法名称根据调用它的对象不同而表现不同。这支持灵活且可维护的设计。
Although Edexcel does not require advanced OOP syntax, candidates should recognise class diagrams, object instantiation and the use of attributes and methods in pseudocode.
虽然爱德思不要求高级 OOP 语法，但考生应认识类图、对象实例化以及在伪代码中属性和方法的使用。
6. Recursion and Stack Frames | 递归与栈帧
Recursion is a technique in which a subroutine calls itself to solve a smaller version of the same problem. Every recursive algorithm needs a base case to stop.
递归是一种子程序调用自身来解决同一问题的较小版本的技术。每个递归算法都需要一个基本情况来停止。
A base case is the simplest condition that can be solved without further recursive calls. Without it, recursion would continue indefinitely and cause a stack overflow.
基本情况是可以直接求解而无需进一步递归调用的最简单条件。如果没有它，递归会无限继续并导致栈溢出。
The recursive case reduces the problem towards the base case. Factorial is a standard example.
递归情况将问题缩小并靠近基本情况。阶乘是一个标准示例。
n! = n × (n – 1)! , 0! = 1
Each recursive call creates a new stack frame on the call stack. The stack frame stores the return address, parameters and local variables.
每次递归调用都会在调用栈上创建一个新的栈帧。栈帧存储返回地址、参数和局部变量。
Recursion can be elegant but may use more memory than iteration. Candidates should be able to trace a simple recursive function and identify when recursion is appropriate.
递归可能很优雅，但比迭代使用更多内存。考生应能够跟踪简单的递归函数，并判断何时适合使用递归。
7. Searching Algorithms | 查找算法
Searching algorithms find whether a target value exists in a collection. Linear search and binary search are the two main methods examined in Edexcel A-Level.
查找算法用于判断目标值是否存在于集合中。线性查找和二分查找是爱德思 A-Level 考查的两种主要方法。
Linear search checks each element in order from the beginning until the target is found or the list ends. It works on unsorted lists.
线性查找从开头依次检查每个元素，直到找到目标或列表结束。它适用于未排序的列表。
Linear search complexity: O(n)
Binary search is more efficient but requires a sorted list. It repeatedly divides the search interval in half.
二分查找效率更高，但要求列表已排序。它反复将查找区间分成两半。
Binary search complexity: O(log n)
To perform binary search, compare the target with the middle element. If the target is smaller, search the left half; if larger, search the right half.
执行二分查找时，将目标与中间元素比较。如果目标较小，则查找左半部分；如果较大，则查找右半部分。
In the practical project, choosing the correct search algorithm can improve performance. This is especially important when handling large datasets.
在实践项目中，选择正确的查找算法可以提高性能。这在处理大型数据集时尤为重要。
8. Sorting Algorithms | 排序算法
Sorting algorithms rearrange data into a specified order, typically ascending or descending. Bubble sort, insertion sort and merge sort are frequently assessed.
排序算法将数据重新排列为指定顺序，通常是升序或降序。冒泡排序、插入排序和归并排序是经常考查的内容。
Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. Larger values move to the end like bubbles.
冒泡排序反复比较相邻元素，如果顺序错误则交换。较大的值像气泡一样移动到末尾。
Bubble sort best case: O(n), average and worst case: O(n²)
Insertion sort builds a sorted portion one element at a time. It takes the next item and inserts it into its correct position among the already sorted items.
插入排序一次一个元素地构建已排序部分。它取出下一个项目，并将其插入到已排序项目中的正确位置。
Insertion sort average and worst case: O(n²)
Merge sort uses divide and conquer. It splits the list into halves, sorts each half recursively, then merges the two sorted halves.
归并排序使用分治策略。它将列表分成两半，递归地对每一半排序，然后合并两个已排序的半部分。
Merge sort complexity: O(n log n)
Comparison table:
| Algorithm | Best Case | Average Case | Space |
|---|---|---|---|
| Bubble sort | O(n) | O(n²) | O(1) |
| Insertion sort | O(n) | O(n²) | O(1) |
| Merge sort | O(n log n) | O(n log n) | O(n) |
Sorting algorithms may be examined through trace tables. Candidates should be confident applying each algorithm step by step on a small list.
排序算法可能通过跟踪表进行考查。考生应能自信地在小型列表上逐步应用每种算法。
9. String Manipulation and File Processing | 字符串操作与文件处理
String manipulation is a common programming task. Typical operations include finding length, extracting substrings, concatenation and converting case.
字符串操作是一项常见的编程任务。典型操作包括求长度、提取子串、连接以及转换大小写。
Character codes such as ASCII and Unicode are examined. Candidates should understand that characters have numerical codes and can be compared or converted.
ASCII 和 Unicode 等字符编码也在考试范围内。考生应理解字符具有数字编码，并且可以进行比较或转换。
A common algorithm is checking whether a string is a palindrome. This can be solved by comparing characters from both ends moving towards the middle.
一个常见算法是检查字符串是否为回文。这可以通过从两端向中间比较字符来解决。
Another common task is counting character frequency. An array or dictionary can store the count of each character.
另一个常见任务是统计字符频率。可以使用数组或字典来存储每个字符的出现次数。
File processing often uses loops to read one line at a time. Candidates should know how to handle end-of-file conditions and how to parse data into variables.
文件处理通常使用循环一次读取一行。考生应了解如何处理文件结束条件以及如何将数据解析到变量中。
Exception handling prevents crashes from invalid input or missing files. A well-designed program checks for errors and displays useful messages.
异常处理可以防止因无效输入或文件缺失而导致崩溃。设计良好的程序会检查错误并显示有用的提示信息。
10. Testing, Debugging and Computational Thinking | 测试、调试与计算思维
Testing is essential to ensure a program meets its specification. Edexcel expects candidates to design normal, boundary and erroneous test data.
测试对于确保程序符合规格说明至关重要。爱德思要求考生设计正常、边界和错误测试数据。
Normal test data checks typical inputs. Boundary test data checks the edges of valid ranges, such as the minimum and maximum accepted values.
正常测试数据检查典型输入。边界测试数据检查有效范围的边缘，例如可接受的最小值和最大值。
Erroneous or invalid test data checks how the program handles inputs that should be rejected. Good error messages and validation are important.
错误或无效测试数据检查程序如何处理应被拒绝的输入。良好的错误提示和输入验证非常重要。
Debugging is the process of finding and fixing errors. Techniques include dry runs, trace tables, breakpoints and printing intermediate values.
调试是查找并修复错误的过程。技术包括干运行、跟踪表、断点以及输出中间值。
A dry run involves manually stepping through code with a table of variables. This helps identify logic errors without running the program.
干运行包括使用变量表手动逐步执行代码。这有助于在不运行程序的情况下发现逻辑错误。
Computational thinking underpins problem solving. The key techniques are abstraction, decomposition and pattern recognition.
计算思维是解决问题的基础。关键技术包括抽象、分解和模式识别。
Abstraction removes unnecessary detail so the programmer can focus on the essential parts of a problem. Decomposition breaks a large problem into smaller subproblems.
抽象去除不必要的细节，使程序员能够专注于问题的核心部分。分解将大问题拆分为更小的子问题。
Pattern recognition identifies similarities between the current problem and known problems. This allows reusable solutions and saves development time.
模式识别识别当前问题与已知问题之间的相似性。这允许复用解决方案并节省开发时间。
Integrated development environments, or IDEs, support programming with features such as syntax highlighting, autocomplete, debugging tools and version control.
集成开发环境（IDE）通过语法高亮、自动补全、调试工具和版本控制等功能支持编程。
Candidates should refer to these techniques when writing about project development. Clear testing and debugging evidence strengthens the written project report.
考生在撰写项目开发内容时应提及这些技术。清晰的测试和调试证据可以增强书面项目报告的说服力。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导