Teaching Suggestions and Lesson Plan Sharing for Year 10 WJEC Computer Science | Year 10 WJEC 计算机：教师教学建议与教案分享

📚 Teaching Suggestions and Lesson Plan Sharing for Year 10 WJEC Computer Science | Year 10 WJEC 计算机：教师教学建议与教案分享

Teaching Year 10 WJEC Computer Science requires a careful blend of theoretical knowledge and practical programming skills. This article provides teachers with detailed suggestions, classroom strategies, and a sample lesson plan to help students master the key concepts of the WJEC GCSE specification while developing computational thinking.

教授 Year 10 WJEC 计算机课程需要将理论知识与实际编程技能巧妙融合。本文为教师提供详细建议、课堂教学策略和一份教案样本，帮助学生在掌握 WJEC GCSE 规范核心概念的同时发展计算思维。

1. Course Planning and Time Allocation | 课程规划与时间分配

A well-structured long-term plan for Year 10 is the foundation of success. The WJEC Computer Science GCSE comprises Unit 1 ‘Understanding Computer Science’ and Unit 2 ‘Computational Thinking and Programming’. I recommend allocating roughly 60% of teaching time to theory topics such as data representation, systems architecture, networks, and societal impacts, and 40% to programming and algorithm design. Begin with data representation and binary logic, as these underpin many later topics. Then introduce programming basics in Python, allowing students to consolidate their skills through weekly coding tasks before moving to computer networks and security. This spiral approach ensures constant reinforcement.

合理的 Year 10 长期规划是成功的基础。WJEC 计算机科学 GCSE 包含单元1“理解计算机科学”和单元2“计算思维与编程”。我建议将约 60% 的教学时间分配给理论主题，如数据表示、系统体系结构、网络和社会影响，40% 用于编程和算法设计。从数据表示和二进制逻辑入手，因为它们是许多后续内容的基础。随后引入 Python 编程基础，通过每周的编码任务巩固技能，之后再学习计算机网络与安全。这种螺旋式方法能确保持续强化。

Term	Topics	Assessment Focus
Autumn 1	Data Representation, Binary & Hex	Quiz + Binary worksheet
Autumn 2	Programming Foundations (Python)	Mini-project: Text adventure
Spring 1	Computer Architecture, Logic Gates	End-of-topic test
Spring 2	Networks, Protocols, Security	Packet Tracer activity
Summer 1	Algorithms, Pseudocode, Trace Tables	Written algorithm exam
Summer 2	Ethics, Revision & Unit 3 NEA intro	Mock paper

2. Teaching Key Points in Data Representation | 数据表示教学关键点

Data representation is often the first theoretical unit and it must be taught with clarity and consistency. Start with the denary system, then explain binary place values (128 64 32 16 8 4 2 1). Use physical flip cards or online manipulatives for binary-to-denary conversion. When converting 01001011, students should add: 64 + 8 + 2 + 1 = 75. Emphasise that nibbles and bytes are the standard groupings. Then introduce binary addition with carries. A typical error is forgetting to carry when the sum of a column equals 2, so repeated practice with sums like 0011₂ + 0101₂ = 1000₂ is essential. The concept of overflow must be linked directly to a fixed bit width, such as 8-bit registers.

数据表示通常是第一个理论单元，教学必须清晰一致。从十进制入手，然后解释二进制位值（128 64 32 16 8 4 2 1）。使用实体翻页卡片或在线操作工具进行二进制与十进制转换。转换 01001011 时，学生应该相加：64 + 8 + 2 + 1 = 75。强调半字节和字节是标准分组。然后引入带进位的二进制加法。常见错误是当某列和为 2 时忘记进位，因此反复练习 0011₂ + 0101₂ = 1000₂ 这样的算式至关重要。溢出的概念必须与固定位宽直接关联，比如 8 位寄存器。

Move on to hexadecimal as a shorthand for binary. Teach that each hex digit represents 4 bits, so 1010₂ is A and 1111₂ is F. Use colour-coded conversion charts. For text representation, explain ASCII and Unicode, comparing the character sets and bit depths. For images, link resolution to pixel count and colour depth to bits per pixel; calculate file size using width × height × colour depth in bits. Use a practical demo: create a small bitmap and calculate its size. For sound, introduce sample rate, bit depth, and duration. The formula file size = sample rate × bit depth × duration (in seconds) should be practised with real examples, such as CD-quality audio (44.1 kHz, 16-bit, stereo).

接着讲授十六进制作为二进制的简写。教给学生每个十六进制数字代表 4 位，所以 1010₂ 是 A，1111₂ 是 F。使用带颜色的转换表。对于文本表示，解释 ASCII 和 Unicode，比较字符集和位深度。对于图像，将分辨率与像素数量关联，颜色深度与每像素位数关联；用宽度 × 高度 × 颜色深度（位）计算文件大小。做一个实践演示：创建一个小位图并计算其大小。对于声音，介绍采样率、位深度和时长。公式文件大小 = 采样率 × 位深度 × 时长（秒）应通过实际例子练习，如 CD 音质音频（44.1 kHz，16 位，立体声）。

3. Computer Architecture and the FDE Cycle | 计算机体系结构与取指执行周期

Computer architecture can feel abstract to students, so anchor it in physical demonstrations. Start with the Von Neumann architecture diagram: CPU, memory, input/output. Define the roles of the control unit, arithmetic logic unit (ALU), and registers (MAR, MDR, PC, ACC). Use a ‘human CPU’ role-play: assign students to be MAR, MDR, etc., and pass slips of paper representing instructions and data. This mimics the fetch-decode-execute cycle. The cycle can be summarised as: MAR ← PC; PC ← PC+1; MDR ← Memory[MAR]; CIR ← MDR; instruction decoded; executed. Repeat until ‘sleep’. Then introduce the concept of clock speed measured in GHz and how it affects performance.

计算机体系结构对学生来说可能比较抽象，因此要用实物演示将其具体化。从冯·诺依曼体系结构图入手：CPU、存储器、输入/输出。定义控制单元、算术逻辑单元 (ALU) 和寄存器（MAR、MDR、PC、ACC）的作用。采用“人肉 CPU”角色扮演：分配学生扮演 MAR、MDR 等，传递代表指令和数据的纸条。这样可以模拟取指-译码-执行周期。该周期可概括为：MAR ← PC；PC ← PC+1；MDR ← 内存[MAR]；CIR ← MDR；指令译码；执行。重复直至结束。然后介绍时钟速度的概念（以 GHz 计量）及其对性能的影响。

When discussing embedded systems, contrast them with general-purpose computers: an embedded system is a computer system with a dedicated function within a larger mechanical or electronic system, like a microwave controller or car engine management unit. Ask students to bring in examples of embedded devices from home. This makes the topic tangible and relatable.

在讨论嵌入式系统时，将其与通用计算机进行对比：嵌入式系统是在更大机械或电子系统中具有专用功能的计算机系统，如微波炉控制器或汽车引擎管理单元。让学生从家里带来嵌入式设备的例子。这会使该主题具体且贴近生活。

4. Networks and Network Security Strategies | 网络与网络安全策略

Start with LAN and WAN definitions, emphasising the geographical differences and hardware used (switch vs. router). Use the school’s own network as a case study. Then present common topologies: star, bus, mesh. For each, discuss advantages, disadvantages, and the impact of a single point of failure. The star topology is central to WJEC; illustrate with a central switch and multiple nodes. Introduce key protocols: TCP/IP (4-layer model), HTTP, HTTPS, FTP, SMTP, POP3. Provide a simple analogy: sending a letter through the postal service involving layers of packaging, addressing, and transport.

从 LAN 和 WAN 的定义入手，强调地理差异和所用硬件（交换机与路由器）。以学校的网络作为案例研究。接着展示常见拓扑结构：星形、总线、网状。对于每种拓扑，讨论其优缺点及单点故障的影响。星形拓扑是 WJEC 的核心，用中央交换机和多个节点来图示。介绍关键协议：TCP/IP（四层模型）、HTTP、HTTPS、FTP、SMTP、POP3。用一个简单的类比：通过邮政服务寄信涉及包装、寻址和运输等多个层次。

Network security must be threaded throughout. Teach threats: malware, phishing, brute-force attacks, denial of service, SQL injection. For each threat, explain the mechanism and prevention technique (firewalls, encryption, strong passwords, two-factor authentication). Use a hands-on simulation: have students try to ‘attack’ a simple login page you set up (in a safe environment) and then protect it with input validation and password complexity rules. This embeds understanding of ethical hacking and security mindset.

网络安全必须贯穿始终。教给学生威胁类型：恶意软件、网络钓鱼、暴力攻击、拒绝服务、SQL 注入。对每种威胁，解释其机制和防护技术（防火墙、加密、强密码、双因素认证）。使用动手模拟：让学生在安全环境中尝试“攻击”你设置的一个简单登录页面，然后用输入验证和密码复杂性规则对其进行保护。这能让学生深入理解道德黑客与安全思维。

5. Algorithm Design and Pseudocode Mastery | 算法设计与伪代码掌握

Algorithmic thinking is a core skill. Teach students to break problems into input, process, output. Regularly use trace tables to step through algorithms; this is a key exam skill. Pseudocode should follow a clear, consistent syntax: variables named meaningfully, assignment with ←, selection IF…THEN…ELSE…ENDIF, iteration FOR…ENDFOR and WHILE…ENDWHILE. Display a classroom poster illustrating these structures. Provide short, unplugged sorting activities with numbered cards to physically demonstrate bubble sort and merge sort.

算法思维是一项核心技能。教学生将问题分解为输入、处理、输出。经常使用跟踪表来逐步执行算法，这是一项关键的考试技能。伪代码应采用清晰一致的语法：变量命名有意义，赋值使用 ←，选择结构用 IF…THEN…ELSE…ENDIF，循环使用 FOR…ENDFOR 和 WHILE…ENDWHILE。在教室张贴展示这些结构的海报。使用带有编号的卡片进行非在线的排序活动，以物理方式演示冒泡排序和归并排序。

For linear search and binary search, compare their efficiencies: binary search requires sorted data but is O(log n). Use the ‘guess a number between 1 and 100’ game to illustrate binary search. Then set challenges: write pseudocode for a login system that allows three attempts, or for calculating the average of a list of numbers. Pair programming can be very effective here; students discuss logic before writing, reducing syntax errors and deepening comprehension.

对于线性搜索和二分搜索，比较它们的效率：二分搜索要求数据有序，但时间复杂度为 O(log n)。用“猜 1 到 100 之间的数字”游戏来说明二分搜索。然后设置挑战：编写允许三次登录尝试的登录系统伪代码，或计算一列数字平均值的伪代码。这里结对编程可能非常有效；学生在编写前讨论逻辑，减少语法错误并加深理解。

6. Python Programming Teaching Strategies | Python 编程教学策略

Use a practical, project-based approach from the very start. Install a simple IDE such as IDLE or Thonny. Lesson 1: print(‘Hello world!’), variables, input(). Follow with a mini-project: ‘Mad Libs’ where students collect string inputs and output a funny story. This introduces string concatenation and data types naturally. Thereafter, explicitly teach numeric data types, casting (int(), str()), and arithmetic. Use the BIDMAS principle. Create a simple calculator program. Students love seeing their code actually solve real problems.

从一开始就使用实践性、基于项目的方法。安装一个简单的 IDE，如 IDLE 或 Thonny。第一课：print(‘Hello world!’)、变量、input()。接着进行一个迷你项目：“Mad Libs”，让学生收集字符串输入并输出一个搞笑的故事。这自然而然地引入了字符串拼接与数据类型。之后，明确教授数值数据类型、类型转换（int()、str()）和算术运算。使用 BIDMAS 原则。创建一个简单计算器程序。学生喜欢看到自己的代码解决实际问题。

As confidence grows, introduce selection with if-elif-else and logical operators (and, or, not). Use a grading program: input a score, output a grade. Then loops: while for indeterminate repetition (a password entry loop), for with range() for iteration. Build a number guessing game. Crucially, introduce lists early and practice indexing, appending, and slicing. A shopping list manager is an excellent context. Finally, teach functions (def) and parameter passing by refactoring previous code. Always emphasise code readability, comments, and meaningful identifier names. Regular code review sessions, where students present their solutions, foster peer learning.

随着信心增强，引入带有 if-elif-else 的选择结构以及逻辑运算符（and, or, not）。使用一个评分程序：输入分数，输出等级。然后是循环：while 用于不确定重复（如密码输入循环），for 与 range() 搭配用于迭代。构建一个猜数字游戏。关键的是，尽早引入列表，练习索引、追加和切片。购物清单管理器是一个极佳的情境。最后，通过重构之前的代码来教授函数（def）和参数传递。始终强调代码可读性、注释和具有意义的标识符名称。定期的代码评审环节，让学生展示自己的解决方案，可以促进同伴学习。

7. Logic Gates and Boolean Algebra | 逻辑门与布尔代数

Logic gates form the basis of digital circuits and appear regularly on WJEC papers. Start with the three fundamental gates: NOT, AND, OR. Use truth tables for each gate, showing all possible inputs. Then combine gates to form logic circuits. A good starter exercise: given the circuit (A AND B) OR (NOT C), construct its truth table. Students should practice converting between circuit diagrams and logic expressions. Use online simulators to build virtual circuits; seeing an LED turn on when the correct combination is applied solidifies understanding.

逻辑门构成了数字电路的基础，并经常出现在 WJEC 试卷中。从三种基本门：非门、与门、或门开始。用每个门的真值表展示所有可能输入。然后组合门形成逻辑电路。一个好的入门练习：给定电路 (A AND B) OR (NOT C)，构建其真值表。学生应练习在电路图与逻辑表达式之间进行转换。使用在线仿真器构建虚拟电路；看到正确的输入组合点亮 LED 可以巩固理解。

Introduce the Boolean algebra notation: AND is represented by ‘·’, OR by ‘+’, NOT by an overbar or ‘¬’. Teach simplification using basic identities: A + 0 = A, A · 1 = A, A + Ā = 1, De Morgan’s laws. Show how a complex expression like ¬(A + B) simplifies to ¬A · ¬B using De Morgan’s theorem. Relate to NAND and NOR gates as universal gates. A practical assignment: design an alarm circuit that triggers when either a window is open (W=1) or a motion sensor is active (M=1), but only if the system is armed (A=1). The Boolean expression: (W + M) · A. This contextual problem makes the abstraction concrete.

引入布尔代数表示法：与用“·”表示，或用“+”表示，非用上划线或“¬”表示。使用基本恒等式教授化简：A + 0 = A、A · 1 = A、A + Ā = 1、德·摩根律。展示如何用德·摩根定理将复杂表达式如 ¬(A + B) 简化为 ¬A · ¬B。关联到与非门和或非门作为通用门。一个实践作业：设计一个报警电路，当窗户打开 (W=1) 或运动传感器激活 (M=1) 时触发，但仅在系统已布防 (A=1) 时。布尔表达式为：(W + M) · A。这种情境问题使抽象概念具体化。

8. Ethical, Legal and Environmental Impacts | 伦理、法律与环境影响

This cross-cutting theme is often assessed in extended writing questions. Teach data privacy, the Data Protection Act 2018, GDPR principles, and how they affect individuals and organisations. Use case studies: how do social media platforms use personal data? What constitutes consent? Address computer misuse, hacking, and the Computer Misuse Act 1990. Explain the offence types: unauthorised access, unauthorised access with intent to commit further offences, and unauthorised acts with intent to impair operation. For each, discuss real-world cases and sentencing.

这个贯穿全局的主题常在长篇写作题中考核。讲授数据隐私、《2018 年数据保护法》、GDPR 原则，以及它们如何影响个人和组织。使用案例研究：社交媒体平台如何使用个人数据？什么构成同意？探讨计算机滥用、黑客行为及《1990 年计算机滥用法案》。解释犯罪类型：未经授权的访问、意图实施进一步犯罪的未经授权访问，以及意图破坏运行的未经授权行为。对每一种，讨论真实案例和量刑。

Explore the environmental impact of technology: manufacturing e-waste, energy consumption of data centres, and carbon footprint of streaming. Discuss positive contributions too: smart grids, weather modelling, and telecommuting. A classroom debate format works very well here: ‘Should the government mandate recycling of all electronic devices?’. Students must research and present arguments. Finally, cover the digital divide and inclusivity, linking to accessibility features in operating systems and the Equality Act 2010. This ensures students appreciate the wider societal context of computing.

探讨科技对环境的影响：电子垃圾制造、数据中心能耗以及流媒体的碳足迹。也要讨论积极贡献：智能电网、气候建模和远程办公。课堂辩论形式在此非常适合：“政府是否应强制回收所有电子设备？”。学生必须研究并提出论点。最后，涵盖数字鸿沟与包容性，关联到操作系统中的辅助功能及《2010 年平等法案》。这确保学生理解计算机科学更广阔的社会背景。

9. Sample Lesson Plan: Binary Addition with Overflow Detection | 教案示例：含溢出检测的二进制加法

This 60-minute lesson demonstrates how to teach binary addition and overflow, blending theory with hands-on practice. Lesson objectives: (1) add two 8-bit binary numbers using column addition; (2) identify when overflow occurs in an 8-bit register; (3) explain how overflow leads to inaccurate results. Resources: prepared worksheets, binary addition cards, mini whiteboards.

这堂 60 分钟的课示范了如何教授二进制加法与溢出，将理论与实践操作相结合。教学目标：(1) 使用列加法将两个 8 位二进制数相加；(2) 识别 8 位寄存器中何时发生溢出；(3) 解释溢出如何导致结果不准确。资源：准备好的练习纸、二进制加法卡片、迷你白板。

Starter (10 min): Quick-fire denary to binary conversion (e.g., 57 in binary = 00111001). Ask: what is the largest number you can store in 8 bits? (Answer: 255). Show that 11111111 + 1 produces 100000000, which needs 9 bits. Pose the question: ‘What happens if we only have 8 bits?’ This introduces the concept of overflow.

导入（10 分钟）： 快速进行十进制到二进制转换（如 57 的二进制 = 00111001）。提问：在 8 位中能存储的最大数字是多少？（答：255）。展示 11111111 + 1 得到 100000000，需要 9 位。提出问题：“如果我们只有 8 位会发生什么？”由此引入溢出的概念。

Main Activity (35 min): Display column addition rules: 0+0=0; 0+1=1; 1+0=1; 1+1=0 carry 1; 1+1+carry 1=1 carry 1. Model Example 1: 01001110 (78) + 00110010 (50). Work through step by step: from rightmost bit to left, showing carries. Result 10000000 (128) does not overflow because 78+50=128 fits in 8 bits. Then Example 2: 10110011 (179) + 11010110 (214). After calculation, result is 100001001 (265) which has 9 bits; the extra bit is lost as overflow. Emphasise that in an 8-bit system the result would be 00001001 (9), which is wrong. Students then work in pairs, completing four similar problems on mini whiteboards. Circulate, address misconceptions. For early finishers, provide a challenge: detect overflow by checking if the two most significant bit carries are different.

主要活动（35 分钟）： 展示列加法规则：0+0=0；0+1=1；1+0=1；1+1=0 进位 1；1+1+进位 1=1 进位 1。示范例 1：01001110 (78) + 00110010 (50)。逐步演算：从最右位到最左位，显示进位。结果 10000000 (128) 没有溢出，因为 78+50=128 在 8 位内。然后例 2：10110011 (179) + 11010110 (214)。计算后，结果为 100001001 (265)，有 9 位；额外的位作为溢出丢失。强调在 8 位系统中结果将是 00001001 (9)，这是错误的。学生然后结对练习，在迷你白板上完成四道类似题目。巡视，纠正误解。提前完成的同学接受挑战：通过检测两个最高有效位进位是否不同来判断溢出。

Plenary (15 min): Select students to present solutions. Discuss: ‘Why is overflow a problem in real computer systems?’ Link to the Year 2000 problem (Y2K) and Ariane 5 rocket failure. Exit ticket: each student writes down one example of overflow and one way to avoid it (e.g., use larger register). Collect to inform next lesson’s review.

总结（15 分钟）： 挑选学生展示解答。讨论：“为什么溢出在实际计算机系统中是个问题？”联系到千年虫问题和阿丽亚娜 5 号火箭故障。离场券：每位学生写下一个溢出例子和一种避免方法（如使用更大寄存器）。收集以指导下节课的复习。

10. Differentiation and Assessment for Progress | 分层教学与促进进步的评估

A mixed-ability classroom requires thoughtful differentiation. Provide scaffolded worksheets with partially completed truth tables or skeleton code. Extend high-attainers with open-ended tasks: ‘Write a program that encrypts a string using a Caesar cipher without using built-in functions.’ For struggling students, use ‘I do, we do, you do’ modelling, and break problems into smaller steps. Program templates with comments indicating where to insert code can reduce cognitive load. Peer mentoring also proves highly effective; pair a confident coder with a less confident one for specific activities.

混合能力的班级需要周到的分层教学。提供带有部分已完成真值表或骨架代码的支架式练习纸。通过开放性任务拓展高水平学生：“编写一个不使用内置函数、用凯撒密码加密字符串的程序。”对于学习困难的学生，采用“我做，我们做，你做”的示范模式，并将问题拆分为更小的步骤。带有注释指示插入代码位置的程序模板可以减轻认知负荷。同伴指导也被证明非常有效；在特定活动中将自信的编程者与缺乏自信者配对。

Assessment for learning should be continuous and varied. Use diagnostic quizzes (e.g., Kahoot) at the start of topics to gauge prior knowledge. Embed hinge questions mid-lesson to check understanding before moving on. For programming, use rubric-based assessment of mini-projects, emphasising not just correctness but also design, efficiency, and explanation. Maintain a ‘computer science portfolio’ for each student, collecting their best pseudocode, code snippets, and reflections. This supports the Unit 3 NEA and provides revision material. Set weekly homework that mixes theory recap and a short coding puzzle. Timely feedback is crucial; use verbal feedback during lessons and written ‘next steps’ comments to guide improvement.

促进学习的评估应是持续且多样化的。在单元开始时使用诊断性测验（如 Kahoot）评估先前知识。在课中嵌入关键问题，以在继续教学前检查理解。对于编程，使用基于评分标准的迷你项目评估，不仅强调正确性，也重视设计、效率和解释。为每位学生维护一个“计算机科学作品集”，收集他们最佳的伪代码、代码片段和反思。这支持单元 3 NEA 并提供复习材料。每周布置结合理论回顾和一个简短编码谜题的作业。及时反馈至关重要；课堂上使用口头反馈，书面“下一步”评语引导改进。

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

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

Teaching Suggestions and Lesson Plan Sharing for Year 10 WJEC Computer Science | Year 10 WJEC 计算机：教师教学建议与教案分享