📚 Pre-U CIE Computer Science: Vocabulary & Terminology Quick-Memorisation Guide | Pre-U CIE 计算机：词汇术语速记指南
Mastering the vast collection of technical terms in the Pre-U CIE Computer Science syllabus can feel overwhelming, but a systematic approach to memorisation turns jargon into second nature. This guide breaks down key vocabulary into thematic clusters, pairs every English definition with a clear Chinese explanation, and shares powerful mnemonic techniques to help you recall terms precisely under exam pressure.
掌握 Pre-U CIE 计算机科学大纲中庞大的技术词汇可能让人望而生畏，但系统化的记忆方法能把行话变成第二本能。本指南将关键词汇分成主题聚类，为每个英文定义搭配清晰的中文解释，并分享强大的助记技巧，帮助你在考试压力下精准回忆术语。
1. Data Types, Structures & Abstract Data Types | 数据类型、结构与抽象数据类型
A primitive data type is a basic building block provided by a programming language, such as integer, character, floating-point, and boolean. These cannot be broken into simpler types at the language level.
基本数据类型是编程语言提供的基础构建块，如整型、字符型、浮点型和布尔型。它们在语言层次上不能再分成更简单的类型。
Composite data types combine primitives into more complex structures. A record (or struct) groups related fields of possibly different types under one name, an array stores elements of the same type in contiguous memory with index-based access, and a string is typically an array of characters.
复合数据类型将基本类型组合成更复杂的结构。记录（或结构体）将可能不同类型的相关字段组合在一个名称下，数组在连续内存中存储同类型元素并通过索引访问，字符串通常是字符的数组。
An Abstract Data Type (ADT) is a logical description of data and the operations that can be performed on it, independent of any specific implementation. Examples include stack (LIFO – last in, first out), queue (FIFO – first in, first out), list, and dictionary.
抽象数据类型（ADT）是对数据及可在其上执行的操作的逻辑描述，独立于任何具体实现。例子包括栈（后进先出）、队列（先进先出）、列表和字典。
A linked list is a dynamic data structure where each node contains data and a pointer to the next node; it overcomes the fixed-size limitation of arrays but lacks direct indexing.
链表是一种动态数据结构，每个节点包含数据和指向下一个节点的指针；它克服了数组固定大小的限制，但缺少直接索引。
Tree terminology includes root, child, parent, leaf, and subtree. A binary tree restricts each node to at most two children; a binary search tree (BST) further orders keys such that left child ≤ parent ≤ right child, enabling O(log n) average-case search.
树的相关术语包括根、子节点、父节点、叶节点和子树。二叉树限制每个节点最多有两个子节点；二叉搜索树（BST）进一步对键排序，使得左子节点 ≤ 父节点 ≤ 右子节点，实现平均 O(log n) 的搜索。
2. Algorithmic Thinking & Complexity | 算法思维与复杂度
An algorithm is a finite sequence of unambiguous, executable steps that solves a problem. Key properties include definiteness, finiteness, effectiveness, and input/output specification.
算法是解决某一问题的有限、无歧义、可执行的步骤序列。关键特性包括确定性、有穷性、有效性和输入/输出规范。
Time complexity describes how the running time of an algorithm grows with input size n. Big O notation expresses the upper bound: O(1) constant, O(log n) logarithmic, O(n) linear, O(n log n) linearithmic, O(n²) quadratic, O(2ⁿ) exponential.
时间复杂度描述算法运行时间如何随输入规模 n 增长。大 O 符号表示上界：O(1) 常数，O(log n) 对数，O(n) 线性，O(n log n) 线性对数，O(n²) 平方，O(2ⁿ) 指数。
Space complexity considers both auxiliary (extra) space and the space used by the input. Tail recursion is an optimisation where a recursive call is the last operation, allowing the compiler to reuse stack frames for constant space.
空间复杂度同时考虑辅助（额外）空间和输入占用的空间。尾递归是一种优化，其中递归调用是最后一步操作，使编译器可以重用栈帧以保持常数空间。
Search algorithms: linear search examines each element sequentially (O(n)); binary search requires a sorted array and repeatedly divides the search interval in half (O(log n)).
搜索算法：线性搜索依次检查每个元素 (O(n))；二分搜索需要已排序数组并反复将搜索区间减半 (O(log n))。
Sorting algorithms: bubble sort swaps adjacent out-of-order elements (O(n²)), merge sort uses divide-and-conquer splitting and merging (O(n log n)), and quick sort picks a pivot, partitions, and recursively sorts sub-arrays (average O(n log n), worst O(n²)).
排序算法：冒泡排序交换相邻乱序元素 (O(n²))，归并排序使用分治法的分割与归并 (O(n log n))，快速排序选取基准、分区并递归排序子数组（平均 O(n log n)，最坏 O(n²)）。
3. Programming Paradigms & Concepts | 编程范式与概念
Procedural programming organises code into procedures (functions) that perform operations. The focus is on sequences of commands, using variables and control structures such as loops and conditionals.
过程式编程将代码组织为执行操作的过程（函数）。重点在于命令序列，使用变量和控制结构，如循环和条件语句。
Object-oriented programming (OOP) models real-world entities as objects that combine state (attributes) and behaviour (methods). Key principles: encapsulation hides internal state, inheritance allows subclassing, and polymorphism lets a single interface work with different data types.
面向对象编程（OOP）将现实世界的实体建模为对象，结合状态（属性）和行为（方法）。关键原则：封装隐藏内部状态，继承允许子类化，多态使单一接口可作用于不同数据类型。
Declarative programming focuses on what the outcome should be rather than how to achieve it. Functional programming, a subset of declarative style, treats computation as evaluation of mathematical functions, avoids side effects, and uses first-class and higher-order functions.
声明式编程关注结果应是什么，而非如何实现。函数式编程是声明式风格的一种，将计算视为对数学函数的求值，避免副作用，并使用一等函数和高阶函数。
Compilation vs interpretation: a compiler translates the entire source code into machine code before execution, generating an independent executable; an interpreter translates and executes code line by line.
编译与解释：编译器在执行前将整个源代码翻译成机器代码，生成独立的可执行文件；解释器逐行翻译并执行代码。
Scope refers to the region of a program where a variable name is visible. Local scope is limited to a function, global scope extends across the whole module. Parameter passing methods: pass-by-value copies the argument; pass-by-reference passes the memory address allowing modification of the original variable.
作用域指程序中变量名可见的区域。局部作用域限于函数内部，全局作用域扩展到整个模块。参数传递方式：按值传递复制实参；按引用传递传递内存地址，允许修改原始变量。
4. Computer Architecture & Organisation | 计算机组成与体系结构
The CPU consists of the Control Unit (CU), Arithmetic Logic Unit (ALU), and registers. The CU fetches and decodes instructions, directing data flow; the ALU performs arithmetic and logic operations.
CPU 由控制单元（CU）、算术逻辑单元（ALU）和寄存器组成。CU 取指并译码，指导数据流；ALU 执行算术和逻辑运算。
The fetch–decode–execute cycle: the Program Counter (PC) holds the address of the next instruction; the instruction is fetched into the Memory Address Register (MAR) and Memory Data Register (MDR), moved to the Current Instruction Register (CIR), decoded by the CU, and then executed, after which the PC is incremented.
取指–译码–执行周期：程序计数器（PC）存放下一条指令的地址；指令被取到内存地址寄存器（MAR）和内存数据寄存器（MDR），移至当前指令寄存器（CIR），由 CU 译码，然后执行，之后 PC 递增。
Memory hierarchy: registers (fastest, smallest), cache (SRAM, multiple levels), main memory (DRAM, volatile), and secondary storage (HDD, SSD, non-volatile). Locality of reference explains why caching works: temporal locality reuses recently accessed data, spatial locality accesses nearby addresses.
存储器层次结构：寄存器（最快、最小）、缓存（SRAM，多级）、主存（DRAM，易失）和辅助存储（HDD、SSD，非易失）。访问局部性解释了缓存有效的原因：时间局部性重用最近访问的数据，空间局部性访问相近地址。
Buses are communication pathways: address bus (one-way, carries memory addresses from CPU), data bus (bi-directional, carries data), control bus (carries control signals like read/write, clock).
总线是通信通路：地址总线（单向，从 CPU 传递内存地址）、数据总线（双向，传输数据）、控制总线（传输读/写、时钟等控制信号）。
5. Operating Systems & System Software | 操作系统与系统软件
An operating system (OS) manages hardware resources and provides a user interface. Kernel is the core component that runs in privileged mode, handling process scheduling, memory management, and device drivers.
操作系统（OS）管理硬件资源并提供用户接口。内核是在特权模式下运行的核心组件，处理进程调度、内存管理和设备驱动程序。
Process states: new, ready, running, blocked (waiting for I/O), terminated. The scheduler uses algorithms like round-robin (equal time slices), first-come-first-served, shortest job first, and multilevel feedback queues to maximise CPU utilisation.
进程状态：新建、就绪、运行、阻塞（等待 I/O）、终止。调度器使用轮转（等长时间片）、先来先服务、最短作业优先和多级反馈队列等算法以最大化 CPU 利用率。
Virtual memory uses paging or segmentation to extend logical address space onto disk, allowing larger programs to run than physical RAM. Pages are transferred between RAM and disk via demand paging; page faults occur when a required page is not in memory.
虚拟内存使用分页或分段将逻辑地址空间扩展到磁盘上，允许运行比物理 RAM 更大的程序。页面通过请求调页在 RAM 和磁盘间传输；当所需页面不在内存中时发生缺页错误。
File systems organise data into files and directories with metadata like permissions, timestamps, and ownership. Fragmentation occurs when free space or file blocks are non-contiguous; defragmentation reorganises blocks to improve access speed.
文件系统将数据组织为文件和目录，包含权限、时间戳和所有者等元数据。当空闲空间或文件块不连续时产生碎片；磁盘碎片整理重新组织块以提高访问速度。
6. Networking & Communication | 网络与通信
A network connects autonomous computers to share resources. LAN (Local Area Network) spans a building or campus; WAN (Wide Area Network) crosses geographic regions. Topologies include star, bus, ring, and mesh; star is most common in Ethernet LANs with a central switch.
网络将自主计算机连接起来以共享资源。LAN（局域网）覆盖一栋建筑或校园；WAN（广域网）跨地理区域。拓扑结构包括星型、总线型、环型和网状型；星型在以太网 LAN 中最常用，以中央交换机为核心。
The OSI model and TCP/IP stack conceptualise networking layers. TCP (Transmission Control Protocol) provides connection-oriented, reliable data delivery with flow control; UDP (User Datagram Protocol) is connectionless, lower overhead, used for streaming. IP (Internet Protocol) handles addressing and routing packets.
OSI 模型和 TCP/IP 协议栈对网络分层进行概念化。TCP（传输控制协议）提供面向连接的、可靠的数据传送并带有流量控制；UDP（用户数据报协议）无连接、开销小，用于流媒体。IP（互联网协议）负责寻址和路由数据包。
Key address concepts: MAC address is a 48-bit hardware identifier burned into the NIC; IPv4 uses 32-bit dotted-decimal, IPv6 uses 128-bit hexadecimal. Routers forward packets between different networks using routing tables; a switch forwards frames within the same LAN using MAC addresses.
关键地址概念：MAC 地址是烧录在网卡中的 48 位硬件标识符；IPv4 使用 32 位点分十进制，IPv6 使用 128 位十六进制。路由器使用路由表在不同网络间转发数据包；交换机在同一 LAN 内使用 MAC 地址转发帧。
Protocols: HTTP/HTTPS for web, FTP for file transfer, SMTP/POP3/IMAP for email, DNS translates domain names to IP addresses. Packet switching breaks data into packets that travel independently; circuit switching establishes a dedicated path like in traditional telephony.
协议：HTTP/HTTPS 用于网页，FTP 用于文件传输，SMTP/POP3/IMAP 用于电子邮件，DNS 将域名转换为 IP 地址。分组交换将数据分成独立传输的分组；电路交换建立专用通路，如传统电话系统。
7. Databases & Information Systems | 数据库与信息系统
A relational database organises data into tables (relations) with rows (tuples) and columns (attributes). Each table has a primary key that uniquely identifies a record; a foreign key links to a primary key in another table, establishing a relationship.
关系数据库将数据组织为表（关系），包含行（元组）和列（属性）。每个表有一个主键唯一标识记录；外键链接到另一表的主键，建立关系。
SQL (Structured Query Language) is used to define, manipulate, and query data. DDL (Data Definition Language) includes commands like CREATE, ALTER, DROP. DML (Data Manipulation Language) includes SELECT, INSERT, UPDATE, DELETE. A join clause combines rows from multiple tables based on a related column.
SQL（结构化查询语言）用于定义、操作和查询数据。DDL（数据定义语言）包含 CREATE、ALTER、DROP 等命令。DML（数据操纵语言）包含 SELECT、INSERT、UPDATE、DELETE。连接子句基于相关列组合多个表的行。
Normalisation reduces data redundancy and dependency anomalies. 1NF requires atomic values; 2NF removes partial dependencies (non-key attributes must depend on the whole primary key); 3NF removes transitive dependencies (non-key attributes must depend only on the primary key).
规范化减少数据冗余和依赖异常。1NF 要求原子值；2NF 消除部分依赖（非键属性必须依赖于整个主键）；3NF 消除传递依赖（非键属性必须仅依赖于主键）。
ACID properties ensure reliable transaction processing: Atomicity (all or nothing), Consistency (database rules obeyed), Isolation (concurrent transactions appear sequential), Durability (committed changes permanent).
ACID 特性确保可靠的事务处理：原子性（全做或全不做）、一致性（遵守数据库规则）、隔离性（并发事务看起来是顺序的）、持久性（已提交的更改是永久的）。
8. Software Engineering & Development Methodologies | 软件工程与开发方法
The software development life cycle (SDLC) includes stages: feasibility study, requirements analysis, design, implementation, testing, deployment, and maintenance. Waterfall model is sequential; Agile methods use iterative sprints with continuous feedback; Extreme Programming (XP) emphasises pair programming, test-driven development, and frequent releases.
软件开发生命周期（SDLC）包括：可行性研究、需求分析、设计、实现、测试、部署和维护等阶段。瀑布模型是顺序的；敏捷方法使用带有持续反馈的迭代冲刺；极限编程（XP）强调结对编程、测试驱动开发和频繁发布。
Verification checks if the product is built right (conforming to specifications); validation checks if the right product is built (meeting user needs). Testing levels: unit testing (individual modules), integration testing (combined modules), system testing (whole system), acceptance testing (user environment).
验证检验产品是否被正确构建（符合规格）；确认检验是否构建了正确的产品（满足用户需求）。测试层次：单元测试（个别模块）、集成测试（模块组合）、系统测试（整个系统）、验收测试（用户环境）。
Version control systems (e.g., Git) track file changes, support branching and merging, and enable collaborative development. A repository stores the full history; a commit represents a snapshot of changes.
版本控制系统（如 Git）跟踪文件变更，支持分支与合并，并支持协作开发。仓库存储完整历史；提交表示变更的快照。
9. Security, Ethics & Legal Aspects | 安全、伦理与法律问题
Malware (malicious software) includes viruses (self-replicating, attaches to files), worms (standalone, spreads via network), Trojan horses (disguised as legitimate software), spyware, ransomware, and adware. Phishing uses deceptive emails to steal credentials; social engineering manipulates people into divulging confidential information.
恶意软件包括病毒（自我复制，附加到文件）、蠕虫（独立，通过网络传播）、木马（伪装成合法软件）、间谍软件、勒索软件和广告软件。网络钓鱼使用欺骗性邮件窃取凭证；社会工程学操纵人们泄露机密信息。
Encryption transforms plaintext into ciphertext using an algorithm and key. Symmetric encryption uses the same key for encryption and decryption (e.g., AES); asymmetric encryption uses a key pair (public and private, e.g., RSA) for secure key exchange and digital signatures.
加密使用算法和密钥将明文转换为密文。对称加密使用相同密钥进行加解密（如 AES）；非对称加密使用密钥对（公钥和私钥，如 RSA）进行安全密钥交换和数字签名。
Firewalls monitor and filter incoming/outgoing network traffic based on a set of security rules, acting as a barrier between trusted and untrusted networks. A DMZ (demilitarised zone) exposes public-facing services while insulating the internal LAN.
防火墙基于一组安全规则监控和过滤进出网络流量，作为可信与不可信网络之间的屏障。DMZ（隔离区）暴露面向公众的服务，同时隔离内部 LAN。
Computer ethics covers professional conduct, data privacy (e.g., GDPR), intellectual property rights, and the digital divide. The ACM Code of Ethics outlines principles like avoiding harm, respecting privacy, and being honest.
计算机伦理涵盖专业操守、数据隐私（如 GDPR）、知识产权和数字鸿沟。ACM 伦理准则阐述了避免伤害、尊重隐私和诚实等原则。
10. Boolean Algebra & Digital Logic | 布尔代数与数字逻辑
Logic gates are the building blocks of digital circuits: AND (output 1 if all inputs are 1), OR (1 if at least one input is 1), NOT (inverts the input), NAND, NOR, XOR (1 if an odd number of inputs is 1), XNOR. Truth tables exhaustively list the outputs for all input combinations.
逻辑门是数字电路的构建块：与门（所有输入均为 1 时输出 1）、或门（至少一个输入为 1 时输出 1）、非门（反转输入）、与非、或非、异或（输入中 1 的个数为奇数时输出 1）、同或。真值表穷举所有输入组合的输出。
De Morgan’s theorems: NOT (A AND B) = (NOT A) OR (NOT B); NOT (A OR B) = (NOT A) AND (NOT B). These are used to simplify Boolean expressions and implement circuits using only NAND or NOR gates.
德摩根定理：非 (A 与 B) = (非 A) 或 (非 B)；非 (A 或 B) = (非 A) 与 (非 B)。这些定理用于化简布尔表达式以及只用与非门或或非门实现电路。
A flip-flop is a bistable circuit that stores one bit. SR flip-flop has Set and Reset inputs; JK flip-flop eliminates the invalid state; D flip-flop delays the input and is used in registers; the circuit changes state on a clock edge.
触发器是存储一个位的双稳态电路。SR 触发器有置位和复位输入；JK 触发器消除了无效状态；D 触发器延迟输入，用于寄存器；电路在时钟边沿改变状态。
11. Computational Thinking & Problem Solving | 计算思维与问题求解
Abstraction is the process of filtering out unnecessary details to focus on the essential features of a problem. Decomposition breaks a complex problem into smaller, more manageable sub-problems. Pattern recognition identifies similarities between current and previously solved problems.
抽象是过滤掉不必要细节以关注问题基本特征的过程。分解将复杂问题拆分成更小、更易管理的子问题。模式识别识别当前问题与以往解决的问题之间的相似性。
An algorithm can be expressed in pseudocode, a structured mixture of natural language and programming constructs, or using flowcharts with symbols: oval for start/end, parallelogram for input/output, rectangle for processes, diamond for decisions, arrows for flow direction.
算法可以用伪代码表达，即自然语言与编程结构的结构化混合，或使用流程图符号：椭圆形表示开始/结束，平行四边形表示输入/输出，矩形表示处理过程，菱形表示决策，箭头表示流程方向。
Hand-tracing (dry running) involves manually stepping through code or pseudocode with a trace table to track variable values at each step, vital for debugging and understanding algorithm behaviour.
手工跟踪（桌面检查）涉及手动逐步执行代码或伪代码，使用跟踪表记录每一步的变量值，对调试和理解算法行为至关重要。
12. Quick-Memorisation Strategies & Mnemonic Toolkit | 速记策略与助记工具箱
Acronyms and acrostics compress multi-word terms into memorable chunks. For example, “All People Seem To Need Data Processing” maps the OSI layers Physical, Data Link, Network, Transport, Session, Presentation, Application. “Please Do Not Throw Sausage Pizza Away” does the same from bottom up.
首字母缩略词和藏头诗将多词术语压缩成易记的组块。例如，“All People Seem To Need Data Processing” 对应 OSI 层物理层、数据链路层、网络层、传输层、会话层、表示层、应用层。“Please Do Not Throw Sausage Pizza Away” 则从下到上进行对应。
For sorting algorithm complexities, use visual imagery: Bubble Sort is like bubbles slowly rising—slow (O(n²)). Merge Sort is like splitting a deck of cards in half repeatedly—divide and conquer (O(n log n)). Quick Sort is a race car with a pivot steering wheel—usually fast (average O(n log n)) but crashes on a bad track (worst O(n²)).
对于排序算法复杂度，使用视觉意象：冒泡排序像气泡慢慢上升——慢 (O(n²))。归并排序像反复将一副牌分成两半——分治 (O(n log n))。快速排序是一辆用基准方向盘的赛车——通常很快（平均 O(n log n)），但糟糕赛道会崩溃（最坏 O(n²)）。
Create bilingual flashcards: front side – English term, back side – Chinese equivalent plus a one-sentence definition in both languages. Use spaced repetition (review after 1 day, 1 week, 1 month) to move terms from short-term to long-term memory.
制作双语闪卡：正面——英文术语，背面——中文对等词加上两种语言的一句话定义。使用间隔重复（1 天、1 周、1 个月后复习）将术语从短期记忆移入长期记忆。
Draw concept maps linking related terms. For instance, link “Queue” to “FIFO”, “Enqueue”, “Dequeue”, “Linear Queue”, “Circular Queue”, “Breadth-First Search”. Use colour coding: green for data structures, blue for algorithms, red for architecture. The act of connecting ideas deepens association memory.
绘制概念地图连接相关术语。例如，将“队列”连接到“FIFO”、“入队”、“出队”、“线性队列”、“循环队列”、“广度优先搜索”。使用颜色编码：绿色表示数据结构，蓝色表示算法，红色表示体系结构。连接想法的行为能加深联想记忆。
Finally, practise past paper questions actively, writing definitions in your own words and comparing them with mark schemes. Teaching a term to a peer is the ultimate memorisation test—if you can explain “virtual memory” in both English and Chinese without notes, you truly own that term.
最后，积极练习历年试题，用自己的话写出定义并与评分方案对照。向同伴教授一个术语是终极记忆测试——如果你能不看笔记用中英文解释“虚拟内存”，你就真正掌握了该术语。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导