📚 AS CIE Computer Science: Vocabulary & Terminology Quick-Memorization Guide | AS CIE 计算机：词汇术语速记指南
Mastering the terminology of AS CIE Computer Science is half the battle. This guide presents key terms with memorable explanations, mnemonics, and bilingual clarity to help you recall definitions precisely under exam pressure. Each section focuses on a core topic, unpacking the jargon one pair of English–Chinese explanations at a time.
掌握 AS CIE 计算机科学的术语，就成功了一半。本文提供关键词汇，搭配好记的解释、助记法和中英对照，帮助你在考试压力下准确回忆定义。每一节围绕一个核心主题，逐条用英中配对的方式，一层层拆解专业术语。
1. Data Representation Basics | 数据表示基础
Bit: The smallest unit of data in a computer, representing a binary digit of 0 or 1. Think of it as a light switch — either off (0) or on (1).
位（比特）: 计算机中最小的数据单位，代表二进制数字 0 或 1。可以把它想象成一个灯开关——要么关（0），要么开（1）。
byte can represent 2⁸ = 256 distinct values. Remember that 8 bits make a byte by picturing 'B' and 'b': big B (Byte) contains 8 small b's (bits).
字节: 一组 8 个位，传统上用来编码一个字符。一个字节可以表示 2⁸ = 256 种不同的值。记住 8 个位构成一个字节：大写 B（Byte）里装着 8 个小 b（bit）。
Nibble: Half a byte, i.e., 4 bits. It is easy to remember because 'nibble' sounds like a small bite of a byte.
半字节: 半个字节，即 4 位。这个术语很好记，因为 nibble（轻咬）听起来就像是咬了一小口 byte。
Binary Denary Conversion: Transformation between base‑2 and base‑10. Use the column weights (128, 64, 32, 16, 8, 4, 2, 1) and sum those with a 1 underneath. For denary to binary, repeatedly divide by 2 and record remainders.
二进制与十进制转换: 基数为 2 与基数为 10 之间的转换。使用位权值（128, 64, 32, 16, 8, 4, 2, 1），将对应位为 1 的权值相加。十进制转二进制则反复除以 2 记录余数。
Hexadecimal: A base‑16 number system using digits 0–9 and letters A–F. Each hex digit represents exactly one nibble, making conversion to binary trivially group‑by‑4. This compact notation is widely used for memory addresses and colour codes.
十六进制: 基数为 16 的数制，使用数字 0–9 和字母 A–F。每个十六进制位恰好对应一个半字节，因此转换为二进制只需每 4 位一组。这种紧凑记法广泛用于内存地址和颜色编码。
2. Binary Arithmetic & Logic | 二进制运算与逻辑
addition exceeds the number of bits available, the most significant carry is lost. In an 8‑ with a carry out. Visualise a bucket overflowing when water is poured beyond its capacity.
溢出: 当二进制加法的结果超过可用位数时，最高位的进位会丢失。在 8 位寄存器中，11111111 + 1 会得到 00000000 并产生一个进位。想象往水桶里倒水，超出容量就会溢出。
Two' t acts as the sign bit (1 = negative). This representation makes subtraction possible by adding the two's complement.
二进制补码: 表示负二进制数的方法。对一个数求负，需要将所有位取反再加 1。最高有效位用作符号位（1 表示负）。这种表示法让减法可以通过加上补码来实现。
Logic Gates: Elementary building blocks (AND, OR, NOT, NAND, NOR, XOR) that perform boolean operations. Their truth tables define outputs for every input combination. Drawing the distinctive shapes — AND is a D, OR is a shield — helps recall their function.
逻辑门: 执行布尔运算的基本构件（AND, OR, NOT, NAND, NOR, XOR）。真值表定义了每种输入组合的输出。画出它们的独特形状——AND 像个 D 形，OR 像个盾牌——有助于记住其功能。
Karnaugh Map (K‑map): A grid‑based simplification tool for boolean expressions. Groups of adjacent 1s in powers of two eliminate variables. This technique reduces gate count in digital circuits and is a frequent exam skill.
卡诺图: 基于网格的布尔表达式化简工具。将相邻的 1 按 2 的幂次分组，可以消去变量。这项技术可以减少数字电路中的门数量，是常考的技能。
3. Data Structures & Abstract Data Types | 数据结构与抽象数据类型
g elements of the same data type. Indexing is direct and fast because the address of the i‑th element is base + (i × element size). Arrays are ideal for lookup tables and matrices.
数组: 一块静态、连续的内存区域，存储相同数据类型的元素。索引直接且快速，因为第 i 个元素的地址 = 基地址 + (i × 元素大小)。数组适合查找表和矩阵。
Linked List: A dynamic collection of nodes, each containing data and a pointer to the next node. Insertion and deletion are efficient, but random access is slow because you must traverse from the head. Imagine a treasure hunt where each clue points to the next.
链表: 节点的动态集合，每个节点包含数据和指向下一个节点的指针。插入和删除效率高，但随机访问慢，因为必须从头遍历。想象一个寻宝游戏，每条线索指向下一个地点。
Stack (LIFO): A Last‑In‑First‑Out structure. Push adds to the top; pop removes from the top. Applications include undo features, recursion call stack, and bracket matching. Visualise a stack of plates: you can only take the top plate.
栈（后进先出）: 一种后进先出的结构。Push 将元素加入顶部；Pop 从顶部移除。应用包括撤销功能、递归调用栈和括号匹配。想象一叠盘子：只能拿最上面的盘子。
Queue (FIFO): A First‑In‑First‑Out structure. Enqueue adds to the rear; dequeue removes from the front. Used in print spooling, task scheduling, and breadth‑first search. Picture a queue of people at a bus stop — first to arrive, first to board.
队列（先进先出）: 一种先进先出的结构。Enqueue 将元素加入队尾；Dequeue 从队首移除。用于打印缓冲、任务调度和广度优先搜索。想象公交车站排队的人群——先到先上车。
Record / Struct: A composite data type that groups related fields of potentially different types. Each field is accessed by name. Compare it to a form with labelled boxes: name, age, grade.
记录 / 结构体: 一种复合数据类型，将可能不同类型相关字段组合在一起。每个字段通过名称访问。好比一张带标签的表格：姓名、年龄、成绩。
4. Programming Concepts | 编程概念
Variable: A named storage location whose value can change during execution. The identifier references a memory address. Think of it as a labelled box where you can put different items.
变量: 一个命名的存储位置，其值在程序执行期间可以改变。标识符引用一个内存地址。把它看作贴了标签的盒子，可以放入不同的东西。
Constant: Similar to a variable but its value cannot be modified after initialisation. It improves code readability and prevents accidental changes. Declared with const or final in many languages.
常量: 类似变量，但初始化后值不可修改。它可以提高代码可读性并防止意外更改。许多语言用 const 或 final 声明。
Sequence, Selection, Iteration: The three fundamental control structures. Sequence executes statements in order. Selection (if‑else, switch) makes decisions. Iteration (for, while) repeats code. Every algorithm can be built from these three building blocks.
顺序、选择、迭代: 三种基本控制结构。顺序是按次序执行语句。选择（if‑else, switch）进行决策。迭代（for, while）循环执行代码。任何算法都能由这三种基本块构建。
Procedure vs Function: A procedure performs a task but returns no value; a function performs a task and returns a value. In pseudocode, PROCEDURE and FUNCTION keywords distinguish them. Functions often appear in expressions; procedures are called as statements.
过程与函数: 过程执行某个任务但不返回值；函数执行任务并返回一个值。在伪代码中，用 PROCEDURE 和 FUNCTION 关键字区分。函数常出现在表达式中；过程则作为语句调用。
Scope (Local vs Global): Local variables are declared inside a subroutine and exist only while it runs. Global variables are declared outside and are accessible throughout the program. Use local scope to avoid unintended side effects.
作用域（局部与全局）: 局部变量在子程序内部声明，仅在运行期间存在。全局变量在外部声明，整个程序都可访问。使用局部作用域以避免意外的副作用。
5. Software Development Life Cycle | 软件开发周期
Waterfall Model: A sequential development approach: analysis, design, implementation, testing, maintenance. Each phase must be completed before the next begins. Its rigidity makes changes costly once a phase is finished.
瀑布模型: 一种顺序开发方法：分析、设计、实施、测试、维护。每个阶段必须在下一阶段开始前完成。其僵化性导致一旦阶段结束，变更代价高昂。
Iterative / Rapid Application Development (RAD): Development cycles through repeated prototyping and user feedback. Requirements evolve with each iteration. This reduces overall risk but requires close customer involvement.
迭代 / 快速应用开发（RAD）: 通过反复原型设计和用户反馈迭代开发。需求随每次迭代演化。这降低了整体风险，但需要客户密切参与。
Alpha vs Beta Testing: Alpha testing is carried out in‑house by developers, often using white‑box techniques. Beta testing involves real users in a live environment, providing black‑box feedback. Alpha finds logic bugs; Beta finds usability and environment issues.
Alpha 测试与 Beta 测试: Alpha 测试由开发人员在内部进行，通常采用白盒技术。Beta 测试让真实用户在实际环境中进行，提供黑盒反馈。Alpha 发现逻辑错误；Beta 发现可用性和环境问题。
Black‑Box vs White‑Box Testing: Black‑box tests functionality against specifications without seeing internal code. White‑box tests internal logic, ensuring all paths and branches are exercised. Black‑box is like testing a car by driving it; white‑box is like examining the engine.
黑盒测试与白盒测试: 黑盒测试根据规格说明测试功能，不查看内部代码。白盒测试检验内部逻辑，确保所有路径和分支都被覆盖。黑盒好比开车试驾；白盒好比检查引擎。
6. Hardware Components | 硬件组件
CPU (Central Processing Unit): The brain of the computer, consisting of the Control Unit, ALU, and registers. It fetches, decodes, and executes instructions in a continuous cycle. Clock speed and cores determine performance.
中央处理器 (CPU): 计算机的大脑，由控制单元、算术逻辑单元和寄存器组成。它不断进行取指、译码、执行的循环。时钟频率和核心数量决定性能。
ALU (Arithmetic Logic Unit): The part of the CPU that performs arithmetic operations (add, subtract) and logical operations (AND, OR, NOT). It takes inputs from registers and outputs results back to a register or memory.
算术逻辑单元 (ALU): CPU 中执行算术运算（加、减）和逻辑运算（AND, OR, NOT）的部分。它从寄存器获取输入，将结果输出回寄存器或内存。
Von Neumann Architecture: A design where both data and instructions share the same memory and bus system. This simplicity leads to the 'Von Neumann bottleneck', where the CPU often waits for memory. Almost all modern computers are based on this concept.
冯·诺依曼架构: 一种数据和指令共享同一内存和总线系统的设计。这种简单性导致了'冯·诺依曼瓶颈'，即 CPU 经常需要等待内存。几乎所有现代计算机都基于此概念。
Primary Memory (RAM / ROM): RAM is volatile, fast, and holds currently running programs and data. ROM is non‑volatile, usually contains boot firmware (BIOS/UEFI), and cannot be easily altered. RAM is like a workbench; ROM is like an instruction manual stored in the drawer.
主内存（RAM / ROM）: RAM 是易失性的、快速的，存放当前运行的程序和数据。ROM 是非易失性的，通常包含启动固件（BIOS/UEFI），不易被改动。RAM 像工作台；ROM 像抽屉里的说明书。
7. Processor Architecture | 处理器架构
Register: Extremely fast, small storage locations inside the CPU. Special‑purpose registers include PC (Program Counter), MAR (Memory Address Register), MDR (Memory Data Register), CIR (Current Instruction Register). Each plays a vital role in the fetch‑decode‑execute cycle.
寄存器: CPU 内部极快的小存储位置。特殊用途寄存器包括 PC（程序计数器）、MAR（内存地址寄存器）、MDR（内存数据寄存器）、CIR（当前指令寄存器）。每一个在取指‑译码‑执行周期中都扮演关键角色。
Fetch‑Decode‑ Decode instruction; 5) Execute, possibly using ALU; 6) Increment PC. This endlessly repeating pattern is the heartbeat of a processor.
取指‑译码‑执行周期: 1) PC 内容 → MAR；2) 从内存读出到 MDR；3) MDR → CIR；4) 指令译码；5) 执行，可能使用 ALU；6) PC 增量。这个无限循环的模式是处理器的心跳。
Instruction Set: The complete collection of machine‑level commands a processor can execute. It includes data movement, arithmetic, logical, and control transfer instructions. The opcode specifies the operation; the operand provides the data or address.
指令集: 处理器可执行的机器级命令的完整集合。包括数据传送、算术、逻辑和控制转移指令。操作码指定操作；操作数提供数据或地址。
Interrupt: A signal that causes the CPU to temporarily suspend the current task, save its state, and execute an interrupt service routine (ISR). Sources include I/O devices, timers, and errors. Handling interrupts ensures responsive multitasking.
中断: 一种信号，使 CPU 暂停当前任务，保存状态，并执行中断服务程序（ISR）。中断源包括 I/O 设备、定时器和错误。处理中断确保了多任务的响应性。
8. Networks & The Internet | 网络与互联网
LAN vs WAN: A Local Area Network covers a small geographical area (e.g., a building) with high data transfer rates, typically using Ethernet or Wi‑Fi. A Wide Area Network spans cities or countries, often using leased lines or satellite links, and is generally slower.
局域网与广域网: 局域网覆盖小片地理区域（如建筑物），数据传输率高，通常使用以太网或 Wi‑Fi。广域网跨越城市或国家，常用租用线路或卫星连接，通常速度较慢。
Protocol: A set of rules governing data communication. Protocols define syntax, semantics, and timing. TCP/IP is the fundamental suite of the Internet; HTTP/HTTPS carry web traffic; FTP transfers files. Think of a protocol as the language diplomats must speak.
协议: 管理数据通信的一组规则。协议定义了语法、语义和时序。TCP/IP 是互联网的基础协议族；HTTP/HTTPS 承载网页流量；FTP 传输文件。把协议想象成外交官必须使用的语言。
Packet Switching: Data is broken into packets, each labelled with source/destination addresses, sequence numbers, and error‑checking data. Packets travel independently and may follow different routes, then are reassembled. This method is efficient and robust.
分组交换: 数据被分割成数据包，每个都标有源/目的地址、序号和错误校验数据。数据包独立传输，可能走不同路径，然后再重组。这种方法高效且健壮。
MAC Address vs IP Address: A MAC address is a 48‑bit hardware identifier burnt into the NIC, unique worldwide. An IP address is a logical identifier assigned to a device on a network, either static or dynamic. MAC works at Layer 2; IP at Layer 3.
MAC 地址与 IP 地址: MAC 地址是烧录在网卡中的 48 位硬件标识符，全球唯一。IP 地址是分配给网络上设备的逻辑标识符，可以是静态或动态的。MAC 工作在第 2 层；IP 在第 3 层。
9. Databases & SQL | 数据库与 SQL
Primary Key: A field (or combination of fields) that uniquely identifies each record in a table. It must be unique and not null. In a student table, StudentID is a typical primary key.
主键: 唯一标识表中每条记录的一个（或多个）字段。它必须唯一且非空。在学生表中，StudentID 是典型的主键。
Foreign Key: A field in one table that refers to the primary key in another table, creating a relationship. It enforces referential integrity: you cannot have an order for a non‑existent customer.
外键: 一个表中的字段，引用另一表的主键，从而建立关系。它强制执行引用完整性：你不能为不存在的客户创建订单。
SQL SELECT Statement: The core query command structured as SELECT columns FROM table WHERE condition ORDER BY column. Example: SELECT name, grade FROM Students WHERE grade > 80 ORDER BY name. Mnemonic: 'So Far We Only' — Select, From, Where, Order by.
SQL SELECT 语句: 核心查询命令，结构为 SELECT 列名 FROM 表 WHERE 条件 ORDER BY 列。示例: SELECT name, grade FROM Students WHERE grade > 80 ORDER BY name。助记: 'SFWO' — Select, From, Where, Order by。
Normalisation: A process to reduce data redundancy and anomalies by decomposing tables. The first three normal forms (1NF, 2NF, 3NF) progressively remove repeating groups, partial dependencies, and transitive dependencies. A well‑normalised database is like a tidy filing cabinet — no duplicate files.
规范化: 通过分解表来减少数据冗余和异常的过程。前三范式（1NF, 2NF, 3NF）逐步消除重复组、部分依赖和传递依赖。一个良好规范化的数据库就像整洁的文件柜——没有重复的档案。
10. Security & Ethics | 安全与道德
Malware: Malicious software designed to disrupt, damage, or gain unauthorised access. Types include viruses (self‑replicating, attach to files), worms (standalone, spread over networks), and trojans (disguised as legitimate software). Defense uses anti‑malware and user awareness.
恶意软件: 旨在破坏、损害或未经授权访问的恶意软件。类型包括病毒（自我复制，附着文件）、蠕虫（独立，通过网络传播）和木马（伪装成合法软件）。防护使用反恶意软件和用户意识。
Phishing: A social engineering attack where fraudulent emails or websites impersonate trustworthy entities to steal credentials. Urgent language and fake login pages are common. Always check the URL and never click unexpected links.
钓鱼攻击: 一种社会工程攻击，通过欺诈邮件或网站冒充可信实体来窃取凭证。紧急措辞和虚假登录页面很常见。务必检查 URL，绝不要点击意外链接。
Encryption: Converting plaintext into ciphertext using an algorithm and a key. Symmetric encryption uses the same key for encryption and decryption; asymmetric uses a public/private key pair. Caesar cipher is a simple substitution for learning the concept.
加密: 使用算法和密钥将明文转换为密文。对称加密使用同一密钥加密解密；非对称加密使用公钥/私钥对。凯撒密码是一种用于学习概念的简单替换密码。
Data Protection Act / Ethical Issues: Legislation that governs how personal data is collected, used, and stored. Key principles include data must be fairly and lawfully processed, used for specified purposes, kept secure, and accurate. Ethics in computing covers professional conduct, privacy, and intellectual property.
数据保护法 / 伦理问题: 管理个人数据如何被收集、使用和存储的法规。关键原则包括数据必须公平合法处理、用于指定目的、保持安全和准确。计算伦理涵盖职业操守、隐私和知识产权。
11. Number Systems & Data Representation Extras | 数制与数据表示补充
BCD (Binary Coded Decimal): A representation where each denary digit (0–9) is encoded as a 4‑bit binary pattern. 29 is represented as 0010 1001, not as the pure binary 11101. BCD is used in systems where exact decimal rounding is critical, like financial calculations.
BCD（二进制编码十进制）: 一种表示方式，每个十进制数字（0–9）被编码为 4 位二进制模式。29 表示为 0010 1001，而不是纯二进制 11101。BCD 用于需要精确十进制舍入的系统，如金融计算。
Character Encoding (ASCII / Unicode): ASCII uses 7 bits to represent 128 characters (English letters, digits, symbols). Extended ASCII adds an 8th bit. Unicode supports thousands of characters from global scripts using multi‑byte encoding (UTF‑8, UTF‑16). Unicode ensures 'A' is the same number everywhere.
字符编码（ASCII / Unicode）: ASCII 用 7 位表示 128 个字符（英文字母、数字、符号）。扩展 ASCII 增加第 8 位。Unicode 使用多字节编码（UTF‑8, UTF‑16）支持全球脚本的数以千计字符。Unicode 确保 'A' 在所有地方都是同一个数字。
xels per unit (e.g., 1920 × 1080). Higher resolution means more detail but larger file size. Colour depth (bpp) determines how many colours each pixel can display.
像素与分辨率: 像素是光栅图像中最小可寻址元素，存储颜色信息。图像分辨率是每单位像素数（如 1920 × 1080）。分辨率越高细节越多，但文件越大。颜色深度（bpp）决定每个像素能显示多少种颜色。
12. Algorithms & Searching / Sorting | 算法与搜索/排序
Linear Search: A sequential scan through a list until the target is found or the end is reached. It works on unsorted data with O(n) time complexity. Useful for small or unsorted datasets.
线性搜索: 顺序扫描列表，直到找到目标或到达末尾。它适用于未排序数据，时间复杂度 O(n)。适用于小型或未排序数据集。
Binary Search: An efficient search on sorted arrays. Repeatedly compare the target with the middle element; if not equal, discard half the list. O(log n) time. Halving the search space each time speeds it up dramatically.
二分搜索: 在已排序数组上的高效搜索。反复将目标与中间元素比较；若不相等则丢弃一半列表。时间复杂度 O(log n)。每次搜索空间减半，极大加速。
Bubble Sort: A simple comparison‑based sort that repeatedly steps through the list, swaps adjacent elements if they are in the wrong order, and 'bubbles' the largest to the end. O(n²). Easy to implement but inefficient for large data.
冒泡排序: 一种基于比较的简单排序，反复遍历列表，若相邻元素顺序错误则交换，使最大元素'冒泡'到最后。时间复杂度 O(n²)。实现容易但对大数据效率低。
Insertion Sort: Builds the sorted list one item at a time by taking each unsorted element and inserting it into its correct position in the sorted portion. Efficient for small or nearly sorted datasets, O(n²) in worst case.
插入排序: 每次从未排序部分取出一个元素，插入到已排序部分的正确位置，逐步构建有序列表。对于小型或接近有序的数据高效，最坏 O(n²)。
Syntax / Logic / Runtime Errors: Syntax errors break the grammar of the language (e.g., missing semicolon). Logic errors produce incorrect results but no crash (e.g., wrong formula). Runtime errors occur during execution (e.g., division by zero). Think of syntax as spelling mistakes, logic as wrong recipe, runtime as unexpected event while cooking.
语法 / 逻辑 / 运行时错误: 语法错误违反语言语法（如缺少分号）。逻辑错误产生错误结果但不崩溃（如公式错误）。运行时错误在执行期间发生（如除零）。语法错误像拼写错误，逻辑错误像食谱错误，运行时错误像烹饪时的意外事件。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图