Vocabulary & Terminology Quick Study Guide for CCEA Computer Science | CCEA 计算机科学词汇术语速记指南

📚 Vocabulary & Terminology Quick Study Guide for CCEA Computer Science | CCEA 计算机科学词汇术语速记指南

Building a strong command of technical vocabulary is essential for success in CCEA Year 13 Computer Science. This guide presents high-frequency terms grouped by topic, with clear English definitions followed by Chinese explanations, to help you memorise and apply them confidently in exams and coursework.

掌握扎实的技术词汇是 CCEA 13 年级计算机科学取得好成绩的关键。本指南按主题分组列出高频术语，每个术语先给出清晰的英文定义，再配上中文解释，帮助你在考试和课程作业中自信地记忆和运用。

1. Data Structures | 数据结构

An array is a static data structure that stores a fixed number of elements of the same data type in contiguous memory locations, accessed via an index.

数组是一种静态数据结构，在连续内存位置中存储固定数量、相同数据类型的元素，通过索引访问。

A linked list is a dynamic data structure where each element (node) contains data and a pointer to the next node; it allows efficient insertion and deletion but does not support direct indexing.

链表是一种动态数据结构，每个元素（节点）包含数据和指向下一个节点的指针；它支持高效插入和删除，但不支持直接索引访问。

A stack is a Last-In-First-Out (LIFO) structure with operations push, pop, and peek; it is used for backtracking, function calls, and undo functions.

栈是一种后进先出（LIFO）结构，操作包括压入、弹出和查看栈顶；常用于回溯、函数调用和撤销功能。

A queue is a First-In-First-Out (FIFO) structure where elements are added at the rear and removed from the front; it models real-world queues like print spoolers.

队列是一种先进先出（FIFO）结构，元素从尾部添加，从头部移除；用以模拟现实排队，如打印缓冲池。

A binary search tree stores ordered data where each node has at most two children; the left child is smaller, the right child is larger, enabling O(log n) search on average.

二叉搜索树存储有序数据，每个节点最多有两个子节点；左子节点较小，右子节点较大，平均搜索时间复杂度为 O(log n)。

---

2. Algorithms | 算法

Linear search sequentially checks each element until the target is found or the list ends; its worst-case time complexity is O(n).

线性搜索逐个检查每个元素，直到找到目标或列表结束；最坏时间复杂度为 O(n)。

Binary search works on sorted arrays by repeatedly dividing the search interval in half; time complexity is O(log n), much faster than linear search on large datasets.

二分搜索在已排序数组上通过反复将搜索区间减半来工作；时间复杂度为 O(log n)，在大数据集上比线性搜索快得多。

Bubble sort compares adjacent elements and swaps them if they are in the wrong order; it has O(n²) complexity and is rarely used in practice.

冒泡排序比较相邻元素，若顺序错误则交换；时间复杂度为 O(n²)，实践中很少使用。

Merge sort is a divide-and-conquer algorithm that splits the list, recursively sorts sublists, and then merges them; it guarantees O(n log n) time and is stable.

归并排序是一种分治算法，将列表拆分，递归排序子列表后合并；保证 O(n log n) 时间，且是稳定排序。

Dijkstra’s algorithm finds the shortest path from a source node to all other nodes in a weighted graph with non-negative edges, using a priority queue.

Dijkstra 算法使用优先队列在无负权边的加权图中找到从源节点到所有其他节点的最短路径。

---

3. Programming Paradigms | 编程范式

In procedural programming, instructions are organised into procedures or functions that operate on data; it follows a top-down approach and uses sequence, selection, and iteration.

在过程式编程中，指令组织成操作数据的过程或函数；采用自顶向下方法，使用顺序、选择和迭代结构。

Object-oriented programming (OOP) models real-world entities as objects that encapsulate data and methods; key principles are encapsulation, inheritance, and polymorphism.

面向对象编程（OOP）将现实事物建模为封装数据和方法的对象；核心原则是封装、继承和多态。

Encapsulation binds data and the methods that manipulate it within a class, hiding internal state from direct access and enforcing access through interfaces.

封装将数据及其操作数据的方法绑定在类中，隐藏内部状态，强制通过接口访问。

Inheritance allows a class (subclass) to derive properties and behaviours from another class (superclass), promoting code reuse and hierarchical classification.

继承允许一个类（子类）从另一个类（超类）派生属性和行为，促进代码重用和层次分类。

Polymorphism means “many forms”; it lets objects of different classes be treated as instances of a common superclass, typically via method overriding.

多态意即“多种形态”；它让不同类的对象可以作为共同超类的实例来处理，通常通过方法重写实现。

---

4. System Fundamentals | 系统基础

The CPU (Central Processing Unit) fetches, decodes, and executes instructions; it consists of the ALU, Control Unit, and registers such as the Program Counter and Accumulator.

中央处理器（CPU）取指、译码并执行指令；由算术逻辑单元、控制单元和寄存器（如程序计数器、累加器）组成。

The fetch-decode-execute cycle is the continuous loop through which the CPU processes instructions, involving the memory address register (MAR) and memory data register (MDR).

取指-译码-执行周期是 CPU 处理指令的连续循环，涉及内存地址寄存器（MAR）和内存数据寄存器（MDR）。

Pipelining overlaps the execution of multiple instructions by splitting the cycle into stages, improving throughput but introducing hazards (data, control, structural).

流水线技术通过将指令周期分为多个阶段来重叠执行多条指令，提高吞吐量，但会引入数据冒险、控制冒险和结构冒险。

Cache memory is small, high-speed memory located close to the CPU that stores frequently accessed data and instructions, following the principle of locality (temporal and spatial).

高速缓存是靠近 CPU 的小容量高速内存，存储频繁访问的数据和指令，遵循局部性原理（时间局部性和空间局部性）。

Virtual memory uses a portion of hard disk space as an extension of RAM, allowing larger programs to run but causing disk thrashing if overused.

虚拟内存使用部分硬盘空间作为内存的扩展，使更大的程序能够运行，但若过度使用会导致磁盘抖动。

---

5. Operating Systems | 操作系统

The operating system (OS) manages hardware resources, provides a user interface, and enables multitasking through process scheduling and memory management.

操作系统（OS）管理硬件资源、提供用户界面，并通过进程调度和内存管理实现多任务处理。

Paging is a memory management scheme that divides physical memory into fixed-size frames and logical memory into pages of the same size; it eliminates external fragmentation.

分页是一种内存管理方案，将物理内存划分为固定大小的帧，逻辑内存划分为同样大小的页面；可消除外部碎片。

Segmentation divides memory into variable-sized logical segments such as code, stack, and heap; it matches the programmer’s view but can cause external fragmentation.

分段将内存划分为可变大小的逻辑段，如代码段、栈段和堆段；它符合程序员视角，但可能导致外部碎片。

A process is a program in execution; the OS maintains a Process Control Block (PCB) containing state, program counter, and registers for context switching.

进程是正在执行的程序；操作系统维护一个进程控制块（PCB），其中包含状态、程序计数器和寄存器信息，用于上下文切换。

Deadlock occurs when two or more processes are each waiting for a resource held by the other; four necessary conditions are mutual exclusion, hold and wait, no preemption, and circular wait.

死锁指两个或多个进程各自等待对方持有的资源而无法继续；四个必要条件是互斥、持有并等待、不可剥夺和循环等待。

---

6. Networking & Internet | 网络与互联网

The OSI model is a conceptual framework with seven layers (Physical, Data Link, Network, Transport, Session, Presentation, Application) that standardises network communication functions.

OSI 模型是一个七层概念框架（物理层、数据链路层、网络层、传输层、会话层、表示层、应用层），标准化网络通信功能。

The TCP/IP model combines OSI layers into four layers: Application, Transport, Internet, and Network Access; it is the foundation of internet communication.

TCP/IP 模型将 OSI 层次合并为四层：应用层、传输层、互联网层和网络接入层；它是互联网通信的基础。

TCP (Transmission Control Protocol) provides reliable, connection-oriented data delivery with error checking and flow control, while UDP (User Datagram Protocol) is connectionless and faster but unreliable.

TCP（传输控制协议）提供可靠、面向连接的数据传输，具有差错校验和流量控制；UDP（用户数据报协议）无连接、速度快但不保证可靠。

IP addressing assigns a unique logical address to each device on a network; IPv4 uses 32-bit addresses, while IPv6 uses 128-bit addresses to overcome address exhaustion.

IP 寻址为网络上的每个设备分配唯一的逻辑地址；IPv4 使用 32 位地址，IPv6 使用 128 位地址以解决地址枯竭问题。

Subnet masking splits an IP address into network and host portions; CIDR (Classless Inter-Domain Routing) notation enables flexible allocation.

子网掩码将 IP 地址划分为网络部分和主机部分；CIDR（无类别域间路由）记法支持灵活分配。

---

7. Databases | 数据库

A relational database organises data into tables (relations) with rows (tuples) and columns (attributes); it enforces integrity through primary keys and foreign keys.

关系数据库将数据组织成表（关系），表由行（元组）和列（属性）组成；通过主键和外键保证数据完整性。

Normalisation is the process of structuring database tables to minimise redundancy and dependency anomalies; Third Normal Form (3NF) requires non-key attributes to depend solely on the primary key.

规范化是构建数据库表以减少冗余和依赖异常的过程；第三范式（3NF）要求非键属性仅仅依赖于主键。

SQL (Structured Query Language) is used to define, manipulate, and query relational databases; commands include SELECT, INSERT, UPDATE, DELETE, CREATE TABLE, and JOIN.

SQL（结构化查询语言）用于定义、操作和查询关系数据库；命令包括 SELECT、INSERT、UPDATE、DELETE、CREATE TABLE 和 JOIN。

An index is a data structure that speeds up data retrieval on a table at the cost of slower writes; it works like a book index, mapping values to row locations.

索引是一种数据结构，可加快表上的数据检索，但会降低写入速度；其原理类似于书籍索引，将值映射到行位置。

ACID properties (Atomicity, Consistency, Isolation, Durability) guarantee that database transactions are processed reliably even in the event of failures.

ACID 属性（原子性、一致性、隔离性、持久性）保证即使在故障情况下数据库事务也能被可靠地处理。

---

8. Computational Thinking & Problem Solving | 计算思维与问题解决

Abstraction is the process of simplifying complex systems by focusing on relevant details and ignoring irrelevant ones; it is key in modelling and programming.

抽象是通过关注相关细节、忽略无关部分来简化复杂系统的过程；它是建模和编程的关键。

Decomposition breaks a large problem into smaller, manageable sub-problems; it forms the basis of modular design and top-down development.

分解将大问题拆分为更小、可管理的子问题；它是模块化设计和自顶向下开发的基础。

Algorithmic thinking involves defining clear step-by-step instructions to solve problems; it emphasises sequence, selection, iteration, and efficiency analysis.

算法思维涉及定义清晰的逐步指令来解决问题；强调顺序、选择、迭代和效率分析。

Pattern recognition identifies similarities among problems to reuse solutions; in computing, it links to regular expressions, machine learning, and data compression.

模式识别识别问题之间的相似性以重用解决方案；在计算中，它与正则表达式、机器学习和数据压缩相关。

Trace tables are used to manually step through an algorithm, tracking variable values and outputs at each stage to verify correctness or debug logic errors.

跟踪表用于手动逐步执行算法，记录每一步的变量值和输出，以验证正确性或调试逻辑错误。

---

9. Data Representation | 数据表示

Binary is base-2; all data inside a computer is stored as 0s and 1s. A bit is a single binary digit, and a byte is typically 8 bits.

二进制以 2 为基数；计算机内所有数据都以 0 和 1 存储。一位（bit）是一个二进制数字，一个字节（byte）通常为 8 位。

Hexadecimal (base-16) uses digits 0-9 and letters A-F, providing a more compact representation of binary and simplifying debugging of memory dumps.

十六进制（基数为 16）使用数字 0-9 和字母 A-F，能更紧凑地表示二进制，简化内存转储的调试。

Two’s complement is the standard method for representing signed integers in binary; the most significant bit indicates sign, and negation is performed by inverting bits and adding 1.

二进制补码是表示有符号整数的标准方法；最高位指示符号，求负数时按位取反再加 1。

Floating point representation stores real numbers as mantissa × 2^exponent; it allows a wide range of values but introduces rounding errors.

浮点表示将实数存储为尾数 × 2^指数形式；能表示极广的数值范围，但会引入舍入误差。

Bitmap images represent each pixel individually, whereas vector graphics use mathematical descriptions of shapes; bitmaps suffer from pixelation when enlarged.

位图图像单独表示每个像素，而矢量图形使用形状的数学描述；位图放大时会出现像素化。

---

10. Security & Ethics | 安全与伦理

Encryption transforms plaintext into ciphertext using an algorithm and a key; symmetric encryption uses the same key for both encryption and decryption, while asymmetric uses a public-private key pair.

加密使用算法和密钥将明文转换为密文；对称加密用相同密钥加解密，非对称加密使用公钥-私钥对。

A firewall monitors and controls incoming and outgoing network traffic based on predetermined security rules, acting as a barrier between trusted and untrusted networks.

防火墙根据预设安全规则监控并控制进出网络流量，充当可信与不可信网络之间的屏障。

Malware is malicious software including viruses, worms, trojans, and ransomware; antivirus software uses signature-based and heuristic detection to mitigate threats.

恶意软件是包括病毒、蠕虫、特洛伊木马和勒索软件在内的恶意软件；防病毒软件使用基于签名和启发式的检测来缓解威胁。

Phishing is a social engineering attack where attackers impersonate legitimate entities to steal sensitive information; it relies on deception rather than technical hacking.

网络钓鱼是一种社会工程攻击，攻击者冒充合法实体窃取敏感信息；它依赖欺骗而非技术性黑客攻击。

The Data Protection Act governs the collection, storage, and processing of personal data, requiring consent, purpose limitation, and data subject rights.

数据保护法规定个人数据的收集、存储和处理，要求获得同意、限制目的，并保障数据主体权利。

---

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

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