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计算机科学考试的成功至关重要。本速记指南汇总了考纲中的高频词汇，提供清晰的中英文释义，帮助你高效记忆和应用概念。

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²)。

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.

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

Linked list – a dynamic data structure where each node contains data and a

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

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