📚 A-Level CIE Computer Science: Last-Minute Revision Notes | A-Level CIE 计算机：考前冲刺笔记
These concise revision notes cover the essential topics for the CIE A-Level Computer Science (9618) syllabus. Each section pairs an English explanation with a Chinese translation, helping you quickly consolidate key concepts before the exam.
这份精炼的考前冲刺笔记覆盖了 CIE A-Level 计算机科学（9618）大纲的核心考点。每个小节以英文加中文对照的形式呈现，帮助你在考前快速巩固关键概念。
1. Data Representation | 数据表示
Data is stored as binary digits (bits). Denary numbers are converted to binary by successive division by 2, reading remainders upwards. Hexadecimal (base‑16) provides a compact form using digits 0‑9 and letters A‑F, where each hex digit represents 4 bits.
数据以二进制位的形式存储。十进制转换为二进制采用除 2 取余法，余数从下往上读。十六进制（基数为 16）使用 0‑9 和 A‑F，每个十六进制数字代表 4 位二进制，提供更紧凑的表示。
Negative integers are represented using two’s complement. For an n‑bit word, the most negative number is –2ⁿ⁻¹ and the most positive is 2ⁿ⁻¹ – 1. To negate a number, invert all bits and add 1.
负整数采用补码（two’s complement）表示。对于 n 位字长，最小的负数是 –2ⁿ⁻¹，最大的正数是 2ⁿ⁻¹ – 1。对一个数取负值时，将所有位取反后加 1。
Real numbers use floating‑point representation with a mantissa and an exponent. Normalisation ensures the mantissa starts with either 01 for positive numbers or 10 for negative numbers, maximising precision. Rounding and truncation errors can occur because finite bits cannot store all real numbers exactly.
实数使用浮点表示，包含尾数和指数。规格化可确保正数的尾数以 01 开头，负数的尾数以 10 开头，从而最大化精度。由于有限位无法精确存储所有实数，会产生舍入误差和截断误差。
| Character Set | Bits per character | Range |
|---|---|---|
| ASCII | 7 bits (extended 8 bits) | 128/256 characters |
| Unicode (UTF‑8) | 8‑32 bits | Over 143,000 characters |
Images are stored as a grid of pixels; color depth (e.g., 24 bits for true color) determines the number of bits per pixel. Sound is sampled at a certain rate and bit depth, with the Nyquist theorem stating that the sampling frequency must be at least twice the highest frequency in the signal.
图像存储为像素构成的网格；颜色深度（如真彩色 24 位）决定每个像素的位数。声音按一定采样率和采样深度进行采集，奈奎斯特定理指出采样频率至少应为信号最高频率的两倍。
2. Communication and Internet Technologies | 通信与互联网技术
Serial transmission sends one bit at a time over a single wire; parallel transmission sends multiple bits simultaneously using multiple wires. Serial is preferred for long distances due to reduced skew and crosstalk.
串行传输通过单根线每次发送一个位；并行传输使用多根线同时发送多个位。由于串行传输时滞和串扰较小，长距离通信更倾向于采用串行方式。
The internet is a global network of networks built on the TCP/IP protocol stack. The main protocols include: TCP (Transmission Control Protocol, reliable, connection‑oriented), IP (Internet Protocol, handles addressing and routing), HTTP/HTTPS (web), FTP (file transfer), SMTP/POP3/IMAP (email).
互联网是建立在 TCP/IP 协议栈上的全球性网络。主要协议包括：TCP（传输控制协议，可靠、面向连接）、IP（互联网协议，负责寻址和路由）、HTTP/HTTPS（网页传输）、FTP（文件传输）、SMTP/POP3/IMAP（电子邮件）。
Packet switching breaks messages into packets that travel independently, possibly along different routes, and are reassembled at the destination. Each packet contains a header with source and destination IP addresses, sequence number, and checksum.
分组交换将消息拆分为分组，各分组独立传输，可能经过不同路径，在目的地进行重组。每个分组包含包头，其中有源 IP 地址、目标 IP 地址、序列号和校验和。
Client‑server vs peer‑to‑peer: In the client‑server model, clients request services from central servers. In P2P, each node acts as both client and server, sharing resources directly. BitTorrent is a classic P2P application.
客户‑服务器模式中，客户向中央服务器请求服务。P2P（对等网络）模式中，每个节点同时作为客户和服务器，直接共享资源。BitTorrent 是典型的 P2P 应用。
3. Hardware and Virtual Machines | 硬件与虚拟机
Input devices: keyboard, mouse, touchscreen, microphone, barcode reader. Output devices: monitor, printer, speaker, actuator. Primary memory (RAM, ROM) is directly accessed by the CPU; secondary storage (HDD, SSD, optical) retains data permanently.
输入设备包括键盘、鼠标、触摸屏、麦克风、条形码阅读器。输出设备包括显示器、打印机、扬声器、执行器。主存储器（RAM、ROM）由 CPU 直接访问；辅助存储器（HDD、SSD、光盘）用于永久保存数据。
Virtual memory uses a portion of secondary storage as an extension of RAM when physical RAM is insufficient. This allows larger programs to run but reduces speed due to disk access times. Thrashing occurs when excessive swapping degrades performance severely.
虚拟内存将辅助存储器的一部分当作 RAM 的扩展使用，当物理 RAM 不足时，允许运行更大的程序，但因磁盘访问速度慢而降低整体性能。当过度交换导致性能严重下降时，即发生“系统颠簸”。
Virtual machines emulate a complete computer system using software. A hypervisor manages multiple VMs on one physical host. Each VM has its own OS and applications, isolated from others. Benefits: efficient resource use, safe testing environments, server consolidation.
虚拟机通过软件模拟出完整的计算机系统。管理程序（hypervisor）在一台物理主机上管理多个虚拟机。每个虚拟机拥有独立的操作系统和应用程序，彼此隔离。优点包括高效利用资源、安全的测试环境、服务器整合。
4. Processor Fundamentals | 处理器基础
The von Neumann architecture stores both instructions and data in the same memory. The CPU fetches, decodes, and executes instructions in a continuous cycle. Key components include the ALU (Arithmetic Logic Unit), Control Unit, and registers such as PC (Program Counter), MAR (Memory Address Register), MDR (Memory Data Register), CIR (Current Instruction Register).
冯·诺依曼体系结构将指令和数据存放在同一内存中。CPU 不断重复取指、译码、执行这一循环。关键部件包括 ALU（算术逻辑单元）、控制单元以及寄存器，如程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）。
The fetch‑decode‑execute cycle: PC → MAR; PC incremented; instruction read into MDR → CIR; Control Unit decodes instruction; operands fetched if needed; ALU executes; result stored; repeat.
取指‑译码‑执行周期：PC → MAR；PC 递增；指令读入 MDR → CIR；控制单元译码；必要时读取操作数；ALU 执行；结果存储；重复。
Factors affecting CPU performance: clock speed, number of cores, word length, cache size, and bus speed. Pipelining allows overlapping execution of instructions, improving throughput but may suffer from hazards (data, control).
影响 CPU 性能的因素：时钟频率、核心数、字长、缓存大小、总线速度。流水线技术可重叠执行指令，提高吞吐量，但可能遇到数据冒险和控制冒险。
5. System Software and Operating System | 系统软件与操作系统
An operating system manages hardware resources and provides a user interface. Key functions: memory management (virtual memory), processor scheduling, file management, I/O management, interrupt handling, and providing a platform for applications.
操作系统管理硬件资源并提供用户接口。主要功能包括：内存管理（虚拟内存）、处理器调度、文件管理、输入输出管理、中断处理以及为应用程序提供平台。
Utility software performs maintenance tasks: file compression (lossless), backup, disk defragmentation, anti‑malware, and firewall. Translators include assemblers (assembly → machine code), compilers (high‑level → machine code, all at once), and interpreters (execute line‑by‑line).
实用程序执行维护任务：文件压缩（无损）、备份、磁盘碎片整理、反恶意软件、防火墙。翻译器包括汇编器（汇编 → 机器码）、编译器（高级语言一次性翻译成机器码）和解释器（逐行执行）。
Linkers combine separately compiled modules into a single executable, resolving external references. Loaders copy the executable into memory and start execution.
链接器将分别编译的模块合并成单一可执行文件，解析外部引用。加载器将可执行文件复制到内存中并启动执行。
6. Security, Privacy, and Ethics | 安全、隐私与伦理
Threats: malware (virus, worm, trojan), phishing, denial of service (DoS), SQL injection, man‑in‑the‑middle attack. Defenses: encryption (symmetric, asymmetric), digital signatures and certificates, firewalls, access rights, 2‑factor authentication, regular patches.
威胁包括恶意软件（病毒、蠕虫、木马）、网络钓鱼、拒绝服务攻击（DoS）、SQL 注入、中间人攻击。防御措施包括加密（对称、非对称）、数字签名与数字证书、防火墙、访问权限、双因素身份验证、定期打补丁。
Encryption: Symmetric uses the same key for encryption and decryption (fast, key distribution problem). Asymmetric uses a public/private key pair (slower, solves key exchange). Digital signatures provide authenticity and non‑repudiation.
加密：对称加密使用同一密钥进行加解密（速度快，但存在密钥分发问题）。非对称加密使用公钥/私钥对（较慢，解决密钥交换问题）。数字签名提供了真实性和不可否认性。
Data privacy laws (GDPR) regulate personal data collection and processing. Ethical issues include the digital divide, surveillance, and the environmental impact of computing (e‑waste, energy consumption).
数据隐私法规（如 GDPR）规范个人数据的收集和处理。伦理问题包括数字鸿沟、监控以及计算对环境的影响（电子废弃物、能耗）。
7. Algorithm Design and Problem-Solving | 算法设计与问题求解
Abstract data types (ADTs): stack (LIFO, push, pop), queue (FIFO, enqueue, dequeue), linked list, binary tree. Recursion involves a function calling itself with a base case to terminate. Factorial example: n! = n × (n‑1)!, base case 0! = 1.
抽象数据类型（ADT）：栈（后进先出，操作 push、pop）、队列（先进先出，操作 enqueue、dequeue）、链表、二叉树。递归指函数在满足终止条件（基线条件）的情况下调用自身。阶乘示例：n! = n × (n‑1)!，基线条件 0! = 1。
Searching algorithms: Linear search O(n), binary search O(log n) on sorted arrays. Sorting algorithms: Bubble sort O(n²), insertion sort O(n²), merge sort O(n log n). Understand how to trace each step in pseudocode.
搜索算法：线性搜索 O(n)，二分搜索 O(log n) 适用于已排序数组。排序算法：冒泡排序 O(n²)，插入排序 O(n²)，归并排序 O(n log n)。应能通过伪代码逐步追踪每种算法的执行过程。
Algorithm representation: structure charts (top‑down hierarchy), flowcharts, pseudocode. Key constructs: sequence, selection (IF…THEN…ELSE…ENDIF), iteration (FOR, WHILE, REPEAT…UNTIL).
算法表示：结构图（自顶向下层次）、流程图、伪代码。关键结构：顺序、选择（IF…THEN…ELSE…ENDIF）、迭代（FOR、WHILE、REPEAT…UNTIL）。
Problem decomposition and stepwise refinement: break a problem into smaller sub‑problems, then refine each step. Top‑down design makes testing and maintenance easier.
问题分解与逐步求精：将问题分解为更小的子问题，然后逐步细化。自顶向下的设计更易于测试和维护。
8. Programming Concepts | 编程概念
Data types: integer, real/float, char, string, Boolean. Composite types: arrays, records (structs). Variable declarations and constants. Scope: local (within a subroutine) and global (accessible throughout).
数据类型：整型、实型/浮点型、字符型、字符串型、布尔型。复合类型：数组、记录（结构体）。变量声明和常量。作用域：局部（仅在子程序内有效）和全局（在整个程序中可访问）。
File handling: opening a file for read/write/append, reading lines, writing data, closing files. Exception handling using TRY…EXCEPT blocks in pseudocode to gracefully manage runtime errors (e.g., division by zero, file not found).
文件处理：以读/写/追加方式打开文件，读取行数据，写入数据，关闭文件。在伪代码中使用 TRY…EXCEPT 块进行异常处理，优雅地管理运行时错误（如除零错误、文件未找到）。
Object‑oriented programming: class, object, attribute, method, inheritance, polymorphism, encapsulation. Inheritance allows a subclass to derive from a superclass, reusing attributes and methods. Polymorphism means the same method name can behave differently depending on the object.
面向对象编程：类、对象、属性、方法、继承、多态、封装。继承允许子类从父类派生，重用属性和方法。多态指同一方法名可根据对象的不同而表现出不同行为。
9. Databases | 数据库
A relational database consists of tables linked by primary and foreign keys. Primary key: unique identifier. Foreign key: links to the primary key of another table, enabling relationships. Normalisation reduces redundancy and update anomalies (1NF: atomic values; 2NF: remove partial dependencies; 3NF: remove transitive dependencies).
关系数据库由通过主键和外键关联的表组成。主键是唯一标识符。外键引用另一张表的主键，从而建立关系。规范化可减少数据冗余和更新异常（1NF：原子值；2NF：消除部分依赖；3NF：消除传递依赖）。
SQL (Structured Query Language) is used to define and manipulate databases. Common commands: SELECT, FROM, WHERE, ORDER BY, GROUP BY, HAVING, INSERT INTO, UPDATE, DELETE. JOIN operations combine rows from multiple tables: INNER JOIN, LEFT/RIGHT OUTER JOIN.
SQL（结构化查询语言）用于定义和操作数据库。常用命令：SELECT、FROM、WHERE、ORDER BY、GROUP BY、HAVING、INSERT INTO、UPDATE、DELETE。JOIN 操作用于联结多张表的行：INNER JOIN、LEFT/RIGHT OUTER JOIN。
A DBMS (Database Management System) provides data security, integrity constraints, concurrent access control, and backup/recovery. A data warehouse stores historical data for analysis, using OLAP, while OLTP systems handle day‑to‑day transactions.
数据库管理系统（DBMS）提供数据安全、完整性约束、并发访问控制以及备份恢复。数据仓库存储用于分析的历史数据，采用 OLAP；而 OLTP 系统则处理日常交易事务。
10. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路
Basic gates: AND, OR, NOT, NAND, NOR, XOR. Truth tables for each. NAND and NOR are functionally complete: any Boolean function can be implemented using only NAND gates (or only NOR gates).
基本门电路：与门、或门、非门、与非门、或非门、异或门。每种门电路都有对应的真值表。与非门和或非门具有功能完备性：仅用与非门（或仅用或非门）即可实现任何布尔函数。
Boolean identities and laws: commutative, associative, distributive, De Morgan’s theorems (A+B = A·B, A·B = A+B), absorption, double negation. Use them to simplify logic expressions.
布尔恒等式和定律：交换律、结合律、分配律、德摩根定律（A+B = A·B，A·B = A+B）、吸收律、双重否定律。可运用这些定律化简逻辑表达式。
Karnaugh maps (K‑maps) provide a visual method to simplify Boolean expressions up to 4 variables. Group adjacent 1s in rectangles of size 1,2,4,8,… and derive the minimal sum‑of‑products expression. Don’t care conditions (X) can be used to enlarge groups.
卡诺图提供了一种可视化方法，最多能对 4 个变量的布尔表达式进行化简。将相邻的 1 圈成大小为 1、2、4、8……的矩形组，然后推导出最简的积之和表达式。无关项（X）可用于扩大组。
A half‑adder adds two bits, producing Sum and Carry. A full‑adder adds three bits (including carry‑in). Multiple full‑adders build a ripple‑carry adder. Flip‑flops (SR, JK, D) are sequential circuits that store a single bit and form memory elements.
半加器对两个位进行相加，产生 Sum 和 Carry。全加器对三个位（包括进位输入）相加。多个全加器级联构成行波进位加法器。触发器（SR、JK、D）是能存储单个位的时序电路，构成存储器元件。
11. Error Handling and Testing | 错误处理与测试
Types of errors: syntax (grammar mistakes, detected by compiler/interpreter), run‑time (cause program to crash, e.g., division by zero), logic (program runs but produces wrong output).
错误类型：语法错误（语法错误，由编译器/解释器检测）、运行时错误（导致程序崩溃，如除零）、逻辑错误（程序运行但输出错误）。
Testing strategies: black‑box (functional, tests input/output without internal knowledge), white‑box (structural, tests all paths and conditions), integration, alpha (internal) and beta (external end‑users). Test plans should include normal, boundary, and erroneous data.
测试策略：黑盒测试（功能测试，不关注内部结构，只检查输入输出）、白盒测试（结构测试，测试所有路径和条件）、集成测试、α 测试（内部）和 β 测试（外部最终用户）。测试计划应包含正常数据、边界数据和错误数据。
Verification ensures the product is built correctly according to specifications. Validation checks whether the product meets the user’s real needs. Both are essential for software quality.
验证确保产品按照规格说明正确构建。确认检查产品是否满足用户的真实需求。两者对于软件质量都至关重要。
12. Exam Tips and Common Pitfalls | 应试技巧与常见陷阱
Read each question carefully, noting the command words: ‘State’, ‘Describe’, ‘Explain’, ‘Compare’, ‘Evaluate’. For ‘Describe’, simply provide key facts; ‘Explain’ requires cause and effect with justification; ‘Evaluate’ demands a balanced conclusion.
仔细审题，注意指令词：“陈述”（State）、“描述”（Describe）、“解释”（Explain）、“比较”（Compare）、“评估”（Evaluate）。“描述”只需给出关键事实；“解释”要说明因果关系并给出理由；“评估”则需要给出权衡后的结论。
When writing pseudocode, maintain consistent indentation and use clear variable names. Declare variables and constants explicitly. For database questions, show all relationships and explain normalisation steps clearly. In Boolean simplification, show each application of a law or K‑map groupings step by step.
编写伪代码时，保持一致的缩进并使用清晰的变量名。显式声明变量和常量。对于数据库题目，展示所有关系并清晰解释规范化步骤。在布尔化简中，逐步展示每个定律的应用或卡诺图的分组过程。
Time management: 75‑mark paper in 90 minutes gives roughly 1.2 minutes per mark. Tackle high‑mark questions first if you are confident, but ensure you leave time for the compulsory shorter questions. Always show workings for calculation questions; marks are given for method.
时间管理：75 分的试卷在 90 分钟内完成，大约每分用时 1.2 分钟。如果有把握，可先解答分值较高的题目，但务必保留时间应对必答的简答题。计算题务必写出中间步骤，方法正确即可得分。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导