IGCSE Computer Science: Quick Memorization with Mind Maps | IGCSE 计算机：思维导图速记

📚 IGCSE Computer Science: Quick Memorization with Mind Maps | IGCSE 计算机：思维导图速记

Mind maps transform the dense IGCSE Computer Science syllabus into visual, interconnected paths, making revision active and memorable. By organising key concepts around a central idea and branching out with keywords, you can rapidly recall hardware, software, data representation, algorithms, and more during the exam.

思维导图将厚重的 IGCSE 计算机科学课程转化为可视化、相互关联的路径，让复习变得主动且印象深刻。围绕中心主题展开，用关键词向外分支，你就能在考试中快速回忆起硬件、软件、数据表示、算法等核心内容。

1. Central Theme and Main Branches | 中心主题与主干分支

Start your mind map with ‘IGCSE Computer Science’ at the centre. From this hub, radiate two thick branches: ‘Theory of Computer Science’ and ‘Practical Programming’. Theory then splits into Data Representation, Hardware, Software, Networks, and Security & Ethics. Programming splits into Algorithm Design, Programming Concepts, and Databases. This high-level structure already gives you a mental index of all topics.

以“IGCSE 计算机科学”为中心展开思维导图。从这个中心向外辐射两条主分支：“计算机科学理论”与“实践编程”。理论再分为数据表示、硬件、软件、网络、安全与伦理。编程分为算法设计、编程概念和数据库。这个高层结构已经为你提供了一个全科的心理索引。

Theory branch keywords: binary, CPU, operating system, protocol, encryption, ethics.

理论分支关键词：二进制、处理器、操作系统、协议、加密、伦理。
Programming branch keywords: pseudocode, loop, variable, array, SQL.

编程分支关键词：伪代码、循环、变量、数组、SQL。
Visual hint: draw icons next to each keyword – a lock for security, a gear for hardware, a page for SQL.

视觉提示：在每个关键词旁画上图标——安全旁画锁，硬件旁画齿轮，SQL 旁画页面。

2. Data Representation: Bits, Bytes, and Beyond | 数据表示：位、字节及其他

Hang this sub-branch under Theory. Place ‘Bit’ as the smallest unit (0 or 1), then show 1 byte = 8 bits. From byte, fork to binary, denary, and hexadecimal conversions. Add a leaf for ‘Overflow’ when a number exceeds 8 bits, and another for ‘Two’s complement’ to represent negative integers.

把这个子分支挂在理论下。把“位”（比特）作为最小单元（0或1），然后展示 1 字节 = 8 位。从字节分叉到二进制、十进制和十六进制转换。为“溢出”添加一片叶子（当数字超过 8 位时），再为“二进制补码”添加一片叶子来表示负整数。

Binary → Denary: multiply each bit by 2ⁿ (n = position from right, starting at 0). Example: 1011₂ = 1×2³ + 0×2² + 1×2¹ + 1×2⁰ = 11.

二进制转十进制：每位乘以 2ⁿ （n 从右起位置，从0开始）。例：1011₂ = 1×2³ + 0×2² + 1×2¹ + 1×2⁰ = 11。
Hexadecimal: group 4 bits, use digits 0-9 and A-F. 1111₂ = F₁₆.

十六进制：每 4 位一组，使用数字 0-9 和 A-F。1111₂ = F₁₆。
Character sets: ASCII uses 7 bits for 128 characters; Unicode uses up to 32 bits to cover global languages.

字符集：ASCII 使用 7 位表示 128 个字符；Unicode 最多用 32 位覆盖全球语言。
Image representation: pixel grid, colour depth (bits per pixel), resolution, file size = width × height × colour depth / 8 bytes.

图像表示：像素网格、颜色深度（每像素位数）、分辨率、文件大小 = 宽 × 高 × 颜色深度 / 8 字节。

3. Hardware: Input, Output, Storage, CPU | 硬件：输入、输出、存储与CPU

Under the Hardware branch, sketch four main limbs: Input Devices, Output Devices, Storage Devices, and Central Processing Unit (CPU). The CPU limb further divides into Control Unit (CU), Arithmetic Logic Unit (ALU), Registers, and Buses. Link them with von Neumann architecture.

在硬件分支下，画出四个主干：输入设备、输出设备、存储设备和中央处理器（CPU）。CPU 主干再分为控制器（CU）、算术逻辑单元（ALU）、寄存器和总线。用冯·诺依曼架构将它们连接起来。

CPU cycle: Fetch – Decode – Execute. The CU fetches an instruction from RAM, decodes it, then ALU executes.

CPU 周期：取指 – 译码 – 执行。控制器从 RAM 中取出指令，译码后由 ALU 执行。
Registers: PC (Program Counter) holds address of next instruction; MAR (Memory Address Register); MDR (Memory Data Register); Accumulator.

寄存器：PC（程序计数器）存放下条指令地址；MAR（内存地址寄存器）；MDR（内存数据寄存器）；累加器。
Storage hierarchy: primary (RAM, volatile; ROM, non-volatile) → secondary (HDD, SSD, optical). Cloud storage is remote secondary storage.

存储层次：主存（RAM，易失性；ROM，非易失性） → 辅助存储（HDD、SSD、光盘）。云存储是远程辅助存储。
Memory units: KB, MB, GB, TB – each 1024 times the previous. Use a colourful flashcard linking ‘Kilo = 2¹⁰ = 1024’ on your map.

存储单位：KB、MB、GB、TB——每个是前一个的 1024 倍。在导图上用彩色闪卡关联“Kilo = 2¹⁰ = 1024”。

4. Software: Operating Systems and Applications | 软件：操作系统与应用

Branch ‘Software’ into ‘System Software’ and ‘Application Software’. System software’s biggest leaf is the Operating System (OS). List its functions: memory management, file management, user interface, peripheral management, and security. Link to ‘utility software’ like antivirus and disk defragmentation.

“软件”分支分为“系统软件”和“应用软件”。系统软件最大的叶子是操作系统（OS）。列出其功能：内存管理、文件管理、用户界面、外设管理和安全。连接到“工具软件”，如防病毒和磁盘碎片整理。

OS memory management: uses paging and segmentation to allocate RAM to processes.

操作系统内存管理：使用分页和分段向进程分配 RAM。
User interfaces: CLI (command line), GUI (graphical), menu-driven, voice-driven. Add a small icon for each to trigger memory.

用户界面：CLI（命令行）、GUI（图形）、菜单驱动、语音驱动。为每种类型加一个小图标以触发记忆。
Application software: word processors, spreadsheets, web browsers. Their purpose is to perform specific user tasks.

应用软件：文字处理、电子表格、网络浏览器。其目的是执行特定的用户任务。
High- and low-level languages: remember the rainbow bridge – high-level (Python, Java) → compiler/interpreter → assembly → machine code.

高级与低级语言：记住彩虹桥——高级语言（Python、Java）→ 编译器/解释器 → 汇编语言 → 机器码。

5. Networks: Topologies, Protocols, Security | 网络：拓扑、协议与安全

Draw a cloud labelled ‘Network’. Inside, place nodes for LAN/WAN, topologies, protocols, and threats. Use a chain-link symbol for the Internet. Link ‘Protocols’ to TCP/IP, HTTP, HTTPS, FTP, SMTP, POP3, IMAP – each with a small tagline (e.g., SMTP = send email).

画一朵标有“网络”的云。在里面放置局域网/广域网、拓扑、协议和威胁等节点。用链条符号表示互联网。将“协议”连接到 TCP/IP、HTTP、HTTPS、FTP、SMTP、POP3、IMAP——每个都带有一小句提示语（例如 SMTP = 发送邮件）。

Topologies: star (central switch, if one link fails others unaffected), mesh (multiple paths, robust but expensive), bus (shared cable, collisions). Draw simple sketches on the map.

拓扑：星型（中心交换机，一条链路故障不影响其他）、网状（多条路径，健壮但昂贵）、总线型（共享电缆，易冲突）。在导图上绘制简单草图。
Packet switching: data split into packets with header (source/destination IP, sequence number). Travel different routes, reassembled at destination.

分组交换：数据拆分为带有头部（源/目标 IP、序号）的数据包。沿不同路由传输，在目的地重组。
Security threats: malware (virus, worm, Trojan), phishing, DoS attack. Countermeasures: firewalls, encryption, two-factor authentication.

安全威胁：恶意软件（病毒、蠕虫、木马）、网络钓鱼、拒绝服务攻击。对策：防火墙、加密、双因素认证。
Encryption: symmetric (same key) vs asymmetric (public/private key pair). Draw a lock and key to anchor the concept.

加密：对称（同一密钥）与非对称（公钥/私钥对）。画一把锁和钥匙来锚定概念。

6. Algorithms: Pseudocode, Flowcharts, Efficiency | 算法：伪代码、流程图与效率

Under the Algorithm Design branch, radiate three sub-nodes: ‘Problem-solving stages’, ‘Representation’, and ‘Efficiency’. The stages are: understand the problem → decomposition → pattern recognition → abstraction → algorithmic solution. Link ‘Representation’ to pseudocode and flowcharts.

在算法设计分支下，辐射出三个子节点：“问题解决阶段”、“表示法”和“效率”。阶段是：理解问题 → 分解 → 模式识别 → 抽象 → 算法解决方案。将“表示法”连接到伪代码和流程图。

Pseudocode: uses IF…THEN…ELSE, WHILE…DO, REPEAT…UNTIL, FOR…NEXT. Underline these structures on your map with bright colours.

伪代码：使用 IF…THEN…ELSE、WHILE…DO、REPEAT…UNTIL、FOR…NEXT。在导图上用鲜艳的颜色划线标注这些结构。
Flowchart symbols: oval = start/stop, rectangle = process, diamond = decision, parallelogram = input/output. Draw each symbol with its meaning.

流程图符号：椭圆 = 开始/结束，矩形 = 处理，菱形 = 判断，平行四边形 = 输入/输出。画出每个符号及其含义。
Search algorithms: linear search (go through each item until found, O(n)) and binary search (repeatedly divide sorted list, O(log n)). A quick picture of a sorted list halving works well.

查找算法：线性查找（逐个遍历直至找到，O(n)）和二分查找（反复对半分割有序列表，O(log n)）。画一幅有序列表不断减半的简图效果很好。
Sort algorithms: bubble sort (repeated passes, swapping adjacent items) and insertion sort (build up sorted portion). Visualise small cards being shuffled and placed.

排序算法：冒泡排序（重复轮次，交换相邻元素）和插入排序（逐步构建已排序部分）。想象小卡片被洗牌并放置的过程。

7. Programming: Variables, Loops, Functions | 编程：变量、循环与函数

From ‘Programming Concepts’ branch, hang the essential building blocks: variables and data types, iteration, selection, arrays, and functions. On your map, create a ‘toolbox’ icon containing these blocks. Each block then gets its own tiny mind map.

从“编程概念”分支，挂上基本构件：变量与数据类型、迭代、选择、数组和函数。在导图上创建一个包含这些构件的“工具箱”图标。每个构件再各自拥有一个微型思维导图。

Data types: integer, real (float), Boolean, character, string. Use a simple table on the map: int (5), float (3.14), Boolean (TRUE), char (‘A’), string (“Hello”).

数据类型：整型、实型（浮点）、布尔型、字符型、字符串。在导图上使用简单表格：int (5)、float (3.14)、Boolean (TRUE)、char (‘A’)、string (“Hello”)。
Selection: IF…ELSE and CASE statements. Draw a decision diamond with two outgoing arrows for true/false.

选择：IF…ELSE 和 CASE 语句。画一个判断菱形，带两个箭头分别指向真/假。
Iteration: definite (FOR i ← 1 TO 10) and indefinite (WHILE score < 100). A spiral doodle can represent looping.

迭代：定数循环（FOR i ← 1 TO 10）和不定数循环（WHILE score < 100）。画一个螺旋涂鸦可以表示循环。
Arrays: one-dimensional and two-dimensional. Think of a numbered row of lockers (1D) and a grid (2D). Eg: total ← total + sales[i] ; grid[row, col].

数组：一维和二维。想象一排编号的储物柜（1D）和一个网格（2D）。例如：total ← total + sales[i] ; grid[row, col]。
Functions and procedures: functions RETURN a value; procedures do not. Write tiny examples: FUNCTION add(a,b) RETURN a+b.

函数与过程：函数 RETURN 一个值；过程不返回。写几个微型例子：FUNCTION add(a,b) RETURN a+b。

8. Databases: Tables, Queries, SQL | 数据库：表、查询与SQL

The Database branch grows from ‘Practical Programming’. At its core, place a box labelled ‘Table = Entity’. Around it, add columns: Record (row), Field (column), Primary Key (unique), Foreign Key (link). Then extend to SQL commands: SELECT, FROM, WHERE, ORDER BY, GROUP BY.

数据库分支从“实践编程”生长出来。在核心位置放一个标有“表 = 实体”的方框。围绕它添加列：记录（行）、字段（列）、主键（唯一）、外键（关联）。然后扩展到 SQL 命令：SELECT、FROM、WHERE、ORDER BY、GROUP BY。

Key fields: primary key uniquely identifies each record; foreign key connects two tables. Sketch two linked tables with arrows.

键字段：主键唯一标识每条记录；外键连接两张表。画出两个带箭头的连接表。
SQL syntax example: SELECT name, age FROM Students WHERE grade = ‘A’ ORDER BY age DESC. Write this on your map as a colourful code snippet.

SQL 语法示例：SELECT name, age FROM Students WHERE grade = ‘A’ ORDER BY age DESC。把它作为彩色代码片段写在导图上。
Data types in DB: TEXT, INTEGER, REAL, BOOLEAN, DATE. Associate each with a tiny icon.

数据库中的数据类型：TEXT、INTEGER、REAL、BOOLEAN、DATE。把每种与一个小图标关联起来。
Flat-file vs relational: flat-file = single table, relational = multiple linked tables to reduce redundancy.

平面文件与关系型：平面文件 = 单表，关系型 = 多张相互关联的表以减少冗余。

9. Logic Gates and Circuits | 逻辑门与电路

Create a distinct ‘Logic’ branch directly from the central node. Place six petals: AND, OR, NOT, NAND, NOR, XOR. For each gate, draw its symbol, and attach a mini truth table. Use coloured pens: red for NOT (always opposite), blue for AND (both 1 gives 1).

从中心节点直接创建一个独特的“逻辑”分支。放置六个花瓣：AND、OR、NOT、NAND、NOR、XOR。为每个门画出符号，并附上一个微型真值表。使用彩色笔：红色代表 NOT（总是相反），蓝色代表 AND（两个都是 1 才得 1）。

AND: output 1 only if all inputs are 1. Quick recall: ‘All must be true’.

AND：仅当所有输入为 1 时输出 1。快速记忆：“必须全为真”。
OR: output 1 if at least one input is 1. ‘At least one true’.

OR：只要至少一个输入为 1 就输出 1。“至少一个为真”。
NOT: single input, output opposite. Relate to a light switch on/off.

NOT：单输入，输出相反。联系灯具开关的开/关。
NAND/NOR/XOR: derive from AND/OR plus NOT; XOR gives 1 when inputs differ. A simple scene: two roommates disagree (XOR).

NAND/NOR/XOR：由 AND/OR 加上 NOT 推导；XOR 输入不同时输出 1。一个简单场景：两个室友总是在不同问题上争吵（XOR）。
Truth tables: use the map’s margin to draw a small complete truth table with inputs A, B and outputs for each gate. Fold the paper to self-test.

真值表：利用导图空白处画一个带有输入 A、B 及各门输出的完整真值表。折叠纸张自我测试。

10. Ethics and Emerging Technologies | 伦理与新兴技术

The final branch under Theory is ‘Ethics and Society’. From here, tie in legislation, data protection, and professional ethics. Also add a leaf for ‘Emerging Technologies’ like AI, machine learning, blockchain, and quantum computing. Connect these to ethical concerns such as bias and privacy.

理论下的最后一个分支是“伦理与社会”。从这里引出立法、数据保护和职业道德。再添加一片“新兴技术”的叶子，如人工智能、机器学习、区块链和量子计算。将它们与偏见和隐私等伦理问题联系起来。

Data Protection Acts: principles – data must be processed fairly, for specified purpose, kept secure. Use the acronym ‘FLAIR’ to remember fairness, lawfulness, accuracy, integrity, retention.

数据保护法：原则——数据必须公平处理、用于特定目的、安全保存。使用首字母缩略词“FLAIR”记忆公平、合法性、准确性、完整性、保存期限。
Digital divide: gap between those with and without access to technology. Picture a bridge half-built across a valley.

数字鸿沟：拥有与不拥有技术访问权之间的差距。想象一座横跨山谷但只建了一半的桥。
AI ethics: bias in algorithms, job displacement, autonomous decision-making. Draw a robot with a question mark heart.

人工智能伦理：算法偏见、工作岗位流失、自主决策。画一个心脏是问号的机器人。
Professional ethics: codes of conduct for computer scientists – no spreading malware, respect intellectual property, avoid plagiarism.

职业道德：计算机科学家的行为准则——不传播恶意软件、尊重知识产权、避免抄袭。
Emerging tech keywords: IoT, autonomous vehicles, 5G, virtual reality. Link each to a societal impact leaflet on your map.

新兴技术关键词：物联网、自动驾驶汽车、5G、虚拟现实。每项在导图上连接一个社会影响小折页。

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

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

IGCSE Computer Science: Quick Memorization with Mind Maps | IGCSE 计算机：思维导图速记