📚 Edexcel A-Level Programming: Concepts, Techniques and Problem Solving | Edexcel A-Level 编程：概念、技巧与问题求解
Programming is at the heart of the Edexcel A-Level Computer Science specification. It involves applying computational thinking to design, write, test and refine code that solves real-world problems. Mastery of programming requires not only syntax but also an understanding of algorithms, data structures and the principles of structured design.
编程是 Edexcel A-Level 计算机科学课程的核心。它要求学生运用计算思维来设计、编写、测试和完善解决实际问题的代码。掌握编程不仅需要熟悉语法，还要理解算法、数据结构以及结构化设计原则。
1. Computational Thinking and Problem Decomposition | 计算思维与问题分解
Computational thinking involves abstraction, decomposition and pattern recognition. Decomposition means breaking a large problem into smaller, manageable sub-problems that can be solved individually.
计算思维包括抽象、分解和模式识别。分解是指把一个大问题拆分成更小、更易管理的子问题，逐一解决。
Abstraction is the process of removing unnecessary detail so that only essential features remain. This is essential when modelling real-world systems in code.
抽象是去除不必要细节、只保留关键特征的过程。在用代码对现实系统建模时，这非常重要。
Pattern recognition identifies similarities between problems, allowing reuse of previous solutions. For example, many searching problems can use the same binary search pattern.
模式识别找出问题之间的相似性，从而复用已有解决方案。例如，许多查找问题都可以使用相同的二分查找模式。
- Decomposition: split a problem into smaller parts
- Abstraction: ignore irrelevant detail
- Pattern recognition: identify common characteristics
- Algorithm design: create step-by-step solutions
分解：把问题拆分成更小的部分；抽象：忽略无关细节；模式识别：识别共同特征；算法设计：创建分步解决方案。
2. Variables, Data Types and Constants | 变量、数据类型与常量
Variables store data values that can change during execution; constants store values that remain fixed. Common data types include integer, real, Boolean, character and string.
变量存储在执行过程中可以改变的数据值；常量存储保持不变的值。常见数据类型包括整型、实数型、布尔型、字符型和字符串型。
Type casting is used to convert one data type into another, such as integer to string for concatenation.
类型转换用于把一种数据类型转换为另一种，例如将整型转换为字符串以便拼接。
Edexcel expects knowledge of type systems: strongly typed languages enforce type rules at compile time, while weakly typed languages allow implicit conversion.
Edexcel 要求了解类型系统：强类型语言在编译时强制类型规则，而弱类型语言允许隐式转换。
- Integer: whole numbers, e.g. 42
- Real: numbers with fractional part, e.g. 3.14
- Boolean: TRUE or FALSE
- Character: a single symbol, e.g. ‘A’
- String: a sequence of characters, e.g. “hello”
整型：整数，例如 42；实数型：带小数部分的数，例如 3.14；布尔型：TRUE 或 FALSE；字符型：单个符号，例如 ‘A’；字符串型：字符序列，例如 “hello”。
3. Control Structures: Sequence, Selection and Iteration | 控制结构：顺序、选择与迭代
All programs are built from three control structures: sequence, selection and iteration. Selection uses IF, ELSE IF and ELSE statements; iteration uses FOR, WHILE and REPEAT UNTIL loops.
所有程序都由三种控制结构组成：顺序、选择和迭代。选择使用 IF、ELSE IF 和 ELSE 语句；迭代使用 FOR、WHILE 和 REPEAT UNTIL 循环。
A nested condition can model complex logic, but it may be replaced by a CASE statement to improve readability.
嵌套条件可以表达复杂逻辑，但可以用 CASE 语句替代以提高可读性。
Count-controlled loops repeat for a fixed number of iterations; condition-controlled loops repeat until a condition changes. A REPEAT UNTIL loop always executes at least once because the condition is tested at the end.
计数控制循环按固定次数重复；条件控制循环一直重复直到条件改变。REPEAT UNTIL 循环至少执行一次，因为条件在末尾测试。
FOR i = 1 TO 10
WHILE condition = TRUE
REPEAT … UNTIL condition = TRUE
FOR i = 1 到 10；WHILE 条件为 TRUE；REPEAT … UNTIL 条件为 TRUE
4. Subroutines, Functions and Parameter Passing | 子程序、函数与参数传递
Subroutines are named blocks of code that can be called repeatedly. Functions return a value; procedures do not. Parameters can be passed by value or by reference.
子程序是可重复调用的命名代码块。函数返回值；过程不返回值。参数可以按值传递或按引用传递。
By value passes a copy of the data, so changes inside the subroutine do not affect the original argument. By reference passes the address, allowing the original value to be modified.
按值传递传递数据的副本，因此子程序内部的修改不会影响原始参数。按引用传递传递地址，允许修改原始值。
Local variables exist only inside a subroutine, reducing side effects and improving modularity. Global variables can be accessed from anywhere but increase the risk of unintended changes.
局部变量仅存在于子程序内部，减少副作用并提高模块化。全局变量可以在任何地方访问，但增加了意外修改的风险。
FUNCTION add(a, b) RETURN a + b
函数 add(a, b) 返回 a + b
5. Recursion and the Call Stack | 递归与调用栈
A recursive subroutine calls itself until a base case is reached. Each recursive call is placed on the call stack; if the base case is missing, stack overflow occurs.
递归子程序会调用自身，直到达到基准条件。每次递归调用都被压入调用栈；如果缺少基准条件，就会发生栈溢出。
Factorial is a classic example: factorial(n) = n × factorial(n − 1) with factorial(1) = 1.
阶乘是经典示例：factorial(n) = n × factorial(n − 1)，且 factorial(1) = 1。
factorial(n) = n × factorial(n − 1), with factorial(1) = 1
Recursion can lead to elegant solutions for tree traversals, sorting algorithms such as merge sort, and divide-and-conquer problems. However, it may be less memory-efficient than iteration because each call adds a stack frame.
递归可以为树遍历、归并排序等分治问题提供优雅的解决方案。但由于每次调用都会增加栈帧，其内存效率可能不如迭代。
6. Data Structures: Arrays, Records, Lists, Stacks and Queues | 数据结构：数组、记录、列表、栈与队列
Arrays store multiple values of the same data type in contiguous memory. Records store values of different types as fields. Lists are dynamic collections that can grow and shrink.
数组将相同数据类型的多个值存储在连续内存中。记录将不同类型的值存储为字段。列表是可动态增删的集合。
A two-dimensional array models a grid or matrix, such as a game board or pixel image. A record groups related fields, for example a student record with name, age and grade.
二维数组可模拟网格或矩阵，例如游戏棋盘或像素图像。记录将相关字段组合在一起，例如包含姓名、年龄和成绩的学生记录。
Stacks use LIFO (last in, first out) logic; queues use FIFO (first in, first out) logic. Both can be implemented with arrays or linked lists.
栈使用 LIFO（后进先出）逻辑；队列使用 FIFO（先进先出）逻辑。两者都可以用数组或链表实现。
- Stack operations: push, pop, peek
- Queue operations: enqueue, dequeue
栈操作：push（入栈）、pop（出栈）、peek（查看栈顶）；队列操作：enqueue（入队）、dequeue（出队）。
7. Object-Oriented Programming: Classes, Inheritance and Polymorphism | 面向对象编程：类、继承与多态
Object-oriented programming (OOP) organises code around objects that combine data and behaviour. A class is a blueprint from which objects are instantiated.
面向对象编程（OOP）围绕对象组织代码，对象结合了数据和行为。类是从中实例化对象的蓝图。
Inheritance allows a subclass to reuse and extend the methods and attributes of a superclass. Polymorphism lets the same method call behave differently on different objects.
继承允许子类复用并扩展超类的方法和属性。多态性使同一个方法调用在不同对象上产生不同行为。
Encapsulation hides internal state and requires interaction through public methods, protecting data integrity. Constructors initialise object attributes when an instance is created.
封装隐藏内部状态，要求通过公共方法进行交互，保护数据完整性。构造函数在创建实例时初始化对象属性。
- Class: Dog
- Attributes: name, age, breed
- Methods: bark(), fetch()
- Subclass: Puppy inherits from Dog
类：Dog（狗）；属性：name（名字）、age（年龄）、breed（品种）；方法：bark()（叫）、fetch()（接球）；子类：Puppy（小狗）继承自 Dog。
8. File Handling and Exception Handling | 文件处理与异常处理
Programs can read from and write to sequential or random access files. Opening a file requires a mode such as read, write or append. Always close files to release resources.
程序可以读写顺序文件或随机访问文件。打开文件需要指定模式，如读、写或追加。始终要关闭文件以释放资源。
Sequential files are accessed line by line from the beginning; random access files allow direct movement to any record using a file pointer. Exception types include Input/Output errors, TypeError and ValueError.
顺序文件从头开始逐行访问；随机访问文件允许使用文件指针直接移动到任意记录。异常类型包括输入/输出错误、TypeError 和 ValueError。
Exception handling uses TRY-EXCEPT blocks to catch runtime errors such as file not found, division by zero or invalid input, preventing crashes.
异常处理使用 TRY-EXCEPT 块捕获运行时错误，如文件未找到、除零或无效输入，防止程序崩溃。
TRY
file = OPEN(“data.txt”, “read”)
EXCEPT FileNotFoundError
PRINT “File missing”
TRY 尝试打开文件；EXCEPT 捕获文件未找到错误并输出提示
9. Debugging, Testing and Trace Tables | 调试、测试与跟踪表
Debugging involves identifying and correcting errors: syntax errors, logic errors and runtime errors. A trace table tracks the values of variables as an algorithm executes, helping to locate logic errors.
调试包括识别和纠正错误：语法错误、逻辑错误和运行时错误。跟踪表记录算法执行过程中变量的值，帮助定位逻辑错误。
Testing should use normal, boundary and erroneous data. For example, for an input range 0–100, boundaries are 0 and 100; erroneous data include −1 and 101.
测试应使用正常数据、边界数据和错误数据。例如，对于输入范围 0–100，边界值是 0 和 100；错误数据包括 −1 和 101。
Modern IDEs provide breakpoints, stepping, and variable watches to observe execution. Unit tests isolate individual subroutines to verify they return expected results for given inputs.
现代 IDE 提供断点、单步执行和变量监视等功能来观察执行过程。单元测试隔离单个子程序，验证其对给定输入返回预期结果。
| Input | Expected | Type |
| 50 | Valid result | Normal |
| 0 | Valid lower bound | Boundary |
| -1 | Rejected | Erroneous |
表格示例：输入 50 为正常数据，输入 0 为下边界数据，输入 -1 为错误数据。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply