📚 Year 10 WJEC Computer Science: Christmas Break Intensive Revision Plan | Year 10 WJEC 计算机科学：寒假强化复习计划
The Christmas break is the perfect opportunity to consolidate everything you have learned so far in Year 10 WJEC Computer Science. Without the pressure of daily lessons, you can structure your time to fill knowledge gaps, practise key skills, and build confidence for the months ahead. This 12-day intensive plan breaks the syllabus into manageable daily topics, combining theory review, worked examples, and exam-style questions.
寒假是巩固 Year 10 WJEC 计算机科学所学内容的绝佳时机。没有日常课程的压力，你可以合理安排时间，填补知识漏洞，练习关键技能，为接下来的学习建立信心。这份 12 天强化计划将考纲拆解为每天一个可管理的主题，融合理论复习、例题讲解与考试风格练习。
1. Day 1: Setting Goals and Organising Notes | 第1天：设定目标与整理笔记
Before diving into content, you need a clear picture of what you have covered and where your weaknesses lie. Spend this first session gathering all your class notes, textbooks, and any topic checklists provided by your teacher.
在开始复习内容之前，你需要清楚自己已经学了哪些内容，以及薄弱环节在哪里。利用第一天的学习时间，收集所有课堂笔记、教科书以及老师提供的主题清单。
Write down a list of the main units from the WJEC specification that your class has already studied, such as system architecture, data representation, networks, logic, algorithms, and programming. Rate your confidence in each area on a scale of 1 to 5, then use this rating to decide how much time each topic deserves.
写下你们班级已经学过的 WJEC 考纲主要单元，例如系统架构、数据表示、网络、逻辑、算法和编程。按照 1 到 5 分评价你对每个领域的信心，然后用这个评分来决定每个主题应投入多少时间。
Create a simple timetable for the next 11 days, blocking out 60–90 minutes per session. Stick the timetable on your wall and tick off each day as you complete it. This small act of tracking keeps motivation high.
为接下来的 11 天制作一张简单的时间表，每次学习安排 60–90 分钟。把时间表贴在墙上，每完成一天就打勾。这个小小的跟踪动作能让你的动力保持高涨。
2. Day 2: System Architecture – CPU, Memory and Storage | 第2天：系统架构——CPU、内存与存储
Begin by revisiting the Von Neumann architecture. Draw a labelled diagram showing the CPU, main memory (RAM), input/output devices, and the system bus carrying data, address, and control signals.
首先回顾冯·诺依曼架构。画出带标签的示意图，标出 CPU、主存储器（RAM）、输入/输出设备，以及承载数据、地址和控制信号的系统总线。
Define the function of the control unit (CU), arithmetic logic unit (ALU), and registers such as the program counter (PC), memory address register (MAR), and memory data register (MDR). Use the fetch-decode-execute cycle to explain how these components work together.
定义控制单元（CU）、算术逻辑单元（ALU）以及程序计数器（PC）、内存地址寄存器（MAR）和内存数据寄存器（MDR）等寄存器的功能。运用取指-译码-执行周期解释这些部件如何协同工作。
For memory and storage, create a comparison table of RAM vs ROM, and note the differences between volatile and non-volatile storage. Distinguish between primary storage (RAM, ROM) and secondary storage (magnetic, solid-state, optical), giving at least one real-world example for each.
关于内存与存储，制作一张 RAM 与 ROM 的对比表，并记下易失性与非易失性存储的区别。区分主存储器（RAM、ROM）和辅助存储器（磁性、固态、光学），每种至少给出一个实际例子。
3. Day 3: Data Representation – Binary and Hexadecimal | 第3天：数据表示——二进制与十六进制
Today is all about number conversions. Start with the binary number system: practise converting denary (decimal) numbers to binary using the division-by-2 method, and vice versa by adding up place values. For example, 53₁₀ = 110101₂.
今天的重点是数制转换。从二进制数制开始：练习用除 2 取余法将十进制数转换为二进制，以及通过累加位权值将二进制转为十进制。例如 53₁₀ = 110101₂。
Move on to hexadecimal. Understand that hex uses digits 0–9 and letters A–F to represent the values 10–15. Practise converting between denary, binary, and hex – grouping binary digits into nibbles (4 bits) makes hex conversion much quicker.
接着学习十六进制。理解十六进制使用数字 0–9 和字母 A–F 表示数值 10–15。练习十进制、二进制与十六进制之间的相互转换——将二进制位分组为半字节（4 位）能够更快地转换为十六进制。
Work through at least ten conversion questions and check your answers. Remember that 1 hexadecimal digit represents exactly 4 bits, so an 8‑bit binary number becomes two hex digits, e.g., 1101 0110₂ = D6₁₆.
至少完成十道转换题目并核对答案。记住 1 位十六进制数字恰好表示 4 个二进制位，因此一个 8 位二进制数会变成两位十六进制，例如 1101 0110₂ = D6₁₆。
4. Day 4: Representing Text, Images and Sound | 第4天：表示文本、图像与声音
Explain how characters are stored using character sets such as ASCII and Unicode. Know that ASCII uses 7 bits (extended ASCII uses 8 bits) to represent 128/256 characters, while Unicode can represent many more characters using up to 32 bits per character.
解释如何使用 ASCII 和 Unicode 等字符集存储字符。了解 ASCII 使用 7 位（扩展 ASCII 用 8 位）表示 128/256 个字符，而 Unicode 每个字符最多使用 32 位，可以表示更多字符。
For images, describe bitmap representation: an image is made of pixels, each pixel has a binary colour value. Define colour depth (bits per pixel) and resolution (pixels per inch). Calculate the file size of a bitmap image using: size = width × height × colour depth (in bits). Convert to bytes by dividing by 8.
对于图像，描述位图的表示方式：图像由像素组成，每个像素有一个二进制的颜色值。定义颜色深度（每像素位数）和分辨率（每英寸像素数）。计算位图图像的文件大小，使用公式：大小 = 宽 × 高 × 颜色深度（位）。除以 8 转换为字节。
For sound, explain sampling: analogue sound waves are measured at intervals (sample rate) and each sample is stored as a binary number (sample resolution). Higher sample rates and bit depths give better quality but larger files. Calculate sound file sizes with: size = sample rate × sample resolution × duration (in seconds).
对于声音，解释采样：在特定间隔测量模拟声波（采样率），每个样本存储为一个二进制数（采样分辨率）。更高的采样率和位深度带来更好的音质，但文件也更大。计算声音文件大小，公式为：大小 = 采样率 × 采样分辨率 × 时长（秒）。
5. Day 5: Networks and Topologies | 第5天：网络与拓扑结构
Define a computer network and compare LAN (Local Area Network) with WAN (Wide Area Network). List the hardware needed: NIC, switch, router, wireless access point, and transmission media (copper cable, fibre optic, wireless).
定义计算机网络，并比较 LAN（局域网）和 WAN（广域网）。列出所需硬件：网卡、交换机、路由器、无线接入点以及传输介质（铜缆、光纤、无线）。
Draw the four main network topologies: star, bus, ring, and mesh. For each, write one advantage and one disadvantage. Explain why the star topology is the most common in schools and offices – central switch, easy fault isolation, if one cable fails only that device is affected.
画出四种主要网络拓扑结构：星型、总线型、环型和网状型。为每种拓扑写一个优点和一个缺点。解释为什么星型拓扑在学校和办公室最常见——中央交换机、容易隔离故障，一条电缆断了只影响那一台设备。
Introduce client-server and peer-to-peer models. In client-server, a dedicated server manages resources; in P2P, all devices share resources equally. Know examples such as file servers, print servers, and BitTorrent.
介绍客户端-服务器模型与对等模型。在客户端-服务器模型中，专用服务器管理资源；在 P2P 中，所有设备平等共享资源。了解文件服务器、打印服务器和 BitTorrent 等实例。
6. Day 6: Network Security Threats and Prevention | 第6天：网络安全威胁与防护
Start by listing common security threats: malware (virus, worm, Trojan), phishing, social engineering, denial-of-service (DoS) attacks, and brute-force attacks. For each, write a short description of how it works and the harm it can cause.
首先列出常见的安全威胁：恶意软件（病毒、蠕虫、特洛伊木马）、网络钓鱼、社会工程、拒绝服务（DoS）攻击和暴力攻击。为每种威胁写一段简短的运作方式及其可能造成的危害描述。
Then move on to prevention methods: firewalls, anti-malware software, encryption (including SSL/TLS), strong password policies, two-factor authentication (2FA), and user access levels. Explain how a firewall filters incoming and outgoing packets based on rules.
然后转向预防方法：防火墙、反恶意软件、加密（包括 SSL/TLS）、强密码策略、双因素认证（2FA）和用户访问级别。解释防火墙如何根据规则过滤传入和传出的数据包。
Create a scenario: a school server holds sensitive student data. Describe the layers of security that should be applied (physical locks on the server room, user authentication, firewall, encryption, regular backups). Link each measure to a threat it mitigates.
创建一个场景：学校服务器存有敏感的学生数据。描述应该实施的安全层次（服务器机房的物理锁、用户认证、防火墙、加密、定期备份）。将每项措施与其防范的威胁关联起来。
7. Day 7: Logic Gates and Truth Tables | 第7天：逻辑门与真值表
Learn the standard symbols and truth tables for the three basic logic gates: AND, OR, and NOT. Then add NAND and NOR gates. For each gate, be able to draw the shape and write the Boolean expression.
学习三种基本逻辑门的标准符号和真值表：与（AND）、或（OR）、非（NOT）。然后加入与非（NAND）和或非（NOR）门。对于每种门，要能画出形状并写出布尔表达式。
| A | B | A AND B | A OR B | A NAND B | A NOR B |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 |
Practise writing truth tables for simple logic circuits that combine two or three gates. Start with a given combination, label intermediate outputs, and fill the table systematically.
练习为包含两到三个逻辑门的简单逻辑电路编写真值表。先从一个给定的组合开始，标出中间输出，然后系统地填写真值表。
Also cover the concept of a logic expression from a circuit diagram and vice versa. For instance, Q = (A AND B) OR (NOT C). Simplify where possible using Boolean identities if your teacher has introduced them.
同时学习如何从电路图写出逻辑表达式，以及根据表达式画出电路图。例如，Q = (A AND B) OR (NOT C)。如果老师已经引入布尔恒等式，可以尝试进行简化。
8. Day 8: Algorithms – Flowcharts and Pseudocode | 第8天：算法——流程图与伪代码
Algorithms are the backbone of all programs. Start by defining an algorithm and the need for precision, sequence, selection, and iteration. Draw the standard flowchart symbols: oval for start/end, parallelogram for input/output, rectangle for process, diamond for decision, and arrows for flow direction.
算法是所有程序的支柱。首先定义算法，以及它需要精确、顺序、选择和迭代的原因。画出标准流程图符号：椭圆形表示开始/结束，平行四边形表示输入/输出，矩形表示处理，菱形表示判断，箭头表示流程方向。
Work through tracing exercises: given a flowchart or pseudocode, step through it with sample data and record the values of variables at each step. This is a crucial exam skill. Use a trace table with columns for each variable.
完成跟踪练习：给出一个流程图或伪代码，用示例数据逐步执行，记录每一步变量的值。这是一项关键的考试技能。使用包含每个变量列的跟踪表。
Create pseudocode for common problems: finding the largest of three numbers, calculating a running total, and counting how many numbers in a list are even. Use meaningful variable names and consistent indentation.
为常见问题编写伪代码：找出三个数中的最大值、计算累计总和、统计列表中偶数的个数。使用有意义的变量名和一致缩进。
9. Day 9: Programming Fundamentals (Python) | 第9天：编程基础（Python）
Open your Python IDE and refresh the basic building blocks: declaring variables (integer, float, string, Boolean), using input() and print(), and performing arithmetic operations (+, -, *, /, //, %, **).
打开你的 Python IDE，复习基本构建块：声明变量（整型、浮点型、字符串型、布尔型），使用 input() 和 print()，以及算术运算（+、-、*、/、//、%、**）。
Practise selection with if, elif, and else statements. Write a small program that asks for a test score and prints a grade according to WJEC boundaries. Then explore iteration: for loops with range() and while loops with a condition.
练习使用 if、elif 和 else 语句进行选择。编写一个小程序，要求输入测试分数，并根据 WJEC 评分等级输出成绩。然后探索迭代：带 range() 的 for 循环和带条件的 while 循环。
Create a simple list and demonstrate how to add, remove, and access elements. Write a function that takes a list of numbers and returns the average. Document your code with comments to explain each section.
创建一个简单列表，演示如何添加、删除和访问元素。编写一个函数，接收数字列表并返回平均值。用注释记录代码，解释每个部分。
10. Day 10: Ethical, Legal and Environmental Issues | 第10天：伦理、法律与环境问题
This topic requires you to discuss real-world impacts of computing. Revise the principles of the Data Protection Act 2018/GDPR: data must be processed fairly, lawfully, and for specified purposes; it must be accurate, kept secure, and not kept longer than necessary. Relate these to smart devices or social media apps.
本主题要求你讨论计算机对现实世界的影响。复习《2018 年数据保护法》/GDPR 的原则：数据必须公平、合法地处理，且用于特定目的；数据必须准确、安全保存，且保存时间不超过必要。将这些原则与智能设备或社交媒体应用联系起来。
Outline the Computer Misuse Act 1990 – unauthorised access, unauthorised access with intent to commit further offences, and unauthorised acts with intent to impair operation. Give a recent news example of a cyber attack and which offence it falls under.
概述《1990 年计算机滥用法》——未经授权访问、未经授权访问并意图实施进一步犯罪，以及未经授权行为意图破坏计算机运行。给出一个近期网络攻击的新闻例子，并说明它属于哪类罪行。
Discuss environmental impacts: the energy consumption of data centres, the problem of e-waste, and how technology can also help the environment (smart grids, remote working). Mention the digital divide and how unequal access to technology affects education and job opportunities.
讨论环境影响：数据中心的能耗、电子垃圾问题，以及技术如何帮助环保（智能电网、远程办公）。提及数字鸿沟，以及技术获取不平等如何影响教育和就业机会。
11. Day 11: Practice Exam Questions and Mark Schemes | 第11天：模拟考题与评分标准
Now it is time to apply your knowledge under exam conditions. Print a set of past paper questions from the WJEC website or your teacher’s resources. Attempt them without notes, timing yourself as you would in the real exam.
现在是时候在考试环境下运用你的知识了。从 WJEC 网站或老师的资源中打印一套历年试题。在不看笔记的情况下尝试作答，并像真实考试一样给自己计时。
After you finish, mark your answers using the official mark scheme. Pay close attention to command words: ‘state’ demands a short factual answer, ‘describe’ needs more detail, and ‘explain’ requires causes or reasons. Note where marks are awarded for keywords like ‘volatile’, ‘encryption’, or ‘algorithm’.
完成后，用官方评分标准批改答案。特别注意指令词：“state”要求简短的客观回答，“describe”需要更多细节，“explain”则要求说明原因或理由。记录像“volatile”、“encryption”或“algorithm”这类关键词是在哪里得分的。
Identify two or three mistakes that you made repeatedly, and revisit those topics briefly. Write a short ‘fix-it’ card that summarises the correct answer to the question you got wrong.
找出你反复犯的两三个错误，并简要回顾那些主题。写一张简短的“纠正卡”，总结你做错的那道题的正确解答。
12. Day 12: Final Review and Confidence Building | 第12天：最终复习与建立信心
On the last day, avoid cramming new content. Instead, skim through your Day 1 confidence list and your ‘fix-it’ cards. Pick three topics that you have improved most and explain them aloud as if teaching someone else.
最后一天，避免死记硬背新内容。相反，浏览你第一天的信心列表和“纠正卡”。选出你进步最大的三个主题，并像教别人那样大声解释它们。
Create a one-page summary sheet containing the most important formulas (file size for image and sound, binary‑denary conversion steps, logic gate truth tables) and key definitions (volatile, firmware, protocol, band-width, iterative testing).
制作一张单页摘要表，包含最重要的公式（图像和声音文件大小、二进制与十进制转换步骤、逻辑门真值表）和关键定义（易失性、固件、协议、带宽、迭代测试）。
Finally, remind yourself that this two‑week effort has given you a significant advantage. Walk into the new term knowing you have a solid foundation and can tackle new topics with confidence.
最后，提醒自己这两周的努力已经为你带来了显著优势。带着扎实的基础走进新学期，知道你能够自信地应对新主题。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导