📚 Pre-U CCEA Computer Science: Vocabulary & Terminology Quick Memorisation Guide | Pre-U CCEA 计算机：词汇术语速记指南
Mastering the vocabulary of computer science is the first critical step towards confident exam performance. This guide breaks down high-frequency terms from the CCEA Pre-U curriculum into digestible, memorable chunks, pairing English definitions with Chinese explanations and simple memory aids. Use it as a daily drill to strengthen your technical fluency and avoid losing marks to misunderstood jargon.
掌握计算机科学词汇是取得自信应试表现的关键第一步。本指南将 CCEA Pre-U 课程中的高频术语拆解为易于消化、方便记忆的单元，把英文定义与中文解释以及简单的记忆窍门配对使用。把它当作每日训练，巩固你的技术流利度，避免因误解专业术语而丢分。
1. Programming Foundations | 编程基础术语
A variable is a named storage location in memory whose value can be changed while the program runs. It acts like a labelled container for data.
变量 是内存中一个命名的存储位置，其值在程序运行时可以被改变。它就像一个贴了标签的数据容器。
Memory trick: Imagine a wardrobe locker – the label is the variable name, the item inside is its current value.
记忆窍门： 想象一个储物柜——标签是变量名，里面放的物品是它的当前值。
A constant is similar to a variable but its value is fixed once assigned and cannot be altered during execution. It provides readability and protection against accidental changes.
常量 与变量相似，但其值一旦赋值就固定下来，无法在程序执行期间被改变。它提升了可读性，并防止意外修改。
Memory trick: Picture a name engraved on a trophy – it never changes.
记忆窍门： 想象奖杯上刻着的名字——永远不会改变。
A data type determines the kind of data a variable can hold (e.g., integer, real, Boolean, character, string) and what operations can be performed on it.
数据类型 决定了一个变量可以保存何种数据（如整型、实型、布尔型、字符型、字符串型）以及可以对其执行哪些操作。
Memory trick: Think of data types as different shaped plugs – each socket only accepts a specific plug.
记忆窍门： 把数据类型想象成不同形状的插头——每个插座只接受特定形状的插头。
An operator is a symbol that tells the computer to perform a specific mathematical, relational, or logical action. Common operators include +, -, *, /, AND, OR, NOT, and comparison symbols like == and >.
运算符 是一个符号，用于指示计算机执行特定的数学、关系或逻辑操作。常见运算符包括 +、-、*、/、AND、OR、NOT 以及 == 和 > 等比较符号。
Memory trick: An operator is like a traffic sign – it tells the processor exactly which action to take next.
记忆窍门： 运算符就像交通标志——它告诉处理器下一步该执行什么动作。
Sequence means executing instructions one after another in the order they appear. Selection (if-else) chooses a path based on a condition, and iteration (loops like for, while) repeats a block of code. These are the three building blocks of structured programming.
顺序 表示按照指令出现的先后依次执行。选择（if-else）根据条件选择一条路径，而 迭代（for、while 等循环）重复执行一段代码。这三者是结构化编程的基本构件。
Memory trick: Sequence, selection, iteration can be remembered as ‘SSI’ – the backbone of every program you write.
记忆窍门： 顺序、选择、迭代可记作“SSI”——你所写每个程序的骨架。
2. Data Representation & Logic | 数据表示与逻辑
A bit (binary digit) is the smallest unit of data in a computer, representing either 0 or 1. A byte is a group of 8 bits, typically used to encode a single character.
比特（二进制位）是计算机中最小的数据单位，表示 0 或 1。字节 是由 8 个比特组成的一组，通常用于编码一个单独字符。
Memory trick: Bit = single on/off switch; Byte = enough switches to store one letter.
记忆窍门： 比特 = 单个开/关开关；字节 = 足以存储一个字母的开关数量。
Binary is a base‑2 number system using only 0 and 1. Hexadecimal is a base‑16 system using digits 0‑9 and letters A‑F. Hex is a compact way to represent binary values, as one hex digit matches exactly 4 bits.
二进制 是以 2 为基的数制，只使用 0 和 1。十六进制 是以 16 为基的数制，使用数字 0‑9 和字母 A‑F。十六进制是表示二进制值的紧凑方式，因为一个十六进制位恰好对应 4 个比特。
Memory trick: ‘Hex = 6 + 10’ reminds you it’s base‑16; think of a colour code like #FF5733 – it’s secretly binary inside.
记忆窍门： “Hex = 6 + 10” 提醒你它是 16 进制；想想颜色代码 #FF5733——它在内部其实就是二进制。
An overflow error occurs when a calculation produces a result that exceeds the allocated number of bits. For example, adding 1 to the largest 8‑bit binary number (11111111) wraps around to 00000000 if no extra bit is available.
当计算结果超出所分配的比特数时，就会发生 溢出错误。例如，把最大的 8 位二进制数（11111111）加 1，若没有额外比特就会回绕变成 00000000。
Memory trick: Imagine an old‑style car odometer reaching 999,999 and rolling back to 000,000 – that’s overflow.
记忆窍门： 想象老式汽车里程表到达 999,999 后翻回 000,000——那就是溢出。
A truth table lists all possible input combinations for a logic gate (AND, OR, NOT, XOR) and shows the corresponding output. It is the foundation of Boolean algebra and circuit design.
真值表 列出了逻辑门（AND、OR、NOT、XOR）所有可能的输入组合，并显示相应的输出。它是布尔代数和电路设计的基础。
Memory trick: Treat AND like a strict bouncer – both inputs must be 1 for the door to open; OR is a friendly bouncer – any 1 lets you in.
记忆窍门： 把 AND 想像成严格的守门人——两个输入必须都是 1 才能开门；OR 是友好的守门人——只要有一个 1 就让你进去。
3. Computer Architecture | 计算机体系结构
The Central Processing Unit (CPU) is the brain of the computer. It consists of the Arithmetic Logic Unit (ALU) for calculations and logical operations, the Control Unit (CU) that directs data flow, and a set of registers – tiny, ultra‑fast memory locations inside the CPU.
中央处理器 (CPU) 是计算机的大脑。它由负责计算和逻辑操作的算术逻辑单元 (ALU)、指挥数据流的控制单元 (CU) 以及一组寄存器（CPU 内部极小的超快存储位置）组成。
Memory trick: Think of the CPU as a chef: ALU does the chopping (calculations), CU reads the recipe (instructions), and registers are the tiny bowls holding immediate ingredients.
记忆窍门： 把 CPU 想像成厨师：ALU 负责切菜（计算），CU 读取食谱（指令），寄存器则是盛放即时配料的小碗。
The fetch‑decode‑execute cycle is the fundamental process the CPU repeats indefinitely: fetch an instruction from memory, decode it into signals the CPU understands, and execute the corresponding operation. This cycle is driven by the system clock.
取指‑译码‑执行周期 是 CPU 不断重复的基本过程：从内存取出指令，将其译码为 CPU 能理解的信号，然后执行相应操作。该周期由系统时钟驱动。
Memory trick: ‘F‑D‑E’ is like a factory assembly line – Fetch raw material, Decode the blueprint, Execute the assembly.
记忆窍门： “F‑D‑E” 就像工厂装配线——取来原材料（Fetch），解读图纸（Decode），执行装配（Execute）。
Von Neumann architecture describes a design where both program instructions and data are stored in the same memory unit. This allows programs to be easily modified and is the basis of most modern computers.
冯·诺依曼体系结构 描述了一种设计，其中程序指令和数据都存储在同一个内存单元中。这使得程序易于修改，也是大多数现代计算机的基础。
Memory trick: Von Neumann = one shared notebook for both recipes and ingredients.
记忆窍门： 冯·诺依曼 = 一本笔记本同时记着菜谱和食材。
Cache memory is a small, high‑speed buffer located close to the CPU that stores frequently accessed data, reducing the time needed to fetch information from main RAM. Levels L1, L2, and L3 indicate distance from the processor core.
缓存 是靠近 CPU 的一小块高速缓冲存储器，用于保存经常访问的数据，从而减少从主存读取信息所需的时间。L1、L2、L3 表示与处理器核心的距离层级。
Memory trick: Cache is like a pocket notebook – you keep the most‑needed phone numbers there instead of walking to the filing cabinet every time.
记忆窍门： 缓存就像口袋里的便签本——你把最常用的电话号码记在上面，而不必每次都走到文件柜前。
4. Operating Systems & Utility Software | 操作系统与实用程序
The kernel is the core of the operating system, responsible for managing hardware resources such as CPU time, memory, and input/output devices. It operates at the highest privilege level.
内核 是操作系统的核心，负责管理硬件资源，如 CPU 时间、内存和输入/输出设备。它以最高特权级别运行。
Memory trick: Kernel is like the engine control unit in a car – you don’t see it, but it makes everything run smoothly.
记忆窍门： 内核就像汽车引擎控制单元——你看不见它，但它让一切平稳运转。
An interrupt is a signal that temporarily halts the CPU’s current task, forcing it to handle an urgent event such as a keypress or disk I/O completion. After servicing the interrupt, the CPU resumes its original task.
中断 是一种信号，它暂时中止 CPU 当前任务，强制其处理紧急事件，如按键或磁盘 I/O 完成。处理完中断后，CPU 恢复原来的任务。
Memory trick: Interrupts are like a fire alarm – the current work stops immediately to address the emergency, then you go back.
记忆窍门： 中断就像火警——当前工作立刻停下来去处理紧急情况，然后再回到之前的工作。
Paging is a memory management scheme that divides physical memory into fixed‑size blocks (frames) and logical memory into blocks of the same size (pages). This allows processes to use non‑contiguous memory and enables virtual memory.
分页 是一种内存管理方案，将物理内存划分为固定大小的块（帧），并将逻辑内存划分为同样大小的块（页）。这使得进程可以使用不连续的内存，并可实现虚拟内存。
Memory trick: Think of paging as organising a bookshelf with identical boxes – you can place boxes anywhere, yet the catalogue keeps track.
记忆窍门： 把分页想像成用统一尺寸的盒子整理书架——你可以把盒子放在任何位置，而目录会记录位置。
Defragmentation rearranges fragmented data on a hard disk so that related pieces are stored contiguously, improving read/write speed. SSDs do not require defragmentation.
碎片整理 重新排列硬盘上的碎片数据，使相关片段连续存储，从而提高读写速度。固态硬盘 (SSD) 不需要碎片整理。
Memory trick: Defrag is like tidying scattered puzzle pieces into their original clusters so the picture assembles faster.
记忆窍门： 碎片整理就像把散落的拼图块收拾成原来的簇，这样拼图完成得更快。
5. Networking & Communication | 网络与通信
A protocol is a set of rules that govern how data is transmitted and received between devices. Protocols ensure that different hardware and software can communicate reliably over a network.
协议 是管理设备之间数据传输和接收的一套规则。协议确保不同的硬件和软件可以在网络上可靠地通信。
Memory trick: Protocol is like diplomatic etiquette – everyone follows the same handshake procedure to avoid confusion.
记忆窍门： 协议就像外交礼仪——大家都遵循相同的握手程序，避免混淆。
TCP/IP is the fundamental protocol suite of the Internet. TCP (Transmission Control Protocol) ensures reliable, ordered delivery of packets, while IP (Internet Protocol) handles addressing and routing. Together they provide end‑to‑end communication.
TCP/IP 是互联网的基础协议套件。TCP（传输控制协议）确保数据包可靠、按序传输，而 IP（网际协议）处理寻址和路由。两者共同提供端到端通信。
Memory trick: IP delivers the envelope using the address; TCP checks that all pages of the letter arrive in the correct order.
记忆窍门： IP 用地址递送信封；TCP 检查信的每一页是否按正确顺序到达。
DNS (Domain Name System) translates human‑readable domain names (e.g., http://www.aleveler.com) into IP addresses so browsers can load Internet resources. It acts like a phonebook for the web.
DNS（域名系统） 将人类可读的域名（如 http://www.aleveler.com）转换为 IP 地址，以便浏览器加载互联网资源。它就像互联网的电话簿。
Memory trick: DNS = phonebook: you remember the name, but the computer needs the number.
记忆窍门： DNS = 电话簿：你记住的是名字，而计算机需要的是号码。
A packet is a small unit of data transmitted over a network. Each packet contains the source and destination addresses, a sequence number, and a portion of the overall message, enabling efficient routing and error recovery.
数据包 是通过网络传输的一小段数据。每个数据包含有源地址、目的地址、序列号以及总消息的一部分，从而实现高效路由和错误恢复。
Memory trick: A packet is like a postcard – limited space, but the address and message are right there, and many postcards make a whole story.
记忆窍门： 数据包就像明信片——空间有限，但地址和信息都在上面，许多明信片拼成一个完整故事。
MAC address (Media Access Control) is a unique hardware identifier assigned to a network interface card, while an IP address is a logical address that can change based on network location. MAC identifies the device, IP identifies its connection point.
MAC 地址（媒体访问控制地址）是分配给网络接口卡的唯一硬件标识符，而 IP 地址 是一个逻辑地址，会根据网络位置而改变。MAC 标识设备，IP 标识其连接点。
Memory trick: MAC is your DNA – permanent; IP is your hotel room number – temporary.
记忆窍门： MAC 是你的 DNA——永久的；IP 是你住的酒店房间号——临时的。
6. Databases | 数据库
A relational database organises data into one or more tables consisting of rows (records) and columns (fields). Each table usually contains data about one type of entity.
关系型数据库 将数据组织成一张或多张表，表由行（记录）和列（字段）构成。每张表通常包含关于一种实体类型的数据。
Memory trick: Picture an Excel spreadsheet: columns are fields like Name, Age; each row is a record of one person.
记忆窍门： 想象一张 Excel 电子表格：列是如姓名、年龄等字段；每一行是一个人的记录。
A primary key uniquely identifies each record in a table (e.g., StudentID). A foreign key is a field in one table that links to the primary key of another table, creating a relationship between them.
主键 唯一标识表中的每条记录（例如，学生ID）。外键 是某张表中的一个字段，它链接到另一张表的主键，从而在两者之间建立关系。
Memory trick: Primary key = your national ID number (unique to you); foreign key = that ID number written on your library card to link you to your records.
记忆窍门： 主键 = 你的身份证号（独一无二）；外键 = 写在你的借书卡上的那个身份证号，用于将你与记录关联起来。
SQL (Structured Query Language) is the standard language for managing and querying relational databases. Commands like SELECT, INSERT, UPDATE, and DELETE let users interact with the data.
SQL（结构化查询语言） 是管理和查询关系型数据库的标准语言。像 SELECT、INSERT、UPDATE、DELETE 等命令让用户能够与数据交互。
Memory trick: SQL is the polite conversation you have with a database – ask (SELECT), add (INSERT), change (UPDATE), or remove (DELETE).
记忆窍门： SQL 是你与数据库进行的礼貌对话——询问 (SELECT)、添加 (INSERT)、更改 (UPDATE) 或删除 (DELETE)。
Normalisation is the process of reducing data redundancy and dependency by organising fields and tables according to rules (normal forms). It usually involves splitting a large table into smaller, linked tables.
规范化 是通过按规则（范式）组织字段和表来减少数据冗余和依赖的过程。它通常涉及将大表拆分成更小的、相互链接的表。
Memory trick: Normalisation is like writing each piece of information only once in an organised filing cabinet rather than scribbling it everywhere.
记忆窍门： 规范化就像有条理的文件柜，每个信息只写一次，而不是到处乱涂乱画。
7. Software Engineering | 软件工程
An algorithm is a step‑by‑step procedure for solving a problem or completing a task. It must be unambiguous, finite, and produce a result. Pseudocode and flowcharts are common ways to express algorithms before coding.
算法 是解决问题或完成任务的一步一步的过程。它必须无歧义、有限且能产生结果。伪代码和流程图是在编码前表达算法的常用方式。
Memory trick: Algorithm = a recipe: ingredients (inputs), steps (instructions), and final dish (output).
记忆窍门： 算法 = 一份食谱：食材（输入）、步骤（指令）和最后的菜肴（输出）。
A flowchart uses geometric symbols – ovals for Start/End, parallelograms for Input/Output, rectangles for processes, diamonds for decisions – connected by arrows to illustrate the flow of an algorithm.
流程图 使用几何符号——椭圆代表开始/结束，平行四边形代表输入/输出，矩形代表处理，菱形代表判断——通过箭头连接来展示算法的流程。
Memory trick: ‘Oval to Oval, diamond for a question’ – draw it like a visual map.
记忆窍门： “椭圆接椭圆，菱形来提问”——像绘制可视化地图一样画出来。
Debugging is the systematic process of finding and fixing errors (bugs) in a program. Techniques include single‑stepping, breakpoints, and print statements. Logic errors are often the hardest to spot.
调试 是系统地查找并修复程序中错误（bug）的过程。技术包括单步执行、断点和打印语句。逻辑错误通常最难发现。
Memory trick: Debugging = detective work – follow the clues, eliminate suspects, until the culprit line of code is caught.
记忆窍门： 调试 = 侦探工作——追踪线索，排除嫌疑，直到抓住罪魁祸首的那行代码。
Version control tracks and manages changes to code, allowing teams to collaborate and revert to previous states. Git is a popular distributed version control system, often hosted on GitHub or GitLab.
版本控制 跟踪和管理代码的更改，使团队能够协作并恢复到先前的状态。Git 是一种流行的分布式版本控制系统，通常托管在 GitHub 或 GitLab 上。
Memory trick: Version control is like ‘track changes’ in a word document, but for code, with a perfect undo history.
记忆窍门： 版本控制就像文本文档中的“修订记录”功能，但它是给代码用的，并且拥有完美的撤销历史。
8. Algorithms & Complexity | 算法与复杂度
Big O notation describes the efficiency of an algorithm in terms of time or space as the input size grows. It focuses on the worst‑case scenario. Common classes include 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²)。
Complexity: O(1) < O(log n) < O(n) < O(n log n) < O(n²)
Memory trick: ‘Big O’ tells you how fast the pain grows when you give it more work – O(n²) hurts quickly!
记忆窍门： “大O” 告诉你当工作量增加时，痛苦增长得有多快——O(n²) 很快就会让你痛不欲生！
Linear search checks each element in a list sequentially until a match is found. Its worst‑case complexity is O(n). Binary search works on sorted lists by repeatedly dividing the search interval in half, achieving O(log n).
线性搜索 按顺序依次检查列表中的每个元素，直到找到匹配项。其最坏情况复杂度为 O(n)。二分搜索 用于已排序列表，通过反复将搜索区间一分为二，达到 O(log n)。
Memory trick: Linear search = flipping through a dictionary page by page; binary search = opening the dictionary right in the middle each time.
记忆窍门： 线性搜索 = 一页一页翻字典；二分搜索 = 每次都直接从字典中间打开。
Bubble sort repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order. It is simple but inefficient with O(n²) average complexity. Merge sort recursively splits the list into halves, sorts them, and merges them back; it runs in O(n log n).
冒泡排序 反复遍历列表，比较相邻元素，若顺序错误则交换它们。它简单但效率较低，平均复杂度为 O(n²)。归并排序 递归地将列表分成两半，分别排序，再合并回来；其运行时间为 O(n log n)。
Memory trick: Bubble = stones rising to the surface; Merge = sorting two tidy stacks of books into one.
记忆窍门： 冒泡 = 石子浮出水面；归并 = 把两沓整理好的书本合成一沓。
Recursion is a technique where a function calls itself to solve a smaller instance of the same problem. Every recursive solution must have a base case to prevent infinite calls.
递归 是一种函数调用自身来解决同一问题更小实例的技术。每个递归解决方案都必须有一个
Published by TutorHao | Pre-U Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply