Year 13 CIE Computer Science: Terminology Memorisation Guide | Year 13 CIE 计算机：词汇术语速记指南

📚 Year 13 CIE Computer Science: Terminology Memorisation Guide | Year 13 CIE 计算机：词汇术语速记指南

Mastering the terminology of Year 13 CIE Computer Science is the first step toward confident exam performance. This guide presents key technical terms organised by topic, with concise English explanations followed by Chinese translations and memory aids to help you internalise them quickly.

掌握 Year 13 CIE 计算机的专业术语是通往自信应试的第一步。本指南按主题整理了关键术语，先提供简洁的英文解释，再搭配中文翻译和速记技巧，帮助你快速内化这些概念。

1. Abstract Data Types (ADT) | 抽象数据类型

A logical description of a data structure, specifying the operations that can be performed without revealing implementation details. ADTs separate interface from implementation.

ADT 是对数据结构的逻辑描述，规定可执行的操作，隐藏实现细节，将接口与实现分离。记忆法：ADT 只关心“做什么”，不关心“怎么做”。

Stack: A last‑in‑first‑out (LIFO) structure supporting push and pop, typically implemented with an array and a stack pointer.

栈：后进先出（LIFO）的结构，支持 push 和 pop，常通过数组加栈指针实现。像一摞盘子，后放的先取。

Queue: A first‑in‑first‑out (FIFO) structure with enqueue and dequeue; can be linear or circular to reuse space.

队列：先进先出（FIFO）结构，有入队和出队操作；可采用循环队列循环利用空间。排队买东西，先到先得。

Linked List: Dynamic collection of nodes, each containing data and a pointer to the next node; easy to insert/delete but no random access.

链表：动态节点的集合，每个节点含数据和指向下一节点的指针；插入删除方便但无随机访问。像一列火车，车厢间用挂钩连接。

Tree / Graph: Tree is a hierarchical, acyclic structure with one root; Graph is a set of vertices connected by edges, can be directed or undirected.

树/图：树是层次化无环结构，有唯一根节点；图是由边连接的顶点集合，可分有向和无向。树是家族的族谱，图是社交关系网。

---

2. Object‑Oriented Programming (OOP) | 面向对象编程

Encapsulation: Bundling data with methods that operate on that data, restricting direct access from outside via public/private modifiers.

封装：把数据及操作数据的方法捆绑，通过 public/private 修饰符限制外部直接访问，好比药丸胶囊把药物包裹起来。

Inheritance: A class derives properties and behaviours from a parent class, promoting code reuse and establishing ‘is‑a’ relationships.

继承：子类从父类继承属性和方法，促进代码复用，形成“是一种”的关系。就像孩子继承父母特征。

Polymorphism: Ability of different classes to respond to the same method call in different ways, often via method overriding or overloading.

多态：不同类对同一方法调用做出不同响应的能力，常用于方法重写和重载。同一指令“移动”，汽车和人执行方式不同。

Abstract Class / Interface: Abstract class cannot be instantiated, may contain abstract methods; Interface defines a contract of methods with no implementation.

抽象类/接口：抽象类不能实例化，可含抽象方法；接口定义一组方法签名而无实现，是必须遵守的“合同”。

Composition over Inheritance: Preferring ‘has‑a’ relationships (composition) to ‘is‑a’ (inheritance) for greater flexibility.

组合优于继承：优先使用“有一个”的关系（组合）而非“是一种”（继承），以获得更高灵活性。好比汽车有发动机，而非汽车是发动机。

---

3. Data Structures (Static & Dynamic) | 数据结构（静态与动态）

Array: Fixed‑size contiguous memory block; offers O(1) access by index but expensive insertion/deletion.

数组：固定大小的连续内存块，索引访问 O(1)，但插入删除代价高。像电影院的固定座位。

Dynamic Array (List): Resizable array that doubles capacity when full, amortised O(1) append.

动态数组（列表）：可调整大小的数组，满时翻倍扩容，追加操作均摊 O(1)。像报名名单可灵活增加。

Hash Table: Uses a hash function to map keys to buckets, average O(1) search; collisions resolved by chaining or open addressing.

哈希表：用哈希函数把键映射到桶，平均 O(1) 查找；冲突通过链地址或开放地址解决。类比通过拼音首字母找字典页码。

Binary Search Tree (BST): Each node has at most two children; left subtree < node < right subtree; gives O(log n) search when balanced.

二叉搜索树：每个节点最多两个子节点；左子树值小于根，右子树值大于根；平衡时查找 O(log n)。可用“左小右大”快速记忆。

AVL / B‑tree: AVL is a self‑balancing BST; B‑tree is a multi‑way tree used in databases to minimise disk reads.

AVL 树 / B 树：AVL 是自平衡二叉搜索树；B 树是一种多路树，用于数据库以减少磁盘读取次数。AVL 保证绝对平衡，B 树像宽扁文件夹。

---

4. Algorithms & Complexity | 算法与复杂度

Big‑O notation: Describes upper bound of time/space complexity, ignoring constants. Common: 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²)。粗线条刻画增长速度。

Recursion: A function calling itself with a base case and a recursive step. Must use a call stack.

递归：函数调用自身，需要有基准情形和递归步骤。必须借助调用栈。镜子中的镜子，层层深入，总有终点。

Divide and Conquer: Break problem into subproblems, solve recursively, combine results. E.g. Merge Sort, Quick Sort.

分治法：将问题分解为子问题，递归求解后合并结果。如归并排序、快速排序。像整理卡片，先分组再排序。

Dynamic Programming: Solves problems by storing results of overlapping subproblems (memoisation). Example: Fibonacci with array.

动态规划：通过存储重叠子问题的结果（记忆化）来求解。例：用数组计算斐波那契。走迷宫记录已走过的死路。

Linear vs Binary Search: Linear searches sequentially O(n); Binary search splits sorted data O(log n).

线性搜索与二分搜索：线性逐项检查 O(n)；二分在有序数据中每次折半 O(log n)。二分好比翻字典。

---

5. System Software & Operating System | 系统软件与操作系统

Operating System (OS): Provides a user interface, manages hardware resources, controls file systems and runs applications.

操作系统：提供用户界面、管理硬件资源、控制文件系统并运行应用程序。是硬件和应用之间的“大管家”。

Kernel: Core of the OS that handles memory, process scheduling, and I/O; operates in protected mode.

内核：OS 核心，处理内存、进程调度和 I/O，运行在保护模式下。如同机场调度中心，不可随意触碰。

Interrupt: Signal from hardware/software causing the CPU to suspend current task and run an interrupt handler.

中断：硬件或软件发出的信号，使 CPU 挂起当前任务转而执行中断处理程序。好比老师突然点名，你停下笔响应。

Virtual Memory / Paging: Uses disk as extension of RAM; divides memory into fixed‑size pages to run larger programs.

虚拟内存/分页：用磁盘扩展内存，将内存分成固定大小的页以运行更大的程序。就像书桌放不下时借用书架。

Compiler vs Interpreter: Compiler translates entire source code to machine code before execution; Interpreter translates line‑by‑line at runtime.

编译器与解释器：编译器将全部源代码在执行前翻译为机器码；解释器运行时逐行翻译。前者像笔译整本书，后者像口译实时同传。

---

6. Computer Architecture | 计算机体系结构

Von Neumann Architecture: Shared bus for data and instructions, stored‑program concept; suffers from Von Neumann bottleneck.

冯·诺依曼体系：数据与指令共用总线，存储程序概念；存在冯·诺依曼瓶颈。程序存储在内存中，像食谱既可读也可改。

Control Unit (CU) / ALU: CU decodes instructions and controls execution; ALU performs arithmetic and logic operations.

控制单元 / 算术逻辑单元：CU 解码指令并控制执行；ALU 执行算术和逻辑运算。CU 是大脑，ALU 是计算器。

Registers: Tiny fast storage inside CPU: PC (program counter), MAR, MDR, CIR, ACC. Each has a dedicated role in the fetch‑execute cycle.

寄存器：CPU 内部极小的高速存储：PC（程序计数器）、MAR、MDR、CIR、ACC 等，在取指执行周期中各司其职。

Pipelining: Overlapping stages of instruction execution to improve throughput, but hazards may cause stalls.

流水线：重叠指令执行的各个阶段以提高吞吐量，但冒险可能导致停顿。类似工厂装配线并行处理。

RISC vs CISC: RISC uses simple, fixed‑length instructions; CISC has complex, variable‑length instructions. RISC is load‑store architecture.

RISC 与 CISC：RISC 采用简单定长指令；CISC 拥有复杂变长指令。RISC 是加载/存储架构，CISC 一条指令做更多事。

---

7. Networks & Communication | 网络与通信

TCP/IP Stack: Layered model: Application, Transport, Internet, Link. TCP ensures reliable data delivery; IP handles addressing/routing.

TCP/IP 协议栈：层级模型：应用层、传输层、网络层、链路层。TCP 保证可靠传输；IP 处理寻址与路由。

Packet Switching: Data split into packets with header (source, dest, sequence); each packet may take different routes.

分组交换：数据被拆分成带报头（源、目的、序号）的分组，各分组可经不同路由传输。像邮寄不同明信片。

Client‑Server vs P2P: Client‑server centralises resources; P2P shares resources directly among peers, more scalable.

客户‑服务器与对等网络：客户‑服务器集中管理资源；P2P 在节点间直接共享，扩展性更强。饭店点餐 vs 朋友间分享水果。

MAC Address / IP Address: MAC is physical, 48‑bit, unique to NIC; IP is logical, can change, used for routing.

MAC 地址 / IP 地址：MAC 是物理地址，48 位，网卡唯一；IP 是逻辑地址，可变化，用于路由。

Firewall / Proxy: Firewall filters incoming/outgoing packets based on rules; Proxy acts as intermediary, can cache and hide identity.

防火墙 / 代理：防火墙按规则过滤进出数据包；代理充当中介，可缓存内容并隐藏真实身份。

---

8. Databases & SQL | 数据库与 SQL

Relational Database: Organises data into tables (relations) with rows (tuples) and columns (attributes), linked by foreign keys.

关系型数据库：将数据组织为由行（元组）和列（属性）构成的表（关系），通过外键关联。如同 Excel 表格间建立链接。

Normalisation: Process of reducing data redundancy by splitting tables (1NF, 2NF, 3NF) to avoid update anomalies.

规范化：通过拆分表（1NF、2NF、3NF）减少数据冗余，避免更新异常。从小表做起，原子化数据。

SQL Queries: SELECT … FROM … WHERE … ORDER BY. DDL (CREATE, ALTER), DML (INSERT, UPDATE, DELETE).

SQL 查询：SELECT … FROM … WHERE … ORDER BY。DDL 定义结构，DML 操作数据。像用精准的语言向数据库提问。

Entity‑Relationship Diagram (ERD): Graphical representation of entities, attributes, and relationships (1:1, 1:M, M:N).

实体联系图 (ERD)：实体、属性及联系的图形表示（一对一等），是数据库设计的蓝图。

Indexing: Special lookup table to speed up searches, similar to a book index; implemented as B‑tree or hash.

索引：加速查找的特殊查找表，类似书籍索引；常用 B 树或哈希实现。为数据库表创建“目录”。

---

9. Data Representation & Binary | 数据表示与二进制

Sign & Magnitude vs Two’s Complement: Two’s complement is used for integers; MSb indicates sign, easy addition. Range: −2ⁿ⁻¹ to 2ⁿ⁻¹−1.

原码与补码：整数用补码表示；最高位为符号位，便于加法。范围：−2ⁿ⁻¹ 到 2ⁿ⁻¹−1。补码将减法变加法。

Floating Point: Normalised format ±1.mantissa × 2ˣᵖᵒⁿᵉⁿᵗ; stored as sign, exponent (biased) and mantissa.

浮点数：规格化形式 ±1.尾数 × 2指数；存储符号、指数（偏置）和尾数。科学记数法的二进制版。

Bitmap vs Vector Graphics: Bitmap is pixel grid; vector uses shapes described by equations. Bitmap suffers scaling distortion.

位图与矢量图：位图是像素网格；矢量用方程描述图形。位图放大会失真，矢量任意缩放不变。

Sound Sampling: Sampling rate × bit depth × channels gives bit rate. Nyquist: rate ≥ 2× max frequency.

声音采样：采样率 × 位深度 × 声道 = 比特率。奈奎斯特定理：采样率 ≥ 2倍最高频率。忠实记录波形关键点。

Compression (Lossy/Lossless): Lossless preserves exact original (run‑length, Huffman); Lossy removes redundant data (JPEG, MP3).

压缩（有损/无损）：无损保留原始数据（游程编码、哈夫曼）；有损移除冗余信息（JPEG、MP3）。无损像真空袋，有损像素描简笔画。

---

10. Security, Ethics & Law | 安全、伦理与法律

Encryption: Symmetric (same key) vs Asymmetric (public/private key pair). Common algorithms: AES, RSA. Digital signatures use hashing + private key.

加密：对称（同一密钥）与非对称（公钥/私钥对）。常用算法：AES、RSA。数字签名采用哈希加私钥。锁和钥匙的升级版。

Malware: Virus (attaches to files), worm (self‑replicates across network), trojan (disguised software), ransomware (encrypts data).

恶意软件：病毒（附着文件）、蠕虫（网络自我复制）、木马（伪装软件）、勒索软件（加密数据）。了解特点才能有效防御。

Phishing / Social Engineering: Tricking users into revealing credentials or sensitive info, often via fake emails/websites.

钓鱼/社会工程：通过虚假邮件或网站诱骗用户泄露凭证等敏感信息。不是攻系统，而是攻人心。

Data Protection Act / GDPR: Legal frameworks governing collection, storage and use of personal data, with rights for individuals.

数据保护法 / GDPR：管辖个人数据收集、存储和使用的法律框架，赋予个人权利。数据是金矿，法规是围栏。

Computer Misuse Act: Criminalises unauthorised access to computer material, often covering hacking and malware distribution.

计算机滥用法：将未经授权访问计算机资料定为犯罪，通常涵盖黑客行为与恶意软件传播。数字世界的红线。

---

11. Programming Paradigms & Languages | 编程范式与语言

Procedural Programming: Step‑by‑step instruction sequences, uses procedures/functions. Examples: C, Pascal. Focus on ‘how’.

过程式编程：分步骤的指令序列，使用过程/函数。例如 C、Pascal。重心在“怎么做”。

Object‑Oriented Programming: Organises code around objects with state and behaviour. Examples: Java, C++. Wraps data and methods together.

面向对象编程：围绕对象（具有状态和行为）组织代码。例如 Java、C++。将数据与方法打包成“活”的实体。

Declarative / Functional Programming: Declarative describes what to compute (SQL, HTML); Functional uses pure functions, recursion (Haskell).

声明式/函数式编程：声明式描述要计算什么（SQL、HTML）；函数式使用纯函数和递归（Haskell）。只关心结果，不操心步骤。

Low‑level vs High‑level Languages: Low‑level (assembly) close to hardware, hard to read; High‑level (Python) portable and human‑readable.

低级与高级语言：低级语言（汇编）接近硬件，难读；高级语言（Python）可移植且易读。机器方言对比人类语言。

Translators: Assembler, Compiler, Interpreter: Assembler converts assembly to machine code; Compiler creates standalone executable; Interpreter executes on‑the‑fly.

翻译器：汇编器、编译器、解释器：汇编器将汇编转为机器码；编译器生成独立可执行文件；解释器即时执行。三种翻译官，各有专长。

---

12. Advanced Concepts (Recursion, AI, Big Data) | 高级概念（递归、人工智能、大数据）

Recursion Base Case & Stack Overflow: Without a reachable base case, recursion leads to infinite calls and stack overflow. Careful design needed.

递归基例与栈溢出：没有可达基例会导致无限递归和栈溢出。必须设计好停止条件，如套娃最里层的实心娃娃。

Memoisation: Caching results of expensive function calls for future use. Transforms exponential recursion to polynomial in DP.

记忆化：缓存代价高昂的函数调用结果，供后续使用。把算过的记下来，避免重复劳动。

Artificial Intelligence (Narrow / General): Narrow AI performs specific tasks (chess, voice assistants); General AI (AGI) would match human cognition.

人工智能（弱/强）：弱 AI 执行特定任务（下棋、语音助手）；通用 AI 达到人类认知水平。现阶段几乎所有 AI 都是弱 AI。

Big Data (Volume, Velocity, Variety, Veracity): Datasets too large for traditional processing; MapReduce, distributed storage handle 4Vs.

大数据（4V）：数据量大、速度快、种类多、真实性不确定；传统技术无法处理。MapReduce、分布式存储应对 4V 挑战。

Boolean Algebra & Logic Gates: AND, OR, NOT, NAND, NOR, XOR. De Morgan’s laws: ¬(A·B) = ¬A + ¬B. Foundation of digital circuits.

布尔代数与逻辑门：与、或、非、与非、或非、异或。德摩根定律：¬(A·B) = ¬A + ¬B。数字电路的基石，用真值表验证。

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

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