📚 Year 11 Edexcel Computer Science: Winter Holiday Intensive Revision Plan | Year 11 Edexcel 计算机：寒假强化复习计划
The winter holiday is a decisive window for Year 11 Edexcel Computer Science students. With mock exams behind you and the real GCSEs approaching, a well-structured two-week plan can turn fragmented knowledge into exam confidence. This guide provides a daily hour-by-hour blueprint covering every topic from the 1CP2 specification, blending theory recall with practical coding and past-paper application.
寒假是 Year 11 学生备战 Edexcel 计算机科学考试的关键黄金期。模拟考刚结束，真正的大考即将来临，一个结构清晰的复习计划能把零散的知识点转化成考场上的自信。这份指南提供了一份每天一小时的详细蓝图，覆盖 1CP2 考纲的每个主题，将理论回顾、编程实践与真题演练紧密结合。
1. Why a Holiday Plan Matters | 为什么需要寒假计划
Without a timetable, it is easy to waste days revising only the topics you already like. A structured plan forces you to rotate between problem‑solving, programming, theory, and exam technique, preventing burnout while exposing weak spots early. For Edexcel’s two externally assessed papers — Principles of Computer Science (Paper 1) and Application of Computational Thinking (Paper 2) — you need depth in algorithms and coding as well as factual recall.
没有时间表的话，很容易每天都在复习已经擅长的内容。一份结构化的计划能迫使你在问题求解、编程、理论和考试技巧之间轮换，避免倦怠的同时尽早发现薄弱环节。Edexcel 的两份外部考卷——计算机科学原理（试卷一）和计算思维应用（试卷二）——需要你在算法和编程上有深度理解，同时也要熟记事实性知识。
2. The 14‑Day Master Schedule | 十四天总体规划
Set aside 90 minutes each morning: 40 minutes for a focused topic, 30 minutes for hands‑on coding or trace tables, and 20 minutes for past‑paper questions. Alternate between Paper 1 and Paper 2 themes; for example, Day 1: Algorithms, Day 2: Data representation, Day 3: Programming fundamentals, Day 4: Networks, Day 5: Mixed exam practice. The last two days are reserved for full timed mock papers.
每天上午安排 90 分钟：40 分钟聚焦一个主题，30 分钟动手编程或画跟踪表，20 分钟做真题。试卷一和试卷二的主题交替进行；例如第一天算法，第二天数据表示，第三天编程基础，第四天网络，第五天综合练习。最后两天留给全套限时模拟卷。
3. Topic 1: Algorithms – Flowcharts, Pseudocode & Efficiency | 主题一：算法——流程图、伪代码与效率
Start by redrawing common flowcharts for linear search, binary search, bubble sort, and merge sort. Write the matching pseudocode and calculate time complexity using Big O notation (O(n), O(log n), O(n²)). Pay attention to the Edexcel pseudocode style — consistent indentation, meaningful variable names, and the use of INPUT, OUTPUT, WHILE…ENDWHILE.
从重画线性搜索、二分搜索、冒泡排序和归并排序的流程图开始。写出对应的伪代码，并用大 O 符号计算时间复杂度（O(n)、O(log n)、O(n²)）。注意 Edexcel 伪代码风格——缩进一致、变量名有意义、使用 INPUT、OUTPUT、WHILE…ENDWHILE 等关键字。
4. Topic 2: Programming with Python – Data Structures & File Handling | 主题二：Python 编程——数据结构与文件处理
Code one‑dimensional and two‑dimensional arrays from scratch, performing insertion, deletion, and linear search. Implement dictionary and set operations for handling unique data. Revise file reading modes (‘r’, ‘w’, ‘a’) and write a complete program that reads CSV data into a 2D array, processes it, and writes results back. Always handle exceptions with try/except to prevent runtime crashes.
从零开始编写一维和二维数组，实现插入、删除和线性搜索。实现字典和集合操作来处理唯一数据。复习文件读取模式（’r’、’w’、’a’），编写一个完整程序，将 CSV 数据读入二维数组，处理后把结果写回文件。始终用 try/except 处理异常，防止程序崩溃。
5. Topic 3: Data Representation – Binary, Hex, Images & Sound | 主题三：数据表示——二进制、十六进制、图像和声音
Practice conversions by hand: denary to 8‑bit binary, binary to hexadecimal, and vice‑versa. Understand the effect of sample rate, bit depth, and colour depth on file size. Calculate uncompressed file sizes using: size = sample rate × bit depth × duration for sound, and size = width × height × colour depth for images. Remember that 1 byte = 8 bits, and use KiB (1024 bytes) not 1000.
动手练习转换：十进制转 8 位二进制、二进制转十六进制，反之亦然。理解采样率、位深度和颜色深度对文件大小的影响。计算未压缩文件大小：声音用 size = 采样率 × 位深度 × 时长，图像用 size = 宽度 × 高度 × 颜色深度。记住 1 字节 = 8 位，使用 KiB（1024 字节）而非 1000。
6. Topic 4: Computer Systems – Von Neumann, CPU & Storage | 主题四：计算机系统——冯·诺依曼、CPU 与存储
Redraw the Von Neumann architecture labelling MAR, MDR, PC, ACC, ALU, and CU. Explain the fetch‑decode‑execute cycle step by step. Compare RAM and ROM, volatile vs non‑volatile, and describe how virtual memory extends addressable space using the hard disk. Differentiate solid‑state, magnetic, and optical storage by durability, speed, and capacity.
重画冯·诺依曼体系结构，标注 MAR、MDR、PC、累加器、ALU 和控制单元。逐步解释取指－解码－执行周期。比较 RAM 和 ROM，易失性与非易失性，并描述虚拟内存如何借助硬盘扩展寻址空间。从耐用性、速度和容量上区分固态、磁性和光存储。
7. Topic 5: Networks – Topologies, Protocols & Layers | 主题五：网络——拓扑结构、协议与分层
Draw and compare star, mesh, and bus topologies, listing advantages and disadvantages. Memorise the TCP/IP four‑layer model (Application, Transport, Internet, Link) and the function of each layer. Focus on key protocols: HTTP/HTTPS, FTP, SMTP, POP/IMAP, and TCP/IP. Explain how packet switching works, including the role of routers and the reassembly process.
画出星型、网状和总线拓扑并比较优缺点。记住 TCP/IP 四层模型（应用层、传输层、互联网层、链路层）及各层功能。重点掌握关键协议：HTTP/HTTPS、FTP、SMTP、POP/IMAP 和 TCP/IP。解释分组交换的工作原理，包括路由器作用和重组过程。
8. Topic 6: Databases & SQL | 主题六：数据库与 SQL
Be confident with flat‑file vs relational databases, primary and foreign keys. Write SQL queries using SELECT, FROM, WHERE, ORDER BY, and JOIN. Create a small database of at least two tables in DB Browser for SQLite and run queries to return filtered records. Normalise data to third normal form (3NF) to avoid redundancy.
熟练掌握平面文件与关系型数据库的区别，主键和外键。使用 SELECT、FROM、WHERE、ORDER BY 和 JOIN 编写 SQL 查询。在 DB Browser for SQLite 中创建一个至少有两张表的小型数据库，运行查询返回筛选后的记录。将数据规范化为第三范式（3NF）以避免冗余。
9. Topic 7: Ethical, Legal & Environmental Issues | 主题七：伦理、法律与环境问题
Link real‑world cases to the Data Protection Act 2018, Computer Misuse Act 1990, and Copyright, Designs and Patents Act. Discuss the privacy implications of location tracking, social media data harvesting, and facial recognition. Evaluate the environmental impact of data centres, e‑waste, and the digital divide. Use the ‘stakeholder’ lens: how does technology affect users, developers, and society?
将真实案例与《2018 数据保护法》、《1990 计算机滥用法》和《版权、设计和专利法》联系起来。讨论位置追踪、社交媒体数据采集和人脸识别对隐私的影响。评估数据中心、电子废弃物和数字鸿沟的环境影响。用“利益相关者”视角分析：技术如何影响用户、开发者和社会？
10. Exam Technique & Timed Practice | 考试技巧与限时练习
Paper 1 (1h 30m, 75 marks) demands precise definitions and short answers; use the ‘point, explain, example’ structure for 6‑mark questions. Paper 2 (2h, 75 marks) involves an on‑screen coding task in Python; save frequently, comment your code, and test boundary inputs. In the last 20 minutes of each exam, review spelling of keywords and check all bullet points are addressed.
试卷一（1 小时 30 分钟，75 分）要求精准的定义和简答；6 分题采用“观点—解释—举例”结构。试卷二（2 小时，75 分）含屏幕编程任务；记得常保存、加注释并测试边界输入。每场考试的最后 20 分钟，检查关键字拼写并确认所有要点都已回答。
11. Recommended Resources & Tools | 推荐资源与工具
Download the official Edexcel 1CP2 specification and the Python 3 reference sheet. Use Isaac Computer Science for algorithm simulations, Craig’n’Dave videos on YouTube for concept animations, and Seneca for quick‑fire retrieval quizzes. Create flashcards with key definitions on one side and examples on the reverse; review them daily during breakfast.
下载 Edexcel 1CP2 官方考纲和 Python 3 参考表。使用 Isaac Computer Science 练习算法模拟、YouTube 上的 Craig’n’Dave 视频帮助理解概念动画、Seneca 进行快速检索测验。制作闪卡，正面写关键定义，反面写示例；每天早餐时复习一次。
12. Staying Motivated & Tracking Progress | 保持动力与追踪进度
At the end of each day, tick off completed topics on a checklist and write one sentence about what you learned. Set small rewards after finishing three days of consistent revision — a favourite snack or a short gaming break. If you feel stuck, switch to a different format: explain a topic aloud to a family member or record a voice note. Progress, not perfection, is the goal.
每天结束时，在清单上勾选已完成主题，并写一句学到了什么。连续三天坚持复习后给自己小奖励——喜欢的零食或短暂的游戏休息。如果卡住了，就换一种方式：向家人大声讲解某个主题或录一段语音笔记。目标是进步，而非完美。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导