High-Yield Topic Summary for A-Level CIE Computer Science | A-Level CIE 计算机：高频考点总结

📚 High-Yield Topic Summary for A-Level CIE Computer Science | A-Level CIE 计算机：高频考点总结

The Cambridge International AS & A Level Computer Science (9618) syllabus spans hardware, software, theory of computation, and ethical issues. This revision article consolidates the most frequently examined topics into a bilingual guide, presenting every key idea in English followed by its Chinese equivalent. You will find concise explanations of data representation, computer architecture, operating systems, networking, databases, Boolean logic, programming, algorithms, system development, and security – all tuned to the demands of the CIE examination.

剑桥国际AS与A Level计算机科学(9618)课程涵盖硬件、软件、计算理论及伦理议题。这篇复习文章将最高频的考点整合成一份双语指南，每条关键概念均以英文呈现并紧接中文翻译。你将看到数据表示、计算机体系结构、操作系统、网络、数据库、布尔逻辑、编程、算法、系统开发和安全等模块的精炼解析，所有内容都契合CIE考试的要求。

1. Data Representation Fundamentals | 数据表示基础

All data inside a computer is stored as binary digits (bits). Programmers often use hexadecimal (base-16) as a shorthand because one hex digit represents exactly four bits (a nibble). To convert denary to binary, repeatedly divide by 2 and record remainders. To convert binary to hexadecimal, group bits into nibbles from the right and then write the equivalent hex digit (0–9, A–F).

计算机内的所有数据都以二进制位存储。程序员常用十六进制作为简写，因为一个十六进制数字恰好代表四个二进制位（半个字节）。将十进制转换为二进制时，反复除以2并记录余数；将二进制转换为十六进制时，从右向左每四位一组，然后写出对应的十六进制数字（0–9, A–F）。

Negative integers are represented using two’s complement. To obtain the two’s complement of a binary number, invert all bits (one’s complement) and add 1. For an n-bit word, the range of representable values is –2^n–1 to 2^n–1–1. The most significant bit acts as a sign bit: 0 for positive, 1 for negative.

负整数以补码表示。要得到某个二进制数的补码，先将所有位取反（反码），然后加1。对于n位字长，可表示的数值范围是 –2^n–1 到 2^n–1–1。最高有效位作为符号位：0为正，1为负。

Binary Coded Decimal (BCD) encodes each decimal digit as its 4-bit binary equivalent. For example, 259 is stored as 0010 0101 1001 in BCD. It is used in applications that require precise decimal arithmetic, such as digital displays and financial systems.

二进制编码十进制(BCD)将每一位十进制数字编码为其4位二进制等值。例如，259在BCD中存储为0010 0101 1001。它应用于需要精确十进制算术的场合，例如数字显示和金融系统。

Real numbers are stored in floating-point form: a mantissa (fraction) multiplied by 2 raised to the power of the exponent. Normalisation shifts the mantissa so that its most significant bit is 1, maximising precision. A typical floating-point number is expressed as:

实数以浮点数形式存储：一个尾数乘以2的指数次幂。规范化将尾数移位，使最高有效位为1，以最大化精度。典型的浮点数表示为：

Value = Mantissa × 2^Exponent

2. Computer Architecture and the Fetch–Execute Cycle | 计算机体系结构与取指–执行周期

The Von Neumann architecture stores both data and instructions in the same memory, sharing a single bus. The central processing unit (CPU) contains the arithmetic logic unit (ALU), control unit (CU), and a set of registers. The most important registers for the fetch–execute cycle are:

冯·诺依曼体系结构将数据和指令存放在同一存储器中，共享单一总线。中央处理器内含算术逻辑单元、控制单元和一组寄存器。取指–执行周期中最重要的寄存器有：

Program Counter (PC) – holds address of the next instruction
Memory Address Register (MAR) – holds address to be read/written
Memory Data Register (MDR) – holds data just read or to be written
Current Instruction Register (CIR) – holds the instruction being executed
Accumulator (ACC) – holds results of ALU operations

程序计数器(PC) – 存放下一条指令的地址
存储器地址寄存器(MAR) – 存放待读写的地址
存储器数据寄存器(MDR) – 存放刚读出或待写入的数据
当前指令寄存器(CIR) – 存放正在执行的指令
累加器(ACC) – 存放ALU运算结果

The fetch–execute cycle proceeds as follows: PC value is copied to MAR, memory read is initiated, instruction moves from MDR to CIR, PC increments. The CU then decodes the instruction and executes it, often using the ALU and other registers.

取指–执行周期流程如下：PC的值被复制到MAR，启动存储器读，指令从MDR传至CIR，PC递增。接着CU解码并执行该指令，此过程常会用到ALU和其他寄存器。

Assembly language uses mnemonics such as LDM, STO, ADD, and JMP. Addressing modes specify how the operand is accessed: immediate (operand is part of instruction), direct (address of operand given), indirect (address holds the address of the operand), and indexed (base address plus an index register).

汇编语言使用助记符，如LDM、STO、ADD和JMP。寻址方式指定操作数的访问方式：立即寻址（操作数是指令的一部分）、直接寻址（给定操作数地址）、间接寻址（地址中存放的是操作数的地址）和变址寻址（基地址加上变址寄存器的值）。

3. Operating Systems and Interrupts | 操作系统与中断

An operating system (OS) manages hardware resources, provides a user interface, and enables multitasking. It handles interrupts – signals from hardware or software that demand immediate attention. When an interrupt occurs, the current process state is saved, an Interrupt Service Routine (ISR) is executed via the interrupt vector table, and then the original process resumes.

操作系统管理硬件资源、提供用户界面并实现多任务处理。它处理中断——来自硬件或软件的紧急信号。中断发生时，当前进程状态被保存，通过中断向量表执行中断服务程序(ISR)，然后原进程恢复。

CPU scheduling algorithms determine the order of process execution. Common strategies include First Come First Served (FCFS), Shortest Job First (SJF), Round Robin (each process gets a time quantum), and Priority-based scheduling. Round Robin is widely adopted for its fairness in interactive systems.

CPU调度算法决定进程执行的顺序。常见策略包括先到先服务、最短作业优先、轮转调度（每个进程获得一个时间片）和基于优先级的调度。轮转调度因在交互式系统中的公平性而被广泛采用。

Memory management uses paging and segmentation. Paging divides physical memory into fixed-size frames and logical memory into pages; a page table maps pages to frames. Virtual memory extends RAM by using disk space, allowing larger programs to run even when physical memory is limited.

内存管理采用分页和分段技术。分页将物理内存划分为固定大小的帧，逻辑内存划分为页；页表将页映射到帧。虚拟内存利用磁盘空间扩展RAM，使得物理内存受限时也能运行更大的程序。

4. Networking Essentials | 网络基础

Local Area Networks (LANs) connect computers in a small geographical area, whereas Wide Area Networks (WANs) span cities or countries. Common topologies include star (central switch), bus (single backbone cable), and mesh (multiple redundant paths). Packet switching breaks data into packets, each carrying a header with source/destination addresses, and routes them independently.

局域网连接小范围地理区域内的计算机，广域网则跨越城市或国家。常见拓扑包括星型（中心交换机）、总线型（单根主干电缆）和网状型（多条冗余路径）。分组交换将数据分割为数据包，每个包含带有源地址和目的地址的报头，并独立路由。

The TCP/IP model is a four-layer protocol stack: Application (e.g., HTTP, SMTP), Transport (TCP, UDP), Internet (IP), and Network Access (Ethernet, Wi-Fi). TCP provides reliable, connection-oriented delivery with error checking, while UDP is connectionless and faster.

TCP/IP模型是一个四层协议栈：应用层（如HTTP、SMTP）、传输层（TCP、UDP）、互联网层（IP）和网络接入层（以太网、Wi-Fi）。TCP提供可靠的、面向连接的传输并带有错误校验，而UDP是无连接的、更快速。

Key protocols and their default ports are summarised below:

关键协议及其默认端口总结如下：

Protocol	Port	Purpose
HTTP	80	Web browsing (unencrypted)
HTTPS	443	Secure web browsing (TLS/SSL)
FTP	21	File transfer
SMTP	25	Sending emails
POP3	110	Retrieving emails (download)
IMAP	143	Retrieving emails (server sync)
DNS	53	Domain name resolution

IP addresses (IPv4) are 32-bit numbers usually written in dotted decimal. Subnetting borrows host bits to create network subdivisions, helping reduce broadcast domains and improve security.

IP地址(IPv4)是32位数字，通常采用点分十进制书写。子网划分借用主机位创建网络子区域，有助于缩小广播域并提高安全性。

5. Databases and Normalisation | 数据库与规范化

A relational database organises data into tables (relations) linked by primary keys and foreign keys. Each table has a primary key that uniquely identifies each record; a foreign key in one table refers to the primary key of another, establishing relationships. Entity-relationship (ER) diagrams graphically depict entities, attributes, and relationships (1:1, 1:M, M:M).

关系型数据库将数据组织为通过主键和外键关联的表。每个表有一个唯一标识记录的主键；一个表中的外键引用另一个表的主键，从而建立联系。实体-关系图以图形方式描绘实体、属性及联系（1:1、1:M、M:M）。

Normalisation reduces data redundancy and update anomalies. The progressive stages are:

规范化旨在减少数据冗余和更新异常。递进的阶段包括：

1NF: All attributes contain atomic values; no repeating groups.
2NF: Table is in 1NF and no partial dependencies on the primary key exist (all non-key attributes depend on the whole primary key).
3NF: Table is in 2NF and contains no transitive dependencies (non-key attributes depend only on the primary key).

1NF：所有属性包含原子值，没有重复组。
2NF：满足1NF且不存在对主键的部分依赖（所有非键属性依赖整个主键）。
3NF：满足2NF且不存在传递依赖（非键属性仅依赖于主键）。

Structured Query Language (SQL) is used to manipulate databases. A typical query might be:

SELECT Name, Score FROM Students WHERE Grade = ‘A’ ORDER BY Score DESC;

The command retrieves names and scores of students with grade ‘A’, sorted descending.

结构化查询语言(SQL)用于操作数据库。一个典型查询可能为：

SELECT Name, Score FROM Students WHERE Grade = ‘A’ ORDER BY Score DESC;

该命令检索成绩为’A’的学生的姓名和分数，并按分数降序排列。

6. Boolean Algebra and Karnaugh Maps | 布尔代数与卡诺图

Boolean algebra deals with binary variables and logical operations. The basic gates are AND (∧), OR (∨), and NOT (¬). NAND and NOR gates are functionally complete, meaning any logic circuit can be built using only NAND or only NOR gates.

布尔代数处理二进制变量和逻辑运算。基本门为与(∧)、或(∨)和非(¬)。与非门和或非门具有功能完备性，意味着任何逻辑电路都可仅用与非门或仅用或非门实现。

De Morgan’s laws are essential for simplifying expressions:

德摩根定律对于表达式化简至关重要：

¬(A ∧ B) = ¬A ∨ ¬B

¬(A ∨ B) = ¬A ∧ ¬B

Karnaugh maps (K-maps) provide a systematic method to minimise Boolean expressions of up to four variables. Adjacent cells containing 1s are grouped in powers of two to obtain simplified sum-of-products (SOP) or product-of-sums (POS) forms.

卡诺图为最多四个变量的布尔表达式提供了一种系统化简方法。相邻的含1单元按2的幂次分组，从而得到简化的积之和(SOP)或和之积(POS)形式。

A half adder adds two bits and produces a sum (S = A ⊕ B) and a carry (C = A ∧ B). A full adder extends this to three input bits (A, B, C_in) giving S = A ⊕ B ⊕ C_in and C_out = (A ∧ B) ∨ (C_in ∧ (A ⊕ B)).

半加器将两个位相加，产生和(S = A ⊕ B)和进位(C = A ∧ B)。全加器将此扩展到三个输入位(A, B, C_in)，得到S = A ⊕ B ⊕ C_in和C_out = (A ∧ B) ∨ (C_in ∧ (A ⊕ B))。

7. Programming Fundamentals (Python and Pseudocode) | 编程基础（Python与伪代码）

CIE examinations expect familiarity with programming constructs in a high-level language (often Python) and the ability to read and write pseudocode. Key data types include integer, real, character, string, and Boolean. Control structures cover sequence, selection (IF…THEN…ELSE…ENDIF), and iteration (FOR, WHILE, REPEAT…UNTIL).

CIE考试要求学生熟悉高级语言（通常是Python）中的编程结构，并能阅读和书写伪代码。

Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com

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

High-Yield Topic Summary for A-Level CIE Computer Science | A-Level CIE 计算机：高频考点总结