📚 Teaching Strategies and Lesson Plans for WJEC Year 11 Computer Science | WJEC Year 11 计算机：教师教学建议与教案分享
Teaching Year 11 Computer Science under the WJEC specification presents a unique blend of bridging fundamental concepts and preparing students for linear examinations. The final GCSE year demands focused delivery of computational thinking, practical programming, and theoretical knowledge, all while nurturing problem-solving confidence. This article offers actionable teaching suggestions, classroom-tested lesson structures, and a detailed sample lesson plan to support educators in crafting an effective and engaging curriculum.
在 WJEC 考试局规范下教授 Year 11 计算机科学，既要巩固基础概念，又要为线性考试做好冲刺准备。这一年不仅需要系统讲授计算思维、编程实践和理论知识，还要培养学生的解题信心。本文提供可落地的教学建议、课堂验证过的教案结构以及一份详实的教案示例，帮助教师打造高效又引人入胜的教学计划。
1. Unpacking the WJEC GCSE Specification | 解析 WJEC GCSE 规范
Begin by mapping every topic from Component 1 (Understanding Computer Science) and Component 2 (Computational Thinking and Programming) onto a topic tracker. WJEC emphasises applied knowledge, so theoretical concepts such as binary logic must be linked directly to practical contexts like truth tables for simple circuits. Create a specification audit document that highlights command words—'describe', 'explain', 'compare'—and share it with students so they understand exactly what each question demands.
建议先将 Component 1（理解计算机科学）和 Component 2（计算思维与编程）中的每一个知识点都落到一张主题跟踪表上。WJEC 注重知识应用，因此像二进制逻辑这样的理论概念必须与真值表、简单电路等实际情境直接挂钩。制作一份标注了指令词——“描述”“解释”“比较”——的规范审核文件并共享给学生，让他们清楚每种题目要求的确切含义。
Pay close attention to the non-exam assessment (NEA) requirements if still relevant in your cohorts, but note that WJEC has shifted towards an on-screen programming exam. Familiarise yourself with the greenfoot or Python environment guidelines and ensure your scheme of work builds regular keyboard-coding fluency, not just algorithm tracing on paper.
如果学年中还涉及非考试评估，需要密切关注其要求。但请注意 WJEC 已转向在屏编程考试，所以要熟悉 Greenfoot 或 Python 环境指南，并在教学计划中安排规律性的上机编程练习，而不仅仅是纸上追踪算法。
2. Long-Term Planning and Schemes of Work | 长期规划与教学方案
Design a spiral curriculum where the five core areas—data representation, computer systems, networks, databases, and programming—reappear at increasing levels of depth. For Year 11, the first term can consolidate knowledge through interleaved topics: teach hardware and memory alongside low-level data representation, then transition into high-level programming constructs with trace tables integrated into every lesson.
设计螺旋式课程，让数据表示、计算机系统、网络、数据库和编程这五大核心领域以不断加深的层次反复出现。在 Year 11，第一学期就可以通过交叉主题来巩固知识：先结合底层数据表示讲授硬件与存储器，然后过渡到高级编程结构，并在每节课中融入追踪表练习。
Provide a one-page scheme of work overview for students that includes weekly learning objectives, key vocabulary, and a self-assessment column. This transparency has been shown to increase engagement, particularly when pupils tick off objectives and note their own confidence levels.
为学生提供一份一页纸的教学方案概览，包含每周学习目标、关键词汇和自我评估栏。这种透明度已被证实可以提高参与度，尤其是当学生勾选目标并记录自己的信心水平时。
| Week | Topic | Key Activity | Self-Assessment |
|---|---|---|---|
| 1 | Boolean Logic & Truth Tables | Create logic circuits in simulator | Confident / OK / Need help |
| 2 | Data Units & Binary Addition | Binary addition with overflow | Confident / OK / Need help |
3. Teaching Computational Thinking and Algorithms | 计算思维与算法教学
Make abstract algorithm concepts concrete by using physical unplugged activities before writing code. For linear search, have students line up with numbered cards and pass a target value down the line; for bubble sort, let them physically swap positions. Only then move to pseudocode and Python implementation, always relating back to the kinaesthetic experience.
在编写代码之前，通过不插电的动手活动让抽象算法概念具体化。讲线性搜索时，让学生手持数字卡片站成一排，依次传递目标值；讲冒泡排序时，让他们亲身体验位置交换。之后再切入伪代码和 Python 实现，始终回到动觉体验上加以解释。
Introduce the 'decomposition – pattern recognition – abstraction – algorithm' cycle as a checklist for solving any problem. Display this as a permanent poster in the classroom and require students to justify their solutions using these four terms. When walking through exam questions, explicitly label each step of the cycle to embed computational thinking vocabulary.
将“分解–模式识别–抽象–算法设计”这一循环作为解决所有问题的清单。在教室内永久展示这张海报，并要求学生用这四个术语来论证自己的解法。在讲解考题时，明确标注循环中的每一步，以渗透计算思维词汇。
For WJEC papers that ask students to complete or correct an algorithm, train them to sketch a quick trace table before ticking the solution. Use a consistent layout: columns for variables, conditions, and output. This habit drastically reduces careless errors in Section B.
对于 WJEC 试卷中要求学生补全或修正算法的题目，训练他们在作答前先快速画出追踪表。使用统一布局：变量列、条件列、输出列。这一习惯能极大减少 Section B 中的粗心错误。
4. Effective Programming Lessons in Python | 高效的 Python 编程教学
Adopt a 'predict – run – investigate – modify – make' (PRIMM) model so that students first read and trace existing code before writing their own. Supply partially completed programs with deliberate bugs: pupils predict the output, run the code, investigate discrepancies, then modify it to achieve a new goal. This builds resilience and debugging skills essential for the on-screen exam.
采用“预测–运行–探究–修改–创作”（PRIMM）模式，让学生在动手编写前先阅读并追踪已有代码。提供带有故意植入错误的半成品程序：学生先预测输出结果，运行代码，探究差异，再修改代码以达成新目标。这能培养韧性以及上机考试必备的调试技能。
Embed string slicing, file handling, and list operations into small weekly challenges rather than treating them as isolated chapters. For example, a mini-project 'Morse code translator' nicely consolidates dictionaries, iteration, and string concatenation while linking to data representation topics.
将字符串切片、文件处理和列表操作融入每周的小型挑战中，而不是作为独立章节讲授。例如，“摩斯密码翻译器”这个迷你项目可以很好地综合字典、迭代和字符串拼接，同时还能联系数据表示主题。
Always demonstrate the use of meaningful variable names and comments by modelling good practice yourself when live-coding. Dedicate one lesson specifically to reading and annotating WJEC pseudocode so that students become fluent in translating between pseudocode and Python, as the exam may present algorithms in either form.
在实时编写代码时，教师自己要以身作则，示范如何使用有意义的变量名和注释。专门安排一节课用于阅读和注释 WJEC 伪代码，让学生熟练地在伪代码和 Python 之间互译，因为考试可能以任一形式呈现算法。
5. Data Representation: Making Abstract Concrete | 数据表示：将抽象具象化
decimal and nibbles (4-bit groups) so students can convert quickly without rote memorisation. For binary addition, introduce the 'carry' concept using decimal addition analogies: 9+1 = 0 carry 1.
使用位值表、翻牌卡和二进制灯介绍二进制、十进制和十六进制之间的转换。强调十六进制与半字节（4 位组）之间的关联，让学生不必死记硬背就能快速转换。讲二进制加法时，通过类比十进制加法引入“进位”概念：9+1 得 0 进 1。
Binary shifts (Logical left/right, Arithmetic right) often confuse learners. Draw a shift register diagram on the board and walk through examples like 00101100₂ shifted left twice → 10110000₂, explicitly pointing out the effect on the value (multiply by 2² for left shift). Provide practice that combines shifts with binary addition overflows.
二进制移位（逻辑左移/右移、算术右移）常让学生困惑。在黑板上画出移位寄存器图，并逐步讲解示例，如 00101100₂ 左移两位 → 10110000₂，明确指出对数值的影响（左移一位相当于乘以2）。提供结合移位与二进制加法溢出的综合练习。
For image and sound representation, use free tools like bitmap pixel editors where students can view hex colour values. Calculate file sizes repeatedly using the formula file size = resolution × colour depth for images and sample rate × bit depth × duration for sound, with all units clearly shown.
对于图像和声音表示，使用位图像素编辑器等免费工具，学生可以查看十六进制颜色值。反复使用公式 文件大小 = 分辨率 × 颜色深度（图像）和 采样率 × 采样深度 × 时长（声音）进行计算，并清晰展示所有单位。
6. Computer Hardware and Architecture | 计算机硬件与体系结构
Create a large, interactive diagram of the Von Neumann architecture with removable labels for MAR, MDR, PC, ACC, CU, and ALU. Students can physically place the labels while describing the fetch-decode-execute cycle. This kinaesthetic approach solidifies the roles of each register far better than a static diagram.
制作一张可交互的大型冯·诺依曼体系结构图，上面的标签（MAR、MDR、PC、ACC、CU、ALU）可以取下。学生一边描述取指–译码–执行周期，一边将标签贴到对应位置。这种动觉方法远比静态图表更能巩固各寄存器的功能。
When discussing factors affecting CPU performance—clock speed, cache size, number of cores—use accessible analogies: one chef (core) chopping vegetables faster (clock speed) versus two chefs working in parallel. Have students evaluate the trade-offs for different scenarios to prepare for 'discuss' questions.
在探讨影响 CPU 性能的因素——时钟频率、缓存大小、核心数量时，使用通俗的类比：一位厨师（核心）更快地切菜（时钟频率），对比两位厨师并行工作。让学生评估不同场景下的权衡，为回答“讨论”类问题做好准备。
Secondary storage comparisons must be exact: optical, magnetic, solid-state with characteristics of capacity, speed, portability, durability, and cost. Give each group a storage type and ask them to argue why it is best for a given scenario (e.g. game console, cloud data centre). This peer-teaching method deepens retention.
辅助存储器的对比必须精确：光学、磁性和固态，涵盖容量、速度、便携性、耐用性和成本等特性。给每个小组分配一种存储器，然后让他们论证为何其最适合特定场景（例如游戏主机、云数据中心）。这种同伴教学法能加深记忆。
7. Networks and Network Security | 网络与网络安全
Teach networks using both top-down (Internet – LAN – topology) and bottom-up (packet switching, protocols) approaches. Use Wireshark demonstrations to show live packets and let students identify source/destination IP addresses, reinforcing the concept of packet switching. Pairs well with encryption lessons when students observe plaintext versus ciphertext.
采用由顶至下（互联网–局域网–拓扑）和由底至上（分组交换、协议）两种方式教授网络知识。利用 Wireshark 演示实时数据包，让学生识别源/目的 IP 地址，从而强化分组交换概念。当学生观察到明文与密文的区别时，可与加密课程完美衔接。
Protocol layering (TCP/IP four-layer model) can be made memorable using a postal analogy: application layer is the letter content, transport layer is the envelope with port numbers, internet layer is the address, and link layer is the postal van. Have students match protocols (HTTP, TCP, IP, Ethernet) to the correct layers on a printed worksheet.
使用邮政系统类比来帮助记忆协议分层（TCP/IP 四层模型）：应用层是信件内容，传输层是写有端口号的信封，网络层是地址，链路层是邮车。让学生在一张纸质工作表上将协议（HTTP、TCP、IP、Ethernet）匹配到正确的层次。
For network security, focus on identifying threats (malware, phishing, brute force, DoS) and matching them to prevention methods. Use scenario cards: “A company finds unknown devices connected to their wireless network”—what threat and what mitigation? This format aligns with WJEC’s application-focused style.
网络安全部分，重在识别威胁（恶意软件、网络钓鱼、暴力破解、拒绝服务攻击）并匹配相应的防范措施。使用情景卡片：“某公司发现未知设备连入了他们的无线网络”——这属于何种威胁？如何缓解？这种形式与 WJEC 注重应用的风向一致。
8. Databases and SQL for Problem Solving | 数据库与 SQL 问题解决
Move beyond simple SELECT-FROM-WHERE. Provide datasets (e.g. a ‘Students’ table with fields: StudentID, Name, Year, House, Points) and ask progressively complex queries: sorting with ORDER BY, filtering multiple conditions with AND/OR, and using wildcards with LIKE. Students can first write the SQL on paper, then execute in a sandbox like DB Fiddle.
不要仅仅停留在简单的 SELECT-FROM-WHERE 上。提供数据集（如“Students”表，字段：StudentID, Name, Year, House, Points），并提出逐步复杂的查询要求：使用 ORDER BY 排序、用 AND/OR 进行多条件筛选、使用 LIKE 配合通配符。学生可以先在纸上编写 SQL，再在 DB Fiddle 等沙盒环境中执行。
Teach the design process: flat-file problems leading to relational databases. Demonstrate anomalies (insert, delete, update) with a flawed single table, then normalise it into two linked tables. Emphasise primary and foreign keys using real-world analogies like library books and borrowers.
教授设计流程：先展示平面文件数据库存在的问题，再引入关系型数据库。用一个设计不当的单表演示异常现象（插入、删除、更新异常），然后将其规范化为两张关联表。用图书馆书籍与借阅者的真实类比强调主键和外键的作用。
tudents must be able to interpret SQL results and identify errors in a given query. Design ‘spot the mistake’ starters where a query is missing quote marks or uses '=' instead of 'LIKE' for patterns, training a critical eye for syntax.
考试要求学生能解读 SQL 结果并找出给定查询中的错误。设计“找茬”式课堂启动练习，其中查询可能缺少引号或在模糊匹配时误用了“=”而非“LIKE”，以此训练学生对语法的敏锐眼力。
9. Ethical, Legal and Environmental Impacts | 伦理、法律与环境影响
Structure this topic around real case studies: GDPR fines, the Computer Misuse Act prosecutions, and e-waste statistics. Create a debate framework where small groups research a specific technology (facial recognition, cryptocurrency, AI hiring tools) and present arguments covering ethical concerns, relevant legislation, and environmental footprint.
围绕真实案例组织教学：GDPR 罚款、违反《计算机滥用法》的起诉案件以及电子废弃物统计数据。建立一个辩论框架，让各小组研究一项特定技术（人脸识别、加密货币、人工智能招聘工具），并围绕伦理关切、相关立法和环境足迹进行论证发言。
Students often mix up the Data Protection Act and GDPR. Provide a concise comparison card: UK DPA 2018 enacts GDPR, with key principles including lawfulness, purpose limitation, data minimisation, and rights of data subjects. Have them match scenarios to specific principles to deepen application.
学生经常混淆《数据保护法》与 GDPR。提供一张简明对比卡：英国《2018 年数据保护法》实施 GDPR，关键原则包括合法、目的限制、数据最小化和数据主体权利等。让他们将情景与具体原则配对，深化应用能力。
Link environmental impact to hardware topics already taught: discuss the carbon footprint of data centres while revisiting cloud storage, and the energy consumption of proof-of-work cryptocurrencies. Encourage quantitative reasoning—calculate energy use per transaction and compare to traditional banking—to foster evaluative answers.
将环境影响与已讲授的硬件主题结合起来：在重温云存储时讨论数据中心的碳足迹，以及在教授工作量证明加密货币时讨论能耗。鼓励量化推理——计算每笔交易的能耗并与传统银行进行对比——以培养学生的评估性作答能力。
10. Formative Assessment and Feedback Loops | 形成性评估与反馈循环
Use mini whiteboards for hinge questions at the midpoint of every lesson. Ask a multiple-choice question targeting a common misconception (e.g. "Which of these is a valid binary shift for division? A) left shift 1, B) right shift 1, C) right shift 2"). Scan responses to decide whether to re-teach or move on.
每节课中途使用迷你白板进行关键转折点提问。提出一道针对常见迷思概念的选择题（例如，“下列哪一项是用于除法的有效二进制移位？A) 左移1位，B) 右移1位，C) 右移2位”）。浏览学生回答，以此决定是重新讲解还是继续推进。
Implement 'What Went Well' (WWW) and 'Even Better If' (EBI) comments on programming tasks, focusing on code readability, efficiency, and correctness. Provide time in the next lesson for dedicated improvement (DIRT) so feedback becomes a loop, not a dead end. Use a common coding rubric shared from the start.
在编程任务中实施“做得好的地方”（WWW）和“如果能这样就更好了”（EBI）的评语，重点关注代码的可读性、高效性和正确性。在下一节课中留出专门的改进时间（DIRT），让反馈形成闭环，而非流于形式。从学期初就公布统一的编程评分标准。
Build self-marking quizzes using Microsoft Forms or Google Forms that immediately show correct answers for retrieval practice. Include short answer fields where students explain why an answer is correct, which you can sample to gauge depth of understanding before the lesson.
利用 Microsoft Forms 或 Google Forms 构建自动批改的小测验，即时显示正确答案，用于提取练习。在其中加入简答题字段，要求学生解释答案为何正确，你可以在课前抽样查看，以评估学生的理解深度。
11. Differentiation and Inclusive Practice | 差异化教学与包容性实践
Prepare three-tiered worksheets for complex topics like binary addition or logic circuits: Bronze (scaffolded with step-by-step templates), Silver (standard practice), Gold (application in novel contexts). All students start at Silver and either move up to Gold or down to Bronze based on self-assessment.
为二进制加法或逻辑电路等复杂主题准备三层级工作表：铜级（带有分步模板的支架式练习）、银级（标准练习）、金级（新颖情境下的应用）。所有学生都从银级开始，然后根据自我评估情况向上或向下移动。
For students with literacy difficulties, provide glossaries with icons, sentence starters for 'explain' questions, and allow verbal explanations recorded on a voice note before committing to writing. Display keywords on the board in a consistent colour-coded format throughout the year.
针对读写困难的学生，提供附带图标的术语表、用于“解释”类问题的句式开头，并允许他们先以语音备忘录的方式口述解释，再落笔成文。全年在黑板上以统一的颜色编码格式展示关键词。
Stretch high achievers by assigning 'debugging challenges' or asking them to refactor a working program to use fewer lines of code without losing functionality. Pose extension questions that require evaluating the suitability of algorithms or ethical implications rather than just describing them.
通过布置“调试挑战”或要求他们将一个可运行的程序重构为更少的代码行（同时不丢失功能），来拓展学优生的能力。提出需要评估算法适用性或伦理性影响的拓展性问题，而非仅停留在描述层面。
12. Sample Lesson Plan: Bubble Sort and Insertion Sort | 教案示例：冒泡排序与插入排序
Lesson Title: Comparing and Implementing Sorting Algorithms
Lesson Duration: 60 minutes
Learning Objectives: By the end of this lesson, students will be able to: (1) describe how bubble sort and insertion sort work using plain English and pseudocode; (2) trace both algorithms correctly with a given list; (3) compare their efficiency in terms of passes and comparisons; (4) begin implementing one algorithm in Python.
教案标题：排序算法的比较与实现
课时：60 分钟
学习目标：学生能够：(1) 用简洁的中文和伪代码描述冒泡排序和插入排序的工作原理；(2) 用给定列表正确追踪两种算法；(3) 从比较次数和趟数角度比较它们的效率；(4) 开始用 Python 实现其中一种算法。
Starter (5 mins): Students receive shuffled number cards (6, 2, 9, 1, 5) and are asked to sort them physically on their desk. Teacher leads a brief discussion: 'How did you do it? Did you compare pairs or insert one at a time?' Write descriptive phrases on the board.
启动活动（5 分钟）：学生拿到打乱顺序的数字卡片（6, 2, 9, 1, 5），并需要在桌面上进行排序。教师引导简短讨论：“你是怎么做的？是两两比较还是逐一插入？”把学生使用的描述性短语写在黑板上。
Main Activity – Unplugged Modelling (15 mins): Eight volunteers stand in a line holding large numbers. For bubble sort, they pass down the line comparing and swapping. For insertion sort, one student steps out and is reinserted into the correct position. The class fills in trace tables on a handout as the movements happen. Explicitly count passes and comparisons.
主要活动——不插电建模（15 分钟）：八位志愿者手持大号数字站成一排。冒泡排序时，他们沿队伍传递、比较并交换位置。插入排序时，一名学生出列并被重新插入到正确位置。全班同学在队伍移动的同时于讲义上填写追踪表。明确统计趟数和比较次数。
Pseudocode to Python (20 mins): Students are given incomplete Python code for bubble sort with two deliberate errors (missing inner loop range and an incorrect comparison sign). In pairs, they predict output, run, investigate, and fix the code. High attainers are challenged to convert their corrected bubble sort into an insertion sort. Teacher circulates with targeted questioning: 'Why does the range(len(list)-1) keep decreasing?'
伪代码到 Python（20 分钟）：学生拿到一份不完整的冒泡排序 Python 代码，其中故意设置了两处错误（缺少内层循环的范围以及错误的比较符号）。两人一组，预测输出、运行、探究并修正代码。对于学优生，挑战他们将修正后的冒泡排序转化为插入排序。教师巡回并以精准提问进行引导：“为什么 range(len(list)-1) 一直在减少？”
Plenary (10 mins) – Comparing Efficiency: Display two completed trace tables (one per algorithm) and ask: 'Which algorithm required fewer passes for our list? Would the answer change if the list were nearly sorted?' Students write a short evaluative note on a sticky board. Collect these as exit tickets to inform next lesson on efficiency Big-O introduction.
总结环节（10 分钟）——比较效率：展示两张已完成的追踪表（每种算法一张），提问：“对于我们的列表，哪种算法需要的趟数更少？如果列表接近有序，答案是否会改变？”学生在便利贴上写下简短的评估性笔记。收集这些作为出口票证，以指导下节课关于效率与大 O 记法的引入。
Resources: Number cards, A3 trace table templates, Python editor, sticky notes, scaffolded code printouts. Differentiation: Bronze worksheet provides step-by-step trace prompts; Silver uses standard trace tables; Gold asks for independent algorithm comparison written in pseudocode.
教学资源：数字卡片、A3 大小追踪表模板、Python 编辑器、便利贴、带有支架的代码打印稿。差异化：铜级工作表提供分步追踪提示；银级使用标准追踪表；金级要求学生独立使用伪代码撰写算法比较。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图