📚 Year 13 AQA Computer Science: Winter Break Intensive Revision Plan | Year 13 AQA 计算机：寒假强化复习计划
The winter break is a golden opportunity for Year 13 students to consolidate knowledge and sharpen skills for the AQA Computer Science A-level. This plan provides a structured, intensive approach spanning three weeks, targeting both theoretical foundations and practical programming. By following this schedule, you can strengthen weak areas, master key algorithms, and build confidence for Paper 1, Paper 2, and your NEA project.
寒假是 Year 13 学生巩固知识、提升技能的黄金时期，尤其针对 AQA 计算机科学 A-level 课程。本计划提供一个结构化的、为期三周的强化复习方案，兼顾理论基础和编程实践。遵循本安排，你可以强化薄弱环节，掌握核心算法，并为 Paper 1、Paper 2 以及非考试项目 NEA 建立信心。
1. Setting Up Your Revision Blueprint | 制定你的复习蓝图
Before diving in, audit your current understanding: identify weak topics from mock exams or recent assessments. Gather all essential resources: AQA specification, past papers, your class notes, and a reliable textbook (e.g. Bob Reeves). Design a daily timetable of 4-6 hours with breaks, mixing theory, coding, and self-testing.
在投入复习前，先诊断你目前的理解：通过模拟考试或近期评估找出薄弱主题。收集所有必要资料：AQA 课程大纲、历年真题、课堂笔记和一本可靠的教科书（如 Bob Reeves 编写）。制定每天 4-6 小时的作息表，包含休息，并将理论学习、编程练习和自测混合编排。
Use active recall: instead of re-reading notes, test yourself with flashcards or write pseudocode from memory. Spaced repetition is key – review older material every third day. Keep a log of common mistakes from past papers.
运用主动回忆：不要反复阅读笔记，而是用抽认卡自测或凭记忆写出伪代码。间隔重复是关键——每三天重温一次先前学过的内容。为历年真题中的常见错误建立日志。
2. Week 1: Paper 1 Fundamentals and Data Structures | 第一周：Paper 1 基础与数据结构
Day 1: Revisit programming fundamentals – variables, selection, iteration, subroutines. Write pseudocode for a menu-driven program that uses all three constructs. Revise recursion: trace factorial and Fibonacci, and understand base case and stack frames.
第1天：重温编程基础——变量、选择、迭代、子程序。编写一个使用三种结构（顺序、选择、迭代）的菜单驱动程序的伪代码。复习递归：追踪阶乘和斐波那契数列的执行过程，理解基例和栈帧。
Day 2: Stacks and queues. Memorise push/pop for stacks and enqueue/dequeue for circular queues. Draw diagrams showing pointers (front, rear). Implement pseudocode for checking empty/full conditions.
第2天：栈与队列。记住栈的入栈/出栈操作和循环队列的入队/出队操作。画出显示指针（队首、队尾）的示意图。用伪代码实现检查空/满状态的条件。
Day 3: Trees and graphs. Revise binary tree traversals (pre-order, in-order, post-order) with examples. Learn adjacency matrix and adjacency list representations for graphs. Understand depth-first and breadth-first traversal without coding the whole algorithm.
第3天：树和图。通过例子复习二叉树遍历（前序、中序、后序）。学习图的邻接矩阵和邻接表表示法。理解深度优先和广度优先遍历，无需编写完整算法。
Day 4: Searching and sorting algorithms. Focus on binary search (iterative/recursive), bubble sort, insertion sort, and merge sort. Trace each algorithm on a small dataset and compare their Big O complexities.
第4天：查找与排序算法。重点复习二分查找（迭代/递归）、冒泡排序、插入排序和归并排序。在一个小数据集上追踪每种算法的执行过程，并比较大 O 复杂度。
Day 5: Algorithm analysis and computational thinking. Practise expressing time complexity with Big O notation. Solve problems that require stepwise refinement and identifying patterns. Work through typical AQA ‘dry run’ questions.
第5天：算法分析与计算思维。练习用大 O 表示法表达时间复杂度。解决需要通过逐步求精和识别模式求解的问题。完成典型的 AQA “走查”题目。
Day 6: Theory of computation. Revise finite state machines (with and without output), Turing machines, and the Halting Problem. Be able to draw state transition diagrams and explain the difference between regular and context-free languages.
第6天：计算理论。复习有限状态机（有/无输出）、图灵机和停机问题。能够绘制状态转换图，解释正则语言与上下文无关语言之间的区别。
Day 7: Recap and test. Complete one full Paper 1 mock under timed conditions (1 hour 45 minutes). Mark it with the official mark scheme and add errors to your mistake log.
第7天：回顾与测试。在限时条件下（1小时45分钟）完成一套完整的 Paper 1 模拟卷。用官方评分标准批改，并将错误添加到错题日志。
3. Week 2: Paper 2 Systems and Architecture | 第二周：Paper 2 系统与架构
Day 8: Computer organisation – the processor. Revise the fetch-decode-execute cycle, the roles of registers (MAR, MDR, PC, CIR, ACC), and how the control bus, address bus, and data bus work. Understand pipelining and potential hazards.
第8天：计算机组成——处理器。复习取指-译码-执行周期、各寄存器（MAR、MDR、PC、CIR、ACC）的作用，以及控制总线、地址总线和数据总线的工作原理。理解流水线及其潜在冒险。
Day 9: Addressing modes and assembly language. Study immediate, direct, indirect, and indexed addressing. Using a simple instruction set (e.g. LMC or AQA assembler), trace short programs and practise converting snippets.
第9天：寻址模式与汇编语言。学习立即、直接、间接和变址寻址。使用简单的指令集（如 LMC 或 AQA 汇编器），追踪简短程序，并练习转换代码片段。
Day 10: Data representation. Cover binary, two’s complement (negative integers), fixed-point and floating-point binary (mantissa/exponent). Revise Unicode, ASCII, and how bitmaps and sound are represented digitally. Practise binary arithmetic and normalisation.
第10天：数据表示。涵盖二进制、二进制补码（负整数）、定点和浮点二进制（尾数/指数）。复习 Unicode、ASCII 以及位图和声音的数字化表示方式。练习二进制运算和规范化。
Day 11: Communication and networking. Master the TCP/IP stack, protocol layers, socket addressing (IP address + port), NAT, DHCP, and the client-server model. Understand network topologies, CSMA/CD, and wireless network security (WPA2/WPA3).
第11天：通信与网络。掌握 TCP/IP 协议栈、协议分层、套接字寻址（IP 地址+端口）、NAT、DHCP 以及客户端-服务器模型。理解网络拓扑、CSMA/CD 以及无线网络安全（WPA2/WPA3）。
Day 12: Databases and SQL. Normalisation to 3NF, entity relationship diagrams, and SQL queries (SELECT, JOIN, GROUP BY, nested queries). Practise writing SQL for given scenarios and interpreting query results.
第12天：数据库与 SQL。规范化到第三范式（3NF）、实体关系图以及 SQL 查询（SELECT、JOIN、GROUP BY、嵌套查询）。根据给定场景练习编写 SQL，并解读查询结果。
Day 13: Big Data, functional programming, and ethical consequences. Big Data (volume, velocity, variety), functional programming (map, filter, fold, higher-order functions). Review the Data Protection Act, Computer Misuse Act, and moral/ethical impacts of computing.
第13天：大数据、函数式编程与伦理影响。大数据（容量、速度、多样性）、函数式编程（map、filter、fold、高阶函数）。复习《数据保护法》《计算机滥用法》以及计算技术的道德伦理影响。
Day 14: Paper 2 mock exam. Complete a full Paper 2 past paper (1 hour 45 minutes). Mark thoroughly, focusing on marker comments for longer questions. Add to your mistake log and note topics requiring deeper revision.
第14天：Paper 2 模拟考试。完成一套完整的 Paper 2 历年试卷（1小时45分钟）。仔细批改，聚焦于长问题的评分注释。添加到错题日志，并注明需要深入复习的主题。
4. Week 3: Programming Practice and NEA Refinement | 第三周：编程练习与 NEA 完善
Day 15: Object-oriented programming. Revise encapsulation, inheritance, polymorphism, and abstract classes. Write small programs in your chosen language (Python, C#, Java) that demonstrate class hierarchies and method overriding.
第15天：面向对象编程。复习封装、继承、多态和抽象类。用你选择的语言（Python、C#、Java）编写能展示类层次结构和方法重写的小程序。
Day 16: File handling, exceptions, and recursion in practice. Implement try-catch blocks, read from/write to text files, and handle I/O errors gracefully. Apply recursion to searching (binary search) and tree/graph problems.
第16天：文件处理、异常与递归实践。实现 try-catch 块，读写文本文件，并优雅地处理 I/O 错误。将递归应用于查找（二分查找）以及树/图问题。
Day 17: NEA code review. Re-read your project documentation against AQA marking criteria. Refactor messy code, add meaningful comments, and ensure all functionality matches the design. Test edge cases.
第17天：NEA 代码审查。对照 AQA 评分标准重新阅读项目文档。重构混乱的代码，添加有意义的注释，并确保所有功能与设计匹配。测试边界用例。
Day 18: NEA documentation. Polish the analysis, design, technical solution, and evaluation sections. Ensure your write-up explains algorithm choices and complexity. Check for correct use of diagrams (flowcharts, class diagrams, ERDs).
第18天：NEA 文档完善。润色分析、设计、技术解决方案和评估部分。确保你的阐述说明了算法选择和复杂度。检查图表使用是否正确（流程图、类图、ER 图）。
Day 19: Mixed-topic quick-fire revision. Use flashcards or a quiz app to test definitions, key acronyms, and syntax. Cover system software, translators (compiler vs interpreter), and virtual machines.
第19天：混合主题快速复习。使用抽认卡或测验应用测试定义、关键缩写和语法。涵盖系统软件、翻译器（编译器与解释器）以及虚拟机。
Day 20: Full A-level mock. Simulate exam conditions: Paper 1 in the morning, Paper 2 in the afternoon (or on separate days). Mark both, analyse weaknesses, and create a final priority list.
第20天：完整 A-level 模拟。模拟考试条件：上午 Paper 1，下午 Paper 2（或分天进行）。批改两份试卷，分析薄弱点，并制定最终优先复习清单。
Day 21: Light review and mental preparation. Briefly review the priority list and key formulas. Visualise exam day and plan time management. Rest and avoid cramming.
第21天：轻松回顾与心理准备。简要回顾优先清单和重要公式。想象考试当天的情景，规划时间管理。休息，避免死记硬背。
5. Deep Dive: Abstract Data Types (ADTs) | 深入探索：抽象数据类型
An ADT is defined by its behaviour (operations) rather than its implementation. In AQA, you must know stacks, queues, lists, trees, and graphs. Emphasise LIFO for stacks, FIFO for queues, and dynamic vs static allocation.
抽象数据类型（ADT）通过其行为（操作）而非实现方式来定义。在 AQA 中，你必须掌握栈、队列、列表、树和图。强调栈的后进先出（LIFO）、队列的先进先出（FIFO）以及动态与静态分配的区别。
For a stack implemented with an array, maintain a top pointer. Push increments top and stores; pop returns the element at top then decrements. Check overflow/underflow. For a circular queue, use front and rear pointers that wrap around; a counter or flag distinguishes full/empty states.
对于用数组实现的栈，维护一个栈顶指针。入栈时指针递增并存储数据；出栈时返回栈顶元素并将指针递减。检查上溢/下溢。对于循环队列，使用可环绕的队首和队尾指针；通过计数器或标志区分满/空状态。
Binary trees: a node has left and right child pointers. Pre-order visits root-left-right, in-order left-root-right, post-order left-right-root. Graphs can be traversed depth-first (stack-based) or breadth-first (queue-based).
二叉树：每个节点拥有左、右子指针。前序遍历顺序为根-左-右，中序为左-根-右，后序为左-右-根。图可以采用深度优先（基于栈）或广度优先（基于队列）遍历。
6. Deep Dive: Object-Oriented Programming | 深入探索：面向对象编程
Encapsulation bundles data and methods, hiding internal state and exposing an interface. In your A-level code, use private attributes with public getters/setters. Inheritance creates ‘is-a’ relationships; a subclass extends a superclass, inheriting its members. Polymorphism allows a subclass to override a method, and a reference variable of the superclass type can point to subclass objects.
封装将数据和方法捆绑在一起，隐藏内部状态并暴露接口。在 A-level 代码中，使用私有属性和公共的 getter/setter。继承创建“is-a”关系；子类扩展父类，继承其成员。多态允许子类重写方法，且父类类型的引用变量可以指向子类对象。
Abstract classes cannot be instantiated; they define signatures for subclasses to implement. UML class diagrams help visualise relationships: note aggregation (empty diamond) and composition (filled diamond). Practise by modelling a library system or a game inventory.
抽象类不能被实例化；它定义子类需要实现的签名。UML 类图有助于可视化这些关系：注意聚合（空心菱形）和组合（实心菱形）。通过为图书馆系统或游戏库存建模来练习。
7. Computer Organisation and Architecture | 计算机组成与体系结构
The fetch-decode-execute cycle: PC → MAR (address) → memory → MDR (instruction) → CIR → decode → execute. Understand how the ALU, CU, and registers interact. Pipelining increases throughput by overlapping stages, but hazards (data, structural, control) may stall the pipeline.
取指-译码-执行周期：PC → MAR（地址）→ 内存 → MDR（指令）→ CIR → 译码 → 执行。理解 ALU、CU 和寄存器之间的交互。流水线通过重叠各阶段提高吞吐量，但冒险（数据、结构、控制）可能导致流水线停顿。
Buses: the control bus sends timing and status signals, the address bus carries memory/I/O addresses, and the data bus transfers actual data. The width of the address bus determines addressable memory (2ⁿ addresses for n lines).
总线：控制总线发送时序和状态信号，地址总线传输内存/I/O 地址，数据总线传输实际数据。地址总线的宽度决定了可寻址内存大小（n 条线对应 2ⁿ 个地址）。
Assembly language: using mnemonics like LDA, STA, ADD, SUB, BRZ, BRP. Immediate addressing (#5), direct (5), indirect (reference to a pointer), and indexed (base + offset). Trace programs by updating register and memory contents step by step.
汇编语言：使用助记符，如 LDA、STA、ADD、SUB、BRZ、BRP。寻址模式包括立即寻址（#5）、直接寻址（5）、间接寻址（指针）和变址寻址（基址+偏移量）。通过逐步更新寄存器和内存内容来追踪程序。
8. Communication and Networking | 通信与网络
The TCP/IP model: Application (HTTP, FTP, SMTP), Transport (TCP, UDP), Internet (IP), and Network Access (Ethernet, Wi-Fi). TCP ensures reliable, ordered delivery using sequence numbers and acknowledgements. UDP is connectionless and faster, used for streaming.
TCP/IP 模型：应用层（HTTP、FTP、SMTP）、传输层（TCP、UDP）、网络层（IP）和网络访问层（以太网、Wi-Fi）。TCP 通过序列号和确认机制确保可靠、有序的传输。UDP 是无连接的且更快，用于流媒体。
IP addresses (IPv4 and IPv6), subnet masking, and routing. NAT translates private IPs to a public one for internet access. DHCP dynamically assigns IP configuration. In wireless networks, WPA2/WPA3 provide encryption and authentication; know the handshake process.
IP 地址（IPv4 和 IPv6）、子网掩码和路由。NAT 将私有 IP 转换为公有 IP 以便上网。DHCP 动态分配 IP 配置。在无线网络中，WPA2/WPA3 提供加密和认证；应了解握手过程。
Network security: firewalls filter packets based on rules, symmetric and asymmetric encryption, and digital signatures. Revise man-in-the-middle attacks and how HTTPS (TLS/SSL) mitigates them.
网络安全：防火墙根据规则过滤数据包，对称与非对称加密，以及数字签名。复习中间人攻击以及 HTTPS（TLS/SSL）如何缓解这种攻击。
9. Algorithm Efficiency and Big O Notation | 算法效率与大 O 表示法
Big O expresses the worst-case time complexity of an algorithm. It ignores constants and lower-order terms,
Published by TutorHao | Year 13 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导