📚 Pre-U CAIE Computer Science Vocabulary & Terminology Memorisation Guide | Pre-U CAIE 计算机科学词汇术语速记指南
Mastering the precise vocabulary of Computer Science is essential for success in the CAIE Pre-U examination. This guide groups key terms by topic, providing clear definitions alongside efficient memorisation strategies such as chunking, etymology breakdown, and acronym recall. Each entry pairs the English term with its Chinese equivalent, helping you build a bilingual mental lexicon that sharpens both understanding and exam responses.
掌握计算机科学的精确词汇是在 CAIE Pre-U 考试中取得成功的关键。本指南按主题对关键术语进行分组，提供清晰的定义以及高效的记忆策略，例如组块法、词源拆解和首字母缩写回忆。每个条目将英文术语与其中文对应词配对，帮助你构建双语心理词库，从而提升理解能力和答题表现。
1. Foundational Architecture Terms | 基础架构术语
The Central Processing Unit (CPU) is the core component that executes instructions and manages data flow. It consists of the control unit, arithmetic logic unit, and registers.
中央处理器 (CPU) 是执行指令和管理数据流的核心组件。它由控制单元、算术逻辑单元和寄存器组成。
In the Von Neumann architecture, both data and instructions are stored in a single memory unit, sharing the same bus. This contrasts with the Harvard architecture, which uses separate buses for instructions and data, enabling parallel access.
在冯·诺依曼架构中，数据和指令存储在同一内存单元中，共享同一条总线。这与哈佛架构形成对比，后者为指令和数据使用独立的总线，支持并行访问。
A system bus comprises the address bus, data bus, and control bus. The address bus carries memory locations (unidirectional), the data bus transfers actual data (bidirectional), and the control bus transmits timing and command signals.
系统总线 由地址总线、数据总线和控制总线组成。地址总线传输内存地址（单向），数据总线传输实际数据（双向），控制总线传输定时和命令信号。
| Term | Memory Trick |
| Von Neumann | 'One Memory' – think 'one' as in 'one bottle of Neumann wine holding both data and instructions'. |
| Harvard | 'H' for 'hardware separation' – imagine two separate library rooms at Harvard. |
| 术语 | 记忆技巧 |
| 冯·诺依曼 | “单内存” – 想象一瓶诺依曼葡萄酒，里面同时装着数据和指令。 |
| 哈佛 | “H” 代表硬件分离 – 想象哈佛大学里两个独立的图书室。 |
2. Data Representation Units | 数据表示单位
A bit (binary digit) is the smallest unit of data, holding either 0 or 1. Eight bits form a byte, traditionally the amount needed to encode a single character in ASCII.
比特（二进制位）是最小的数据单位，值为 0 或 1。8 个比特组成一个字节，传统上是 ASCII 编码单个字符所需的量。
Larger units follow powers of two: a kibibyte (KiB) equals 2¹⁰ bytes (1024 bytes), a mebibyte (MiB) equals 2²⁰ bytes, and a gibibyte (GiB) equals 2³⁰ bytes. The decimal counterparts (kilobyte, megabyte, gigabyte) use powers of 10 and are often used by storage manufacturers, causing confusion.
更大的单位遵循 2 的幂次：kibibyte (KiB) 等于 2¹⁰ 字节（1024 字节），mebibyte (MiB) 等于 2²⁰ 字节，gibibyte (GiB) 等于 2³⁰ 字节。十进制对应单位（千字节、兆字节、吉字节）使用 10 的幂次，常被存储制造商使用，容易引起混淆。
A word is the natural unit size of a processor, typically matching the width of internal registers (e.g., 32‑bit or 64‑bit). Understanding word size is crucial for grasping addressing limits and integer range.
字 是处理器的自然单位大小，通常与内部寄存器的宽度匹配（如 32 位或 64 位）。理解字大小对于掌握寻址限制和整数范围至关重要。
- Nibble: 4 bits, half a byte, useful for hexadecimal shorthand.
- 半字节 (nibble): 4 位，相当于半个字节，常用于十六进制简写。
3. Boolean Logic Operators | 布尔逻辑运算符
Boolean algebra uses three fundamental operations: AND (conjunction), OR (disjunction), and NOT (negation). NAND and NOR are universal gates; any logic circuit can be built from NAND gates alone.
布尔代数使用三种基本运算：AND（与）、OR（或）和 NOT（非）。NAND（与非）和 NOR（或非）是通用门；任何逻辑电路都可以仅由 NAND 门构建。
XOR (exclusive OR) outputs true only when inputs differ. It is widely used in parity checking and encryption. XNOR (equivalence) gives true when inputs are identical.
XOR（异或）仅在输入不同时输出真。它广泛用于奇偶校验和加密。XNOR（同或）在输入相同时输出真。
Truth tables systematically display all input combinations. A minterm is a product term that is true for exactly one combination; a maxterm is a sum term false for exactly one combination.
真值表系统地展示所有输入组合。最小项 是在恰好一种组合下为真的积项；最大项 是在恰好一种组合下为假的和项。
- De Morgan's Laws: NOT(A AND B) = (NOT A) OR (NOT B); NOT(A OR B) = (NOT A) AND (NOT B)
- 德摩根定律：非(A 与 B) = (非 A) 或 (非 B)；非(A 或 B) = (非 A) 与 (非 B)
4. Processor Components & Cycle | 处理器组件与周期
The Arithmetic Logic Unit (ALU) performs arithmetic and bitwise logic operations. The Control Unit (CU) decodes instructions and orchestrates data movement through control signals.
算术逻辑单元 (ALU) 执行算术和按位逻辑运算。控制单元 (CU) 解码指令并通过控制信号协调数据移动。
Registers are high‑speed on‑chip storage locations. Key registers include the Program Counter (PC), which holds the address of the next instruction; the Memory Address Register (MAR), holding the address to be accessed; the Memory Data Register (MDR), holding the data read or to be written; the Current Instruction Register (CIR), holding the instruction being decoded; and the Accumulator (ACC), storing results of ALU operations.
寄存器 是高速的片上存储位置。关键寄存器包括：程序计数器 (PC)，存放下一条指令的地址；内存地址寄存器 (MAR)，存放要访问的地址；内存数据寄存器 (MDR)，存放读取或待写入的数据；当前指令寄存器 (CIR)，存放正在解码的指令；以及累加器 (ACC)，存储 ALU 的运算结果。
The fetch‑decode‑execute cycle repeats continuously: fetch copies the instruction from memory (address in PC) into MDR then CIR, decode analyses the opcode and operands, execute performs the operation, and the PC increments (unless a jump occurs).
取指‑解码‑执行周期 不断重复：取指将指令从内存（PC 中的地址）复制到 MDR 再复制到 CIR，解码分析操作码和操作数，执行执行操作，PC 自增（除非发生跳转）。
Pipelining overlaps stages of multiple instructions to improve throughput, analogous to an assembly line.
流水线技术重叠多个指令的不同阶段以提高吞吐量，类似于装配线。
5. Memory Hierarchy & Types | 存储器层次与类型
Memory is organised in a hierarchy balancing speed, cost, and capacity. From fastest to slowest: registers, cache (L1, L2, L3), main memory (RAM), and secondary storage (HDD, SSD).
存储器按层次组织，平衡速度、成本和容量。从快到慢依次为：寄存器、缓存（L1、L2、L3）、主存 (RAM) 和辅助存储器（HDD、SSD）。
RAM (Random Access Memory) is volatile, direct‑access, and used for currently running programs and data. ROM (Read‑Only Memory) is non‑volatile and stores firmware such as the BIOS. SRAM uses flip‑flops for cache (faster, more expensive), while DRAM uses capacitors and must be refreshed periodically (main memory).
RAM（随机存取存储器） 易失、可直接访问，用于存储当前运行的程序和数据。ROM（只读存储器） 非易失，存储例如 BIOS 的固件。SRAM 使用触发器用于缓存（更快，更贵），DRAM 使用电容，必须定期刷新（主存）。
Cache performs spatial and temporal locality: if an address is accessed, nearby addresses are likely to be accessed soon (spatial), and if it is used once, it is likely to be used again (temporal).
缓存利用空间局部性和时间局部性：若某地址被访问，其附近地址很可能很快也会被访问（空间）；若某数据被使用过一次，则很可能再次被使用（时间）。
6. I/O & Storage Devices | 输入输出与存储设备
Input devices convert external data into machine‑readable form. Examples: keyboard, mouse, microphone, barcode scanner. Output devices convert digital signals into human‑readable form. Examples: monitor, printer, speaker. Touchscreens act as both I and O.
输入设备 将外部数据转换为机器可读的形式。例如：键盘、鼠标、麦克风、条码扫描器。输出设备 将数字信号转换为人类可读的形式。例如：显示器、打印机、扬声器。触摸屏 兼具输入与输出功能。
Secondary storage is non‑volatile. Magnetic (HDD) uses spinning platters and a read/write head; data is organised in tracks and sectors. Solid State (SSD) uses NAND flash memory with no moving parts, offering faster random access and lower latency. Optical (CD, DVD, Blu‑ray) uses laser to read pits and lands.
辅助存储器 是非易失的。磁性（HDD）使用旋转盘片和读/写磁头；数据按磁道和扇区组织。固态（SSD）使用 NAND 闪存，无移动部件，提供更快的随机访问和更低的延迟。光学（CD、DVD、蓝光）使用激光读取凹坑和平面。
Virtual storage, or paging, uses a portion of a secondary storage as an extension of RAM. The operating system swaps pages between RAM and the swap file/partition.
虚拟存储，或分页，使用一部分辅助存储器作为 RAM 的扩展。操作系统在 RAM 和交换文件/分区之间交换页面。
7. Operating System Concepts | 操作系统概念
The kernel is the core of the OS, managing resources and providing hardware abstraction. Interrupt signals (hardware or software) cause the CPU to suspend current tasks, execute an interrupt service routine (ISR), and resume.
内核 是操作系统的核心，管理资源并提供硬件抽象。中断 信号（硬件或软件）使 CPU 暂停当前任务，执行中断服务例程 (ISR)，然后恢复。
Process is a program in execution with its own memory space. Thread is a lightweight unit within a process sharing the same address space. Scheduling algorithms (Round Robin, First Come First Served, Multi‑level Feedback Queue) decide the allocation of CPU time.
进程 是一个正在执行的程序，拥有自己的内存空间。线程 是进程内的轻量级单元，共享相同的地址空间。调度 算法（轮转、先来先服务、多级反馈队列）决定 CPU 时间的分配。
Deadlock occurs when processes wait indefinitely for resources held by each other; four conditions must hold: mutual exclusion, hold and wait, no preemption, circular wait.
死锁 发生在进程无限期地等待对方持有的资源时；必须满足四个条件：互斥、持有并等待、不可抢占、循环等待。
Paging and segmentation are memory management techniques. Paging divides physical memory into fixed‑size frames and logical memory into pages, while segmentation uses variable‑sized segments corresponding to programme structure.
分页 和分段 是内存管理技术。分页将物理内存划分为固定大小的帧，将逻辑内存划分为页；分段则使用与程序结构对应的可变大小段。
8. Networking Acronyms & Protocols | 网络缩写与协议
The OSI model has seven layers: Physical, Data Link, Network, Transport, Session, Presentation, Application. A mnemonic: Please Do Not Throw Sausage Pizza Away. The TCP/IP suite reduces this to four layers: Link, Internet, Transport, Application.
OSI 模型 有七层：物理层、数据链路层、网络层、传输层、会话层、表示层、应用层。助记：请勿扔掉香肠披萨。TCP/IP 协议族简化为四层：链路层、互联网层、传输层、应用层。
MAC address is a 48‑bit hardware identifier (e.g., 00:1A:2B:3C:4D:5E) used within a local network. IP address (IPv4: 32‑bit, IPv6: 128‑bit) identifies devices on a network logically.
MAC 地址 是 48 位硬件标识符（如 00:1A:2B:3C:4D:5E），用于本地网络内。IP 地址（IPv4：32 位，IPv6：128 位）在逻辑上标识网络上的设备。
Protocols summary:
协议摘要：
- HTTP/HTTPS: Hypertext Transfer Protocol / Secure, for web pages. Port 80/443.
- HTTP/HTTPS: 超文本传输协议/安全版，用于网页。端口 80/443。
- FTP: File Transfer Protocol, port 21.
- FTP: 文件传输协议，端口 21。
- SMTP: Simple Mail Transfer Protocol, for sending email, port 25.
- SMTP: 简单邮件传输协议，用于发送邮件，端口 25。
- POP3/IMAP: Post Office Protocol 3 / Internet Message Access Protocol, for retrieving email.
- POP3/IMAP: 邮局协议 3 / 互联网消息访问协议，用于接收邮件。
- DNS: Domain Name System, translates domain names to IP addresses, port 53.
- DNS: 域名系统，将域名转换为 IP 地址，端口 53。
- DHCP: Dynamic Host Configuration Protocol, assigns IP addresses automatically.
- DHCP: 动态主机配置协议，自动分配 IP 地址。
9. Database & SQL Keywords | 数据库与 SQL 关键词
A relational database organises data into tables (relations) with rows (tuples) and columns (attributes). Primary key uniquely identifies each row; foreign key links to a primary key in another table.
关系数据库 将数据组织为表（关系），包含行（元组）和列（属性）。主键 唯一标识每一行；外键 链接到另一表中的主键。
ACID properties: Atomicity (all or nothing), Consistency (valid state transitions), Isolation (concurrent transactions do not interfere), Durability (committed data persists).
ACID 特性：原子性（全做或全不做）、一致性（有效的状态转换）、隔离性（并发事务互不干扰）、持久性（已提交的数据持久保存）。
Essential SQL clauses:
核心 SQL 子句：
- SELECT columns FROM table WHERE condition;
- SELECT 列名 FROM 表名 WHERE 条件；
- JOIN combines rows from multiple tables: INNER JOIN, LEFT JOIN, RIGHT JOIN.
- JOIN 合并多张表的行：INNER JOIN、LEFT JOIN、RIGHT JOIN。
- GROUP BY groups rows with aggregation functions (COUNT, SUM, AVG).
- GROUP BY 配合聚合函数（COUNT、SUM、AVG）对行分组。
- ORDER BY sorts results ascending (ASC) or descending (DESC).
- ORDER BY 对结果排序，升序 (ASC) 或降序 (DESC)。
- INSERT INTO table (cols) VALUES (vals); UPDATE table SET col=val WHERE; DELETE FROM table WHERE;
- INSERT INTO 表名 (列) VALUES (值); UPDATE 表名 SET 列=值 WHERE; DELETE FROM 表名 WHERE;
10. Programming Paradigms & Constructs | 编程范式与结构
Imperative programming specifies how to achieve a result step by step. Procedural (e.g., C) organises code into procedures/functions; Object‑Oriented (e.g., Java) models entities as objects with attributes and methods, featuring encapsulation, inheritance, polymorphism.
命令式 编程逐步指定如何达成结果。过程式（如 C）将代码组织为过程/函数；面向对象（如 Java）将实体建模为具有属性和方法的对象，具备封装、继承、多态等特性。
Declarative programming describes what the outcome should be without explicit control flow. Functional (e.g., Haskell) uses mathematical functions, avoiding side effects; Logic (e.g., Prolog) relies on facts and rules to infer answers.
声明式 编程描述结果应是什么样，而不指定显式的控制流。函数式（如 Haskell）使用数学函数，避免副作用；逻辑式（如 Prolog）依赖事实和规则来推断答案。
Core constructs: sequence (execution line by line), selection (if‑else, switch), iteration (for, while, do‑while). Understand the difference between recursion (function calling itself) and iteration.
核心结构：顺序（逐行执行）、选择（if‑else、switch）、迭代（for、while、do‑while）。理解递归（函数调用自身）与迭代的区别。
Variable scope: local (inside a function), global (accessible everywhere). Parameter passing can be by value (copy) or by reference (address).
变量作用域：局部（函数内部），全局（可随处访问）。参数传递 可以是传值（复制）或传引用（地址）。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图