📚 Year 13 OCR Computer Science: Key Terminology Memorisation Guide | A-Level OCR 计算机科学 Year 13：核心术语速记指南
Welcome to your essential quick-reference guide for the terminology you’ll meet in Year 13 OCR A-Level Computer Science. Each term is paired with a concise explanation and a memorable aid – in English and Chinese – to help you recall concepts faster, whether you’re preparing for Component 01 or Component 02. Let’s lock those definitions into your long-term memory.
欢迎来到 Year 13 OCR A-Level 计算机科学核心术语速记指南。每个术语都配有简明解释和记忆法，中文英文双双呈现，帮助你在复习 Component 01 和 Component 02 时更快锁定关键概念，把定义刻进长期记忆。
1. Processor Architecture & Performance | 处理器架构与性能
Modern CPUs use a range of techniques to execute instructions efficiently. Mastering these terms will help you explain how clock speed, pipelining, instruction sets, and parallel architectures impact performance.
现代CPU 采用多种技术高效执行指令。掌握以下术语，将助你解释时钟频率、流水线、指令集和并行架构如何影响性能。
-
Clock Speed: The number of cycles a CPU completes per second, measured in gigahertz (GHz). Higher clock speeds generally mean more instructions per second.
时钟频率：CPU 每秒完成的周期数，以 GHz 为单位。通常频率越高，每秒执行的指令数越多。
Memory aid: Think of it as the ‘heartbeat’ of the processor – a faster beat drives quicker operations.
记忆法： 把它想象成处理器的’心跳’，节拍越快，操作越迅速。
-
Pipelining: A technique that overlaps the fetch, decode, and execute stages of multiple instructions, so one instruction is being decoded while another is being fetched.
流水线：通过重叠多条指令的取指、译码、执行等阶段来提高吞吐量，例如在一条指令译码的同时取下一条指令。
Memory aid: Picture a car wash – each station (stage) works on a different car simultaneously, so cars exit faster.
记忆法： 想象一个洗车间，各工位（阶段）同时处理不同的车，车辆洗完的速度更快。
-
CISC (Complex Instruction Set Computer): A processor design where a single instruction can carry out several low-level operations, simplifying code but often requiring multiple clock cycles.
CISC（复杂指令集计算机）：一种处理器设计，单条指令可完成多个底层操作，简化代码但通常需要多个时钟周期。
Memory aid: CISC = Can Incorporate Several Commands in one go.
记忆法： CISC：一条指令能’包办’好几件小事，如同万能工具。
-
RISC (Reduced Instruction Set Computer): A design philosophy using a small, highly optimised set of simple instructions, each typically executing in a single clock cycle.
RISC（精简指令集计算机）：采用少量、高度优化的简单指令，每条指令通常在一个时钟周期内完成。
Memory aid: RISC = Repeated Instructions, Simple & Cool – small but fast.
记忆法： RISC：指令精简，小而精悍，每次只做一件简单任务，速度极快。
-
Multicore & Parallel Processing: A single chip containing two or more independent cores that can run threads simultaneously, enabling true parallelism.
多核与并行处理：单个芯片上集成多个独立核心，能同时运行线程，实现真正的并行。
Memory aid: One kitchen, multiple chefs – tasks finish faster because chefs work on different dishes at the same time.
记忆法： 一个厨房里多个厨师，各炒各的菜，整体出餐速度自然加快。
-
SIMD (Single Instruction, Multiple Data): A parallel architecture where the same operation is applied to multiple data points at once, common in GPUs and vector processing.
SIMD（单指令多数据）：一种并行架构，同一操作同时应用于多个数据点，常见于GPU和向量处理。
Memory aid: A single drill command shouted to an entire marching band – everyone turns left in the same way.
记忆法： 一声口令，所有队员同时向左转——同一指令，全体执行。
2. Operating Systems & Memory Management | 操作系统与内存管理
Operating systems abstract hardware and manage resources. Key memory concepts such as paging, virtual memory, and segmentation are vital for understanding how programs run without conflict.
操作系统抽象硬件并管理资源。分页、虚拟内存、分段等内存概念是理解程序无冲突运行的关键。
-
Virtual Memory: A memory management technique that uses disk space to extend apparent main memory, allowing larger programs to run by swapping pages between RAM and disk.
虚拟内存：一种用磁盘空间扩展主存容量的技术，通过在RAM和磁盘间换页，让更大的程序得以运行。
Memory aid: Virtual memory is like a credit card – you get extra spending power, but using it too much slows you down (thrashing).
记忆法： 虚拟内存像信用卡，给你额外的空间，但过度依赖会变慢（颠簸）。
-
Paging: Memory is divided into fixed-size physical frames and logical pages. A page table maps logical addresses to physical frames, enabling non-contiguous allocation.
分页：内存划分为固定大小的物理页框和逻辑页面。页表记录逻辑地址到物理页框的映射，实现非连续分配。
Memory aid: Paging is like a book – pages (logical) are scattered, but the index (page table) brings them together.
记忆法： 分页如同书籍，书页（逻辑页）散落各处，目录（页表）将其整合。
-
Segmentation: Divides programs into variable-sized logical segments (code, stack, heap) that reflect the programmer’s view, each with base and limit registers.
分段：将程序按逻辑划分为大小可变的段（代码段、栈段、堆段），反映程序员视角，每段有基址和界限。
Memory aid: Segments are like chapters of different lengths – each chapter (segment) has its own start and end.
记忆法： 分段就像不同长度的章节，每章（段）有自己的起始和边界。
-
Page Fault & Thrashing: A page fault occurs when a required page is not in RAM and must be fetched from disk. Thrashing is when the system spends more time swapping pages than executing processes.
缺页与颠簸：缺页发生时所请求的页面不在RAM中，须从磁盘调入。颠簸是系统花在换页上的时间多于执行进程的时间。
Memory aid: Page fault = ‘book not on desk’, thrashing = ‘constantly running to the library instead of reading’.
记忆法： 缺页就像’书不在桌上’，颠簸则是’不停跑去借书而没时间看’。
-
Interrupt: A signal to the CPU indicating an event that needs immediate attention, causing the processor to save its state and execute an interrupt service routine (ISR).
中断：发给CPU的信号，表示需要立即处理的事件，CPU保存当前状态后执行中断服务程序。
Memory aid: A tap on the shoulder while you’re working – you pause, handle the request, then resume.
记忆法： 工作正忙时有人轻拍肩膀——你暂停手里的事，处理完再继续。
3. Data Structures & Abstract Data Types | 数据结构与抽象数据类型
Data structures provide patterns for organising and accessing data efficiently. Here you’ll encounter stacks, queues, trees, graphs, and hash tables – fundamental to algorithm design.
数据结构为高效组织和访问数据提供了模式。栈、队列、树、图、哈希表都是算法设计基础，需要牢记。
-
Stack (LIFO): A linear data structure where elements are added (push) and removed (pop) from the same end, the top. Last-In, First-Out.
栈（后进先出）：一种线性数据结构，元素的添加（压栈）和删除（弹栈）都在同一端（栈顶）进行。
Memory aid: A stack of plates in a cafeteria – you take the topmost plate first.
记忆法： 自助餐厅里的盘子堆，你只会取最上面的那个盘子。
-
Queue (FIFO): A linear structure where elements join at the rear and leave from the front – First-In, First-Out.
队列（先进先出）：元素在队尾入队，在队首出队，先进先出。
Memory aid: A ticket queue – the person who arrives first gets served first.
记忆法： 排队买票，先来的人先得到服务。
-
Binary Tree & BST: A hierarchical data structure where each node has up to two children. A Binary Search Tree (BST) maintains the property left < parent < right for fast search.
二叉树与二叉搜索树：层次化数据结构，每个节点最多两个子节点。二叉搜索树保证左子节点 < 父节点 < 右子节点以加速查找。
Memory aid: Think of a family tree, but with no more than two children and sorted by age for BST.
记忆法： 像家谱，但每对父母最多两个孩子，且BST按年龄’左小右大’排列。
-
Graph: A set of vertices connected by edges, used to model networks, maps, and relationships. Can be directed or undirected.
图：由顶点和边组成的结构，用来模拟网络、地图和关系。可分为有向图和无向图。
Memory aid: Cities (vertices) linked by roads (edges); one-way streets make it directed.
记忆法： 城市是顶点，道路是边；单行道就成了有向图。
-
Hash Table: A data structure that maps keys to values using a hash function, offering average O(1) lookup. Collisions are resolved by chaining or open addressing.
哈希表：利用哈希函数将键映射到值的数据结构，平均查找时间 O(1)。冲突通过拉链法或开放寻址解决。
Memory aid: A super librarian hashes book titles to shelf numbers; two books getting the same shelf is a collision.
记忆法： 超级图书管理员用哈希函数把书名编到书架号；两本书分到同一书架就是冲突。
4. Algorithm Efficiency & Complexity | 算法效率与复杂度
Big O notation is the language of algorithm analysis. You must be able to classify common complexities and understand what they mean for large input sizes.
大O表示法是算法分析的语言。你必须会归类常见复杂度并理解其对大规模输入的意义。
-
Big O Notation: Describes the upper bound of an algorithm’s time or space requirements as input size n grows, expressed as O(f(n)).
大O表示法：描述输入规模 n 增大时算法时间或空间需求的上限，记作 O(f(n))。Published by TutorHao | Year 13 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导