Year 13 WJEC Computer Science: Quick Vocabulary & Terminology Guide | Year 13 WJEC 计算机：词汇术语速记指南

📚 Year 13 WJEC Computer Science: Quick Vocabulary & Terminology Guide | Year 13 WJEC 计算机：词汇术语速记指南

Mastering key terminology is essential for success in the Year 13 WJEC Computer Science exam. This quick guide consolidates high-frequency vocabulary across the specification, providing clear definitions in English and Chinese to help you memorise and apply concepts efficiently.

掌握关键术语对于 Year 13 WJEC 计算机科学考试的成功至关重要。本速记指南汇总考纲中的高频词汇，提供清晰的中英文释义，帮助你高效记忆和应用概念。

The guide follows the A2 units - programming and system development, and computer architecture, data, communication and applications - so you can revise alongside your class notes or use it as a final checklist before the exam.

本指南按照 A2 两个单元编排——程序设计与系统开发，以及计算机体系结构、数据、通信与应用——你可以配合课堂笔记同步复习，也可以在考前把它当作最后的清单逐项核对。

1. Algorithm Complexity Terms | 算法复杂度术语

Time complexity – a function describing the amount of time an algorithm takes to complete as a function of the size of its input.

时间复杂度 – 描述算法完成所需时间与输入规模之间关系的函数。

Space complexity – the amount of memory space required by an algorithm to run to completion, depending on input size.

空间复杂度 – 算法运行完成所需的内存空间量，取决于输入规模。

Big O notation – represents the upper bound of an algorithm's growth rate, highlighting worst-case performance.

大O表示法 – 表示算法增长速率的上限，突出最坏情况性能。

Big Theta (Θ) notation – describes an asymptotically tight bound, indicating that the growth rate is both an upper and lower bound.

大Θ (Θ) 表示法 – 描述渐近紧确界，表明增长率既是上限也是下限。

Big Omega (Ω) notation – provides a lower bound on the growth rate, representing the best-case scenario.

大Ω (Ω) 表示法 – 提供增长率的下限，代表最好情况。

Common Big O classes: O(1), O(log n), O(n), O(n log n), O(n²).

常见大O类别：O(1)、O(log n)、O(n)、O(n log n)、O(n²)。

O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ)

Notation | 表示法	Growth | 增长率	Typical example | 典型例子
O(1)	Constant 常数	Accessing an array element 访问数组元素
O(log n)	Logarithmic 对数	Binary search 二分查找
O(n)	Linear 线性	Linear search 线性查找
O(n log n)	Linearithmic 线性对数	Merge sort 归并排序
O(n²)	Quadratic 平方	Bubble sort 冒泡排序

Scalability – how well an algorithm continues to perform when the input size grows very large.

可扩展性 – 当输入规模变得很大时，算法性能维持的程度。

---

2. Data Structures | 数据结构

Array – a contiguous block of memory storing elements of the same data type, accessed via an index. Insertion and deletion can be costly due to shifting.

数组 – 连续的内存块，存储相同数据类型的元素，通过索引访问。由于需要移动元素，插入和删除代价可能较高。

Static data structure – a structure whose size is fixed at compile time, such as an array; memory is allocated in advance.

静态数据结构 – 大小在编译时即固定的结构，例如数组，内存需预先分配。

Dynamic data structure – a structure that can grow and shrink at run time, such as a linked list, using pointers to link nodes.

动态数据结构 – 可在运行时增长或缩小的结构，例如使用指针连接节点的链表。

Linked list – a dynamic data structure where each node contains data and a pointer to the next node; the head pointer marks the start and the null pointer marks the end.

链表 – 一种动态数据结构，每个节点包含数据与指向下一节点的指针；头指针标记起点，空指针标记结尾。

Stack – a last-in-first-out (LIFO) structure with push, pop and peek operations, used for recursion, undo functions and expression evaluation.

栈 – 后进先出（LIFO）结构，具有 push、pop 和 peek 操作，常用于递归、撤销功能与表达式求值。

Queue – a first-in-first-out (FIFO) structure with enqueue and dequeue operations, used in printers, buffers and scheduling.

队列 – 先进先出（FIFO）结构，具有 enqueue 和 dequeue 操作，常用于打印机、缓冲区与任务调度。

Tree – a hierarchical structure of nodes with a single root; each node may have child nodes.

树 – 以单一根节点开始的层次化节点结构，每个节点可有若干子节点。

Binary search tree – a binary tree in which every value in the left subtree is smaller than the root and every value in the right subtree is larger, giving fast search, insert and delete.

二叉搜索树 – 一种二叉树，左子树的每个值都小于根节点，右子树的每个值都大于根节点，因此查找、插入、删除都很快。

Traversal – visiting every node in a tree; pre-order (root, left, right), in-order (left, root, right) and post-order (left, right, root).

遍历 – 访问树中的每个节点；前序（根、左、右）、中序（左、根、右）、后序（左、右、根）。

Graph – a set of vertices connected by edges; edges may be directed or undirected, and weighted or unweighted, and are stored as an adjacency matrix or adjacency list.

图 – 由边连接的一组顶点；边可以有向或无向、带权或不带权，通常用邻接矩阵或邻接表存储。

Hash table – a structure that maps a key to an index using a hash function, giving near O(1) access; collisions are resolved by chaining or open addressing.

哈希表 – 使用哈希函数把键映射到索引的结构，访问接近 O(1)；冲突可通过链地址法或开放寻址法解决。

---

3. Sorting and Searching Algorithms | 排序与查找算法

Bubble sort – repeatedly compares adjacent items and swaps them if out of order; simple to code but inefficient at O(n²).

冒泡排序 – 反复比较相邻元素，顺序错误就交换；实现简单但效率低，为 O(n²)。

Insertion sort – builds a sorted section one item at a time by inserting each new item into its correct position; efficient for small or nearly sorted data.

插入排序 – 逐个取元素插入到已排序部分的正确位置；对于数据量小或接近有序的数据较高效。

Merge sort – a divide-and-conquer algorithm that repeatedly splits the list in half, sorts each half and merges them; O(n log n) but needs extra memory.

归并排序 – 分治算法，不断把列表一分为二，分别排序后再合并；时间复杂度 O(n log n)，但需要额外内存。

Quick sort – a divide-and-conquer algorithm that selects a pivot, partitions items around it, then recursively sorts the partitions.

快速排序 – 分治算法，选取枢轴值把元素分区，再对分区递归排序。

Linear search – checks each item in turn until the target is found or the list ends; works on unsorted data at O(n).

广告 / Sponsored

线性查找 – 依次检查每个元素，直到找到目标或遍历结束；可用于无序数据，复杂度 O(n)。

Binary search – repeatedly halves a sorted list by comparing the middle item with the target; O(log n).

二分查找 – 将中间元素与目标比较，反复把有序列表折半；复杂度 O(log n)。

Divide and conquer – a strategy that breaks a problem into smaller sub-problems, solves them and combines the results.

分治法 – 把问题拆成更小的子问题，分别求解后再合并结果的策略。

---

4. Programming Constructs and Paradigms | 编程结构与范式

Sequence, selection and iteration – the three basic control structures: statements in order, branching with if/case, and repetition with loops.

顺序、选择与迭代 – 三种基本控制结构：按顺序执行的语句、用 if/case 实现的分支、用循环实现的重复。

Variable and constant – a variable holds a value that may change during execution; a constant holds a value that cannot change once declared.

变量与常量 – 变量保存执行过程中可改变的值；常量在声明后其值不可更改。

Scope – the region of a program where an identifier is visible; local variables exist inside a subroutine, global variables are visible throughout.

作用域 – 标识符在程序中可见的范围；局部变量只存在于子程序内部，全局变量在整个程序中可见。

Parameter and argument – a parameter is the placeholder in a subroutine definition; an argument is the actual value passed when it is called.

形参与实参 – 形参是子程序定义中的占位符；实参是调用时实际传入的值。

Pass by value and pass by reference – value passes a copy, so the original is unchanged; reference passes the address, so the original can be modified.

值传递与引用传递 – 值传递传入副本，原数据不变；引用传递传入地址，原数据可被修改。

Recursion – a subroutine that calls itself, requiring a base case and making use of the call stack.

递归 – 子程序调用自身，必须有基线条件，并依赖调用栈。

Class and object – a class is a template defining attributes and methods; an object is an instance created from that class.

类与对象 – 类是定义属性与方法的模板；对象是由该类创建出来的实例。

Encapsulation, inheritance and polymorphism – hiding data behind methods, deriving new classes from a parent, and allowing one interface to serve many forms.

封装、继承与多态 – 用方法隐藏数据、从父类派生新类、以及同一接口具有多种实现形式。

Abstraction and decomposition – removing unnecessary detail to model a problem, and breaking a large problem into manageable sub-problems.

抽象与分解 – 去除无关细节以建立问题模型，以及把大问题拆分为可管理的子问题。

---

5. Software Development and Testing | 软件开发与测试

Waterfall model – a linear methodology progressing through analysis, design, implementation, testing and maintenance, with little backtracking.

瀑布模型 – 线性开发方法，依次经过分析、设计、实现、测试与维护，几乎不回溯。

Agile methodology – an iterative approach using short sprints, continuous client feedback and incremental deliverables.

敏捷方法 – 使用短周期迭代、持续客户反馈和增量交付的开发方法。

Spiral model – a risk-driven model that repeats planning, risk analysis, engineering and evaluation in cycles.

螺旋模型 – 以风险为驱动的模型，循环进行计划、风险分析、工程实现与评估。

Unit, integration and system testing – testing individual modules, then testing them together, then testing the whole system against requirements.

单元、集成与系统测试 – 先测试单个模块，再测试模块间协作，最后按需求测试整个系统。

Black-box and white-box testing – black-box tests inputs and outputs without seeing the code; white-box uses knowledge of the internal structure.

黑盒与白盒测试 – 黑盒测试只看输入输出，不涉及代码内部；白盒测试则利用代码内部结构知识。

Alpha and beta testing – alpha testing is done in-house by developers, beta testing by real users in a live environment.

Alpha 与 Beta 测试 – Alpha 测试由内部开发者完成，Beta 测试由真实用户在真实环境中完成。

Validation and verification – validation asks whether the right system was built for the user; verification asks whether the system was built correctly.

有效性确认与正确性验证 – 有效性确认关注是否为用户做了正确的系统；正确性验证关注系统是否被正确地实现。

Robustness – the ability of a program to handle invalid or unexpected input without crashing.

健壮性 – 程序在不崩溃的前提下处理无效或意外输入的能力。

Trace table and dry run – manually working through an algorithm, recording variable values line by line, to find logic errors.

跟踪表与人工推演 – 手工逐行执行算法并记录变量值，用于发现逻辑错误。

---

6. Programming Languages and Translators | 编程语言与翻译程序

Machine code – binary instructions executed directly by the CPU; fast but very difficult for humans to write.

机器码 – 由 CPU 直接执行的二进制指令；速度快但极难人工编写。

Assembly language – a low-level language using mnemonics, translated by an assembler.

汇编语言 – 使用助记符的低级语言，由汇编器翻译。

High-level language – a portable, readable language such as Python or Java that must be translated before execution.

高级语言 – 如 Python 或 Java 等可移植、易读的语言，必须经过翻译才能执行。

Assembler, compiler and interpreter – an assembler converts assembly to machine code; a compiler translates the whole program at once; an interpreter translates and executes line by line.

汇编器、编译器与解释器 – 汇编器把汇编代码转为机器码；编译器一次性翻译整个程序；解释器逐行翻译并执行。

Stages of compilation – lexical analysis, syntax analysis, semantic analysis, intermediate code generation and optimisation, then final code generation.

编译阶段 – 词法分析、语法分析、语义分析、

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