📚 Year 11 Cambridge Computer Science: Complete Syllabus Breakdown | Year 11 剑桥计算机：课程大纲全面解析
Cambridge IGCSE Computer Science (0478) is a rigorous two‑year course that builds a solid foundation in computational thinking, programming, and the theoretical principles underpinning modern technology. Year 11 typically covers the second half of the syllabus, where students deepen their understanding of hardware, software, networks, databases, and algorithmic problem‑solving. This article provides a comprehensive breakdown of every major topic in the Year 11 Cambridge Computer Science syllabus, linking each section to key learning objectives and common examination question styles.
剑桥IGCSE计算机科学(0478)是一门严谨的两年制课程，帮助学生打下计算思维、编程以及支撑现代技术的理论基础。Year 11 通常涵盖课程大纲的后半部分，学生将在这一年深入理解硬件、软件、网络、数据库以及算法问题求解等内容。本文全面拆解 Year 11 剑桥计算机课程中的每一个重要主题，并将各个章节的核心学习目标以及常见考题类型串联起来，以便学生高效复习。
1. Data Representation in Depth | 深入探究数据表示
In Year 11, students move beyond simple binary and hexadecimal conversions and explore how data is stored in computer systems. They learn about two's complement representation for negative integers, which allows the CPU to perform subtraction using addition circuits. The understanding of binary addition, overflow errors, and logical shifts (left and right) becomes essential for tackling low‑level programming questions. Character encoding schemes such as ASCII and Unicode are examined in detail, with emphasis on the relationship between code points and binary patterns.
进入 Year 11，学生不再局限于简单的二进制与十六进制转换，而是深入探究数据在计算机系统中的存储方式。他们学习用补码表示负整数，这让 CPU 能够利用加法电路执行减法操作。理解二进制加法、溢出错误以及逻辑移位（左移与右移）对于解决底层编程问题至关重要。同时还会详细研究 ASCII 与 Unicode 等字符编码方案，重点理解码点与二进制位模式之间的关系。
- Two's complement: invert bits and add 1 to represent negative numbers.
- 补码：按位取反再加 1 即可表示负数。
- Binary addition, overflow, and logical left/right shifts (multiplication/division by powers of 2).
- 二进制加法、溢出以及逻辑左移/右移（相当于乘以或除以 2 的幂）。
- ASCII, extended ASCII, and Unicode; their bit requirements and use cases.
- ASCII、扩展 ASCII 与 Unicode 的位宽需求及适用场景。
Sound and image representation also receive greater attention: students calculate file sizes from sample rate, bit depth, and duration for audio; for bitmap images, they use colour depth and resolution to estimate storage requirements. The concept of file compression, both lossless (run‑length encoding, Huffman coding) and lossy (JPEG, MP3), is tested through calculation and evaluation questions.
声音与图像的表示也同样受到重视：学生需要根据采样率、位深和时长计算音频文件大小；而对于位图图像，则利用色彩深度与分辨率来估算存储需求。文件压缩的概念，包括无损压缩（行程编码、霍夫曼编码）和有损压缩（JPEG、MP3），会通过计算与评价类题目加以考察。
2. Data Transmission and Error Checking | 数据传输与差错检测
Data transmission topics in Year 11 focus on the differences between serial and parallel transmission, and between simplex, half‑duplex, and full‑duplex modes. Students analyse how USB technology uses serial transmission and why it has become the de facto standard for peripheral connections. The syllabus also requires knowledge of packet switching, the structure of data packets (header, payload, trailer), and how routers forward packets across the Internet.
Year 11 的数据传输主题聚焦于串行与并行传输、单工、半双工与全双工模式之间的区别。学生会分析 USB 技术如何利用串行传输，以及它为何成为外设连接的事实标准。课程还要求学生掌握分组交换技术、数据包的结构（头部、有效载荷、尾部），以及路由器如何在互联网上转发数据包。
Error detection methods — parity checks, checksums, and echo checks — are explained alongside automatic repeat request (ARQ) protocols. Students must be able to trace how a parity bit can detect single‑bit errors, understand the limitations of simple parity, and describe how checksums are generated and verified. Exam questions often present a transmission scenario and ask candidates to identify the type of error check used or to calculate a parity bit.
差错检测方法——奇偶校验、校验和以及回声检查——与自动重传请求(ARQ)协议一同讲解。学生必须能够追溯奇偶校验位如何检测单比特错误，理解简单奇偶校验的局限性，并能描述校验和的生成与验证过程。考试常常呈现一个传输场景，要求考生判别所用差错检查类型，或计算奇偶校验位。
| Method | Detects | Limitation |
|---|---|---|
| Parity check | Single‑bit errors (odd number of bits flipped) | Cannot detect even number of bit errors |
| Checksum | Accidental changes in blocks of data | Not foolproof against deliberate tampering |
| Echo check | Transmission errors by returning data to sender | Inefficient for large volumes; cannot correct errors |
3. Computer Architecture and the Fetch‑Decode‑Execute Cycle | 计算机体系结构与取指‑译码‑执行周期
Year 11 revisits the von Neumann architecture with a sharper focus on the role of each register inside the CPU. Students are expected to name and describe the function of the program counter (PC), memory address register (MAR), memory data register (MDR), current instruction register (CIR), and accumulator (ACC). The fetch‑decode‑execute cycle is explained step by step, with emphasis on how the address bus, data bus, and control bus coordinate data movement between the CPU and main memory.
Year 11 重新审视冯·诺依曼体系结构，更聚焦于 CPU 内部每个寄存器的功能。学生需要说出并描述程序计数器(PC)、存储器地址寄存器(MAR)、存储器数据寄存器(MDR)、当前指令寄存器(CIR)以及累加器(ACC)的作用。取指‑译码‑执行周期被逐步拆解，重点强调地址总线、数据总线和控制总线如何在 CPU 与主存之间协调数据移动。
Factors affecting processor performance — clock speed, number of cores, and cache size — are analysed using real‑world examples. Students learn that increasing clock speed raises the number of instructions executed per second, but also generates more heat. Multiple cores allow genuine multitasking, but software must be written to take advantage of them. Cache memory stores frequently accessed instructions and data, reducing the average time to access main memory.
影响处理器性能的因素——时钟速度、核心数量和高速缓存大小——通过现实案例加以分析。学生了解到，提升时钟速度会提高每秒执行的指令数，但同时也会产生更多热量。多个核心允许真正的多任务处理，但软件必须经过专门编写才能发挥其优势。高速缓存用于存放频繁访问的指令与数据，从而缩短访问主存的平均时间。
The concept of an embedded system is distinguished from a general‑purpose computer: an embedded system is a dedicated microprocessor designed to perform a specific task, often with real‑time constraints, limited power, and minimal user interface. Examples include washing machine controllers, digital watches, and anti‑lock braking systems.
嵌入式系统的概念与通用计算机有所区分：嵌入式系统是一种专用微处理器，旨在执行特定任务，通常具有实时约束、有限功耗和极简的用户界面。例子包括洗衣机控制器、电子手表以及防抱死制动系统。
4. Operating Systems, Interrupts, and Utility Software | 操作系统、中断与实用软件
The operating system (OS) is presented as the most essential piece of system software, responsible for managing hardware resources, providing a user interface, and executing application programs. In Year 11, students examine the role of the OS in memory management (including paging and segmentation), multitasking, file management, security (user authentication, access rights), and peripheral management through device drivers.
操作系统(OS)被介绍为最重要的系统软件，负责管理硬件资源、提供用户界面以及执行应用程序。在 Year 11，学生将研究操作系统在内存管理（包括分页与分段）、多任务处理、文件管理、安全（用户身份验证、访问权限）以及通过设备驱动程序进行外设管理等方面的作用。
Interrupts are a key concept: they are signals sent to the processor to indicate an event that needs immediate attention. After servicing an interrupt, the processor resumes the interrupted task by restoring the saved state from the stack. The OS handles interrupts using an interrupt service routine (ISR) and a priority system to manage multiple interrupts. Utility software such as disk defragmentation tools, backup utilities, compression software, and antivirus programs are studied alongside their specific functions.
中断是一个核心概念：它们是发送给处理器的信号，表示有事件需要立即处理。处理器在服务中断后，通过从栈中恢复保存的状态来继续执行被中断的任务。操作系统利用中断服务程序(ISR)和优先级系统来管理多重中断。还会学习实用软件，如磁盘碎片整理工具、备份实用程序、压缩软件和防病毒程序，并了解它们各自的功能。
5. Networks and the Internet | 网络与互联网
Building on Year 10 fundamentals, Year 11 explores the infrastructure of networks in greater depth. Students distinguish between LANs and WANs, and learn about network topologies (star, mesh, bus) along with their advantages and disadvantages. The role of hardware components — routers, switches, hubs, bridges, modems, and network interface cards (NICs) — is linked to the OSI model conceptually, though the syllabus does not require full OSI memorisation.
在 Year 10 基础之上，Year 11 更深入地探讨网络基础设施。学生需要区分局域网与广域网，并学习星型、网状、总线型拓扑结构及其各自的优缺点。路由器、交换机、集线器、网桥、调制解调器和网络接口卡(NIC)等硬件的作用，在概念上与 OSI 模型相联系，不过课程大纲并不要求完整记忆 OSI 七层。
IP addressing, both IPv4 and IPv6, is explained alongside the need for the new addressing scheme. The role of DNS in translating domain names into IP addresses is covered. Students also examine how web browsers retrieve and render web pages, and they analyse the client‑server model versus peer‑to‑peer networking. Security aspects such as firewalls, proxy servers, and encryption (symmetric and asymmetric) are vital parts of this unit.
课程讲解 IPv4 与 IPv6 地址，并说明引入新寻址方案的必要性。DNS 将域名转换为 IP 地址的作用也会涉及。学生还要研究网页浏览器如何获取和渲染网页，并分析客户端‑服务器模型与点对点网络的对立特点。诸如防火墙、代理服务器和加密（对称与非对称）等安全方面，是本单元的重要组成部分。
6. Cyber Security Threats and Mitigation | 网络安全威胁与防范
Security knowledge is deepened by examining the range of threats faced by computer systems: malware (viruses, worms, Trojan horses, spyware, ransomware), phishing, pharming, denial‑of‑service (DoS) attacks, SQL injection, and brute‑force attacks. For each threat, students must be able to describe how it operates and what damage it can cause.
通过审视计算机系统面临的各种威胁，安全知识进一步深化：恶意软件（病毒、蠕虫、特洛伊木马、间谍软件、勒索软件）、网络钓鱼、域欺骗、拒绝服务(DoS)攻击、SQL 注入和暴力攻击。对于每种威胁，学生必须能够描述其运作方式以及可能造成的危害。
Mitigation strategies are a core exam focus: the use of anti‑malware software (updated regularly), firewalls (packet filtering and stateful inspection), strong password policies, biometric authentication, two‑factor authentication, and the principle of least privilege for user accounts. Students also learn about penetration testing, ethical hacking, and the importance of software updates to patch vulnerabilities.
防范策略是考试的核心焦点：使用防恶意软件（定期更新）、防火墙（包过滤与状态检测）、强密码策略、生物特征认证、双因素认证，以及用户账户的最小权限原则。学生还会学习渗透测试、道德黑客攻击，以及通过软件更新修补漏洞的重要性。
7. Algorithms, Problem‑solving, and Trace Tables | 算法、问题求解与追踪表
Algorithm design forms the backbone of computational thinking in Year 11. Students write algorithms using structured English, pseudocode, and flowcharts. Standard constructs — sequence, selection (IF‑THEN‑ELSE, CASE), and iteration (WHILE, REPEAT‑UNTIL, FOR) — are used to solve problems such as sorting and searching. Linear search and binary search are compared, as are bubble sort and insertion sort, with emphasis on efficiency and suitability for different data sets.
算法设计是 Year 11 计算思维的支柱。学生使用结构化英语、伪代码和流程图编写算法。标准构造——顺序、选择（IF‑THEN‑ELSE, CASE）和迭代（WHILE, REPEAT‑UNTIL, FOR）——用于解决排序和搜索等问题。线性搜索与二分搜索、冒泡排序与插入排序的比较，强调效率和对不同数据集的适用性。
Trace tables become a fundamental tool for desk‑checking algorithms. Students complete trace tables by tracking variable values step by step. This skill is heavily examined, often requiring candidates to identify logical errors or to predict the output of a given algorithm. Questions may also ask to rewrite an algorithm more efficiently.
追踪表成为人工检查算法的基本工具。学生通过逐步追踪变量值来填写追踪表。这是一项重点考查的技能，往往要求考生识别逻辑错误，或预测给定算法的输出。题目也可能要求将算法改写得更高效。
- Stepwise refinement: breaking a problem into smaller, manageable sub‑problems.
- 逐步求精：将问题分解成更小、易于管理的子问题。
- Validation and verification: range check, length check, type check, presence check, and double entry.
- 验证与核对：范围检查、长度检查、类型检查、存在性检查和双重输入。
8. Programming Concepts and Pseudocode | 编程概念与伪代码
Year 11 programming extends beyond simple input/output to include complex data types and modular design. Students use one‑dimensional and two‑dimensional arrays to store and manipulate collections of data. File handling concepts — opening, reading, writing, and closing text files — are introduced. The use of procedures and functions with parameters (by value and by reference) promotes code reuse and structured programming.
Year 11 的编程超越简单的输入/输出，涵盖复杂数据类型和模块化设计。学生使用一维和二维数组来存储和操作数据集合。文件处理概念——打开、读取、写入和关闭文本文件——被引入课程。使用带参数（按值传递与按引用传递）的过程和函数，促进了代码重用与结构化编程。
Pseudocode is the primary assessment tool for programming logic. Cambridge provides a specific pseudocode syntax that candidates must use to express algorithms in examination papers. Students must become fluent in declaring variables, using loops, implementing conditionals, and defining sub‑routines in this pseudocode. Careful attention must be paid to indentation, correct logical operators (AND, OR, NOT), and string handling.
伪代码是评估编程逻辑的主要工具。剑桥提供了一套特定的伪代码语法，考生必须在考试卷中使用它来表达算法。学生需要熟练地使用该伪代码声明变量、使用循环、实现条件语句以及定义子程序。必须格外注意缩进、正确的逻辑运算符（AND, OR, NOT）和字符串处理。
Common algorithm patterns such as counting, totalling, finding maximum/minimum, and linear search are practised repeatedly. The use of FOR loops is encouraged when the number of iterations is known in advance, while WHILE loops are used when iteration depends on a condition.
常见的算法模式如计数、累加、查找最大值/最小值以及线性搜索会被反复练习。当迭代次数已知时，鼓励使用 FOR 循环；当迭代取决于条件时，则使用 WHILE 循环。
9. Databases and SQL | 数据库与 SQL
Database theory in Year 11 builds from flat‑file databases to relational databases. Students learn to identify entities, attributes, and relationships, and to design a database schema using tables linked by primary and foreign keys. Normalisation is not required in depth, but the concept of reducing data redundancy and maintaining data integrity is emphasised.
Year 11 的数据库理论从平面文件数据库过渡到关系型数据库。学生学习识别实体、属性和关系，并设计使用主键与外键关联表的数据库模式。虽然不要求深入掌握规范化，但减少数据冗余和维护数据完整性的概念会被强调。
E, ORDER BY, GROUP BY, and aggregate functions (COUNT, SUM, AVG, MAX, MIN). The ability to use logical operators (AND, OR, NOT) and comparison operators (=, <, >, <=, >=, <>) within queries is tested regularly. Students are also expected to understand the purpose of data definition language (DDL) commands such as CREATE TABLE and ALTER TABLE.
结构化查询语言(SQL)是重要的实践环节。考生必须能编写 SQL 语句，使用 SELECT、FROM、WHERE、ORDER BY、GROUP BY 以及聚合函数（COUNT, SUM, AVG, MAX, MIN）查询给定表格。在查询中使用逻辑运算符（AND, OR, NOT）和比较运算符（=, <, >, <=, >=, <>）的能力会经常考查。学生还需理解数据定义语言(DDL)命令的用途，例如 CREATE TABLE 和 ALTER TABLE。
10. Logic Gates and Boolean Logic | 逻辑门与布尔逻辑
Digital logic is a small but significant part of the syllabus, requiring students to recognise the symbols, truth tables, and expressions for basic logic gates: NOT, AND, OR, NAND, NOR, and XOR. They must be able to analyse a logic circuit by writing the Boolean expression and generating the truth table, and conversely, design a circuit from a given problem statement or truth table.
数字逻辑是课程大纲中虽小却重要的一部分，要求学生识别基本逻辑门（NOT, AND, OR, NAND, NOR 和 XOR）的符号、真值表和表达式。他们必须能够通过写出布尔表达式并生成真值表来分析逻辑电路；反之，也要能从给定的问题陈述或真值表设计电路。
The concept of a half‑adder and full‑adder circuit is introduced to demonstrate how addition is performed at the hardware level. Students draw logic circuits for statements using sum‑of‑products form derived from truth tables. Questions frequently involve simplifying Boolean expressions using laws such as associativity, commutativity, and De Morgan's theorems.
引入半加器和全加器电路的概念，以展示硬件层面如何执行加法操作。学生要能根据真值表导出的乘积项之和形式绘制逻辑电路图。考题经常涉及使用结合律、交换律以及德摩根定律等定律来简化布尔表达式。
Important gates: AND (A·B), OR (A+B), NOT (A̅), NAND (A·B)̅, NOR (A+B)̅, XOR (A⊕B)
重要逻辑门：与门 (A·B)、或门 (A+B)、非门 (A̅)、与非门 ((A·B)̅)、或非门 ((A+B)̅)、异或门 (A⊕B)
11. Ethical, Legal, and Environmental Impact | 伦理、法律与环境影响
Year 11 demands that students think critically about the wider implications of computing. Topics include the digital divide, data privacy, workplace monitoring, cyberbullying, trolling, and online safety. The ethical use of artificial intelligence and the responsible development of autonomous systems are increasingly relevant.
Year 11 要求学生批判性地思考计算机带来的更广泛影响。主题涵盖数字鸿沟、数据隐私、工作场所监控、网络欺凌、恶意挑衅和网络安全。人工智能的伦理性使用以及自主系统的负责任开发日益受到关注。
Legislation such as the Data Protection Act and Computer Misuse Act (UK context) is examined in detail, along with international equivalents like GDPR. Students must be able to apply these laws to given scenarios and understand the consequences of non‑compliance. The environmental effects of computing — e‑waste, energy consumption of data centres, and the positive role of technology in smart grids and energy management — are also part of the syllabus.
详细考察《数据保护法》和《计算机滥用法》（英国背景），以及 GDPR 等国际等效法律。学生必须能够将这些法律应用于给定情景，并理解不遵守法律的后果。计算机带来的环境影响——电子废弃物、数据中心能耗，以及技术在智能电网和能源管理中的积极作用——也属于课程内容。
12. Exam Strategy and Revision Techniques | 考试策略与复习技巧
Success in the Cambridge Computer Science examination depends as much on exam technique as on subject knowledge. Paper 1 (Theory) tests recall, understanding, and the ability to apply concepts to unfamiliar contexts. Students should practise writing concise but accurate definitions, drawing and labelling diagrams, and justifying their design choices. Paper 2 (Problem‑solving and Programming) assesses pseudocode writing, trace tables, and logic, demanding careful attention to syntax and logical structure.
剑桥计算机科学考试的成功，不仅取决于学科知识，同样取决于考试技巧。Paper 1（理论）考查记忆、理解以及将概念应用于陌生情境的能力。学生应练习书写简洁而准确的定义、绘制并标注图表，以及论证其设计选择。Paper 2（问题求解与编程）评估伪代码编写、追踪表和逻辑，要求密切关注语法和逻辑结构。
The pre‑release material for Paper 2 should be thoroughly explored: students must understand the scenario, plan potential algorithm solutions, and anticipate the types of questions that could be asked. Practising under timed conditions using past papers is essential. Common pitfalls include missing units in data calculations, forgetting to close loops or initialise variables in pseudocode, and confusing the roles of different registers in the CPU.
Paper 2 的预发布材料应被彻底研究：学生必须理解场景，规划可能的算法解决方案，并预测可能提出的问题类型。在限时条件下使用历年真题进行练习至关重要。常见错误包括数据计算中遗漏单位、伪代码中忘记闭合循环或初始化变量，以及混淆 CPU 中不同寄存器的功能。
Regular review of the syllabus content using mind maps and flashcards, combined with active recall and spaced repetition, can dramatically improve retention. Joining study groups to discuss topics such as network security or logic circuits often reveals gaps in understanding.
定期使用思维导图和闪卡复习课程内容，结合主动回忆与间隔重复，可以显著提高记忆效果。加入学习小组讨论网络安全或逻辑电路等主题，常常能暴露出理解上的漏洞。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图