📚 Year 12 OCR Computer Science: Vocabulary & Terminology Quick-Memorisation Guide | Year 12 OCR 计算机：词汇术语速记指南
Mastering the technical vocabulary of OCR A-Level Computer Science can feel like learning a new language. This guide breaks down the most important Year 12 terms into logical clusters, pairing each concept with simple analogies, visual hooks, and cross-references so you can move from memorisation to genuine understanding.
掌握 OCR A-Level 计算机科学的技术词汇就像学习一门新语言。本指南将最重要的 Year 12 术语按逻辑分组，为每个概念配上简单的类比、视觉挂钩和交叉引用，帮助你从死记硬背转向真正的理解。
1. Core Programming Concepts | 核心编程概念
Variable – Think of a named box in memory that holds a value which can change. Like a whiteboard: you can wipe it and write something new. In pseudocode, myScore ← 10 puts the value 10 into that box.
变量——想象内存中一个有名称的盒子，里面存放的值可以改变。就像白板：你可以擦掉再写上新内容。在伪代码中，myScore ← 10 就把 10 放进这个盒子。
Constant – A named value that never changes once set. Use the analogy of the speed of light c – lways 3 × 10⁸ m/s. Declaring a constant protects critical data from accidental alteration.
常量——一旦设定就永不改变的有名值。用光速 c 来类比吧——始终是 3 × 10⁸ 米/秒。声明常量可以保护关键数据不被意外修改。
Data type – The category of a piece of data, such as integer, real/float, Boolean, character, or string. Memory trick: 'IRBCS' – Ice-cream Real Boolean Crunchy Strings. Different types consume different amounts of memory.
数据类型——数据的类别，例如整数、实数/浮点数、布尔值、字符或字符串。记忆技巧：'IRBCS'——Ice-cream Real Boolean Crunchy Strings。不同类型占用的内存不同。
Identifier – The name given to a variable, constant, subroutine, or module. It must be unique and descriptive. Picture a passport: your identifier is your name; no two passports in the same scope should share it.
标识符——赋予变量、常量、子程序或模块的名字。必须唯一且有描述性。想象一本护照：你的标识符就是姓名；同一个作用域内不应有重复。
Assignment – The act of giving a value to a variable using the ← operator. Read it as 'becomes'. minutes ← hours × 60 reads naturally: minutes becomes hours multiplied by 60.
赋值——使用 ← 运算符给变量赋予值的行为。读作‘变成’。minutes ← hours × 60 读起来很自然：分钟变成小时乘以 60。
2. Data Structures Part 1: Arrays and Lists | 数据结构之一：数组与列表
Array – A numbered sequence of elements, all of the same data type, stored contiguously in memory. Think of a row of lockers numbered 0, 1, 2, ... Each locker holds exactly one item of the same size (e.g., an integer). Access is instant via index.
数组——相同数据类型元素的编号序列，在内存中连续存放。想象一排编号为 0、1、2 的储物柜。每个柜子放一个相同大小的物品（如整数）。通过索引可即时访问。
2D Array – An array of arrays, forming a grid. Picture a cinema seating chart: rows and columns. seats[3][5] locates row 4, seat 6 (since indexing often starts at 0). Use the mnemonic 'RC' – Row then Column.
二维数组——数组的数组，形成一个网格。想象电影院座位图：行和列。seats[3][5] 定位到第 4 排第 6 座（索引通常从 0 开始）。用助记符‘RC’——先 Row 后 Column。
List (dynamic array) – A data structure that can grow or shrink, storing items inside an underlying array that is re-sized as needed. Compare to a supermarket trolley: you add and remove items freely, and the trolley doesn't mind how many you have, as long as it can expand.
列表（动态数组）——可以增长或收缩的数据结构，将项目存储在底层数组中，并按需调整大小。好比超市购物车：你自由地放入和取出物品，只要购物车能够扩展，它不在乎你有多少东西。
Tuple – e, test_date). You can change the whole tuple, but not an individual element once created.
元组——有序、不可变的项目集合，通常包含混合数据类型。好比医学检验结果：(患者ID, 体温, 检测日期)。你可以整体更换元组，但一旦创建，就不能单独修改其中的元素。
Record – A collection of related fields, each with a name and a data type, stored as a single unit. Like a student file: (Name: String, Year: Integer, Average: Real). In pseudocode, records are often defined with TYPE … ENDTYPE.
记录——相关字段的集合，每个字段有名称和数据类型，作为一个整体存储。如同学生档案：(姓名：字符串，年级：整数，平均分：实数)。伪代码中通常用 TYPE … ENDTYPE 来定义记录。
3. Data Structures Part 2: Stacks, Queues and Trees | 数据结构之二：栈、队列与树
Stack (LIFO) – Last In, First Out. Picture a stack of cafeteria trays: you can only take the top tray off, and you put new trays on top. Operations: push (add), pop (remove), peek (look at top). The stack pointer tracks the top position.
栈（后进先出）——最后进入的最先出来。想象一叠自助餐厅托盘：你只能取走最上面那个，新托盘也放在顶部。操作：push（压入）、pop（弹出）、peek（查看栈顶）。栈指针追踪栈顶位置。
Queue (FIFO) – First In, First Out. A line of people at a bus stop: the first person to arrive boards first. In a linear queue, items join the rear and leave the front. Two pointers – front and rear – manage the queue.
队列（先进先出）——先进入的先离开。公交站排队的人们：最先到的人最先上车。在线性队列中，项目在后端加入，从前端离开。两个指针——front 和 rear——管理队列。
Circular queue – A queue where the rear pointer wraps around to the beginning to reuse empty space. Picture a clock face: after position 11 comes position 0 again. This avoids dequeue shuffling and saves memory.
循环队列——一种队列，其 rear 指针会绕回开头以重用空位。想象一个钟面：11 号位置之后又是 0 号位置。这样避免了出队时的数据移动，节省内存。
Priority queue – Items each carry a priority; highest priority is served first. An airport check-in: business class passengers go before economy, regardless of arrival time. Often implemented with a heap.
优先队列——每个项目带有优先级；优先级最高者最先获得服务。机场值机：商务舱乘客先于经济舱登机，不管他们何时到达。通常用堆来实现。
Binary tree – ts→parents→children. In a binary search tree, left < parent < right, allowing fast lookup.
二叉树——一种层次结构，每个节点最多有两个子节点：左子节点和右子节点。想象一个祖父母→父母→孩子的家谱。在二叉搜索树中，左子 < 父节点 < 右子，可实现快速查找。
4. Algorithms: Searching and Sorting | 算法：查找与排序
Linear search – Checks every element one by one until the target is found or the list ends. Like scanning a bookshelf from left to right for a specific title. O(n) time complexity – fine for small data, slow for large.
线性查找——逐个检查每个元素，直到找到目标或列表结束。像从左到右扫描书架寻找某一本书。时间复杂度 O(n)——对少量数据不错，但数据量大时很慢。
Binary search – Requires a sorted list. Repeatedly divides the search interval in half; if the middle item is too low, discard the left half, and vice versa. Like finding a word in a dictionary: open near the middle and decide which way to go. O(log n).
二分查找——需要已排序的列表。反复将查找区间减半；如果中间项过小，丢弃左半部分，反之亦然。如同查字典：翻开大致中部，判断转向哪边。时间复杂度 O(log n)。
Bubble sort – Compares adjacent pairs and swaps them if they are in the wrong order, bubbling the largest element to the end with each pass. Sing the 'bubble up' rhyme: 'Big ones bubble to the right, one by one, every night.' O(n²) comparisons.
冒泡排序——比较相邻的元素对，若顺序错误则交换，每一趟将最大的元素‘冒泡’到末尾。唱一段‘冒泡’口诀：‘大数向右冒，一趟一个跑。’比较次数为 O(n²)。
Insertion sort – Builds the sorted list one item at a time, picking the next item and inserting it into its correct position among the already sorted items. Think of organising a hand of playing cards: take a new card and slide it into place. O(n²) but efficient on nearly sorted data.
插入排序——逐个将项目插入已排序部分中的正确位置，逐步构建排序列表。想象整理一手扑克牌：拿起一张新牌，插入合适的位置。时间复杂度 O(n²)，但在数据接近有序时很高效。
Merge sort – A divide-and-conquer algorithm: splits the list into halves recursively until single elements remain, then merges them back in order. Use the mnemonic 'Divide, sort each side, merge, and glide.' O(n log n) time but requires extra space.
归并排序——一种分治法：递归地将列表分为两半，直到只剩下单个元素，再按顺序合并回来。助记口诀：‘分两半，各自排，合并起来真快哉。’时间 O(n log n)，但需要额外空间。
5. Computer Architecture and the CPU | 计算机体系结构与 CPU
ALU (Arithmetic Logic Unit) – The part of the CPU that performs arithmetic and logical operations. Picture a calculator inside the brain of the computer: it does all the maths and comparisons (AND, OR, NOT).
算术逻辑单元——CPU 中执行算术和逻辑运算的部件。想象电脑大脑里的一个计算器：它负责所有数学运算和比较（AND、OR、NOT）。
Control Unit (CU) – Directs the flow of data and instructions, using the decode stage of the fetch-decode-execute cycle. It's the conductor of the orchestra, telling everyone what to do and when.
控制单元——通过取指-译码-执行周期中的译码阶段，指挥数据与指令的流动。就像乐队的指挥，告诉每个人做什么、什么时候做。
Registers – Tiny, super-fast memory locations inside the CPU. Key ones: Program Counter (PC) holds the address of the next instruction; Memory Address Register (MAR) holds the address being read/written; Memory Data Register (MDR) holds the actual data; Accumulator (ACC) holds interim results. Think of them as Post-it notes on the CPU's desk.
寄存器——CPU 内极快的小型存储位置。关键的几个：程序计数器（PC）存放下一条指令的地址；内存地址寄存器（MAR）存放被读写地址；内存数据寄存器（MDR）存放实际数据；累加器（ACC）存放中间结果。把它们想象成 CPU 桌面上的便利贴。
Fetch-Decode-Execute cycle – The heart of instruction processing. Fetch: instruction fetched from memory address in PC into MDR and then CIR. Decode: CU interprets it. Execute: ALU or other components perform the operation. Repeat. Sing it like a heartbeat: 'Fetch, decode, execute – the CPU won't go mute.'
取指-译码-执行周期——指令处理的核心。取指：从 PC 指向的内存地址取出指令，先存入 MDR 再送 CIR。译码：控制单元解读指令。执行：ALU 或其他部件执行操作。周而复始。像心跳一样唱：‘Fetch, decode, execute – CPU 不会静音。’
Von Neumann architecture – A design where both data and instructions share the same memory and a single bus. Remembered by 'One memory, one bus, no fuss.' The bottleneck occurs because the bus alternates between data and instructions.
冯·诺依曼体系结构——数据和指令储存在同一个内存中，共用一条总线的设计。记住：“一个内存，一条总线，简单不闹”。由于总线在数据和指令间交替传送，会产生瓶颈。
6. Systems Software and Operating Systems | 系统软件与操作系统
Operating system – The master software that manages hardware, runs applications, and provides a user interface. Think of it as the hotel manager: allocates rooms (memory), schedules cleaners (processor time), hands out keys (security).
操作系统——管理硬件、运行应用程序并提供用户界面的主控软件。好比酒店经理：分配房间（内存），安排清洁人员（处理器时间），分发钥匙（安全）。
Memory management – The OS decides where each process lives in RAM, using techniques like paging and segmentation. Analogy: a parking manager assigning spots to cars; virtual memory uses the hard disk as overflow parking when the lot is full.
内存管理——操作系统决定每个进程在 RAM 中的存放位置，使用分页和分段等技术。类比：停车管理员为汽车分配车位；当停车场满时，虚拟内存用硬盘作为溢出停车位。
Interrupt – A signal from hardware or software telling the CPU to pause its current task and run an interrupt service routine (ISR). Picture a fire alarm in the hotel: the manager drops everything to handle the emergency, then resumes normal work.
中断——来自硬件或软件的信号，告诉 CPU 暂停当前任务，转去运行中断服务程序（ISR）。想象酒店里的火警：经理放下所有事情处理紧急情况，之后再恢复正常工作。
Scheduling – The OS decides which process gets CPU time next. Round robin gives each a time slice; shortest job first serves quick tasks early; priority-based scheduling favours important processes. Use the sentence 'Red Squirrels Prefer Quick Nuts' (Round robin, SJF, Priority, Multi-level queue).
调度——操作系统决定接下来哪个进程获得 CPU 时间。轮转法给予每个进程时间片；最短作业优先尽早服务短任务；基于优先级的调度偏爱重要进程。用句子‘Red Squirrels Prefer Quick Nuts’记住：轮转、最短作业、优先级、多级队列。
Utility software – Extra tools that keep the system efficient and secure: defragmentation, encryption, compression, anti-malware. Remember 'DECA' – Defrag, Encrypt, Compress, Anti-virus. These are like a toolkit in the hotel maintenance closet.
实用工具软件——保持系统高效和安全的附加工具：碎片整理、加密、压缩、反恶意软件。记住‘DECA’——Defrag、Encrypt、Compress、Anti-virus。就像酒店维修柜里的工具箱。
7. Networking Fundamentals | 网络基础
LAN vs WAN – A Local Area Network covers a small geographical area (a building or campus) with private cabling or Wi-Fi. A Wide Area Network connects LANs over long distances using leased lines or the internet. Memorable phrase: 'LAN is my home; WAN is the world.'
局域网与广域网——局域网覆盖小区域（一栋楼或校园），使用私有线缆或 Wi-Fi。广域网通过租用线路或互联网连接远距离的局域网。好记的句子：‘LAN 是我家，WAN 是世界。’
Protocol – A set of rules governing data communication. Think of diplomatic etiquette: when two ambassadors meet, they must shake hands, exchange docs, and follow a specific order. TCP/IP, HTTP, FTP, SMTP are all protocols.
协议——管理数据通信的一组规则。想象外交礼节：两名大使会面时，必须握手、交换文书并遵循特定顺序。TCP/IP、HTTP、FTP、SMTP 都是协议。
TCP/IP stack – A four-layer model: Application (e.g. HTTP), Transport (TCP/UDP), Internet (IP), and Link (Ethernet). Use the mnemonic 'A Tired Insect Lives' (Application, Transport, Internet, Link). Each layer adds a header to the data.
TCP/IP 协议栈——一个四层模型：应用层（如 HTTP）、传输层（TCP/UDP）、网络层（IP）、链路层（以太网）。助记法：‘A Tired Insect Lives’——应用、传输、网络、链路。每一层都给数据加上头部。
Packet switching – Data is split into packets, each travelling independently across the network and reassembled at the destination. Like sending chapters of a book through separate postmen, then binding them at the destination. Packets have headers with source/destination IPs and sequence numbers.
分组交换——数据分成一个个包，各自独立穿过网络，在目的地重组。就像把一本书的各章交给不同的邮递员，最后在目的地装订。每个包都有一个头部，携带源/目的地 IP 和序号。
Client-server vs Peer-to-peer – In client-server, a central server provides resources and services to client machines (like a library where a librarian fetches books). In P2P, all nodes are equal and share resources directly (like a book-swap club where everyone shares with everyone).
客户机-服务器 vs 对等网络——客户机-服务器模式下，中央服务器向客户机提供资源和服务（就像图书馆，管理员取书）。P2P 中，所有节点平等，直接共享资源（如同换书俱乐部，人人互换）。
8. Databases and SQL | 数据库与 SQL
Relational database – Data organised into tables (relations) with rows (tuples) and columns (attributes). Tables are linked by primary and foreign keys. Picture separate Excel sheets for Customers and Orders, connected by CustomerID.
关系数据库——数据组织成表（关系），包含行（元组）和列（属性）。表之间通过主键和外键关联。想象分开的 Excel 表格：Customers 和 Orders，由 CustomerID 相连。
Primary key vs Foreign key – A primary key uniquely identifies each record in a table (like a national insurance number). A foreign key in another table points to a primary key, creating a link. The foreign key is the 'bridge' between tables.
主键与外键——主键唯一标识表中的每条记录（如社保号）。另一张表中的外键指向某主键，建立联系。外键就是表之间的‘桥梁’。
Normalisation – The process of organising data to reduce redundancy and dependency. First normal form (1NF): no repeating groups. Second normal form (2NF): all non-key attributes depend on the whole primary key. Third normal form (3NF): no transitive dependencies. Think of it like tidying a messy garage into labelled boxes by themes.
规范化——组织数据以减少冗余和依赖的过程。第一范式（1NF）：无重复组。第二范式（2NF）：所有非键属性完全依赖于整个主键。第三范式（3NF）：无传递依赖。就像把杂乱的车库按主题整理成贴有标签的盒子。
SQL key verbs – SELECT … FROM … WHERE … ORDER BY is the core query structure. INSERT INTO adds rows, UPDATE … SET changes rows, DELETE FROM removes rows. Remember the action words: 'Select the good, Insert the new, Update the old, Delete the false.'
SQL 关键动词——SELECT … FROM … WHERE … ORDER BY 是核心查询结构。INSERT INTO 添加行，UPDATE … SET 修改行，DELETE FROM 删除行。记住动作词：‘选其善者，插其新者，更其旧者，删其伪者。’
Entity Relationship Diagram (ERD) – A visual representation of tables and their relationships. Rectangles are entities, diamonds are relationships, ovals are attributes. Use the phrase 'Elephants Rarely Dance Over Ants' to recall Entity, Relationship, Diamond, Oval, Attribute.
实体关系图——表及其关系的可视化表示。矩形代表实体，菱形代表关系，椭圆代表属性。用短语‘Elephants Rarely Dance Over Ants’来记：Entity, Relationship, Diamond, Oval, Attribute。
9. Computational Thinking and Problem Solving | 计算思维与问题解决
Abstraction – The process of removing unnecessary detail to focus on the essential features of a problem. When you draw a stick figure, you abstract away hair, clothes, and eyes to show just the main form. In programming, we use classes, functions, and data hiding.
抽象——去除不必要的细节，专注于问题的本质特征的过程。画简笔画时，你抽象掉了头发、衣服和眼睛，只表现主要形态。编程中，我们使用类、函数和数据隐藏来实现抽象。
Decomposition – ts → combine → bake → cool. Each sub-task can be solved independently or assigned to a team member.
分解——将复杂问题拆解成更小、可管理的子部分。烤蛋糕分解为：收集原料 → 混合干料 → 混合湿料 → 合并 → 烘烤 → 冷却。每个子任务可以独立解决或分配给不同成员。
Algorithmic thinking – A step-by-step logical approach to solving problems. It's like writing a recipe so precise that even a robot could follow it. Key features: sequence, selection (IF), iteration (loops). Use the mantra 'Step, Decide, Repeat.'
算法思维——一种逐步逻辑地解决问题的方法。就像编写一份精确到机器人也能照做的食谱。关键特征：顺序、选择（IF）、迭代（循环）。口诀：‘步骤、判断、重复。’
Pattern recognition – Identifying similarities and common patterns in problems to reuse solutions. If you've solved a maze, you can apply similar backtracking principles to tree traversal. This is the essence of experience in programming.
模式识别——找出问题中的相似性和共性模式，以复用解决方案。如果你解过迷宫，就能把类似的回溯原理应用到树的遍历上。这就是编程经验的精髓。
Trace table – A tool to simulate a program manually, tracking variable values step by step. Columns: line number, variables, conditions, output. It's the programmer's magnifying glass to find logic errors without running the code.
跟踪表——手动模拟程序的工具，逐步追踪变量的值。列包括：行号、变量、条件、输出。它是程序员的放大镜，无需运行代码就能发现逻辑错误。
10. Ethics, Law and Data Security | 伦理、法律与数据安全
Data Protection Act (2018/GDPR) – Principles for handling personal data: processed fairly and lawfully, used for specified purposes, adequate and relevant, accurate and up-to-date, not kept longer than necessary, processed securely. Mnemonic: 'Fresh Pizzas Are Always Awesome, Please Share' (Fair, Purpose, Adequate, Accurate, Always kept minimum, Processed Safe).
数据保护法（2018 / GDPR）——处理个人数据的原则：公平合法处理、用于指定目的、充分相关、准确且最新、保存时间不超必要、安全处理。助记：‘Fresh Pizzas Are Always Awesome, Please Share’（公平、目的、充分、准确、最小保存、安全处理）。
Computer Misuse Act (1990) – Three levels of offence: unauthorised access (logging in without permission), unauthorised access with intent to commit further crimes, unauthorised acts with intent to impair operation (e.g., spreading malware). Remember the 3 A's: Access, Additional crime, And damage.
计算机滥用法（1990）——三级犯罪：未经授权访问（未经允许登录）、意图进行进一步犯罪的未经授权访问、意图破坏运行的未经授权行为（如传播恶意软件）。记住 3 个 A：Access（访问）、Additional crime（附加犯罪）、And damage（并且造成损害）。
Copyright, Designs and Patents Act (1988) – Protects original works: software code, algorithms, digital art. Without a licence, copying code is theft. Think of it like music piracy: you can't use someone else's track without permission or a licence.
版权、设计和专利法（1988）——保护原创作品：软件代码、算法、数字艺术。无许可证复制代码即盗窃。把它想象成音乐盗版：未经许可不能使用他人的曲目。
Encryption – Scrambling data so only authorised parties can read it. Plaintext enters an algorithm using a key, producing ciphertext. The Caesar cipher shifts letters by a fixed number; modern encryption like AES uses far more complex keys. Picture a letter sealed in a lockbox; only the intended receiver has the key.
加密——将数据打乱，只有授权方能读取。明文通过使用密钥的算法产生密文。凯撒密码将字母移动固定位置；AES 等现代加密使用更复杂的密钥。想象一封信锁在保险箱里，只有指定接收者才有钥匙。
Authentication vs Verification – Verification checks that data entered matches its original (like re-typing a password). Authentication confirms the identity of a user (like presenting a passport). Dual concept: 'Verify WHAT you entered; Authenticate WHO you are.'
验证与认证——验证（Verification）检查输入数据是否与原数据一致（如再次输入密码）。认证（Authentication）确认用户身份（如出示护照）。双重概念：‘验证你输入了什么；认证你是谁。’
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图