A-Level Edexcel Programming: Algorithms, Data Structures and OOP Essentials | A-Level Edexcel 编程：算法、数据结构与面向对象核心

📚 A-Level Edexcel Programming: Algorithms, Data Structures and OOP Essentials | A-Level Edexcel 编程：算法、数据结构与面向对象核心

This revision guide covers the programming techniques most frequently examined in Edexcel A-Level Computer Science Paper 2: computational thinking, standard algorithms, data structures, and object-oriented programming. It is designed for active recall and exam-style application rather than passive reading.

本复习指南涵盖 Edexcel A-Level 计算机科学 Paper 2 中最常考查的编程技巧：计算思维、标准算法、数据结构和面向对象编程。内容以主动回忆和考试应用为目标，而非被动阅读。

---

1. Computational Thinking and Algorithm Design | 计算思维与算法设计

Computational thinking involves decomposition, pattern recognition, abstraction, and algorithm design. In Edexcel questions, you are often asked to decompose a problem into smaller parts, identify repeated patterns, and express a solution using pseudocode or flowcharts.

计算思维包括分解、模式识别、抽象和算法设计。在 Edexcel 考题中，你经常需要将问题分解为更小的部分，识别重复模式，并用伪代码或流程图表达解决方案。

An algorithm must be precise, unambiguous, and terminate for all valid inputs. Its efficiency is measured by time complexity using Big O notation such as O(1), O(log n), O(n), O(n²), and O(2ⁿ).

算法必须精确、无歧义，并且对所有有效输入都能终止。算法效率通过时间复杂度衡量，使用大 O 记法，如 O(1)、O(log n)、O(n)、O(n²) 和 O(2ⁿ)。

Time complexity ordering: O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ)

Abstraction means hiding unnecessary detail. For example, a queue can be represented as an abstract data type with operations enqueue, dequeue, isEmpty, and isFull, without showing the underlying array or linked list.

抽象意味着隐藏不必要的细节。例如，队列可以用抽象数据类型表示，提供入队、出队、判空和判满操作，而无需展示底层数组或链表。

Good algorithm design also considers space complexity, readability, and robustness. A robust algorithm handles invalid inputs gracefully instead of crashing.

良好的算法设计还考虑空间复杂度、可读性和健壮性。健壮的算法能够优雅地处理无效输入，而不是崩溃。

---

2. Pseudocode and Trace Tables | 伪代码与追踪表

Edexcel pseudocode uses keywords such as PRINT, INPUT, IF…THEN…ELSE…ENDIF, WHILE…ENDWHILE, FOR…NEXT, and FUNCTION…RETURN…ENDFUNCTION. You must be able to write, read, and debug code written in this style.

Edexcel 伪代码使用 PRINT、INPUT、IF…THEN…ELSE…ENDIF、WHILE…ENDWHILE、FOR…NEXT 以及 FUNCTION…RETURN…ENDFUNCTION 等关键字。你必须能够编写、阅读和调试这种风格的代码。

A trace table records the values of variables at each step of an algorithm. Exam questions often provide an incomplete trace table and ask you to fill in the missing values, which tests your understanding of variable updates and control flow.

追踪表记录算法每一步变量的值。考试中常给出不完整的追踪表，要求填写缺失值，这考查你对变量更新和控制流的理解。

When tracing, always note the order of execution: a FOR loop increments after each iteration, a WHILE loop checks its condition before each iteration, and an IF statement may execute zero or one branch.

追踪时，务必注意执行顺序：FOR 循环在每次迭代后递增，WHILE 循环在每次迭代前检查条件，IF 语句可能执行零个或一个分支。

Use indentation and comments in pseudocode to make control flow clear. For example, a loop that calculates the sum of numbers from 1 to n can be written as:

在伪代码中使用缩进和注释使控制流清晰。例如，计算 1 到 n 数字之和的循环可以写成：

total ← 0
FOR i ← 1 TO n
  total ← total + i
NEXT i

---

3. Stacks and Queues | 栈与队列

A stack is a last-in-first-out (LIFO) structure. Operations include push, pop, peek/top, isEmpty, and isFull. Stacks are used for call stacks, undo functions, and expression evaluation.

栈是一种后进先出（LIFO）结构。操作包括 push（压入）、pop（弹出）、peek/top（读取栈顶）、isEmpty（判空）和 isFull（判满）。栈用于调用栈、撤销功能和表达式求值。

A queue is a first-in-first-out (FIFO) structure. Operations include enqueue, dequeue, front, isEmpty, and isFull. Queues model waiting lines, print spooling, and breadth-first search.

队列是一种先进先出（FIFO）结构。操作包括 enqueue（入队）、dequeue（出队）、front（读取队首）、isEmpty（判空）和 isFull（判满）。队列用于模拟排队、打印缓冲和广度优先搜索。

When implemented with an array, a circular queue uses two pointers, front and rear, and wraps around using modulo arithmetic. This avoids shifting all items after a dequeue, giving O(1) enqueue and dequeue operations.

使用数组实现时，循环队列使用 front 和 rear 两个指针，通过取模运算环绕。这样避免出队后移动所有元素，使入队和出队操作均为 O(1)。

• Stack: LIFO, push, pop, peek | 栈：后进先出，压入、弹出、读取栈顶
• Queue: FIFO, enqueue, dequeue, front | 队列：先进先出，入队、出队、读取队首
• Circular queue: uses modulo to wrap around | 循环队列：使用取模运算环绕

Exam questions may ask you to draw a stack after a series of operations or to implement a queue using two stacks. Always label the top and bottom, or front and rear, clearly.

考试题可能要求你画出一系列操作后的栈，或使用两个栈实现队列。务必清楚标注栈顶和栈底，或者队首和队尾。

---

4. Linked Lists | 链表

A linked list stores nodes where each node contains data and a pointer to the next node. Unlike arrays, linked lists do not require contiguous memory and can grow dynamically.

链表存储节点，每个节点包含数据和一个指向下一个节点的指针。与数组不同，链表不需要连续内存，可以动态增长。

Singly linked lists allow traversal in one direction. Doubly linked lists add a pointer to the previous node, enabling bidirectional traversal. Circular linked lists connect the last node back to the first.

单向链表只能向一个方向遍历。双向链表增加一个指向前一个节点的指针，支持双向遍历。循环链表将最后一个节点连接回第一个节点。

Exam questions often ask you to insert or delete a node at the head, tail, or middle. Always update the relevant pointers in the correct order: first attach the new

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

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