Year 12 CIE Computer Science: Winter Intensive Revision Plan | Year 12 CIE 计算机：寒假强化复习计划

📚 Year 12 CIE Computer Science: Winter Intensive Revision Plan | Year 12 CIE 计算机：寒假强化复习计划

The winter break is a crucial period for Year 12 students preparing for their CIE AS Computer Science examinations. Without the pressure of daily classes, you have the perfect opportunity to consolidate knowledge, tackle weak areas, and build exam confidence. This intensive revision plan breaks the syllabus down into manageable weekly goals, helping you cover all key topics thoroughly while balancing well-deserved rest.

寒假是 Year 12 学生备考 CIE AS 计算机科学考试的关键时期。没有了日常课业压力，你可以利用这段时间巩固知识、攻克薄弱环节，并建立应试信心。这份强化复习计划将考纲分解为可管理的每周目标，帮助你在兼顾休息的同时，彻底复习所有关键主题。

1. Creating a Personalised Revision Timetable | 制定个性化复习时间表

Start by listing all CIE AS Computer Science topics (Data Representation, Communication, Hardware, Processor Fundamentals, System Software, Security, Ethics, Databases, Algorithms, and Programming). Assess your current confidence level for each using percentages or traffic light colours. This snapshot shows where to invest most of your time.

首先列出所有 CIE AS 计算机科学主题（数据表示、通信、硬件、处理器基础、系统软件、安全、伦理、数据库、算法与编程）。用百分比或红绿灯颜色评估你对每个主题的当前信心度。这份快照能告诉你应该把时间重点投入哪里。

Design a weekly schedule that allocates 2–3 hours of focused revision per day, ideally in the morning when concentration peaks. Use the Pomodoro technique (25‑minute study blocks with 5‑minute breaks) to maintain intensity. Reserve weekends for lighter content review or practice papers.

设计一份每周计划，每天安排 2–3 小时专注复习，最好在上午注意力最集中的时候。使用番茄工作法（25 分钟学习，5 分钟休息）保持强度。周末可以留给轻松的回顾或真题练习。

Build in buffer days and a full rest day each week to prevent burnout. A sample 4‑week plan could look like:

每周留出缓冲日和完整的休息日，防止过度疲劳。一份示例的四周计划可以这么安排：

Week	Topics	Practice
1	Data Representation, Communication	Topic‑wise MCQ
2	Processor Fundamentals, System Software, Hardware	Short‑answer questions
3	Security & Ethics, Databases, Algorithms	Pseudocode tracing
4	Programming review, timed papers	Full mock papers

Stick to the timetable with discipline but adjust weekly based on progress. Track what you have accomplished, not just what is left.

坚持执行时间表，但每周根据进度调整。记录你已经完成的内容，而不只是剩下的部分。

---

2. Mastering Data Representation | 掌握数据表示

Data representation is the language of computers. Begin by ensuring you can convert seamlessly between binary, denary and hexadecimal, using both whole numbers and fractions. Check your understanding of binary addition and overflow, as well as logical shifts (left shifts multiply by 2ⁿ).

数据表示是计算机的语言。首先确保你能在二进制、十进制和十六进制之间无缝转换，包括整数和小数。检查你对二进制加法和溢出的理解，以及逻辑移位（左移乘以 2ⁿ）。

Next, review two’s complement for negative numbers. Remember the rule: to negate a binary number, flip all bits and add 1. For example, the 8‑bit two’s complement of +14 is 00001110, while –14 is 11110010. Practice finding the range of values for n bits (–2ⁿ⁻¹ to 2ⁿ⁻¹ – 1).

接下来，复习负数的补码表示。记住规则：要对二进制数取负，将所有位取反再加 1。例如，+14 的 8 位补码是 00001110，而 –14 是 11110010。练习求 n 位数值的范围（–2ⁿ⁻¹ 到 2ⁿ⁻¹ – 1）。

Floating‑point notation uses a mantissa and an exponent. Re‑learn the IEEE 754 single‑precision format (sign bit, 8‑bit biased exponent, 23‑bit mantissa) but focus on the simplified forms used in CIE papers. Practice converting a binary floating‑point number to denary and vice versa. Also revisit character sets: ASCII (7‑bit), extended ASCII and Unicode. Be clear on sampling rate and bit depth for sound, and pixel resolution plus colour depth for images.

浮点表示使用尾数和指数。重新学习 IEEE 754 单精度格式（符号位、8 位移码指数、23 位尾数），但重点放在 CIE 试卷中使用的简化形式。练习将二进制浮点数转换为十进制，反之亦然。还要复习字符集：ASCII（7 位）、扩展 ASCII 和 Unicode。弄清楚声音的采样率与位深度、图像的分辨率与颜色深度。

Create quick‑reference cards showing formulas like:

Number of colours = 2^{bit depth}

and

File size (bits) = samples per second × bit depth × seconds

. These will speed up calculation questions in the exam.

制作快速参考卡片，展示公式例如：

颜色数量 = 2^{位深度}

以及

文件大小（位）= 每秒采样数 × 位深度 × 秒数

。这些可以在考试时加快计算题的速度。

---

3. Understanding Communication and Networks | 理解通信与网络

Networks is a content‑heavy topic. Start by differentiating between LANs and WANs, and describe common topologies (star, bus, mesh). For each topology, list advantages and disadvantages using diagrams in your notes. Understand the role of switches, routers and gateways.

网络是一个内容较多的主题。首先区分局域网和广域网，并描述常见拓扑结构（星型、总线、网状）。在你的笔记中为每种拓扑画出图示，列出优缺点。理解交换机、路由器和网关的作用。

Protocols are at the heart of network communication. Memorise the TCP/IP stack alongside the OSI model, focusing on the four layers: Application, Transport, Internet, Link. Be able to map common protocols to their layers, e.g. HTTP at Application, TCP at Transport, IP at Internet, and Ethernet at Link. Know the purpose of each protocol (HTTP for web pages, FTP for file transfer, SMTP for sending email, POP3/IMAP for receiving, and DNS for name resolution).

协议是网络通信的核心。记住 TCP/IP 协议栈和 OSI 模型，重点关注四个层次：应用层、传输层、网际层、链路层。要能够把常见协议映射到对应层次，例如 HTTP 在应用层，TCP 在传输层，IP 在网际层，以太网在链路层。了解每个协议的用途（HTTP 用于网页，FTP 用于文件传输，SMTP 用于发送邮件，POP3/IMAP 用于接收邮件，DNS 用于域名解析）。

For cybersecurity, revise symmetric and asymmetric encryption. Symmetric uses the same key (e.g. Caesar cipher, AES), whereas asymmetric uses a public‑private key pair (e.g. RSA). Understand how digital signatures and certificates provide authentication. Also cover firewalls, proxy servers and the importance of secure protocols like HTTPS/SSL.

在网络安全方面，复习对称加密和非对称加密。对称加密使用同一密钥（如凯撒密码、AES），而非对称加密使用公私钥对（如 RSA）。理解数字签名和证书如何提供身份验证。还要涵盖防火墙、代理服务器以及 HTTPS/SSL 等安全协议的重要性。

Finally, link theory to real‑world scenarios: how a router forwards packets using the Internet layer, why a web server uses both TCP and HTTP, and how a browser validates a TLS certificate. This applied understanding is often tested in long‑answer questions.

最后，将理论与实际场景联系起来：路由器如何使用网际层转发数据包，网页服务器为什么同时使用 TCP 和 HTTP，浏览器如何验证 TLS 证书。这种应用理解经常在长答题中进行考查。

---

4. Computer Architecture and Processor Fundamentals | 计算机体系结构与处理器基础

Begin by dissecting the fetch‑decode‑execute cycle. Describe how the Program Counter (PC), Memory Address Register (MAR), Memory Data Register (MDR), Current Instruction Register (CIR) and Accumulator (ACC) interact. Practise tracing simple instructions like LDA (load accumulator) or ADD through the cycle.

从解析取指－解码－执行周期开始。描述程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器（ACC）如何交互。练习跟踪简单指令（如 LDA 加载累加器或 ADD）通过该周期。

The von Neumann architecture uses a single shared bus for data and instructions, creating a bottleneck. Contrast this with Harvard architecture (separate buses). Know the function of the ALU (Arithmetic Logic Unit), Control Unit, and system buses (data, address, control). Be able to explain how control signals govern reading from or writing to memory.

冯·诺依曼架构使用一条共享总线传输数据和指令，形成了瓶颈。将该架构与哈佛架构（分开总线）进行对比。了解算术逻辑单元（ALU）、控制单元以及系统总线（数据、地址、控制）的功能。要能解释控制信号如何管理内存的读与写。

Pipelining improves CPU throughput by overlapping instruction execution stages. Even a basic four‑stage pipeline (fetch, decode, execute, write‑back) can double performance in ideal conditions. However, pipeline hazards (data, control, structural) must be managed. Also revise the difference between CISC and RISC processors: CISC has many complex instructions, RISC uses a reduced set of simple instructions and emphasises compiler optimisation.

流水线通过重叠指令执行阶段来提高 CPU 吞吐量。即使是一个基本的四级流水线（取指、解码、执行、写回），在理想条件下也能使性能翻倍。但流水线冒险（数据冒险、控制冒险、结构冒险）必须加以管理。还要复习 CISC 和 RISC 处理器的差异：CISC 有大量复杂指令，RISC 则采用简化指令集，并强调编译器优化。

Memory hierarchy: registers → cache (L1/L2) → RAM → secondary storage. Explain how cache hit ratios affect performance and the principle of locality. In the exam, you may be asked to calculate average memory access time, so commit the formula to memory.

存储器层次结构：寄存器 → 缓存（L1/L2）→ 内存 → 辅助存储器。解释缓存命中率如何影响性能以及局部性原理。在考试中，你可能会被要求计算平均内存访问时间，因此记住相关公式。

---

5. System Software and Operating Systems | 系统软件与操作系统

Operating systems manage hardware resources and provide a user interface. Revise key functions: memory management (paging, segmentation, virtual memory), process management (scheduling algorithms like Round Robin, Priority, Shortest Job First), and file management. Be prepared to evaluate different scheduling algorithms in terms of fairness and throughput.

操作系统管理硬件资源并提供用户界面。复习关键功能：内存管理（分页、分段、虚拟内存）、进程管理（调度算法如轮转、优先级、最短作业优先）以及文件管理。准备好从公平性和吞吐量的角度评价不同调度算法。

Interrupt handling is a frequent exam topic. An interrupt signal causes the CPU to suspend the current task, save its state onto the stack, and execute the Interrupt Service Routine (ISR). Describe the sequence from the arrival of an interrupt (e.g. I/O completion, timer) to the restoration of the original task.

中断处理是常见的考题。一个中断信号会使 CPU 挂起当前任务，将状态保存在堆栈上，并执行中断服务程序（ISR）。描述从中断到来（如 I/O 完成、定时器）到恢复原任务的过程。

Language translators: compiler, interpreter and assembler. Know their differences: a compiler translates the whole source code into machine code once, optimising for speed; an interpreter translates and executes line‑by‑line, aiding debugging. Assemblers convert assembly language into machine code. Linkers combine object modules, and loaders place code ready for execution.

语言翻译器：编译器、解释器和汇编器。了解它们的区别：编译器一次性将整个源代码转换为机器码，并针对速度进行优化；解释器逐行翻译执行，有利于调试。汇编器将汇编语言转为机器码。链接器合并目标模块，加载器将代码放入内存准备执行。

Virtual machines and emulators allow one operating system to run inside another, useful for testing or legacy software. Revise the concepts of virtualisation and its benefits for server consolidation and sandbox environments.

虚拟机和模拟器允许一个操作系统运行在另一个操作系统内，这对于测试或运行旧软件非常有用。复习虚拟化的概念及其在服务器整合和沙盒环境中的好处。

---

6. Security, Ethics and Data Integrity | 安全、伦理与数据完整性

Security threats can be malicious (malware: viruses, worms, Trojans, ransomware, spyware) or non‑malicious (accidental data loss, natural disasters). For each, learn the mechanism and typical countermeasures. For example, a worm replicates itself across a network; anti‑virus and firewalls can block it.

安全威胁可以是恶意的（恶意软件：病毒、蠕虫、木马、勒索软件、间谍软件）或非恶意的（意外数据丢失、自然灾害）。为每种威胁学习其机制和典型对策。例如，蠕虫通过网络自我复制；杀毒软件和防火墙可以阻止它。

Data integrity ensures data is accurate and consistent. Methods include parity checks, checksums, hash functions (MD5, SHA) and CRCs. Understand how a checksum is calculated and used to detect errors during transmission. Emphasise that cryptographic hashes are one‑way functions used to verify that data has not been tampered with.

数据完整性确保数据准确一致。方法包括奇偶校验、校验和、哈希函数（MD5、SHA）和循环冗余校验。理解校验和如何计算并用于检测传输中的错误。强调加密哈希是单向函数，用于验证数据是否被篡改。

Ethical and legal considerations are a rich source of marks. Topics include data privacy, the Computer Misuse Act, the Data Protection Act, intellectual property, and the digital divide. Always structure your answers using the “issue → impact → solution” framework. For instance, ‘Companies collecting personal data must obtain consent (issue) to avoid loss of trust (impact), so they implement clear opt‑in policies (solution).’

伦理和法律考量是拿分的好地方。主题包括数据隐私、《计算机滥用法》、《数据保护法》、知识产权和数字鸿沟。始终使用“问题→影响→解决方案”框架组织答案。例如，“公司收集个人数据必须获得同意（问题），避免失去信任（影响），因此他们实施清晰的‘选择加入’政策（解决方案）。”

Practise applying these concepts to case studies. CIE often provides a scenario and asks you to identify security risks and propose ethical solutions. Re‑read the syllabus statements and craft model paragraphs.

练习将这些概念应用于案例研究。CIE 经常给出一个场景，要求你识别安全风险并提出伦理解决方案。重读考纲陈述，并撰写模范段落。

---

7. Databases and SQL | 数据库与SQL

Relational databases store data in tables with rows (records) and columns (fields). Key terminology: primary key, foreign key, candidate key, composite key. Understand why we normalise databases – to eliminate data redundancy and update anomalies. Practise normalising a dataset to 1NF (atomic values), 2NF (no partial dependencies) and 3NF (no transitive dependencies).

关系数据库用表存储数据，表由行（记录）和列（字段）组成。关键术语：主键、外键、候选键、复合键。理解为什么要对数据库进行规范化——消除数据冗余和更新异常。练习将数据集规范化为 1NF（原子值）、2NF（无部分依赖）和 3NF（无传递依赖）。

SQL is tested heavily. Write and debug SELECT statements with WHERE, LIKE, BETWEEN, ORDER BY, GROUP BY and HAVING. Be comfortable joining tables using INNER JOIN and LEFT JOIN, and using aggregate functions (COUNT, SUM, AVG, MAX, MIN). A typical exam question: “List the names of customers who ordered more than 3 items.” Your query should look like:

SQL 是重点考查内容。编写和调试包含 WHERE、LIKE、BETWEEN、ORDER BY、GROUP BY 和 HAVING 的 SELECT 语句。要熟练使用 INNER JOIN 和 LEFT JOIN 连接表，并使用聚合函数（COUNT、SUM、AVG、MAX、MIN）。一道典型的考题：“列出订购超过 3 件商品的客户姓名。”你的查询应类似：

SELECT CustomerName FROM Customers JOIN Orders ON Customers.CustomerID = Orders.CustomerID GROUP BY CustomerName HAVING COUNT(OrderID) > 3;

Also cover INSERT, UPDATE and DELETE, and the cautionary use of WHERE to avoid accidentally modifying all rows. Use an online DBMS or a simple sandbox to practise real‑time queries.

也要涵盖 INSERT、UPDATE 和 DELETE，以及使用 WHERE 的注意事项，以避免意外修改所有行。使用在线数据库管理系统或简单的沙箱来练习实时查询。

Entity‑Relationship (E‑R) diagrams help visualise database structure. Practise drawing entities, attributes, relationships and cardinality (1:1, 1:M, M:N). Learn how to resolve a many‑to‑many relationship into two one‑to‑many relationships using a junction table.

实体关系图（E-R 图）有助于可视化数据库结构。练习绘制实体、属性、关系和基数（1:1、1:M、M:N）。学习如何通过中间表将多对多关系分解为两个一对多关系。

---

8. Algorithm Design and Problem Solving | 算法设计与问题解决

Algorithms are the backbone of Computer Science. Revisit the standard search algorithms: linear search (O(n)) and binary search (O(log n)) on a sorted array. Sort algorithms: bubble sort (O(n²)), insertion sort (O(n²) but efficient for nearly sorted data), and maybe an overview of merge sort (O(n log n)). Write pseudocode for each and trace examples with small datasets.

算法是计算机科学的支柱。重新学习标准搜索算法：线性搜索（O(n)）和针对有序数组的二分查找（O(log n)）。排序算法：冒泡排序（O(n²)）、插入排序（O(n²) 但适合基本有序的数据），并可概览归并排序（O(n log n)）。为每个算法编写伪代码，并用小数据集跟踪执行过程。

Abstract data types (ADT) often trip students up. Make sure you understand the behaviour of a stack (LIFO) and a queue (FIFO), along with their basic operations (push, pop, enqueue, dequeue). Linked lists can be static (using arrays) or dynamic (using pointers). Be able to diagram insertion and deletion in a linked list and describe the need for a head pointer.

抽象数据类型（ADT）经常让学生失分。确保理解栈（后进先出）和队列（先进先出）的行为及其基本操作（进栈、出栈、入队、出队）。链表可以是静态的（用数组实现）或动态的（用指针）。要能画出链表中插入和删除的示意图，并描述头指针的必要性。

Recursion: define a base case and a recursive case. Trace factorial or Fibonacci functions. While CIE AS does not mandate full recursion coding, understanding the mechanism is valuable for the exam and for A‑Level.

递归：定义基准情况和递归情况。跟踪阶乘或斐波那契函数。虽然 CIE AS 不要求完整的递归编码，但理解其机制对考试和 A-Level 都很有价值。

Flowcharts can be asked for in Section B. Practise the standard symbols (start/stop, process, decision, input/output) and how to translate a simple program logic into a structured flowchart. Always test your algorithm with edge cases, e.g. empty list, target not found.

流程图可能会在 B 部分考查。练习标准符号（开始/结束、处理、判断、输入/输出），以及如何将简单程序逻辑转换为结构化流程图。始终用边缘案例测试你的算法，如空列表、目标未找到等。

---

9. Programming Practice and Testing | 编程实践与测试

Whether you code in Python, VB.NET or Java, syntax fluency is essential. Refresh your knowledge of variables, data types, conditional statements (IF/ELSE, CASE), loops (FOR, WHILE, REPEAT), arrays (1D and 2D), and file handling (open, read, write, close). Practise a few small programs daily: a number guessing game, a mark analyser, or a simple login system.

不管你用 Python、VB.NET 还是 Java 编程，语法流畅性至关重要。重温变量、数据类型、条件语句（IF/ELSE、CASE）、循环（FOR、WHILE、REPEAT）、数组（一维和二维）以及文件处理（打开、读取、写入、关闭）。每天练习几个小程序：猜数字游戏、成绩分析器或简单登录系统。

Modular programming: functions and procedures. Know the difference (functions return a value, procedures do not) and how to pass parameters by value or by reference. Write code that uses a function to calculate a sum or average, and ensure you declare local variables properly.

模块化编程：函数和过程。知道区别（函数返回值，过程不返回）以及如何通过值或引用传递参数。编写使用函数计算总和或平均值的代码，并确保正确声明局部变量。

Testing is a key part of paper 2. Understand the difference between black‑box testing (testing against specification without looking at the code) and white‑box testing (examining internal structures). Explain test tables showing test data, expected results and actual results. Devise test strategies for boundary, normal and erroneous conditions.

测试是试卷二的关键部分。理解黑盒测试（根据说明书测试，不看代码）和白盒测试（检查内部结构）的区别。解释包含测试数据、预期结果和实际结果的测试表。为边界、正常和错误条件设计测试策略。

Trace tables are a common requirement. Given a piece of pseudocode, fill a trace table showing variable states after each step. This sharpens your logical thinking and helps catch off‑by‑one errors in loops. Set aside 15 minutes a day to trace loops and conditional blocks.

跟踪表是常见要求。给出一段伪代码，填写跟踪表显示每一步后的变量状态。这能锻炼逻辑思维，帮助发现循环中的差一错误。每天留出 15 分钟跟踪循环和条件块。

---

10. Exam Paper Practice and Time Management | 真题演练与时间管理

By the final week of your winter break, shift focus to full past papers under timed conditions. CIE AS Computer Science has two papers: Paper 1 (Theory, 1 hour 30 minutes) and Paper 2 (Fundamental Problem‑solving and Programming, 2 hours). Download official papers from recent years and work through them in order.

在寒假的最后一周，将重点转移到限时完成整份真题。CIE AS 计算机科学有两份试卷：试卷一（理论，1 小时 30 分钟）和试卷二（基础问题解决与编程，2 小时）。下载近几年的官方试卷，按顺序完成。

For Paper 1, allocate roughly one mark per minute. Short‑answer questions usually appear at the beginning; answer them quickly to leave time for the longer, evidence‑based questions at the end. Highlight keywords in the question (e.g. “explain”, “describe”, “justify”) and tailor your

Published by TutorHao | Year 12 Computer Science Revision Series | aleveler.com

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