📚 Year 12 CCEA Computer Science: Christmas Intensive Revision Plan | Year 12 CCEA 计算机寒假强化复习计划
The Christmas break is a crucial window for Year 12 students studying CCEA Computer Science to consolidate their knowledge and build real exam confidence. This 12‑session intensive plan structures your holiday revision around every major topic in the AS specification, blending concise concept recaps with active practice using past‑paper questions, pseudocode tracing and hands‑on programming exercises. Each session targets one core area, helping you transform passive reading into genuine understanding and ensuring you return to school ready to excel in your AS module examinations.
寒假是 Year 12 学生学习 CCEA 计算机科学的关键窗口，可以用来巩固知识并建立真正的考试信心。这份 12 节强化计划将假期复习按 AS 大纲的所有主要主题进行结构化安排，结合了简洁的概念复习、真题练习、伪代码追踪和动手编程训练。每一节都针对一个核心领域，帮助你将被动阅读转变为真正的理解，确保你返校后能从容应对 AS 模块考试。
1. Data Representation: Binary, Hexadecimal and Negative Numbers | 数据表示：二进制、十六进制与负数
Begin by mastering conversions between binary, denary and hexadecimal. For negative representation, practise two’s complement conversions for 8‑bit and 16‑bit words, and be sure you can identify overflow conditions. Draw a quick reference table showing bit weights for 8‑bit two’s complement (−128 64 32 16 8 4 2 1) and attempt at least 10 conversion problems from a specimen paper.
从掌握二进制、十进制与十六进制之间的转换开始。对于负数表示，练习 8 位和 16 位字长的补码转换，并确保你能识别溢出条件。画一个 8 位补码位权快速参考表（−128 64 32 16 8 4 2 1），并从样卷中做至少 10 道转换题。
Next, review floating‑point representation using mantissa and exponent in two’s complement. Write out the steps: convert to fixed‑point binary, normalise, then pack sign, exponent and mantissa. Use a standardised format, e.g. 8‑bit mantissa and 4‑bit exponent, to manually encode values like 5.75₁₀ or −3.25₁₀ before checking with an online simulator.
接着复习使用补码形式的尾数和指数进行浮点表示。写出步骤：转换为定点二进制，规格化，然后打包符号位、指数和尾数。使用标准化格式，如 8 位尾数和 4 位指数，手动编码像 5.75₁₀ 或 −3.25₁₀ 这样的值，再用在线模拟器核对。
2. Computer Architecture: Fetch–Decode–Execute and the CPU | 计算机体系结构：取指—译码—执行与CPU
Rebuild the von Neumann architecture from memory. Sketch a diagram showing the control unit, ALU, registers (MAR, MDR, PC, CIR, accumulator) and system buses (address, data, control). Write a paragraph explaining how the fetch–decode–execute cycle uses these components to process an instruction, making sure you associate each register with its role at every step.
根据记忆重建冯·诺依曼体系结构。画一张简图，标出控制器、ALU、寄存器（MAR、MDR、PC、CIR、累加器）和系统总线（地址线、数据线、控制线）。写一段话解释取指—译码—执行周期如何利用这些组件处理一条指令，确保你能将每个寄存器与每一步的功能对应起来。
Compare RISC and CISC architectures using a short table:
| RISC | CISC |
|---|---|
| Simple, fixed‑length instructions | Complex, variable‑length instructions |
| Single‑cycle execution | Multi‑cycle execution |
| Larger code size | Smaller code size |
| Used in mobile devices | Used in desktop/server CPUs |
用简表对比 RISC 与 CISC 架构。记住 CCEA 常考这些差异；练习写出考试风格的对比答案。
3. Operating Systems and Utility Software | 操作系统与实用程序
Define an operating system and list its five key functions: memory management, processor scheduling, file management, I/O management and user interface. For each function, write one sentence that links it to a real‑world scenario, e.g. “virtual memory allows a PC with 4 GB RAM to run a 6 GB game by swapping data to disk.”
定义操作系统并列出其五项关键功能：内存管理、处理器调度、文件管理、输入/输出管理和用户界面。为每一项功能写一句关联真实场景的话，例如“虚拟内存允许一台 4 GB 内存的电脑通过将数据交换到磁盘来运行 6 GB 的游戏”。
between types of utility software: defragmentation, backup, compression, encryption, anti‑ nd explain the difference between lossless and lossy compression with audio and image examples.
区分不同类型的实用程序软件：碎片整理、备份、压缩、加密、反恶意软件。对于压缩，计算一个文件从 200 KB 缩减到 50 KB 的压缩比（比率为 4:1），并用音频和图像示例解释无损压缩与有损压缩的区别。
4. Networking Fundamentals: Topologies, Protocols and the TCP/IP Stack | 网络基础：拓扑、协议与TCP/IP协议栈
Draw and label star and bus topologies, noting the effect of a single cable failure in each. Explain why most modern LANs use a star topology with a switch, and practise describing how CSMA/CD works in an Ethernet network. Write a short explanation of how packets are forwarded using MAC addresses within a LAN and IP addresses across the internet.
画出并标注星型和总线型拓扑，指出每种拓扑中单根线缆故障的影响。解释为什么大多数现代局域网使用带交换机的星型拓扑，并练习描述 CSMA/CD 在以太网中的工作方式。写一段简短说明，解释数据包在局域网内如何通过 MAC 地址转发，在互联网上如何通过 IP 地址转发。
Memorise the four layers of the TCP/IP stack — Application, Transport, Internet, Link — and for each layer list two associated protocols (e.g. HTTP, FTP, SMTP at Application; TCP, UDP at Transport). Use a wrist‑sized flashcard to test yourself during short breaks.
熟记 TCP/IP 协议栈的四层——应用层、传输层、网际层、链路层——并为每一层列出两个相关协议（如应用层的 HTTP、FTP、SMTP；传输层的 TCP、UDP）。用一张腕带大小的记忆卡在短暂休息时自测。
5. Database Concepts and SQL | 数据库概念与SQL
Revisit relational database terminology: table, record, field, primary key, foreign key, composite key. Build a simple entity‑relationship diagram for a school database involving STUDENT, COURSE and ENROLMENT entities, carefully marking cardinality. Explain why normalisation reduces data redundancy by walking through First, Second and Third Normal Forms with a small unnormalised table.
回顾关系数据库术语：表、记录、字段、主键、外键、复合键。为一个涉及 STUDENT、COURSE 和 ENROLMENT 实体的学校数据库绘制简单的实体关系图，仔细标出基数。通过一个小型非规范化表逐步讲解第一、第二和第三范式，解释为什么规范化可以减少数据冗余。
Write SQL queries by hand: SELECT, FROM, WHERE, ORDER BY, GROUP BY, HAVING, and at least one JOIN. Practise on a sample dataset with questions like “List students and the names of courses they have enrolled in after 1 September.” Always test your syntax with an online SQL sandbox.
手写 SQL 查询：SELECT、FROM、WHERE、ORDER BY、GROUP BY、HAVING，以及至少一个 JOIN。在样例数据集上练习，回答类似“列出 9 月 1 日后注册课程的学生及其课程名称”的问题。务必用在线 SQL 沙盒检验你的语法。
6. Programming Fundamentals: Variables, Data Types and Control Structures | 编程基础：变量、数据类型与控制结构
olean, character and string types. Write a short program that asks for a user’s age and outputs whether they are an adult (≥ 18) or a child, using an IF‑THEN‑ELSE structure. Annotate each line to show how the control flow works.
专注于你在课堂上使用的编程语言。巩固变量声明、赋值以及整数、实数/浮点、布尔、字符和字符串类型的正确使用。编写一个简短的程序，询问用户年龄并根据 IF‑THEN‑ELSE 结构输出其是成人（≥ 18 岁）还是儿童。为每一行添加注释，说明控制流程如何工作。
Iteration is heavily examined in CCEA tracing questions. Practise tracing FOR, WHILE and REPEAT‑UNTIL loops by creating a trace table for a given algorithm. For example, trace a loop that sums even numbers from 1 to 20 and record the changing values of the iterator and accumulator at each iteration.
迭代在 CCEA 的追踪题中考查得很重。通过为给定算法创建追踪表来练习追踪 FOR、WHILE 和 REPEAT‑UNTIL 循环。例如，追踪一个计算 1 到 20 之间偶数之和的循环，记录每次迭代中迭代器和累加器的变化值。
7. Algorithm Design: Pseudocode, Flowcharts and Problem Decomposition | 算法设计：伪代码、流程图与问题分解
CCEA AS papers require you both to read and to write pseudocode. Revise the standard pseudocode notation from the specification: ← for assignment, IF…THEN…ELSE…ENDIF, WHILE…DO…ENDWHILE, etc. Write a pseudocode algorithm for a linear search and a binary search on an array of integers, then draw a flowchart for each. Compare their efficiency using Big O notation: O(n) for linear search, O(log n) for binary search.
CCEA AS 试卷要求你既能阅读也能书写伪代码。复习大纲中标准的伪代码符号：← 表示赋值，IF…THEN…ELSE…ENDIF，WHILE…DO…ENDWHILE 等。为一个整数数组编写线性搜索和二分搜索的伪代码算法，然后为每个算法绘制流程图。用大 O 表示法比较它们的效率：线性搜索为 O(n)，二分搜索为 O(log n)。
Decomposition is a key problem‑solving skill. Take a moderately complex problem — e.g. a program that validates a password (at least 8 characters, one uppercase, one digit) — and break it into sub‑problems: input, validation (length, uppercase, digit), output. Write a structure chart showing the hierarchy of modules.
分解是一项关键的解决问题的技能。选取一个中等复杂的问题——例如一个验证密码的程序（至少 8 个字符、一个大写字母、一个数字）——将其分解为子问题：输入、验证（长度、大写、数字）、输出。写一张结构图来展示模块的层次关系。
8. Data Structures: Arrays, Lists, Stacks and Queues | 数据结构：数组、列表、栈与队列
Describe static and dynamic data structures. Arrays provide fixed‑size, direct access storage, while linked lists allow flexible memory usage but require sequential access. Draw a diagram of a singly linked list showing data and pointer fields, and explain how a node can be inserted or deleted by updating pointers.
描述静态与动态数据结构。数组提供固定大小、直接访问的存储，而链表允许灵活的内存使用但需要顺序访问。画一张单链表的示意图，标出数据域和指针域，并解释如何通过更新指针来插入或删除一个节点。
Stacks (LIFO) and queues (FIFO) are essential for managing process states. Model the operation of a stack with push and pop: given an empty stack, push 5, push 9, pop, push 3, show the stack contents after each operation. Do the same for a circular queue with enqueue and dequeue, paying attention to front and rear pointer movement.
栈（后进先出）和队列（先进先出）是管理进程状态的关键。模拟栈的 push 和 pop 操作：给定一个空栈，push 5，push 9，pop，push 3，展示每次操作后栈的内容。对循环队列的 enqueue 和 dequeue 进行同样操作，注意队首和队尾指针的移动。
9. Computational Thinking: Abstraction, Pattern Recognition and Automation | 计算思维：抽象、模式识别与自动化
Use everyday examples to consolidate the four cornerstones of computational thinking. Abstraction: creating a map of a school that omits irrelevant details. Decomposition: breaking “make a cup of tea” into sub‑tasks. Pattern recognition: identifying that searches on an unsorted list always require checking every item. Automation: writing a script to rename hundreds of photos based on metadata.
用日常例子巩固计算思维的四大基石。抽象：制作一张省略无关细节的学校地图。分解：将“泡一杯茶”分解为子任务。模式识别：识别出在无序列表中的搜索总是需要检查每一个项目。自动化：编写脚本根据元数据重命名数百张照片。
Apply these skills to a sample CCEA scenario: a library needs a system to track book loans. Perform abstraction (entities: books, members, loans), pattern recognition (every loan has a due date), decomposition (capture loan, return book, send reminder) and suggest how automation could generate overdue emails nightly.
将这些技能应用到一道 CCEA 样例情景题：一家图书馆需要一个系统来跟踪图书借阅。进行抽象（实体：图书、会员、借阅），模式识别（每次借阅都有到期日），分解（登记借出、归还图书、发送提醒），并提出如何通过自动化在每晚生成逾期邮件。
10. Systems Development Life Cycle and Methodologies | 系统开发生命周期与方法论
CCEA expects you to know the stages of the waterfall model: feasibility study, requirements analysis, system design, implementation, testing, deployment and maintenance. For each stage, write a short purpose statement and an example deliverable. Highlight why the waterfall model can be problematic when requirements change and contrast it with the spiral model or agile development.
CCEA 要求你了解瀑布模型的各个阶段：可行性研究、需求分析、系统设计、实现、测试、部署和维护。为每个阶段写一句目的说明和一个示例可交付成果。强调为什么在需求变更时瀑布模型会有问题，并将其与螺旋模型或敏捷开发进行对比。
Design a test plan for a simple login system. Include normal data (correct username/password), boundary data (minimum/maximum length passwords) and erroneous data (empty fields, SQL injection attempts). Use a table with columns: Test ID, Test Data, Expected Result, Actual Result.
为一个简单的登录系统设计测试方案。包括正常数据（正确的用户名/密码）、边界数据（最短/最长密码）和异常数据（空字段、SQL 注入尝试）。用一个表格呈现各列：测试 ID、测试数据、预期结果、实际结果。
11. Legal, Ethical and Environmental Considerations | 法律、伦理与环境因素
Study the Data Protection Act 2018 and GDPR principles: data must be processed lawfully, kept secure, not transferred outside adequate protection zones, etc. Link each principle to a concrete school scenario, such as storing GCSE results electronically. Know the difference between the Act and GDPR — the latter is EU‑wide while the Act is UK‑specific post‑Brexit, though closely aligned.
学习《2018 年数据保护法》和 GDPR 原则：数据必须合法处理、安全保管、不得转移到保护不足的区域外等。将每条原则与具体的学校场景联系起来，例如以电子方式存储 GCSE 成绩。了解该法案与 GDPR 的区别——后者是欧盟范围的，而该法案是英国脱欧后特有的，但两者密切一致。
For environmental issues, list the positive (e‑waste recycling, paperless offices, smart energy grids) and negative (data centre energy consumption, planned obsolescence, toxic e‑waste) impacts of computing. Write a balanced paragraph suitable for a 4‑mark “discuss” question.
关于环境问题，列出计算的正面影响（电子废弃物回收、无纸化办公、智能电网）和负面影响（数据中心能耗、计划性淘汰、有毒电子垃圾）。写一段适合 4 分“讨论”题的平衡性段落。
12. Mock Exam Sprint and Self‑Assessment | 模拟考试冲刺与自我评估
Acquire a full AS Component 1 past paper from the CCEA website. Sit it under timed conditions: 1 hour 30 minutes. Do not consult notes during the paper; afterwards, mark your answers rigorously using the published mark scheme. Note every lost mark on a topic‑based reflection sheet.
从 CCEA 网站获取一套完整的 AS 模块 1 真题。在计时条件下做一次模拟：1 小时 30 分钟。考试期间不要查阅笔记；做完后用官方评分标准严格批改。将每一个失分点记录在一张按主题分类的反思表上。
Create a revision action plan for January based on the patterns in your mistakes. If you struggled with two’s complement arithmetic, schedule extra practice for the first week back. If you lost marks on structured English answers, plan to write two 4‑mark “explain” paragraphs per day. End the holiday with a second mock paper to measure improvement.
根据错题规律制定一月份的复习行动计划。如果你在补码运算上遇到困难，为返校第一周安排额外练习。如果你在结构化书面回答上失分，计划每天写两段 4 分的“解释”段落。在假期结束时再做一套模拟卷，衡量进步情况。
Remember: Consistency over cramming — 60 minutes of focused revision each morning will cement your understanding far better than a last‑minute panic.
记住：坚持胜过突击——每天上午 60 分钟专注复习，比最后一刻的慌乱更有效地巩固理解。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图