📚 Year 8 WJEC Computer Science: Winter Intensive Revision Plan | 八年级 WJEC 计算机：寒假强化复习计划
The winter break offers a golden opportunity to strengthen your grasp of Year 8 WJEC Computer Science. With no daily classes to rush through, you can revisit tricky topics at your own pace and build confidence for the rest of the year.
寒假是巩固八年级 WJEC 计算机科学知识的黄金机会。没有日常课业追赶，你可以按自己的节奏重新梳理难点，为学年后半段积累信心。
This structured revision plan breaks down the entire syllabus into 12 focused sessions. Each session combines key concept review, worked examples, and quick self‑tests. Follow the plan day by day, and you’ll enter the new term fully prepared.
这份结构化复习计划将整个考纲拆分为 12 个专题环节。每个环节融合核心概念回顾、例题讲解与快速自测。逐日坚持，你将以充分准备迎接新学期。
1. Understanding the Syllabus and Assessment Objectives | 了解考纲与评估目标
Before you start, download the official WJEC Year 8 Computer Science specification. It lists all knowledge points, including computational thinking, data representation, logic, programming, hardware, software, networking and safety.
开始之前，请下载 WJEC 八年级计算机科学官方考纲。它列出了所有知识点，涵盖计算思维、数据表示、逻辑、编程、硬件、软件、网络与安全。
Identify which topics you find hardest by colour‑coding them red, amber or green. This traffic‑light system helps you allocate more time to weak areas and less to those you already know well.
用红、黄、绿三色标记你对各主题的掌握程度。这种交通灯系统能帮你把更多时间分给薄弱环节，减少在已掌握内容上的耗时。
Red topics need daily practice; amber topics every other day; green topics once a week.
红色主题需每日练习；黄色主题隔天一次；绿色主题每周一次即可。
Keep the specification open while revising to make sure you stay on track.
复习时始终打开考纲，确保不偏离考点。
2. Creating a Personalised Revision Timetable | 制定个性化复习时间表
The winter break is short, so design a realistic timetable. Aim for two 1‑hour sessions per day – one in the morning for learning new or weak topics, and one in the afternoon for practice questions.
寒假短暂，要制定切实可行的计划。建议每天安排两个 1 小时时段——上午学习新知识或攻克弱项，下午进行题目练习。
Use a simple grid: list the 12 topics across the days you have available. Include one rest day each week to avoid burnout. Below is an example of a weekly layout.
用一个简单表格：将所有 12 个主题安排到可用的天数中。每周至少安排一天休息，避免疲劳。下面是每周安排示例。
| Day | Morning Focus | Afternoon Task |
|---|---|---|
| Mon | Binary & Denary | Conversion exercises |
| Tue | Hexadecimal | Data sizes quiz |
| Wed | Logic Gates | Draw & label gates |
| Thu | Boolean & Truth Tables | Complete truth tables |
| Fri | Algorithms & Flowcharts | Write pseudocode |
| Sat | Programming Basics | Trace a program |
| Sun | Rest & recap | Light quiz |
Adjust the schedule to fit your holiday. The key is consistency – even 30‑minute bursts count if they are focused.
根据假期调整计划。关键在于坚持——即使每次专注 30 分钟，也大有裨益。
3. Data Representation: Binary and Denary Conversions | 数据表示：二进制与十进制转换
All computer data is represented with 0s and 1s. Binary is a base‑2 system where each digit is worth a power of 2 (e.g. 128, 64, 32, 16, 8, 4, 2, 1 for 8‑bit numbers).
所有计算机数据都用 0 和 1 表示。二进制是基数为 2 的系统，每位数字对应 2 的幂（例如 8 位数依次代表 128, 64, 32, 16, 8, 4, 2, 1）。
To convert denary (base‑10) to binary, repeatedly divide by 2 and note the remainders. For example, 75₁₀ becomes 01001011₂ (or simply 1001011₂).
将十进制转换为二进制时，反复除以 2 记录余数。例如 75₁₀ 转为 01001011₂（或写作 1001011₂）。
8‑bit binary can represent values 0 to 255.
8 位二进制可表示 0 至 255 的值。
The most significant bit (leftmost) is worth 128; the least significant bit (rightmost) is worth 1.
最高有效位（最左）值为 128；最低有效位（最右）值为 1。
Practice quick drills: pick random denary numbers under 256 and write their binary equivalents. Use a table to check your work.
快速练习：随机选取小于 256 的十进制数，写出二进制表示，再用表格核对。
4. Hexadecimal Numbers and Data Sizes | 十六进制数与数据大小
Hexadecimal (hex) is base‑16, using digits 0‑9 and letters A‑F to represent values 0‑15. It is a shorthand for binary, as one hex digit represents exactly 4 bits (a nibble).
十六进制是基数为 16 的系统，使用数字 0‑9 和字母 A‑F 表示 0‑15。它是二进制的简洁表示，因为一位十六进制恰好对应 4 个二进制位（半个字节）。
ecomes D6₁₆ (13 = D, 6 = 6). Hex values often appear in memory addresses and colour codes.
二进制转十六进制时，从右侧开始每 4 位一组。例如 1101 0110₂ 转为 D6₁₆（13 = D，6 = 6）。内存地址和颜色编码常出现十六进制。
Common data size units: a bit is a single 0 or 1; a nibble is 4 bits; a byte is 8 bits. A kilobyte (KB) is 1024 bytes, a megabyte (MB) is 1024 KB, and so on.
常用数据大小单位：位（bit）是单个 0 或 1；半字节（nibble）为 4 位；字节（byte）为 8 位。1 KB = 1024 bytes，1 MB = 1024 KB，依此类推。
| Denary | Binary (8‑bit) | Hex |
|---|---|---|
| 0 | 00000000 | 00 |
| 10 | 00001010 | 0A |
| 127 | 01111111 | 7F |
| 200 | 11001000 | C8 |
Being fluent in binary‑hex‑denary conversions is essential for the exam. Practice with mixed examples every other day.
熟练掌握二进制、十六进制、十进制互转对考试至关重要。每隔一天用混合例子练习一次。
5. Logic Gates: AND, OR, NOT | 逻辑门：与门、或门、非门
Logic gates are the building blocks of digital circuits. The three basic gates you must know are AND, OR and NOT. Each gate processes binary inputs and produces a single output.
逻辑门是数字电路的基石。必须掌握的三种基本门是与门（AND）、或门（OR）和非门（NOT）。每个门处理二进制输入并产生一个输出。
AND gate: output is 1 only when both inputs are 1. Symbol: a flat‑backed shape with two input lines.
与门：仅当两个输入均为 1 时输出 1。图形符号为平背形状，带两条输入线。
OR gate: output is 1 if at least one input is 1. Symbol: a curved shield shape.
或门：只要至少一个输入为 1，输出即为 1。图形符号为弯曲盾形。
NOT gate (inverter): output is the opposite of the single input. Symbol: a triangle with a small circle at the output.
非门（反相器）：输出与单一输入相反。图形符号为三角形，输出端带小圆圈。
Draw each gate and label its inputs A and B. Complete a truth table for each: list all input combinations (00, 01, 10, 11) and the corresponding output.
画出每种门并标注输入 A、B。为每种门填写真值表：列出所有输入组合（00, 01, 10, 11）及对应输出。
| A | B | AND | OR |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |
For NOT gate, simply invert the input: input 0 gives output 1, input 1 gives output 0.
非门直接翻转输入：输入 0 则输出 1，输入 1 则输出 0。
6. Boolean Algebra and Truth Tables | 布尔代数与真值表
ean algebra uses variables that can only be TRUE (1) or FALSE (0). Operators include AND (∧), OR (∨) and NOT (¬). Expressions like Q = (A ∧ B) ∨ ¬C are common in the WJEC exam.
布尔代数使用只能为真（1）或假（0）的变量。运算符包括与（∧）、或（∨）和非（¬）。WJEC 考试中常出现如 Q = (A ∧ B) ∨ ¬C 的表达式。
To evaluate an expression, substitute all input values and work through the brackets first, then NOT, then AND, finally OR. Always draw a truth table with all input permutations.
计算表达式时，代入所有输入值，先算括号，再算非，然后与，最后或。务必画出包含所有输入组合的真值表。
Example: For Q = ¬(A ∨ B), when A=0, B=1, we compute A ∨ B = 1, then ¬1 = 0, so Q=0. The truth table will show Q is 1 only when both inputs are 0.
示例：对于 Q = ¬(A ∨ B)，当 A=0, B=1 时，先计算 A ∨ B = 1，然后 ¬1 = 0，故 Q=0。真值表将显示仅当两个输入都为 0 时 Q 为 1。
Remember De Morgan's laws: ¬(A ∧ B) = ¬A ∨ ¬B and ¬(A ∨ B) = ¬A ∧ ¬B. These can simplify complex logic.
记住德摩根律：¬(A ∧ B) = ¬A ∨ ¬B，¬(A ∨ B) = ¬A ∧ ¬B。它们可简化复杂逻辑。
Practice simplifying expressions before drawing circuits – it saves time.
先化简表达式再画电路，能节约时间。
7. Algorithms, Pseudocode and Flowcharts | 算法、伪代码与流程图
An algorithm is a step‑by‑step procedure to solve a problem. In Year 8, you need to write algorithms using pseudocode (simple English‑like instructions) and draw flowcharts with standard symbols.
算法是解决问题的分步骤过程。八年级要求能用伪代码（类似英语的简单指令）编写算法，并用标准符号绘制流程图。
Oval: Start/End. Parallelogram: Input/Output. Rectangle: Process. Diamond: Decision (with Yes/No branches).
椭圆：开始/结束。平行四边形：输入/输出。矩形：处理。菱形：判断（带是/否分支）。
Pseudocode uses keywords like INPUT, OUTPUT, WHILE...ENDWHILE, IF...THEN...ELSE...ENDIF.
伪代码使用 INPUT、OUTPUT、WHILE...ENDWHILE、IF...THEN...ELSE...ENDIF 等关键词。
Example: an algorithm to add numbers from 1 to 10. Pseudocode: total ← 0, count ← 1. WHILE count ≤ 10: total ← total + count, count ← count + 1. ENDWHILE
Published by TutorHao | Year 8 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图