GCSE WJEC Computer Science: Data Structures Exam Focus | GCSE WJEC 计算机：数据结构考点精讲

📚 GCSE WJEC Computer Science: Data Structures Exam Focus | GCSE WJEC 计算机：数据结构考点精讲

Data structures are fundamental to programming, providing ways to organise and store data so that it can be accessed and worked with efficiently. In the WJEC GCSE Computer Science specification, understanding data structures such as arrays, lists, stacks, queues, and trees is essential for solving problems and writing well-structured code. This guide walks you through each key data structure, with bilingual explanations, practical diagrams, and exam tips to help you master the topic.

数据结构是编程的基础，它提供了组织和存储数据的方法，使数据能够被高效地访问和处理。在 WJEC GCSE 计算机科学考试大纲中，理解数组、列表、栈、队列和树等数据结构对于解决问题和编写结构良好的代码至关重要。本指南将带你逐一掌握每个关键数据结构，配合中英双语解释、实用图表和考试技巧，助你吃透本专题。

1. What Are Data Structures? | 什么是数据结构？

A data structure is a way of organising and storing data in a computer so that it can be used efficiently. Different structures support different operations and are chosen depending on the problem you are solving. For example, you might use an array when you need fast random access, or a stack when you need to reverse a sequence of items.

数据结构是在计算机中组织和存储数据的一种方式，以便高效地使用数据。不同的结构支持不同的操作，并根据要解决的问题进行选择。例如，当你需要快速的随机访问时，可以使用数组；当你需要反转一系列项目时，可以使用栈。

The WJEC GCSE specification focuses on six key structures: one-dimensional arrays, two-dimensional arrays, lists, records, stacks, queues, and binary trees. In this article we will explore the characteristics, operations, and typical uses of each one.

WJEC GCSE 大纲重点关注六种关键结构：一维数组、二维数组、列表、记录、栈、队列和二叉树。在本文中，我们将逐一探讨它们的特性、操作和典型用途。

2. One-Dimensional Arrays | 一维数组

A one-dimensional array is a collection of elements of the same data type, stored in consecutive memory locations. Each element can be accessed directly by its index, which usually starts at 0. In pseudocode, you might see array[0], array[1], etc. Arrays have a fixed size determined when they are created.

一维数组是相同数据类型的元素集合，存储在连续的内存位置中。每个元素可以通过索引直接访问，索引通常从 0 开始。在伪代码中，你可能会看到 array[0]、array[1] 等。数组在创建时就确定了固定的大小。

Key operations: reading a value with value ← arr[i], writing a value with arr[i] ← newValue, and iterating using a loop. Arrays offer O(1) access time, meaning retrieval is instant regardless of position.

关键操作：用 value ← arr[i] 读取值，用 arr[i] ← newValue 写入新值，以及使用循环进行遍历。数组提供 O(1) 的访问时间，即无论位置如何，检索都是即时的。

Arrays are ideal when you know the number of elements in advance and need fast access by position. However, inserting or deleting an element in the middle is inefficient because all following elements must be shifted.

当你事先知道元素数量，并且需要按位置快速访问时，数组是理想的选择。然而，在中间插入或删除元素的效率很低，因为所有后续元素都必须移动。

3. Two-Dimensional Arrays | 二维数组

A two-dimensional array can be visualised as a table with rows and columns, where each cell is identified by two indices: array[row, column]. In many programming languages, it is implemented as an array of arrays. This structure is useful for representing matrices, game boards, spreadsheets, or pixel grids.

二维数组可以看作有行和列的表格，每个单元格通过两个索引来标识：array[row, column]。在许多编程语言中，它被实现为数组的数组。这种结构对于表示矩阵、游戏棋盘、电子表格或像素网格非常有用。

You can traverse a 2D array using nested loops. For an array with R rows and C columns, the outer loop goes over rows and the inner loop over columns. Typical operations include finding the sum of all elements, searching for a value, or updating a particular cell.

你可以使用嵌套循环遍历二维数组。对于一个有 R 行和 C 列的数组，外层循环遍历行，内层循环遍历列。典型操作包括计算所有元素的总和、搜索某个值或更新特定单元格。

In WJEC exam questions, you may be asked to write pseudocode to process a 2D array, such as finding the highest mark in a class of students across multiple tests, where rows represent students and columns represent test scores.

在 WJEC 的考题中，你可能会被要求编写处理二维数组的伪代码，例如查找一个班级学生在多次考试中的最高分，其中行代表学生，列代表考试成绩。

4. Lists and Their Implementation | 列表及其实现

A list is a dynamic data structure that can grow or shrink as needed. Unlike arrays, lists do not require the size to be fixed in advance. In WJEC pseudocode, you will often see commands like list.append(item), list.remove(index), or list.length. Lists can store elements of any type and maintain the order of insertion.

列表是一种动态数据结构，可以根据需要增长或收缩。与数组不同，列表不需要事先固定大小。在 WJEC 伪代码中，你经常会看到诸如 list.append(item)、list.remove(index) 或 list.length 这样的命令。列表可以存储任何类型的元素，并保持插入顺序。

Under the hood, a list might be implemented using an array that is replaced with a larger one when full, or as a linked list where each node points to the next. The WJEC specification only requires you to understand the behaviour, not the low-level implementation details.

在底层，列表可能是用一个数组来实现的，当数组变满时会被一个更大的数组替换，或者是作为链表实现，其中每个节点指向下一个节点。WJEC 规范只要求你理解其行为，不要求掌握底层实现细节。

Lists are versatile and are often the default choice for storing sequences when the number of items is unknown. However, random access by index in some list implementations can be slower than in arrays. Always check which data structure suits the requirements of a given scenario.

列表用途广泛，当项目数量未知时，它通常是存储序列的默认选择。但是，在某些列表实现中，按索引随机访问可能比数组慢。请务必检查哪种数据结构适合给定场景的需求。

5. Records | 记录

A record is a data structure that groups different data items of possibly different types under one name. Each item is called a field. For example, a student record might have fields for name (string), age (integer), and grade (character). Records are the foundation of databases and help to model real-world entities.

记录是一种数据结构，它将可能不同类型的多个数据项组合在一个名称下。每个数据项称为一个字段。例如，一个学生记录可能有姓名字段（字符串）、年龄字段（整数）和成绩字段（字符）。记录是数据库的基础，有助于对现实世界的实体进行建模。

In pseudocode, you might define a record like
TYPE Student
name AS STRING
age AS INTEGER
ENDTYPE
and then create a variable DECLARE s AS Student. Access fields using dot notation: s.name ← “Alice”.

在伪代码中，你可以这样定义记录：
TYPE Student
name AS STRING
age AS INTEGER
ENDTYPE
然后创建一个变量 DECLARE s AS Student。使用点号访问字段：s.name ← “Alice”。

Arrays of records are extremely common: e.g., an array of Student records to store a class list. This combines the fast indexing of arrays with the rich organisation of records.

记录数组极其常见：例如，一个学生记录数组用来存储班级名单。这结合了数组的快速索引和记录丰富的组织方式。

6. Stacks: LIFO Principle | 栈：后进先出原则

A stack is an abstract data type that follows the Last In, First Out (LIFO) principle. You can think of it like a stack of plates: the last plate placed on top is the first one to be taken off. The two main operations are push (add an item to the top) and pop (remove and return the top item).

栈是一种遵循后进先出（LIFO）原则的抽象数据类型。你可以把它想象成一摞盘子：最后放在顶部的盘子会被第一个拿走。两个主要操作是 push（将一个项添加到顶部）和 pop（移除并返回顶部项）。

An additional operation, peek or top, allows you to look at the top item without removing it. A stack can be implemented using an array and a pointer (top) that keeps track of the last occupied position. When implementing, you must handle stack underflow (pop on empty) and overflow (push on full).

还有一个额外操作，peek 或 top，可以让你查看顶部项而不移除它。栈可以用一个数组和一个指向最后占用位置的指针（top）来实现。在实现时，你必须处理栈下溢（对空栈执行 pop）和上溢（对满栈执行 push）。

Common uses of stacks include managing function calls (call stack), undo mechanisms in editors, and evaluating expressions in reverse polish notation. GCSE questions often ask you to trace the state of a stack after a series of pushes and pops.

栈的常见用途包括管理函数调用（调用栈）、编辑器中的撤销机制，以及用逆波兰表示法计算表达式。GCSE 题目经常要求你跟踪一系列 push 和 pop 操作后栈的状态。

7. Queues: FIFO Principle | 队列：先进先出原则

A queue operates on the First In, First Out (FIFO) principle. Items join at the rear and leave from the front, just like people in a queue at a bus stop. The key operations are enqueue (add an item to the rear) and dequeue (remove and return the front item).

队列遵循先进先出（FIFO）原则。项目在后面加入，从前面离开，就像公交站排队的人群一样。关键操作是 enqueue（将一个项添加到队尾）和 dequeue（移除并返回队首项）。

Queues can be implemented with an array, but a circular queue approach is often used to reuse vacant spaces. Two pointers, front and rear, are maintained. Like stacks, you need to guard against underflow (dequeue on empty) and overflow (enqueue on full).

队列可以用数组实现，但通常采用循环队列的方法来重用空余空间。需要维护两个指针，front 和 rear。与栈一样，你需要防止下溢（对空队列执行 dequeue）和上溢（对满队列执行 enqueue）。

Queues are widely used in scheduling tasks, managing print jobs on a printer, and handling data streams where order must be preserved. In WJEC tasks, you may be given a sequence of enqueues and dequeues and asked to show the resulting queue content.

队列广泛用于任务调度、管理打印机上的打印作业，以及处理必须保持顺序的数据流。在 WJEC 的题目中，你可能会收到一系列 enqueue 和 dequeue 操作，并被要求展示最终的队列内容。

8. Binary Trees – Structure and Terminology | 二叉树——结构与术语

A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. The topmost node is called the root. Nodes with no children are leaves. Trees are used to represent hierarchical data such as file systems, organisation charts, or to enable efficient searching (binary search trees).

二叉树是一种层次化数据结构，其中每个节点最多有两个子节点，分别称为左子节点和右子节点。最顶部的节点称为根。没有子节点的节点是叶子。树用于表示层次化数据，如文件系统、组织结构图，或实现高效搜索（二叉搜索树）。

In the WJEC GCSE, you need to understand the basic tree terminology: node, root, leaf, parent, child, subtree, depth, and height. You do not need to know self-balancing trees or complex insertion algorithms, but you must be able to trace traversals.

在 WJEC GCSE 中，你需要理解基本的树术语：节点、根、叶子、父节点、子节点、子树、深度和高度。你不需要了解自平衡树或复杂的插入算法，但必须能够跟踪遍历过程。

9. Binary Tree Traversals | 二叉树遍历

Traversal means visiting each node in a tree exactly once. There are three common depth-first traversals: pre-order (visit root, then left subtree, then right subtree), in-order (left, root, right), and post-order (left, right, root). Another method is level-order (breadth-first), but depth-first is the focus in WJEC.

遍历意味着恰好访问树中的每个节点一次。有三种常见的深度优先遍历：前序遍历（访问根，然后左子树，然后右子树）、中序遍历（左，根，右）和后序遍历（左，右，根）。另一种方法是层序遍历（广度优先），但 WJEC 的重点是深度优先。

In an exam, you may be given a binary tree diagram and asked to write the order of nodes visited for a specific traversal. For a binary search tree, in-order traversal gives the nodes in ascending order. Practise tracing recursively: for each node, apply the traversal rule until all nodes are visited.

在考试中，你可能会得到一棵二叉树图，并被要求写出特定遍历访问节点的顺序。对于二叉搜索树，中序遍历会按升序给出节点。练习递归跟踪：对每个节点，应用遍历规则，直到所有节点都被访问。

Here is a simple example tree and its traversals. Consider a tree with root A, left child B, right child C. Pre-order: A B C. In-order: B A C. Post-order: B C A. If the tree is larger, you break it down recursively.

下面是一个简单的树及其遍历示例。假设一个树，根为 A，左子节点为 B，右子节点为 C。前序：A B C。中序：B A C。后序：B C A。如果树更大，你可以递归地将其分解。

10. Choosing the Right Data Structure | 选择正确的数据结构

Selecting the appropriate data structure depends on the operations you need to perform most frequently. Use an array when you have a fixed number of items and need fast random access. Choose a list when the size changes often and you mainly append or iterate. Use a stack when you need reverse order or undo functionality. Use a queue when order of arrival must be preserved. Records are perfect for grouping related attributes of an entity, and trees suit hierarchical or ordered data that needs fast searching.

选择合适的数据结构取决于你最常执行的操作。当项目数量固定且需要快速随机访问时，使用数组。当大小经常变化且主要进行追加或迭代操作时，选择列表。当需要逆序或撤销功能时，使用栈。当必须保持到达顺序时，使用队列。记录非常适合对实体的相关属性进行分组，而树适用于需要快速搜索的层次化数据或有序数据。

The table below summarises typical use cases:

下表概括了典型用例：

Data Structure	Ideal Scenario
1D Array	Storing daily temperatures for a known number of days.
2D Array	Grid-based games like tic-tac-toe or Battleship.
List	Shopping cart items that change as the user adds or removes products.
Record	An employee database entry with name, ID, and salary.
Stack	Back button history in a web browser.
Queue	Print jobs waiting for a shared printer.
Binary Tree	Storing a sorted list of words for fast search (dictionary).

When writing pseudocode in an exam, always justify your choice of data structure by referring to the efficiency of the required operations or the logical organisation of the data.

在考试中编写伪代码时，一定要通过提及所需操作的效率或数据的逻辑组织方式来说明选择该数据结构的理由。

11. Common Pitfalls and Exam Tips | 常见陷阱与考试技巧

One frequent mistake is confusing the index of an array with its value. Remember that in most languages and WJEC pseudocode, the first element is at index 0, not 1. Always trace your loops carefully, especially with 2D arrays, to avoid off-by-one errors.

一个常见错误是将数组的索引与其值混淆。请记住，在大多数语言和 WJEC 伪代码中，第一个元素的索引是 0，而不是 1。务必仔细跟踪你的循环，尤其是处理二维数组时，以避免差一错误。

When tracing stacks and queues, draw clear diagrams showing the current state after each operation. Label the top pointer for stacks and front / rear pointers for queues. For tree traversals, write the order of visited nodes directly underneath the tree diagram as you go.

在跟踪栈和队列时，绘制清晰的图表，显示每次操作后的当前状态。标注栈的 top 指针和队列的 front / rear 指针。对于树遍历，在你进行时直接将访问节点的顺序写在树的示意图下面。

Pay attention to whether a dynamic data structure is required. If the specification says ‘the number of students is unknown at the start’, an array is not suitable because its size is fixed. Use a list. Similarly, if the problem requires reversing a sequence, a stack is a natural choice.

注意是否需要动态数据结构。如果规范说“学生人数一开始未知”，数组就不适合，因为其大小固定。应使用列表。同样，如果问题要求反转一个序列，栈是自然的选择。

Finally, practise writing pseudocode for basic operations: pushing onto a stack (check for overflow), enqueuing into a queue, traversing a 2D array row by row, and performing an in-order traversal recursively. These are exam favourites.

最后，练习编写基本操作的伪代码：入栈（检查溢出）、入队、逐行遍历二维数组，以及递归执行中序遍历。这些都是考试的热门内容。

12. Summary and Key Takeaways | 总结与要点回顾

Data structures form the backbone of efficient algorithm design. By mastering arrays, lists, records, stacks, queues, and binary trees, you gain the tools to model real-world data and solve computational problems logically. Remember the strengths and weaknesses of each structure and match them to the requirements of the task at hand.

数据结构构成了高效算法设计的骨干。通过掌握数组、列表、记录、栈、队列和二叉树，你将获得对现实世界数据进行建模并从逻辑上解决计算问题的工具。记住每种结构的优缺点，并将它们与手头任务的要求匹配起来。

As you revise, try to implement simple versions of each structure in pseudocode, and work through past paper questions. The WJEC mark scheme rewards clear, methodical thinking and correct use of data structure operations. Keep a structured approach, and success will follow.

在复习时，尝试用伪代码实现每种结构的简单版本，并练习过去的试卷题目。WJEC 的评分方案奖励清晰、有方法的思维以及数据处理结构操作的正确使用。保持结构化的方法，成功将随之而来。

Published by TutorHao | Computer Science Revision Series | aleveler.com

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

GCSE WJEC Computer Science: Data Structures Exam Focus | GCSE WJEC 计算机：数据结构 考点精讲