📚 Cambridge AS & A Level Computer Science: Core Concepts Revision | 剑桥AS & A Level计算机科学核心概念复习
The Cambridge International AS and A Level Computer Science coursebook by Sylvia Langfield and Dave Duddell is a widely used resource for the CIE 9608 syllabus. This article summarises the core topics you need to master, from data representation and computer architecture to databases and ethical issues. Use it as a structured revision guide to check your understanding and identify gaps before the exam.
由Sylvia Langfield和Dave Duddell编写的剑桥国际AS与A Level计算机科学教材是CIE 9608考纲的常用资源。本文总结了需要掌握的核心主题，从数据表示和计算机体系结构到数据库与道德问题。可将其作为结构化复习指南，在考试前检查理解并发现薄弱环节。
1. Data Representation | 数据表示
Computers store and process all data as binary digits (bits). The CIE syllabus requires you to convert confidently between binary, denary and hexadecimal, and to understand how negative integers are represented using two’s complement. Binary coded decimal (BCD) is also examined as an alternative for representing decimal digits exactly.
计算机以二进制数字（比特）存储和处理所有数据。CIE考纲要求你能够在二进制、十进制和十六进制之间熟练转换，并理解如何使用二进制补码表示负整数。二进制编码十进制（BCD）也作为精确表示十进制数字的替代方案被考到。
- Binary to denary: multiply each 1 bit by its place value (e.g. 1011₂ = 8 + 2 + 1 = 11).
- Hexadecimal to binary: each hex digit maps to a 4-bit nibble (e.g. A5₁₆ = 1010 0101₂).
- Two’s complement: invert all bits and add 1 to negate a binary integer.
Range of n-bit two’s complement: -2ⁿ⁻¹ to 2ⁿ⁻¹ – 1
Floating-point numbers are stored as a mantissa and an exponent, allowing a trade-off between range and precision. You should be able to convert simple decimal fractions into normalised floating-point form and explain the effects of increasing or decreasing the number of bits allocated to the mantissa and exponent.
浮点数以尾数和指数存储，在范围和精度之间进行权衡。你应该能够将简单的十进制小数转换为规格化的浮点形式，并解释增加或减少分配给尾数和指数的位数所产生的效果。
2. Computer Architecture | 计算机体系结构
The Von Neumann architecture forms the basis of most modern processors. It uses a single memory space for both instructions and data, with the CPU fetching instructions one at a time. Key CPU components include the arithmetic logic unit (ALU), the control unit (CU) and various registers such as the program counter (PC), memory address register (MAR), memory data register (MDR), current instruction register (CIR) and accumulator (ACC).
冯·诺依曼体系结构构成了大多数现代处理器的基础。它使用单一内存空间存放指令和数据，CPU一次取一条指令。关键的CPU组件包括算术逻辑单元（ALU）、控制单元（CU）以及各种寄存器，如程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器（ACC）。
The fetch-decode-execute cycle describes how the CPU processes an instruction: fetch copies the instruction from memory into the CIR via the MAR and MDR; decode interprets the opcode; execute performs the operation, possibly using the ALU and writing results back to memory. Buses (address, data, control) transfer information between components.
取指-译码-执行周期描述了CPU如何处理一条指令：取指通过MAR和MDR将指令从内存复制到CIR；译码解释操作码；执行使用ALU执行操作，并可能将结果写回内存。总线（地址、数据、控制）在组件之间传输信息。
| Factor | Effect on performance |
| Clock speed | Higher clock rate means more cycles per second |
| Cache memory | Larger and faster cache reduces average memory access time |
| Number of cores | Multiple cores allow true parallel execution of instructions |
理解这些构件对于分析CPU性能以及讨论改进某一因素是否一定能提高速度至关重要。
3. Operating Systems | 操作系统
An operating system (OS) is system software that manages hardware resources and provides services to applications. Core functions include memory management, process scheduling, file management, input/output control, interrupt handling and providing a user interface. The OS must allocate RAM fairly and securely among running processes.
操作系统（OS）是管理硬件资源并为应用程序提供服务的系统软件。核心功能包括内存管理、进程调度、文件管理、输入/输出控制、中断处理和提供用户界面。操作系统必须在运行的进程之间公平且安全地分配RAM。
Virtual memory uses a portion of secondary storage to simulate extra RAM when physical memory is full. Pages of memory are swapped between RAM and disk. Paging divides memory into fixed-size pages, while segmentation divides programs into logical segments of variable size. Interrupts allow hardware or software to signal the CPU that immediate attention is needed, improving efficiency.
虚拟内存使用一部分二级存储来在物理内存已满时模拟额外的RAM。内存页在RAM和磁盘之间交换。分页将内存划分为固定大小的页，而分段将程序划分为可变大小的逻辑段。中断允许硬件或软件向CPU发出需要立即关注的信号，从而提高效率。
You should also be able to explain scheduling algorithms such as round robin, first come first served, shortest job first and priority scheduling, and discuss their impact on throughput, waiting time and fairness.
你还应该能够解释调度算法，如轮转、先来先服务、短作业优先和优先级调度，并讨论它们对吞吐量、等待时间和公平性的影响。
4. Communication and Networks | 通信与网络
Networks allow computers to share resources and data. The CIE syllabus covers network types (LAN, WAN, PAN), topologies (star, bus, ring, mesh), and transmission media (twisted pair, coaxial, fibre optic, wireless). You need to understand how data is transmitted using protocols such as TCP/IP.
网络允许计算机共享资源和数据。CIE考纲涵盖网络类型（局域网、广域网、个人局域网）、拓扑结构（星型、总线型、环型、网状）以及传输介质（双绞线、同轴电缆、光纤、无线）。你需要理解如何使用TCP/IP等协议传输数据。
Packet switching breaks messages into packets that travel independently and may take different routes; circuit switching establishes a dedicated physical path before communication. Error detection methods include parity bits, checksums and echo checks. Internetworking devices such as hubs, switches and routers operate at different layers of the OSI model.
分组交换将消息拆分为独立传输且可能走不同路由的数据包；电路交换在通信前建立专用的物理路径。差错检测方法包括奇偶校验位、校验和和回显检查。集线器、交换机和路由器等网络互连设备在OSI模型的不同层上运行。
Network throughput = Data volume ÷ Transmission time
You should be able to calculate transmission time, propagation delay, and explain how packet size, overhead and error rates affect overall throughput and latency.
你应该能够计算传输时间、传播延迟，并解释数据包大小、开销和错误率如何影响总体吞吐量和延迟。
5. Programming Fundamentals | 编程基础
The coursebook introduces programming using high-level languages. Fundamental constructs include sequence, selection (IF, CASE) and iteration (FOR, WHILE, REPEAT). You must be able to read and write pseudocode, and trace code to determine output values.
该教材使用高级语言介绍编程。基本结构包括顺序、选择（IF、CASE）和迭代（FOR、WHILE、REPEAT）。你必须能够阅读和编写伪代码，并通过跟踪代码确定输出值。
You also need to understand data types (integer, real, char, string, Boolean), variables and constants, procedures and functions, and parameter passing mechanisms. Pass by value copies the argument, so changes inside the subroutine do not affect the caller; pass by reference passes the address, so changes are visible outside.
你还需要理解数据类型（整型、实型、字符型、字符串型、布尔型）、变量和常量、过程和函数以及参数传递机制。按值传递复制实参，因此子程序内的更改不会影响调用者；按引用传递传递地址，因此更改在外部可见。
Recursion is a technique where a subroutine calls itself. A recursive algorithm must have a base case to terminate. You should be able to trace recursive functions such as factorial and Fibonacci, and compare recursion with iteration in terms of memory usage and clarity.
递归是一种子程序调用自身的技术。递归算法必须有一个终止的基例。你应该能够跟踪阶乘和斐波那契等递归函数，并在内存使用和清晰度方面将递归与迭代进行比较。
6. Data Structures and Algorithms | 数据结构与算法
Data structures organise data efficiently. The syllabus requires arrays (1D and 2D), records, lists, stacks, queues, linked lists and binary trees. Stacks are LIFO (last in, first out) and queues are FIFO (first in, first out). Linked lists enable dynamic memory allocation without the need for contiguous storage.
数据结构高效地组织数据。考纲要求掌握数组（一维和二维）、记录、列表、栈、队列、链表和二叉树。栈是后进先出（LIFO），队列是先进先出（FIFO）。链表支持动态内存分配，无需连续存储。
Searching algorithms include linear search (O(n)) and binary search (O(log n)), but binary search requires a sorted array. Sorting algorithms include bubble sort and insertion sort (both O(n²) in the worst case) and merge sort (O(n log n)). Use Big O notation to describe time complexity and compare algorithm efficiency.
搜索算法包括线性搜索（O(n)）和二分搜索（O(log n)），但二分搜索要求数组已排序。排序算法包括冒泡排序和插入排序（最坏情况下均为O(n²)）以及归并排序（O(n log n)）。使用大O符号描述时间复杂度并比较算法效率。
- Stack operations: push(item), pop(), peek() / top().
- Queue operations: enqueue(item), dequeue(), front().
- Binary tree traversal: pre-order (root, left, right), in-order (left, root, right), post-order (left, right, root).
You should be able to draw and trace these data structures, and write algorithms for insertion, deletion, searching and traversal.
你应该能够画出并跟踪这些数据结构，并编写插入、删除、搜索和遍历的算法。
7. Databases | 数据库
A relational database stores data in tables (relations) linked by relationships. Each table consists of entities (rows) and attributes (columns). A primary key uniquely identifies each record; a foreign key links one table to another by referencing the primary key of a related table.
关系数据库在相互关联的表（关系）中存储数据。每个表由实体（行）和属性（列）组成。主键唯一标识每条记录；外键通过引用相关表的主键将一个表链接到另一个表。
Normalisation reduces data redundancy and update anomalies. First normal form (1NF) requires atomic values and no repeating groups; second normal form (2NF) removes partial dependencies on composite keys; third normal form (3NF) removes non-key dependencies. You must be able to convert unnormalised data into 1NF, 2NF and 3NF.
规范化减少数据冗余和更新异常。第一范式（1NF）要求原子值且没有重复组；第二范式（2NF）消除对复合键的部分依赖；第三范式（3NF）消除非键依赖。你必须能够将未规范化的数据转换为1NF、2NF和3NF。
SQL is the standard query language. Basic commands include SELECT (retrieve data), INSERT (add rows), UPDATE (modify existing rows) and DELETE (remove rows). You should be able to write simple SQL statements with WHERE, ORDER BY and JOIN clauses.
SQL是标准的查询语言。基本命令包括SELECT（检索数据）、INSERT（添加行）、UPDATE（修改现有行）和DELETE（删除行）。你应该能够使用WHERE、ORDER BY和JOIN子句编写简单的SQL语句。
8. System Life Cycle | 系统开发生命周期
The systems development life cycle (SDLC) provides a structured approach to building software. Stages typically include feasibility study, requirements analysis, design, implementation, testing, deployment, maintenance and evaluation. Each stage produces documentation that feeds into the next.
系统开发生命周期（SDLC）提供了一种结构化的软件开发方法。阶段通常包括可行性研究、需求分析、设计、实现、测试、部署、维护和评估。每个阶段产生的文档会输入到下一阶段。
Development methodologies vary in how these stages are organised. The waterfall model completes each stage once before moving on; agile development uses iterative cycles (sprints) with frequent feedback; rapid application development (RAD) uses prototypes and user involvement to speed up delivery.
开发方法在这些阶段的组织方式上有所不同。瀑布模型在进入下一阶段前一次性完成每个阶段；敏捷开发使用迭代周期（冲刺）并频繁反馈；快速应用开发（RAD）使用原型和用户参与来加快交付。
Testing methods include unit testing, integration testing, system testing and acceptance testing. You should be able to distinguish between black-box testing (functional, no internal knowledge) and white-box testing (path testing with knowledge of code).
测试方法包括单元测试、集成测试、系统测试和验收测试。你应该能够区分黑盒测试（功能性，不了解内部结构）和白盒测试（了解代码的路径测试）。
9. Ethics, Legal and Environmental Issues | 道德、法律与环境问题
Computer science professionals must consider ethical, legal and environmental impacts of technology. Key topics include data privacy, intellectual property rights, software licensing, computer misuse, and the digital divide. Professional bodies often publish codes of conduct that members should follow.
计算机科学专业人员必须考虑技术的道德、法律和环境影响。关键主题包括数据隐私、知识产权、软件许可、计算机滥用以及数字鸿沟。专业机构通常发布成员应遵守的行为准则。
Data protection laws regulate how personal data is collected, stored and used. Intellectual property includes copyright, patents and trademarks, which protect software and digital content. Software licences range from proprietary to open source, affecting distribution and modification rights.
数据保护法律规范个人数据的收集、存储和使用。知识产权包括版权、专利和商标，保护软件和数字内容。软件许可从专有到开源不等，影响分发和修改权。
Environmental concerns arise from manufacturing, energy consumption and e-waste. The digital divide describes unequal access to technology between different groups. You should be able to discuss these issues from multiple perspectives using structured arguments.
环境问题源于制造、能源消耗和电子废弃物。数字鸿沟描述了不同群体之间在技术获取上的不平等。你应该能够使用结构化论点从多个角度讨论这些问题。
10. Exam Tips and Summary | 考试技巧与总结
Success in CIE Computer Science requires both knowledge and exam technique. Read questions carefully and note the command word: ‘define’ asks for a precise meaning, ‘describe’ requires a detailed account, ‘explain’ demands reasons or causes, and ‘evaluate’ expects judgements supported by evidence.
在CIE计算机科学中取得成功需要知识和答题技巧。仔细阅读问题并注意指令词：“define”要求精确的含义，“describe”要求详细说明，“explain”要求原因或成因，“evaluate”要求有证据支持的判断。
Practise with past papers under timed conditions. When writing pseudocode, use clear indentation and consistent syntax. In database questions, always check for primary keys, foreign keys and normalisation. In data representation, double-check your binary conversions and two’s complement calculations.
在计时条件下练习往年试题。编写伪代码时，使用清晰的缩进和一致的语法。在数据库问题中，始终检查主键、外键和规范化。在数据表示中，仔细检查二进制转换和二进制补码计算。
This revision guide covers the main areas of the Cambridge AS and A Level Computer Science coursebook. Review each section, attempt related questions, and revisit weak areas before your final exam. Good preparation is the key to confidence.
本复习指南涵盖了剑桥AS和A Level计算机科学教材的主要领域。复习每个部分，尝试相关题目，并在期末考试前回顾薄弱环节。充分的准备是建立信心的关键。
Published by TutorHao | CIE Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导