Quick Guide to Memorising AS AQA Computer Science Terminology | AS AQA 计算机：词汇术语速记指南

📚 Quick Guide to Memorising AS AQA Computer Science Terminology | AS AQA 计算机：词汇术语速记指南

Mastering the precise terminology is half the battle in AS AQA Computer Science. This guide provides proven memory techniques tailored to the AQA specification, helping you recall definitions of algorithms, data structures, hardware components, networking concepts, and programming terms with clarity and confidence.

在 AS AQA 计算机科学中，精准掌握术语是成功的一半。本指南提供了专为 AQA 考纲量身定制的行之有效的记忆技巧，帮助你清晰、自信地回想算法、数据结构、硬件组件、网络概念和编程术语的定义。

1. Acronyms & Initialisms | 首字母缩略词与缩写记忆法

Create catchy acronyms for sequences or groups of terms. For the CPU’s Fetch-Decode-Execute cycle, remember ‘Freddie Doesn’t Eat’ (FDE). For the four main factors affecting CPU performance, use ‘C-CLOCK’: Cores, Clock speed, Cache, and Look-again (actually, just remember Cores, Clock speed, Cache size – but mnemonics help). The TCP/IP stack layers – Application, Transport, Internet, Link – can become ‘All Tigers In Love’.

为一系列或一组术语创建朗朗上口的首字母缩略词。对于 CPU 的取指-译码-执行周期，可以记住 ‘Freddie Doesn’t Eat’（FDE）。对于影响 CPU 性能的四个主要因素，可用 ‘C-CLOCK’：核心数（Cores）、时钟速度（Clock speed）、缓存（Cache）和再看一次（其实是概念加深）。TCP/IP 协议栈的各层 —— 应用层、传输层、互联网层、链路层 —— 可以变成 ‘All Tigers In Love’。

The AQA spec includes the OSI model only for comparison – but you can still use mnemonics for the seven layers: ‘Please Do Not Throw Sausage Pizza Away’ (Physical, Data Link, Network, Transport, Session, Presentation, Application). For sorting algorithms: Bubble, Insertion, Merge, Quick – remember ‘BIMQ’ or ‘Big Insane Merging Quacks’.

AQA 考纲中仅将 OSI 模型作为对比，但你仍可用口诀记忆七层：’Please Do Not Throw Sausage Pizza Away’（物理层、数据链路层、网络层、传输层、会话层、表示层、应用层）。对于排序算法：冒泡、插入、归并、快速 —— 记住 ‘BIMQ’ 或编个搞笑的句子。

For object-oriented programming pillars in AQA AS: Abstraction, Encapsulation, Inheritance, Polymorphism – the acronym ‘A E I P’ or phrase ‘All Elephants In Pyjamas’ sticks instantly.

AQA AS 中面向对象编程的支柱：抽象、封装、继承、多态 —— 首字母 ‘A E I P’ 或句子 ‘All Elephants In Pyjamas’ 立马能记住。

---

2. Visual Imagery & Analogies | 图像联想与类比

Turn abstract terms into vivid mental pictures. For a stack data structure, picture a stack of cafeteria trays; LIFO (Last In First Out) is intuitive. The push and pop operations are like adding and removing trays. For a queue, imagine a ticket line – FIFO (First In First Out). Enqueue adds a person to the back, dequeue serves the person at the front.

将抽象术语转化为生动的脑中画面。对于栈数据结构，想象一叠食堂托盘；后进先出（LIFO）很直观。入栈和出栈操作就像加上和拿走托盘。对于队列，想象排队买票 —— 先进先出（FIFO）。入队就是在队尾增加一个人，出队就是服务队首的人。

For the fetch-decode-execute cycle, visualise a librarian (the control unit) fetching a book (instruction) from the shelf (RAM), decoding the title (what to do), and then executing the task (reading the book). The ALU is the ‘brain’ that does the maths. Registers are tiny note pads the librarian uses for immediate numbers.

对于取指-译码-执行周期，想象一位图书管理员（控制单元）从书架（RAM）取书（指令），解读书名（做什么），然后执行任务（读书）。算术逻辑单元 ALU 是做数学的“大脑”。寄存器是管理员用来记临时数字的便利贴。

Networking terms: a packet is like a postcard with a destination address. The router is a post office sorting centre. The protocol is the language both post offices agree on. Encryption is putting the postcard in a locked box.

网络术语：数据包就像一张写有目的地址的明信片。路由器是邮局分拣中心。协议是双方邮局约定的语言。加密就是把明信片放进一个上锁的盒子里。

---

3. Etymology & Word Roots | 词源与词根拆解

Many computer science terms have logical roots. ‘Algorithm’ stems from the Persian mathematician al-Khwarizmi. ‘Compiler’ compiles – it gathers the entire source code and translates it all at once before execution. ‘Interpreter’ interprets – it reads and translates line by line during runtime. ‘Abstraction’ literally means ‘drawing away’ – hiding complexity by drawing away unnecessary details.

许多计算机术语的词根很有逻辑。’Algorithm’（算法）源自波斯数学家花拉子米。’Compiler’（编译器）会 compile（编汇）—— 它收集整个源代码并一次性翻译，之后再执行。’Interpreter’（解释器）会 interpret（解释）—— 它在运行时逐行读取并翻译。’Abstraction’（抽象）字面意思就是“抽离”—— 通过抽离不必要的细节来隐藏复杂度。

Remember: ‘Polymorphism’ = poly (many) + morph (form). An object can take many forms. ‘Inheritance’ – a child class inherits attributes and methods from a parent, just like biological inheritance. ‘Encapsulation’ – putting data and methods inside a capsule (class) and protecting them.

记住：’Polymorphism’（多态）= poly（多）+ morph（形态）。一个对象可以有多种形态。’Inheritance’（继承）—— 子类从父类继承属性和方法，就像生物遗传。’Encapsulation’（封装）—— 将数据和方法放进一个胶囊（类）里并加以保护。

For databases: ‘Normalisation’ means making data normal (reducing redundancy) by applying normal forms. ‘Primary key’ uniquely identifies a record – the ‘primary’ way to pick one row. ‘Foreign key’ is a ‘foreign’ reference linking to another table’s primary key.

数据库方面：’Normalisation’（规范化）是通过应用范式使数据变得 normal（规范），减少冗余。’Primary key’（主键）唯一标识一条记录 —— 是选取一行的 ‘primary’（主要）方式。’Foreign key’（外键）是一个 ‘foreign’（外来的）引用，链接到另一张表的主键。

---

4. Categorisation & Grouping | 分类与群组划分

Group related terms under umbrella headings. For example, all searching algorithms (linear search, binary search) and sorting algorithms (bubble sort, insertion sort, merge sort, quick sort) belong to ‘Algorithm Complexity’. Within that, separate those with O(n²) worst-case (bubble, insertion) from O(n log n) (merge, quick) – a simple table makes this stick.

将相关术语归入概括性标题下。例如，所有搜索算法（线性搜索、二分搜索）和排序算法（冒泡排序、插入排序、归并排序、快速排序）都属于“算法复杂度”。在其中，将最坏情况 O(n²) 的算法（冒泡、插入）与 O(n log n) 的算法（归并、快速）分开 —— 一张简单的表格就能加深记忆。

Algorithm	Best Case	Average Case	Worst Case
Bubble Sort	O(n)	O(n²)	O(n²)
Insertion Sort	O(n)	O(n²)	O(n²)
Merge Sort	O(n log n)	O(n log n)	O(n log n)
Quick Sort	O(n log n)	O(n log n)	O(n²)

Group hardware terms: input devices (keyboard, mouse, sensors), output devices (monitor, printer, actuators), storage devices (HDD, SSD, optical). The CPU consists of Control Unit (CU), Arithmetic Logic Unit (ALU), and registers (such as Program Counter, Accumulator, MAR, MDR). Visualise a diagram of these parts working together.

将硬件术语分组：输入设备（键盘、鼠标、传感器）、输出设备（显示器、打印机、执行器）、存储设备（HDD、SSD、光盘）。CPU 由控制单元（CU）、算术逻辑单元（ALU）和寄存器（如程序计数器、累加器、MAR、MDR）组成。在脑海中画出这些部件协同工作的框图。

Programming constructs only three: sequence, selection (if, else, switch), iteration (definite: for loop; indefinite: while, do-while). That’s it – any program can be built from these three.

编程结构只有三种：顺序、选择（if、else、switch）、迭代（确定循环：for 循环；非确定循环：while、do-while）。仅此而已 —— 任何程序都可以由这三种结构构建。

---

5. Flashcards & Spaced Repetition | 闪卡与间隔重复

Create digital or physical flashcards with the term on one side and the AQA definition plus an example on the reverse. Use an app like Anki that schedules reviews based on how well you know each card. For example, front: ‘Abstraction’, back: ‘The process of removing unnecessary details so that only the relevant characteristics remain. E.g., a car dashboard abstracts the engine complexity.’

制作电子或纸质闪卡，正面写术语，背面写 AQA 定义外加一个例子。使用像 Anki 这样能根据你对每张卡片的掌握程度安排复习的应用。例如，正面：’Abstraction’（抽象），背面：’去除不必要细节，仅保留相关特征的过程。例如，汽车仪表盘抽象了发动机的复杂细节。’

Tag your cards by topic: ‘Programming’, ‘Data Structures’, ‘Networking’, ‘Databases’, ‘Computer Systems’. This lets you focus on weak areas. Review regularly – just five minutes a day can double your long-term retention.

按主题给你的卡片打上标签：’编程’、’数据结构’、’网络’、’数据库’、’计算机系统’。这样你可以集中攻克薄弱部分。坚持定期复习 —— 每天只需五分钟，就能使你的长期记忆翻倍。

Reverse flashcards: read the definition and recall the term. This mimics exam questions that ask you to ‘Identify the term described’. For example, ‘The part of the CPU that performs addition and logical comparisons’ → ALU.

反向闪卡：阅读定义，回想术语。这模拟了考试中要求你“识别所描述的术语”的题目。例如，“CPU 中执行加法和逻辑比较的部分”→ ALU。

---

6. The ‘Elaborate & Teach’ Method | “详细解释并教会他人”法

Explain a term out loud as if teaching a friend with no computer science background. If you can simplify it without losing accuracy, you truly understand it. Try: ‘A compiler takes your entire program code and translates it into machine code before you run it, like a translator translating a whole book. An interpreter translates and runs one line at a time, like a live translator.’

大声解释一个术语，就好像在教一个毫无计算机背景的朋友。如果你能在不失准确性的前提下把它讲得简单，那你是真的懂了。试试这样讲：’编译器会在你运行程序之前，把你的整个程序代码翻译成机器码，好比一位翻译翻完一整本书。解释器则是一次翻译一行并立刻执行，就像同声传译。’

Record yourself on your phone and listen back. Hearing your own explanation strengthens neural pathways. Better yet, form a study group where each member teaches one topic per session. The act of preparing to teach forces you to organise the terminology logically.

用手机录下自己的讲解，然后回听。听自己的解释能强化神经通路。更好的做法是，组成学习小组，每次活动每个成员教一个主题。准备教学的过程会迫使你逻辑清晰地将术语组织起来。

This method is particularly powerful for complex concepts like the fetch-decode-execute cycle, TCP/IP stack, or how a bubble sort actually swaps adjacent elements. The more senses you involve (speaking, hearing, drawing diagrams), the stronger the memory.

这种方法对复杂概念尤其有效，比如取指-译码-执行周期、TCP/IP 协议栈，或者冒泡排序究竟如何交换相邻元素。你动用的感官越多（说、听、画图），记忆就越牢固。

---

7. The ‘Three Cs’ of Data Structures | 数据结构的“3C”速记

For AS AQA, the key static data structures are arrays and records; dynamic ones are lists, stacks, queues, and binary search trees. Use the three Cs to differentiate: Container, Capacity, and Connection.

AS AQA 要求的关键静态数据结构是数组和记录；动态的有列表、栈、队列和二叉搜索树。用三个 C 来区分：容器（Container）、容量（Capacity）和连接（Connection）。

• Container: what holds the data – an array is a fixed-size container; a list can grow.
• Container（容器）：持有数据的东西 —— 数组是固定大小的容器；列表可以增长。
• Capacity: static structures have fixed size; dynamic structures can change.
• Capacity（容量）：静态结构大小固定；动态结构可以变化。
• Connection: how elements relate – stacks/queues use LIFO/FIFO; trees use parent-child links.
• Connection（连接）：元素如何关联 —— 栈/队列使用 LIFO/FIFO；树使用父子链接。

Add a rhyme: ‘Array is static, list is elastic; Stack from top, queue from front – non-dramatic!’

再编个顺口溜：’Array is static, list is elastic; Stack from top, queue from front – non-dramatic!’（数组静态，列表弹性；栈从顶出，队列从前往前，平淡无奇！）

For binary search trees, remember the rule: left child < parent < right child. Draw a small tree and mentally insert numbers to see how the ordering always holds – this visual pattern is hard to forget.

对于二叉搜索树，记住规则：左孩子 < 父节点 < 右孩子。画一棵小树，在心里插入数字，观察排序规则如何始终成立 —— 这种视觉模式不易忘记。

---

8. Networking Protocols & the ‘Sensible Pizza’ Stack | 网络协议与“聪明的披萨”栈

The AQA AS spec focuses on the TCP/IP four-layer model. To remember the layers from top to bottom, use the phrase: ‘All Talented Internet Lovers’ (Application, Transport, Internet, Link). For protocols at each layer:

AQA AS 考纲侧重于 TCP/IP 四层模型。要记住从上到下的各层，用短语：’All Talented Internet Lovers’（应用层、传输层、互联网层、链路层）。对于各层的协议：

• Application: HTTP, HTTPS, FTP, SMTP, POP3, IMAP – visualise them as ‘web, safe web, file transfer, send mail, pick mail v3, improved mail’.
• 应用层：HTTP、HTTPS、FTP、SMTP、POP3、IMAP —— 将它们想象成“网页、安全网页、传文件、发邮件、取邮件第三版、增强邮件”。
• Transport: TCP (reliable, connection-oriented) and UDP (fast, connectionless) – ‘TCP thinks, UDP shoots’.
• 传输层：TCP（可靠、面向连接）和 UDP（快速、无连接）—— ‘TCP 三思而行，UDP 不管不顾’。
• Internet: IP – the addressing system, like a postal code.
• 互联网层：IP —— 寻址系统，如同邮政编码。
• Link: Ethernet, Wi-Fi – the actual hardware wiring or radio signals.
• 链路层：以太网、Wi-Fi —— 实际的硬件线缆或无线电信号。

Remember the difference between a MAC address and an IP address: MAC is like your fingerprint (fixed hardware identifier), IP is like your current postal address (can change as you move networks).

记住 MAC 地址与 IP 地址的区别：MAC 像你的指纹（固定的硬件标识符），IP 则像你当前的邮寄地址（更换网络时会变）。

For network security, the ‘AAA’ triad helps: Authentication (who you are), Authorisation (what you can access), Accounting (logging what you do). Firewalls filter traffic; encryption scrambles data using symmetric or asymmetric keys.

关于网络安全，“AAA”三要素很有用：认证（你是谁）、授权（你能访问什么）、记账（记录你做了什么）。防火墙过滤流量；加密使用对称或非对称密钥打乱数据。

---

9. Programming Paradigms & OOP Essentials | 编程范式与面向对象要领

AQA AS covers procedural and object-oriented programming. Procedural follows a top-down approach with functions and procedures; OOP revolves around classes and objects. For OOP, use the ‘PIE’ mnemonic for Polymorphism, Inheritance, Encapsulation (and the fourth pillar Abstraction, making ‘A PIE’).

AQA AS 涵盖面向过程编程和面向对象编程。面向过程采用自顶向下的方式，包含函数和过程；面向对象围绕类和对象展开。对于面向对象，用“PIE”口诀记多态、继承、封装（加上第四个支柱抽象，构成 ‘A PIE’）。

• Encapsulation: wrapping data (attributes) and methods into a class, and using access modifiers (private, public) to protect it. Think of a medicine capsule.
• 封装：将数据（属性）和方法包裹在类中，并使用访问修饰符（私有、公有）加以保护。想想药物胶囊。
• Inheritance: a ‘child’ class derives properties and methods from a ‘parent’. E.g., a ‘Dog’ class inherits from ‘Animal’. It promotes code reuse.
• 继承：一个“子”类从“父”类派生属性和方法。例如，“狗”类继承自“动物”类。它促进代码复用。
• Polymorphism: same method name behaves differently depending on the object. Method overriding is a common form.
• 多态：相同的方法名根据对象不同而有不同表现。方法重写是一种常见形式。
• Abstraction: hiding complex implementation details and exposing only essential features. An abstract class cannot be instantiated; it provides a template.
• 抽象：隐藏复杂的实现细节，仅暴露必要功能。抽象类不能实例化；它提供模板。

Inheritance types to know: single, multiple (not supported in Java but concept), hierarchical, and multi-level. Visualise a family tree to keep them straight.

需了解的继承类型：单一继承、多重继承（Java 不支持，但概念要懂）、层次继承和多级继承。画一棵家谱树使其清晰明了。

---

10. Relational Databases & SQL Key Terms | 关系型数据库与 SQL 关键术语

Use the ‘CRUD’ acronym for main database operations: Create (INSERT), Read (SELECT), Update (UPDATE), Delete (DELETE). For normalisation, remember the three normal forms with ‘No repeating groups (1NF), no partial dependencies (2NF), no transitive dependencies (3NF)’.

用“CRUD”首字母记主要数据库操作：创建（INSERT）、读取（SELECT）、更新（UPDATE）、删除（DELETE）。对于规范化，记住三种范式：“无重复组（1NF），无部分依赖（2NF），无传递依赖（3NF）”。

Visualise a table as a spreadsheet. A record is a row, a field is a column. The primary key is the unique ID column. A foreign key is a column that links to the primary key of another table – like a cross-reference. An entity relationship diagram (ERD) shows these links as lines between boxes.

把表想象成电子表格。一条记录就是一行，一个字段就是一列。主键是唯一 ID 列。外键是链接到另一张表的主键的一列 —— 就像交叉引用。实体关系图（ERD）将这些链接表示为方框之间的连线。

SQL syntax is easy to recall if you read it like English: ‘SELECT name, age FROM students WHERE grade> 10 ORDER BY name ASC’. Indexes speed up searches; a composite key uses more than one field to uniquely identify a record.

如果你用英语的语感去读，SQL 语法很容易记住：’SELECT name, age FROM students WHERE grade > 10 ORDER BY name ASC’。索引可以加快搜索速度；复合键使用多个字段来唯一标识一条记录。

Normalisation aims to reduce data redundancy and update anomalies. Think of it as tidying a messy wardrobe: you separate clothes into logical drawers so that you never duplicate a shirt in two drawers.

规范化的目标是减少数据冗余和更新异常。把它想象成整理杂乱的衣橱：你将衣物分门别类放入有逻辑的抽屉，这样就不会有一件衬衫同时出现在两个抽屉里。

---

11. Number Systems & Binary Representation | 数制与二进制表示

Hexadecimal is just a compact way to represent binary. Remember ‘BIN to HEX: groups of 4’. The hex digits 0–9 and A–F; use ‘A=10, B=11, …, F=15’. For two’s complement, the rule is ‘flip bits and add 1’ to get the negative of a binary number. Sign and magnitude simply use the most significant bit as the sign.

十六进制只是表示二进制的一种紧凑方式。记住“二进制转十六进制：四位一组”。十六进制数字 0–9 和 A–F；用“A=10，B=11，……，F=15”。对于二进制补码，规则是“按位取反再加 1”得到二进制数的负数。原码表示法简单地使用最高位作为符号位。

Bitwise operators: AND (&), OR (|), NOT (~), XOR (^). Truth tables are essential – draw them until they become muscle memory. For character encoding, ASCII uses 7 bits (extended ASCII 8 bits) and Unicode uses up to 32 bits, covering many languages. Unicode is a superset of ASCII.

位运算符：AND (&)、OR (|)、NOT (~)、XOR (^)。真值表极为重要 —— 反复绘制直到形成肌肉记忆。关于字符编码，ASCII 使用 7 位（扩展 ASCII 8 位），Unicode 使用最多 32 位，涵盖多种语言。Unicode 是 ASCII 的超集。

Floating point binary stores numbers as mantissa × 2^exponent. Think of scientific notation: 1.23 × 10⁵. The mantissa holds the significant digits, the exponent scales it. Precision relies on the number of bits allocated.

浮点二进制将数字存储为 尾数 × 2^指数。想想科学计数法：1.23 × 10⁵。尾数保存有效数字，指数进行缩放。精度取决于分配的位数。

---

12. Practice with Past Paper Keywords | 结合真题关键词练习

AQA examiners expect precise terminology. Underline command words: ‘State’, ‘Describe’, ‘Explain’, ‘Compare’. ‘State’ needs a definition; ‘Describe’ adds detail; ‘Explain’ gives cause/effect; ‘Compare’ needs similarities and differences. Always use the exact term from the specification – e.g., ‘volatile memory’ not ‘temporary memory’.

AQA 考官期望精确的术语。划出指令词：“陈述”（State）、“描述”（Describe）、“解释”（Explain）、“比较”（Compare）。“陈述”需要一个定义；“描述”需增加细节；“解释”要给出因果；“比较”需要相似点和不同点。务必使用考纲中的准确术语 —— 例如，用“易失性存储器”而不是“临时存储器”。

Build a glossary as you revise. After each topic, write down every bold or italicised term in the textbook and its exact AQA definition. Test yourself by writing exam-style answers without looking. The act of retrieving strengthens memory far more than re-reading.

复习时建立词汇表。学完每个主题后，写下教科书里所有加粗或斜体的术语及其准确的 AQA 定义。通过不看书写出考试风格的答案来自测。提取练习巩固记忆的效果远超反复阅读。

Finally, mix techniques: combine visual imagery with acronyms, teach a friend using your flashcards, and categorise terms into mind maps. The key is not just to recognise the term but to produce it accurately under timed conditions.

最后，混合多种技巧：将图像联想与首字母缩略词结合，利用闪卡教朋友，用思维导图给术语分类。关键不仅仅是识别术语，而是在限时条件下准确地写出它们。

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

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