📚 Programming Essentials for Edexcel A Level Computer Science | Edexcel A Level 计算机科学编程精要
Programming is at the heart of the Edexcel A Level Computer Science specification. This article explains core programming concepts, including paradigms, data structures, algorithms, recursion, and object-oriented techniques.
编程是 Edexcel A Level 计算机科学考纲的核心。本文解析核心编程概念，包括范式、数据结构、算法、递归与面向对象技术。
1. Computational Thinking | 计算思维
Computational thinking involves decomposition, pattern recognition, abstraction, and algorithm design. These skills help you break a problem into smaller parts, identify repeated patterns, remove unnecessary detail, and create a step-by-step solution.
计算思维包括分解、模式识别、抽象和算法设计。这些技能帮助你把问题拆分成更小的部分、识别重复模式、去掉无关细节，并制定逐步求解方案。
In Edexcel exam questions, you may be asked to explain how abstraction reduces complexity or to outline an algorithm in pseudocode.
在 Edexcel 考题中，你可能需要解释抽象如何降低复杂度，或用伪代码概述一个算法。
2. Programming Paradigms | 编程范式
A programming paradigm is a style or way of programming. The main paradigms in the Edexcel specification are procedural, object-oriented, and event-driven programming.
编程范式是一种编程风格或方式。Edexcel 考纲中的主要范式包括过程式、面向对象和事件驱动编程。
Procedural programming uses sequences, selection, and iteration with functions and procedures. Object-oriented programming organises code into classes and objects. Event-driven programming responds to user actions such as clicks and key presses.
过程式编程使用顺序、选择和循环，并配合函数和过程。面向对象编程将代码组织为类和对象。事件驱动编程响应用户操作，如点击和按键。
3. Data Types and Variables | 数据类型与变量
Variables store values in memory. Common data types include integer, real/float, Boolean, character, and string. Some languages also support date and time types.
变量在内存中存储值。常见数据类型包括整型、实型/浮点型、布尔型、字符型和字符串型。有些语言还支持日期与时间类型。
Choosing the correct data type is important for memory efficiency and for preventing type errors during casting or conversion.
选择正确的数据类型对节省内存和防止类型转换时的类型错误非常重要。
DECLARE age : INTEGER
DECLARE price : REAL
DECLARE name : STRING
4. Control Structures | 控制结构
Control structures determine the order in which statements are executed. The three basic control structures are sequence, selection, and iteration.
控制结构决定语句执行的顺序。三种基本控制结构是顺序、选择和循环。
Selection includes IF…THEN…ELSE and CASE statements. Iteration includes FOR, WHILE, and REPEAT…UNTIL loops.
选择结构包括 IF…THEN…ELSE 和 CASE 语句。循环结构包括 FOR、WHILE 和 REPEAT…UNTIL 循环。
WHILE count < 10 DO
count = count + 1
END WHILE
5. Subroutines and Parameter Passing | 子程序与参数传递
A subroutine is a named block of code that performs a specific task. Functions return a value; procedures do not.
子程序是一段执行特定任务的具名代码块。函数会返回值，过程不返回值。
Parameters can be passed by value or by reference. Passing by value copies the data, so the original variable is not changed. Passing by reference allows the subroutine to modify the original variable.
参数可以按值传递或按引用传递。按值传递会复制数据，因此原变量不会被修改。按引用传递允许子程序修改原变量。
In the exam, you should be able to trace code that uses global and local variables and explain their scope.
在考试中，你应当能追踪使用全局变量和局部变量的代码，并解释其作用域。
6. Recursion | 递归
Recursion is a technique where a subroutine calls itself. Every recursive routine must have a base case to stop the recursion.
递归是一种子程序调用自身的编程技巧。每个递归例程必须有一个基准情形来终止递归。
A classic example is the factorial function: n! = n × (n-1)!, with 0! = 1 as the base case.
经典例子是阶乘函数：n! = n × (n-1)!，其中基准情形 0! = 1。
FUNCTION factorial(n)
IF n = 0 THEN RETURN 1
ELSE RETURN n * factorial(n-1)
END FUNCTION
Recursion can be elegant but may use more memory due to call stack frames. You should compare it with iteration in terms of efficiency.
递归代码可能很优雅，但由于调用栈帧，可能占用更多内存。你应将其与循环在效率方面进行比较。
7. Data Structures: Arrays, Lists, Stacks and Queues | 数据结构：数组、列表、栈和队列
Arrays store elements of the same data type in contiguous memory locations and allow random access by index.
数组在连续内存位置中存储相同数据类型的元素，并允许通过索引进行随机访问。
Lists are dynamic data structures that can grow and shrink. Stacks are last-in first-out (LIFO) structures, while queues are first-in first-out (FIFO).
列表是可以动态增减的数据结构。栈是后进先出（LIFO）结构，队列是先进先出（FIFO）结构。
You should know common operations such as push, pop, peek for stacks, and enqueue, dequeue for queues.
你应当了解栈的常见操作，如压入、弹出、取栈顶，以及队列的入队和出队操作。
8. Searching Algorithms | 搜索算法
Linear search checks each element one by one. It works on unsorted data and has a worst-case time complexity of O(n).
线性搜索逐个检查每个元素。它适用于未排序数据，最坏时间复杂度为 O(n)。
Binary search repeatedly divides a sorted list in half. Its worst-case time complexity is O(log n), making it much faster for large data sets.
二分搜索反复将有序列表分成两半。其最坏时间复杂度为 O(log n)，对大数据集快得多。
low = 0, high = n-1
WHILE low <= high
mid = (low + high) DIV 2
IF list[mid] = target THEN RETURN mid
ELSE IF list[mid] < target THEN low = mid + 1
ELSE high = mid – 1
END WHILE
Binary search requires the list to be sorted first, so it is not suitable when data changes frequently.
二分搜索要求列表先排序，因此不适合数据频繁变化的情况。
9. Sorting Algorithms | 排序算法
Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. It has O(n²) time complexity.
冒泡排序反复比较相邻元素，若顺序错误则交换。其时间复杂度为 O(n²)。
Merge sort uses a divide-and-conquer strategy with O(n log n) time complexity. It is more efficient than bubble sort for large lists.
归并排序使用分治策略，时间复杂度为 O(n log n)。对于大列表，它比冒泡排序更高效。
You should be able to trace and compare these algorithms and identify the number of comparisons and swaps.
你应当能追踪和比较这些算法，并确定比较和交换的次数。
10. Object-Oriented Programming | 面向对象编程
Object-oriented programming (OOP) models real-world entities using classes and objects. A class is a blueprint; an object is an instance of a class.
面向对象编程（OOP）使用类和对象对现实世界实体进行建模。类是蓝图，对象是类的实例。
Key OOP concepts include encapsulation, inheritance, polymorphism, and abstraction. Encapsulation hides data by making attributes private and providing public methods.
OOP 的关键概念包括封装、继承、多态和抽象。封装通过将属性设为私有并提供公共方法来隐藏数据。
Inheritance allows a subclass to reuse and extend the features of a superclass, reducing code duplication.
继承允许子类复用并扩展父类的特性，减少代码重复。
CLASS Car
PRIVATE speed
PUBLIC PROCEDURE accelerate()
END PROCEDURE
END CLASS
In the Edexcel exam, you may be asked to interpret class diagrams and explain how OOP improves maintainability.
在 Edexcel 考试中，你可能需要解读类图，并解释 OOP 如何提高可维护性。
11. Testing and Debugging | 测试与调试
Testing ensures that a program meets its requirements. Types of testing include unit testing, integration testing, system testing, and acceptance testing.
测试确保程序满足需求。测试类型包括单元测试、集成测试、系统测试和验收测试。
Debugging is the process of finding and fixing errors. Common error types are syntax errors, runtime errors, and logic errors.
调试是发现并修复错误的过程。常见错误类型有语法错误、运行时错误和逻辑错误。
Trace tables are an important exam technique for following the values of variables as an algorithm runs.
跟踪表是重要的考试技巧，用于追踪算法运行过程中变量的值。
Published by TutorHao | Edexcel A Level Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导