📚 Year 11 CAIE Computer Science: Summer Prep & Bridging Course | Year 11 CAIE 计算机：暑期预习与衔接课程
The summer before Year 11 is a strategic window: it sits between foundational study and the final push towards CAIE IGCSE Computer Science (0478). This bridging guide helps you consolidate Year 10 concepts while building confidence in the more challenging topics ahead—from logic circuits and network security to algorithm design and SQL. Use these weeks to transform scattered knowledge into exam‑ready understanding, with structured revision and targeted preview tasks.
进入 11 年级前的暑假是一个关键的战略窗口：它处于基础学习与 CAIE IGCSE 计算机科学（0478）最后冲刺之间。这份衔接指南将帮助你巩固 10 年级的概念，同时建立对逻辑电路、网络安全、算法设计和 SQL 等更具挑战性主题的信心。利用这几周时间，通过结构化的复习和有针对性的预习任务，把零散的知识转化为应对考试的扎实理解。
1. Understanding the CAIE Computer Science Landscape | 了解 CAIE 计算机科学课程全景
CAIE IGCSE Computer Science 0478 is assessed via two papers. Paper 1 (1 hour 45 minutes) tests theoretical knowledge with short‑answer and structured questions covering data representation, hardware, software, networks, security and ethics. Paper 2 (1 hour 45 minutes) assesses problem‑solving and programming skills. You will answer questions that require writing pseudocode, drawing flowcharts, tracing algorithms and correcting code snippets.
CAIE IGCSE 计算机科学 0478 通过两张试卷进行评估。试卷一（1 小时 45 分钟）考查理论知识，包含简答和结构化问题，覆盖数据表示、硬件、软件、网络、安全和伦理。试卷二（1 小时 45 分钟）评估问题解决与编程能力。你需要回答需要编写伪代码、绘制流程图、跟踪算法和纠正代码片段的问题。
Year 11 typically introduces more abstract topics: logic gates, cybersecurity legislation, database querying and advanced algorithm analysis. By previewing these now, you reduce in‑year stress and create space for regular exam practice. A structured summer plan should split time roughly 40% on reviewing Year 10 fundamentals, 40% on previewing Year 11 content, and 20% on practising past paper questions.
11 年级通常会引入更抽象的主题：逻辑门、网络安全立法、数据库查询和高级算法分析。现在预习这些内容，可以减轻课内压力，并留出时间进行常规的考试练习。一个结构化的暑期计划应将时间大致分配为：40% 复习 10 年级基础，40% 预习 11 年级内容，20% 练习往年试卷。
2. Data Representation: From Bits to Hex | 数据表示：从比特到十六进制
s. Binary numbers use only 0 and 1; each position represents a power of 2. To convert an 8‑ + 1 = 105. To convert denary to binary, repeatedly divide by 2 and record the remainders.
牢固掌握二进制和十六进制对两张试卷至关重要。二进制数只使用 0 和 1，每一位代表一个 2 的幂。要将一个 8 位二进制数转换为十进制，把所有出现 1 的位置的权值相加。例如 01101001₂ = 64 + 32 + 8 + 1 = 105。将十进制转换为二进制，则反复除以 2 并记录余数。
ation. Because 2⁴ = 16, each hex digit represents exactly 4 bits (a nibble). The digits 10‑15 are represented by A‑ in computer memory, MAC addresses and colour codes are often shown in hex. Practise paper‑ on, logical shifts (left shift multiplies by 2ⁿ, right shift divides) and overflow errors.
十六进制简化了二进制表示。因为 2⁴ = 16，每个十六进制数字恰好代表 4 个比特（一个半字节）。10 到 15 用字母 A 到 F 表示。快速转换需要熟练：二进制 1111₂ = F₁₆，1010₂ = A₁₆。计算机内存中的数据、MAC 地址和颜色代码通常以十六进制显示。练习试卷一风格的二进制加法、逻辑移位（左移乘以 2ⁿ，右移除以 2）以及溢出错误的题目。
| Denary | Binary (8‑bit) | Hexadecimal |
| 42 | 00101010 | 2A |
| 200 | 11001000 | C8 |
| 255 | 11111111 | FF |
3. Hardware & The Fetch‑Decode‑Execute Cycle | 硬件与取指-解码-执行周期
The von Neumann architecture stores both data and instructions in the same memory. Core components include the Control Unit (CU), Arithmetic Logic Unit (ALU), registers (MAR, MDR, PC, CIR, Accumulator) and buses (address, data, control). Understanding how they interact during the fetch‑decode‑execute cycle is fundamental to explaining how a processor runs a program.
冯·诺依曼架构将数据和指令存放在同一存储器中。核心组件包括控制单元（CU）、算术逻辑单元（ALU）、寄存器（MAR、MDR、PC、CIR、累加器）以及总线（地址总线、数据总线、控制总线）。理解它们在取指-解码-执行周期中如何相互作用，是解释处理器如何运行程序的基础。
The cycle repeats indefinitely: fetch the next instruction from the address held in the PC, decode it in the CU, and execute it using the ALU and registers. The PC increments after each fetch unless a jump instruction alters the sequence. Clock speed, number of cores and cache size are the three key factors that affect CPU performance. A higher clock speed means more cycles per second; multiple cores allow true parallel processing; larger cache reduces the average time to access memory.
这个周期循环往复：从 PC 保存的地址取出下一条指令，在 CU 中解码，然后使用 ALU 和寄存器执行。除非遇到跳转指令改变顺序，否则每次取指后 PC 自增。时钟速度、核心数量和缓存大小是影响 CPU 性能的三个关键因素。更高的时钟速度意味着每秒更多周期；多核心允许真正的并行处理；更大的缓存减少了访问内存的平均时间。
4. Logic Gates and Truth Tables | 逻辑门与真值表
Logic gates are the building blocks of digital circuits. The six gates you must know are: AND, OR, NOT, NAND, NOR and XOR. Each gate's behaviour is described by a truth table showing output for every input combination. For example, an AND gate outputs 1 only when both inputs are 1; XOR outputs 1 when inputs differ. NAND and NOR are universal gates; any other circuit can be constructed from them.
逻辑门是数字电路的构建模块。你必须掌握的六种门是：与门（AND）、或门（OR）、非门（NOT）、与非门（NAND）、或非门（NOR）和异或门（XOR）。每种门的行为由真值表描述，显示每种输入组合下的输出。例如，与门仅在两个输入都为 1 时输出 1；异或门在输入不同时输出 1。与非门和或非门是全能门，任何其他电路都可以由它们构造出来。
CAIE often asks you to complete a truth table for a given logic diagram or to draw a circuit from a Boolean expression. Practise creating expressions using ∧ (AND), ∨ (OR) and ¬ (NOT), and simplifying them where possible. In Year 11 you will extend this to creating logic circuits with multiple gates and evaluating how they solve simple control problems, like a car’s warning light that activates under specific sensor conditions.
CAIE 常要求你为给定的逻辑图填写真值表，或根据布尔表达式绘制电路。练习使用 ∧（与）、∨（或）和 ¬（非）创建表达式，并在可能的情况下进行化简。在 11 年级，你将扩展至使用多个门创建逻辑电路，并评估它们如何解决简单的控制问题，例如在特定传感器条件下点亮汽车警告灯。
| A | B | A AND B | A XOR B |
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 |
5. Programming Concepts: Variables, Loops, and Conditionals | 编程概念：变量、循环与条件语句
Paper 2 does not require you to code in a specific real‑world language, but you must be fluent in pseudocode as defined by CAIE. Core constructs include: variable declaration and assignment (e.g., Total ← 0), counting‑controlled loops (FOR i ← 1 TO 10), condition‑controlled loops (WHILE condition DO ... ENDWHILE), and selection (IF ... THEN ... ELSE ... ENDIF). Data types such as INTEGER, REAL, CHAR, STRING and BOOLEAN are used to declare variables.
试卷二不要求用特定的真实世界语言编写代码，但你必须熟练掌握 CAIE 定义的伪代码。核心结构包括：变量声明与赋值（如 Total ← 0），计数控制循环（FOR i ← 1 TO 10），条件控制循环（WHILE condition DO ... ENDWHILE），以及选择结构（IF ... THEN ... ELSE ... ENDIF）。数据类型如 INTEGER、REAL、CHAR、STRING 和 BOOLEAN 用于声明变量。
During the summer, refresh your ability to trace pseudocode: execute code line by line on paper and record the changing values of variables. This skill is vital because many Paper 2 questions present an unfamiliar algorithm and ask you to complete a trace table. Also practise writing pseudocode for everyday tasks—calculate the average of three numbers, find the largest in a list, or validate a password length—to build pattern recognition.
在暑假中，重新熟悉跟踪伪代码的能力：在纸上逐行执行代码并记录变量的变化值。这项技能至关重要，因为许多试卷二题目会给出一个不熟悉的算法并要求你完成跟踪表。同时练习为日常任务编写伪代码——计算三个数的平均值、找出列表中的最大值或验证密码长度——以培养模式识别能力。
6. Algorithm Design: Pseudocode and Flowcharts | 算法设计：伪代码与流程图
Algorithms are step‑by‑step solutions. Year 11 builds on sorting and searching introduced in Year 10: linear search, binary search, bubble sort and insertion sort. For each, you should be able to write pseudocode, draw the corresponding flowchart, and analyse efficiency (e.g., binary search requires a sorted list and runs in O(log n) time while linear search runs in O(n)). Understand why bubble sort is O(n²) and how an insertion sort works by shifting elements.
算法是逐步的解决方案。11 年级在 10 年级引介的排序与搜索基础上深入：线性搜索、二分搜索、冒泡排序和插入排序。对于每一种，你应该能够编写伪代码，绘制相应的流程图，并分析效率（例如二分搜索需要有序列表，时间复杂度为 O(log n)，而线性搜索为 O(n)）。理解为什么冒泡排序是 O(n²)，以及插入排序如何通过移动元素来工作。
Flowcharts use standard symbols: rounded boxes for start/stop, parallelograms for input/output, rectangles for processes, diamonds for decisions. CAIE expects you to draw flowcharts from a description or convert a flowchart into pseudocode. A summer task: design a flowchart for a program that keeps asking for a positive number until a valid one is entered, then calculates its factorial. This loops, selection, input validation and arithmetic into one design.
流程图使用标准符号：圆角矩形表示开始/结束，平行四边形表示输入/输出，矩形表示处理，菱形表示判断。CAIE 要求你根据描述绘制流程图，或将流程图转换为伪代码。一项暑期任务：设计一个流程图，程序要求反复输入正数直到一个有效数字被录入，然后计算其阶乘。这将循环、选择、输入验证和算术结合在一个设计中。
7. Networks and the Internet | 网络与互联网
Networking topics feature heavily in Paper 1. You need to distinguish between LAN (Local Area Network) and WAN (Wide Area Network), and describe common topologies: star, bus, mesh and hybrid. In a star network, all devices connect to a central switch; failure of one cable only affects that station, but failure of the switch disables the whole network. Mesh networks offer redundancy because each device is connected to several others.
网络主题在试卷一中占比很大。你需要区分局域网（LAN）和广域网（WAN），并描述常见的拓扑结构：星型、总线型、网状和混合型。在星型网络中，所有设备连接到一个中央交换机；一条电缆故障只影响该工作站，但交换机故障会使整个网络瘫痪。网状网络提供冗余，因为每个设备都与多个其他设备相连。
The role of hardware such as routers, switches, NICs and modems must be clear. Understand the TCP/IP protocol stack (application, transport, internet, link layers) and the purpose of protocols like HTTP, HTTPS, FTP, POP3, IMAP and SMTP. MAC addresses are unique identifiers for network interfaces; IP addresses are logical and can change. Year 11 will also ask you to compare client‑server and peer‑to‑peer models, explaining their advantages and drawbacks in real scenarios.
必须清楚路由器、交换机、网卡和调制解调器等硬件的作用。理解 TCP/IP 协议栈（应用层、传输层、互联网层、链路层）以及 HTTP、HTTPS、FTP、POP3、IMAP 和 SMTP 等协议的目的。MAC 地址是网络接口的唯一标识符；IP 地址是逻辑地址且可以改变。11 年级还会要求你比较客户-服务器模型和对等网络模型，并解释它们在真实场景中的优缺点。
8. Cyber Security Threats and Prevention | 网络安全威胁与防范
Security is a high‑priority topic. Malware categories include viruses (self‑replicating, attach to files), worms (replicate without host files), Trojan horses (disguised as legitimate software), spyware (monitors user activity) and ransomware (encrypts data for ransom). Social engineering attacks such as phishing, pharming, pretexting and shoulder surfing exploit human psychology rather than technical flaws.
安全是一个高度优先的主题。恶意软件类别包括病毒（自我复制，附着于文件）、蠕虫（无宿主文件自我复制）、特洛伊木马（伪装成合法软件）、间谍软件（监视用户活动）和勒索软件（加密数据以索取赎金）。社会工程攻击如网络钓鱼、域名欺骗、借口欺骗和肩窥，利用的是人的心理而非技术漏洞。
Prevention methods include firewalls (filter incoming and outgoing traffic), anti‑malware software (signature‑based and heuristic detection), encryption (scrambling data so that only authorised parties can read it) and strong password policies. Students should be able to explain how two‑factor authentication improves security and describe the role of automatic updates and access rights. Use the summer to create a security glossary with exam‑ready definitions.
防范方法包括防火墙（过滤进出流量）、反恶意软件（基于签名和启发式检测）、加密（扰乱数据使只有授权方才能读取）以及强密码策略。学生应能解释双因素认证如何提高安全性，并描述自动更新和访问权限的作用。利用暑假创建一个安全术语表，准备好考试用的定义。
9. Ethical and Legal Issues | 道德与法律问题
CAIE requires you to discuss the legal and ethical dimensions of computing. Key legislation includes the Data Protection Act (governing fair processing of personal data), the Computer Misuse Act (criminalising unauthorised access and malware creation) and the Copyright, Designs and Patents Act (protecting intellectual property). You should be able to apply these laws to given scenarios—for instance, a company selling customer data without consent breaches data protection rules.
CAIE 要求你讨论计算领域的法律和伦理维度。关键立法包括数据保护法（规范个人数据的公平处理）、计算机滥用法（将未经授权访问和制造恶意软件定为刑事犯罪）以及版权、设计和专利法（保护知识产权）。你应该能够将这些法律运用到给定情境中——例如，一家公司在未获同意的情况下出售客户数据就违反了数据保护规定。
Ethical debates include the digital divide, workplace surveillance, automated decision‑making and the environmental impact of technology. In Year 11 you will practise constructing balanced arguments: recognise both benefits and risks, then form a justified conclusion. A useful exercise is to write one‑paragraph ethical evaluations for technologies like facial recognition or AI‑assisted hiring.
伦理辩论包括数字鸿沟、工作场所监控、自动化决策以及技术对环境的影响。在 11 年级，你将练习构建平衡的论点：认识到利益与风险，然后形成合理的结论。一个有用的练习是为面部识别或人工智能辅助招聘等技术写一段伦理评估。
10. Databases and SQL | 数据库与 SQL
Database theory includes tables, records, fields, primary keys and foreign keys. A primary key uniquely identifies each record; a foreign key links two tables together. You must be able to explain why relational databases reduce data redundancy and improve data integrity. Flat files, by contrast, often suffer from insertion, deletion and update anomalies.
数据库理论包括表、记录、字段、主键和外键。主键唯一标识每条记录；外键将两个表连接起来。你必须能够解释为什么关系型数据库能减少数据冗余并提高数据完整性。相较之下，平面文件常会遇到插入、删除和更新异常。
SQL (Structured Query Language) is tested on Paper 1. You will be asked to write queries using SELECT, FROM, WHERE, ORDER BY and sometimes INNER JOIN. For example: SELECT Name, Age FROM Students WHERE Age > 16 ORDER BY Name ASC; Practise reading a table schema and predicting the output of a given query. Also learn the difference between data definition and data manipulation commands, though the exam focuses on SELECT.
SQL（结构化查询语言）在试卷一中考查。你将被要求使用 SELECT、FROM、WHERE、ORDER BY，有时还有 INNER JOIN 来编写查询。例如：SELECT Name, Age FROM Students WHERE Age > 16 ORDER BY Name ASC; 练习阅读表结构并预测给定查询的输出。同时学习数据定义命令与数据操作命令之间的区别，虽然考试重点在 SELECT。
| StudentID (Primary Key) | Name | Age |
| 101 | Amara | 15 |
| 102 | Ben | 17 |
11. Summer Study Plan and Exam Prep Tips | 暑期学习计划与备考技巧
Structure your summer weeks to maintain momentum without burnout. Dedicate specific days to theory (e.g., Monday/Wednesday for Paper 1 topics) and other days to practical programming and algorithm tracing (Tuesday/Thursday for Paper 2). Use a learning journal: after each session, write three bullet points summarising what you learned and one question you still have. This highly active recall technique strengthens long‑term memory.
合理安排暑假的几周，保持动力而不倦怠。将特定日子用于理论学习（如周一和周三学习试卷一主题），其他日子用于实践编程和算法跟踪（周二和周四学习试卷二）。使用学习日志：每次学习后，写下三条要点总结所学内容，以及一个仍有疑问的问题。这种高度主动的回忆技术能强化长期记忆。
Gather high‑quality
Published by TutorHao | Year 11 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图