📚 IB OCR Computer Science: Mind Map Memory Boosters | IB OCR 计算机：思维导图速记
Mastering computer science for IB or OCR examinations requires memorising a vast array of concepts, from binary logic to network protocols. Mind maps turn these abstract topics into visual, connected trees that your brain can absorb faster. This article presents ten core mind‑map branches with paired English–Chinese explanations, designed to speed up your revision and deepen long‑term recall.
要掌握 IB 或 OCR 计算机科学考试，需要记忆众多概念，从二进制逻辑到网络协议。思维导图把这些抽象主题转化为可视化、相互关联的树状图，让大脑更快吸收。本文提供十个核心的思维导图分支，配以中英双语解释，旨在加速你的复习并加深长期记忆。
1. Computer Systems & Hardware | 计算机系统与硬件
Mind map root: Computer System → branches: Hardware, Software, Data, Users. Under Hardware, sub‑branches: CPU, Memory, Storage, I/O devices.
思维导图根节点：计算机系统 → 分支：硬件、软件、数据、用户。在硬件下，子分支：CPU、内存、存储器、输入输出设备。
The CPU consists of the Control Unit (CU), Arithmetic Logic Unit (ALU), and registers. The CU fetches, decodes, and executes instructions; the ALU performs arithmetic and logical operations.
CPU 由控制单元(CU)、算术逻辑单元(ALU)和寄存器组成。CU 取指、译码并执行指令；ALU 执行算术和逻辑运算。
Primary memory (RAM/ROM) holds data and instructions currently in use. RAM is volatile, ROM is non‑volatile and stores firmware. Secondary storage (HDD, SSD, optical) provides permanent storage.
主存储器（RAM/ROM）保存当前使用的数据和指令。RAM 易失，ROM 非易失并存储固件。辅助存储器（硬盘、固态盘、光盘）提供永久存储。
Input devices (keyboard, mouse, sensor) feed data into the system. Output devices (monitor, printer, speaker) convey information to the user. Understanding the data flow between these blocks is essential for system design questions.
输入设备（键盘、鼠标、传感器）将数据送入系统。输出设备（显示器、打印机、扬声器）向用户传递信息。理解这些模块之间的数据流对于系统设计题至关重要。
- Hardware components: CPU, main memory, secondary storage, input/output
- 软件分类：系统软件（操作系统、工具）与应用软件（字处理、浏览器）
System software manages hardware resources; application software performs user‑oriented tasks. The mind map links these via the operating system bridge.
系统软件管理硬件资源；应用软件执行面向用户的任务。思维导图通过操作系统这座桥梁把它们连接起来。
2. Data Representation | 数据表示
Root: Data Representation → branches: Number systems (binary, denary, hexadecimal), text (ASCII, Unicode), images (bitmap, vector), sound (sampling), compression (lossy, lossless).
根节点：数据表示 → 分支：数字系统（二进制、十进制、十六进制）、文本（ASCII、Unicode）、图像（位图、矢量图）、声音（采样）、压缩（有损、无损）。
Binary uses base 2 (digits 0,1). Denary is base 10. Hexadecimal (base 16) compacts binary: each hex digit represents 4 bits, e.g., 1101₂ = D₁₆.
二进制使用基数 2（数字 0、1）。十进制是基数 10。十六进制（基数 16）可以压缩二进制：每个十六进制位代表 4 个比特，例如 1101₂ = D₁₆。
Binary addition follows rules: 0+0=0, 0+1=1, 1+0=1, 1+1=0 carry 1. Overflow occurs when the result exceeds the bit width.
二进制加法规则：0+0=0，0+1=1，1+0=1，1+1=0 进 1。当结果超出位宽时发生溢出。
Text encoding maps characters to numbers. ASCII uses 7 bits (128 characters), extended ASCII 8 bits. Unicode (UTF‑8/16) supports global scripts and emojis, using variable‑length encoding.
文本编码将字符映射为数字。ASCII 使用 7 比特（128 个字符），扩展 ASCII 8 比特。Unicode（UTF‑8/16）支持全球文字和表情符号，采用变长编码。
Bitmap images are grids of pixels, each with a colour value. Resolution = width × height in pixels; colour depth = bits per pixel (e.g., 24‑bit true colour). File size = resolution × colour depth (bits).
位图图像是像素网格，每个像素有颜色值。分辨率 = 宽 × 高（像素）；色深 = 每像素比特数（如 24 位真彩色）。文件大小 = 分辨率 × 色深（比特）。
Vector graphics store drawing instructions (lines, curves, shapes) rather than pixels; they scale without quality loss and have smaller files for diagrams.
矢量图形存储绘图指令（线条、曲线、形状）而不是像素；可无限缩放且保持质量，在示意图中文件更小。
Sound is digitised by sampling—measuring amplitude at regular intervals. Sample rate (kHz) and bit depth determine quality. File size = sample rate × bit depth × duration (channels).
声音通过采样数字化——按固定间隔测量振幅。采样率（kHz）和位深度决定质量。文件大小 = 采样率 × 位深度 × 时长（通道数）。
Compression: lossy (e.g., MP3, JPEG) discards some data to reduce size, acceptable for human perception. Lossless (e.g., PNG, ZIP) restores exact original, used for text and programs.
压缩：有损压缩（如 MP3、JPEG）丢弃部分数据以减小体积，对感官可接受。无损压缩（如 PNG、ZIP）可恢复精确原始数据，用于文本和程序。
3. Computer Architecture & Organization | 计算机体系结构与组成
Root: Architecture → Von Neumann model: shared memory for data and instructions. Key components: CPU, memory, input, output, control bus, address bus, data bus.
根节点：体系结构 → 冯·诺依曼模型：数据和指令共享内存。关键部件：CPU、存储器、输入、输出、控制总线、地址总线、数据总线。
The CPU executes a fetch‑decode‑execute cycle. Program Counter (PC) holds the address of the next instruction; Memory Address Register (MAR) and Memory Data Register (MDR) transfer data; Current Instruction Register (CIR) stores the instruction being decoded.
CPU 执行取指‑译码‑执行周期。程序计数器(PC)存放下一条指令地址；存储器地址寄存器(MAR)和存储器数据寄存器(MDR)传输数据；当前指令寄存器(CIR)存储正在译码的指令。
The control bus carries control signals (read, write, clock). The address bus carries addresses (unidirectional). The data bus carries actual data (bidirectional). Word length determines bus width.
控制总线传输控制信号（读、写、时钟）。地址总线传输地址（单向）。数据总线传输实际数据（双向）。字长决定总线宽度。
Factors affecting CPU performance: clock speed (Hz), number of cores, cache size and levels (L1, L2, L3), and instruction set architecture (RISC vs CISC).
影响 CPU 性能的因素：时钟速度（Hz）、核心数量、缓存大小和级别（L1、L2、L3），以及指令集架构（RISC 与 CISC）。
Pipelining overlaps instruction stages to boost throughput. Branch prediction reduces pipeline stalls. For OCR and IB, you might also discuss Harvard architecture, where instruction and data memories are separate.
流水线技术将指令阶段重叠以提升吞吐量。分支预测减少流水线停顿。针对 OCR 和 IB，可能还需要讨论哈佛架构，其指令和数据存储器分开。
4. Operating Systems & Virtual Machines | 操作系统与虚拟机
Root: Operating System → roles: resource management, user interface, file management, security. The OS acts as an intermediary between hardware and applications.
根节点：操作系统 → 角色：资源管理、用户界面、文件管理、安全性。OS 充当硬件与应用程序之间的中介。
Memory management: paging, segmentation, virtual memory. Virtual memory uses disk space to simulate extra RAM, swapping pages in and out.
内存管理：分页、分段、虚拟内存。虚拟内存利用磁盘空间模拟额外 RAM，将页面换入换出。
Scheduling algorithms: Round Robin, First Come First Served (FCFS), Shortest Job First (SJF), multi‑level feedback queues. They decide which process gets CPU time.
调度算法：时间片轮转（Round Robin）、先来先服务（FCFS）、最短作业优先（SJF）、多级反馈队列。它们决定哪个进程获得 CPU 时间。
Interrupt handling: when a device signals the CPU (e.g., I/O completion), the current task is suspended, the Interrupt Service Routine (ISR) runs, then context is restored.
中断处理：当设备向 CPU 发信号（例如 I/O 完成），当前任务挂起，执行中断服务程序（ISR），然后恢复上下文。
Virtual machines (VMs) simulate hardware using a hypervisor, allowing multiple OS instances on one physical machine. Benefits: isolation, testing, cloud computing.
虚拟机（VM）通过虚拟机监控程序模拟硬件，在一台物理机上运行多个操作系统实例。优点：隔离、测试、云计算。
5. Networks & Data Transmission | 网络与数据传输
Root: Networks → types: LAN, WAN, PAN. Topologies: star, bus, ring, mesh. Protocols: TCP/IP, HTTP, FTP, SMTP, DNS. The TCP/IP stack (application, transport, internet, link) maps to OSI layers.
根节点：网络 → 类型：局域网(LAN)、广域网(WAN)、个域网(PAN)。拓扑：星型、总线、环状、网状。协议：TCP/IP、HTTP、FTP、SMTP、DNS。TCP/IP 协议栈（应用层、传输层、互联网层、链路层）对应 OSI 层。
Packet switching breaks data into packets, each with source/destination IP, sequence number. Routers direct packets independently across a mesh of networks. This is resilient but may cause out‑of‑order delivery.
分组交换将数据分成数据包，每个包含源/目的 IP、序号。路由器在网络 mesh 中独立引导数据包。这具有弹性但可能导致乱序到达。
IP addresses: IPv4 (32‑bit, e.g., 192.168.1.1) and IPv6 (128‑bit, hexadecimal blocks). Subnet masks divide network and host portions. DNS translates domain names to IP addresses.
IP 地址：IPv4（32 位，如 192.168.1.1）和 IPv6（128 位，十六进制块）。子网掩码划分网络部分和主机部分。DNS 将域名解析为 IP 地址。
Data transmission: serial vs parallel, simplex/duplex, bit rate vs baud rate. Error detection: parity bits, checksums, CRC. Encryption: symmetric (AES) and asymmetric (RSA) for secure transmission.
数据传输：串行与并行、单工/双工、比特率与波特率。差错检测：奇偶校验位、校验和、CRC。加密：对称（AES）和非对称（RSA）用于安全传输。
6. Databases & SQL | 数据库与 SQL
Root: Databases → Relational model: tables, rows (tuples), columns (attributes). Primary key uniquely identifies a row; foreign key links tables. Normalisation reduces redundancy (1NF, 2NF, 3NF).
根节点：数据库 → 关系模型：表、行（元组）、列（属性）。主键唯一标识一行；外键连接表。规范化减少冗余（1NF、2NF、3NF）。
SQL commands: DDL (CREATE, ALTER, DROP), DML (SELECT, INSERT, UPDATE, DELETE). A SELECT query uses FROM, WHERE, ORDER BY, GROUP BY, JOIN (INNER, LEFT, RIGHT).
SQL 命令：DDL（CREATE、ALTER、DROP），DML（SELECT、INSERT、UPDATE、DELETE）。SELECT 查询使用 FROM、WHERE、ORDER BY、GROUP BY、JOIN（INNER、LEFT、RIGHT）。
ACID properties (Atomicity, Consistency, Isolation, Durability) ensure reliable transactions. In IB/OCR, you might also encounter referential integrity and cascading updates.
ACID 特性（原子性、一致性、隔离性、持久性）保证可靠的事务。在 IB/OCR 中，可能还会遇到引用完整性和级联更新。
Data warehousing and business intelligence are higher‑level concepts: OLTP vs OLAP, data mining. A mind map can connect operational databases to analytical systems.
数据仓库和商业智能是更高层次概念：OLTP 与 OLAP、数据挖掘。思维导图可将操作型数据库与分析系统连接起来。
7. Algorithms & Problem‑Solving | 算法与问题解决
Root: Algorithms → sorting (bubble, insertion, merge, quick) and searching (linear, binary). Time complexity uses Big‑O notation: 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²)。
Binary search requires sorted data, halves the search space each step, O(log n). Linear search checks elements sequentially, O(n). Understanding best, average, and worst cases is crucial.
二分搜索要求数据有序，每步将搜索空间减半，时间复杂度 O(log n)。线性搜索顺序检查元素，O(n)。理解最好、平均和最坏情况至关重要。
Recursion: a function calls itself, needs a base case to stop. Example: factorial n! = n × (n−1)!. Mind map trace the call stack for deeper understanding.
递归：函数调用自身，需要一个基本情况来停止。例如：阶乘 n! = n × (n−1)!。思维导图可追踪调用栈以加深理解。
Standard algorithms: finding max/min, counting occurrences, linear search on array. Pseudo‑code or flowcharts are used to design solutions before coding.
标准算法：求最大/最小值、统计出现次数、数组线性搜索。在编码之前用伪代码或流程图设计解决方案。
8. Programming Concepts & OOP | 编程概念与面向对象
Root: Programming → paradigms: procedural, object‑oriented, functional. OOP four pillars: encapsulation, inheritance, polymorphism, abstraction.
根节点：编程 → 范式：过程式、面向对象、函数式。OOP 四大支柱：封装、继承、多态、抽象。
Encapsulation bundles data (attributes) and methods, restricting direct access (private, public). Inheritance allows a subclass to reuse parent code (extends). Polymorphism enables one interface, many implementations (method overriding/overloading).
封装将数据（属性）和方法捆绑，限制直接访问（private、public）。继承允许子类重用父类代码（extends）。多态实现一个接口、多种实现（方法重写/重载）。
IDEs, debuggers, compilers, and interpreters are tools. Compilation translates whole source code to machine code before execution; interpretation translates line by line. Java uses bytecode + JVM.
IDE、调试器、编译器和解释器是工具。编译执行前将整个源代码翻译为机器码；解释逐行翻译。Java 采用字节码 + JVM。
Data structures: arrays, lists, stacks (LIFO), queues (FIFO), trees, hash tables. The mind map links each to typical operations (push, pop, enqueue, dequeue) and complexity.
数据结构：数组、链表、栈（LIFO）、队列（FIFO）、树、哈希表。思维导图将每种结构与典型操作（push、pop、enqueue、dequeue）及复杂度关联。
For OCR or IB, you should be able to trace algorithms, identify errors, and write pseudocode for tasks like validating input, reading files, or using string manipulation.
针对 OCR 或 IB，你应能追踪算法、识别错误，并为验证输入、读取文件或字符串操作等任务编写伪代码。
9. System Development Life Cycle | 系统开发生命周期
Root: SDLC → stages: Feasibility, Analysis, Design, Implementation, Testing, Deployment, Maintenance. Methodologies: waterfall, agile (Scrum, XP).
根节点：系统开发生命周期 → 阶段：可行性、分析、设计、实施、测试、部署、维护。方法论：瀑布、敏捷（Scrum、XP）。
Feasibility study assesses technical, economic, legal, and operational constraints. Analysis gathers requirements using interviews, questionnaires, observation, document analysis.
可行性研究评估技术、经济、法律和操作约束。分析阶段通过访谈、问卷、观察、文档分析收集需求。
Design produces data flow diagrams, entity‑relationship diagrams, system flowcharts, and prototypes. Designs must address data storage, user interface, and modularity.
设计阶段产出数据流图、实体关系图、系统流程图和原型。设计必须处理数据存储、用户界面和模块化。
Testing includes unit, integration, system, acceptance testing. Test plans use normal, boundary, and erroneous data. Alpha and beta testing involve users.
测试包括单元测试、集成测试、系统测试、验收测试。测试计划使用正常、边界和错误数据。α 测试和 β 测试涉及用户。
Changeover methods: direct, parallel, phased, pilot. Post‑implementation reviews ensure the system meets objectives. Maintenance types: corrective, adaptive, perfective.
转换方法：直接、并行、分阶段、试点。实施后评审确保系统达到目标。维护类型：纠正性、适应性、完善性。
10. Computational Thinking & Ethics | 计算思维与伦理
Root: Computational thinking → decomposition, pattern recognition, abstraction, algorithm design. Apply these to real‑world problems before coding.
根节点：计算思维 → 分解、模式识别、抽象、算法设计。在编码前将这些应用于实际问题。
Decomposition breaks a problem into smaller, manageable parts. Pattern recognition identifies similarities with known problems. Abstraction hides irrelevant detail, focusing on essential features.
分解将问题拆分为更小、易管理的部分。模式识别找出与已知问题的相似性。抽象隐藏无关细节，聚焦于基本特征。
Ethics in computing: data privacy (GDPR), intellectual property, digital divide, environmental impact of e‑waste. AI ethics covers bias, accountability, transparency.
计算机伦理：数据隐私（GDPR）、知识产权、数字鸿沟、电子垃圾的环境影响。AI 伦理涉及偏见、问责和透明度。
Legislation like the Computer Misuse Act, Data Protection Act, and Copyright Act form the legal framework. In exams, be prepared to discuss scenarios involving unauthorized access, data breaches, or software piracy.
法律框架如《计算机滥用法》、《数据保护法》和《版权法》。考试中，准备讨论涉及未经授权访问、数据泄露或软件盗版的场景。
The internet and AI raise new challenges: deepfakes, misinformation, automated decision‑making. A balanced mind map connects benefits (efficiency, connectivity) with risks (surveillance, job displacement).
互联网和 AI 带来新挑战：深度伪造、虚假信息、自动化决策。平衡的思维导图将好处（效率、连通性）与风险（监控、工作岗位流失）联系起来。
11. Boolean Algebra & Logic Circuits | 布尔代数与逻辑电路
Root: Boolean logic → gates (AND, OR, NOT, NAND, NOR, XOR). Truth tables define outputs. Logic expressions simplify using Boolean laws (De Morgan, distribution, absorption).
根节点：布尔逻辑 → 门（与、或、非、与非、或非、异或）。真值表定义输出。逻辑表达式可利用布尔定律（德摩根、分配、吸收）化简。
A half adder adds two bits producing sum and carry. Full adder includes carry‑in. Combine to build multi‑bit adders. Flip‑flops (SR, JK, D) store one bit and form the basis of sequential logic.
半加器将两个位相加产生和与进位。全加器包含进位输入。可组合构建多位加法器。触发器（SR、JK、D）存储一位数据，构成时序逻辑的基础。
Karnaugh maps (K‑maps) simplify expressions visually for up to 4 variables. Group 1s in powers of two to reduce gates in circuit design.
卡诺图（K‑map）可直观化简最多 4 个变量的表达式。将 1 按 2 的幂次分组以在电路设计中减少门电路。
OCR especially tests logic circuit design and simplification. IB may include basic gates and truth tables within the core topics.
OCR 尤其会考查逻辑电路设计和化简。IB 可能在核心主题中包含基本门和真值表。
12. Emerging Technologies & Future Trends | 新兴技术与未来趋势（速记补充）
Root: Trends → Artificial Intelligence, Internet of Things, quantum computing, blockchain, 5G. Each branch can be linked to existing topics: IoT ↔ networks, AI ↔ algorithms, blockchain ↔ security and hashing.
根节点：趋势 → 人工智能、物联网、量子计算、区块链、5G。每个分支可链接到现有主题：IoT ↔ 网络、AI ↔ 算法、区块链 ↔ 安全与哈希。
IoT devices collect sensor data and communicate via protocols like MQTT. Security and scalability are key concerns. Mind map connects to cloud computing and edge processing.
物联网设备收集传感器数据并通过 MQTT 等协议通信。安全性和可扩展性是关键问题。思维导图连接到云计算和边缘处理。
Artificial intelligence uses machine learning (supervised, unsupervised, reinforcement). Neural networks mimic brain cells. Ethical implications must be considered.
人工智能使用机器学习（监督、无监督、强化学习）。神经网络模拟脑细胞。必须考虑伦理影响。
Quantum computing uses qubits (superposition, entanglement) to solve certain problems exponentially faster. Still in early stages but impacts cryptography (Shor’s algorithm).
量子计算利用量子比特（叠加、纠缠）以指数速度解决某些问题。仍处于早期阶段，但影响密码学（秀尔算法）。
Keep this branch as an extension; it often appears in longer‑response questions where you can demonstrate wider reading.
把这个分支作为扩展保留；它经常出现在需要展示广泛阅读的较长的问答题中。
Published by TutorHao | 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