Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧

📚 Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧

Programming is central to Edexcel A-Level Computer Science. You need to design, write, trace, test, and evaluate algorithms under exam conditions. This guide covers essential concepts and exam skills with bilingual explanations matched to the specification.

编程是 Edexcel A-Level 计算机科学的核心。你需要在考试条件下设计、编写、跟踪、测试和评估算法。本指南涵盖基本概念和考试技巧，并提供与考试大纲对应的双语解释。

1. Computational Thinking and Problem Solving | 计算思维与问题解决

Decomposition means breaking a large problem into smaller, manageable modules. For example, a library system can be divided into user login, book search, borrowing, and returning.

分解意味着将大问题拆分为更小、易于管理的模块。例如，图书馆系统可以分为用户登录、图书搜索、借阅和归还。

Abstraction focuses on the essential features while hiding unnecessary detail. Pattern recognition identifies repeated elements, and algorithm design creates a step-by-step solution.

抽象专注于基本特征，隐藏不必要的细节。模式识别确定重复元素，算法设计创建逐步解决方案。

Decomposition — 分解
Abstraction — 抽象
Pattern recognition — 模式识别
Algorithm design — 算法设计

2. Algorithm Representation: Pseudocode and Flowcharts | 算法表示：伪代码与流程图

Edexcel questions often expect pseudocode and flowcharts. Pseudocode should clearly show inputs, processes, conditions, and outputs using indentation.

Edexcel 题目通常要求伪代码和流程图。伪代码应使用缩进清晰展示输入、处理、条件和输出。

Flowchart symbols include an oval for start/end, a parallelogram for input/output, a rectangle for process, a diamond for decision, and arrows for flow direction.

流程图符号包括：椭圆形表示开始/结束，平行四边形表示输入/输出，矩形表示处理，菱形表示判断，箭头表示流程方向。

Symbol	Purpose	中文
Oval	Start / End	开始 / 结束
Parallelogram	Input / Output	输入 / 输出
Rectangle	Process	处理
Diamond	Decision	判断
Arrow	Flow direction	流程方向

3. Control Structures: Sequence, Selection, Iteration | 控制结构：顺序、选择、迭代

The three fundamental control structures are sequence, selection, and iteration. Sequence runs statements one after another in the order written.

三种基本控制结构是顺序、选择和迭代。顺序按编写的先后顺序执行语句。

Selection chooses between paths using IF, ELSE IF, ELSE, or CASE. Iteration repeats code with FOR, WHILE, or REPEAT UNTIL.

选择使用 IF、ELSE IF、ELSE 或 CASE 在路径之间选择。迭代使用 FOR、WHILE 或 REPEAT UNTIL 重复代码。

Loop	Condition check	中文
FOR	Before each iteration; known count	每次迭代前；次数已知
WHILE	Before each iteration; zero or more times	每次迭代前；零次或多次
REPEAT UNTIL	After each iteration; at least once	每次迭代后；至少一次

4. Data Types and Data Structures | 数据类型与数据结构

Primitive data types store single values: integer for whole numbers, real/float for decimals, Boolean for true/false, character for a single symbol, and string for text.

基本数据类型存储单个值：整数存储整数，实数/浮点存储小数，布尔存储真/假，字符存储单个符号，字符串存储文本。

Composite data structures such as arrays, records, lists, stacks, queues, and trees organise multiple values for efficient access and updating.

数组、记录、列表、栈、队列和树等复合数据结构组织多个值，以实现高效访问和更新。

Type	Example	中文
Integer	42	整数
Real / Float	3.14	实数 / 浮点
Boolean	TRUE / FALSE	布尔
Character	‘A’	字符
String	“Alice”	字符串

5. Arrays, Lists and Records | 数组、列表与记录

An array is a fixed-size collection of elements of the same type, accessed by index. A list is dynamic and can grow or shrink. A record groups related fields of different types.

数组是固定大小的同类元素集合，通过索引访问。列表是动态的，可增长或缩小。记录将不同类型的相关字段组合在一起。

When tracing array algorithms, keep a clear index table. For example, scores[0] = 85, scores[1] = 92, scores[2] = 78.

跟踪数组算法时，保持清晰的索引表。例如，scores[0] = 85，scores[1] = 92，scores[2] = 78。

student.name = “Alice”; student.age = 17; student.grade = “A”

6. Searching and Sorting Algorithms | 搜索与排序算法

Linear search checks each element in turn, with time complexity O(n). Binary search repeatedly divides a sorted array in half, giving O(log n).

线性搜索依次检查每个元素，时间复杂度为 O(n)。二分搜索反复将已排序数组减半，时间复杂度为 O(log n)。

Bubble sort repeatedly swaps adjacent out-of-order elements, O(n²). Merge sort splits arrays and merges sorted halves, O(n log n).

冒泡排序

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

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

Edexcel A-Level Programming: Core Concepts and Exam Skills | Edexcel A-Level 编程：核心概念与考试技巧