📚 Year 12 AQA Computer Science: Christmas Intensive Revision Plan | AQA 计算机 Year 12 寒假强化复习计划
The Christmas break offers a vital window for Year 12 students to consolidate first-term AQA Computer Science content. This intensive plan structures your revision across all core topics, helping you build deep understanding, sharpen problem-solving skills, and return in January fully prepared for the second half of the course.
寒假为 Year 12 学生提供了巩固第一学期 AQA 计算机科学内容的重要窗口。这份强化复习计划将为你梳理所有核心主题，帮助构建深度理解、锻炼解决问题的能力，并在1月份返回课堂时充分准备好迎接课程后半段的学习。
1. Setting Goals and Planning Your Time | 设定目标与时间规划
Begin by mapping out a realistic timetable for the entire break. Plan 2-3 hours of focused study per day, with one full day off each week to recharge. Divide the available days across all Year 12 units: programming fundamentals, data structures, algorithms, theory of computation, data representation, computer systems, networking, databases, and consequences of computing.
首先为整个假期制定一个切实可行的时间表。每天安排2-3小时专注学习，每周休息一整天以恢复精力。将可用天数分配给所有 Year 12 单元：编程基础、数据结构、算法、计算理论、数据表示、计算机系统、网络、数据库以及计算机的社会影响。
In each session, mix theory review with active problem-solving. Start by reading your class notes or textbook summaries, then immediately apply the ideas through writing pseudocode, drawing circuit diagrams, or explaining concepts out loud. Finish every topic block by answering at least two past paper questions from the AQA AS 7516 specification. Keep a revision log to record mistakes and track improvements over the holiday.
每次复习环节要将理论回顾与主动解决问题的训练相结合。先阅读课堂笔记或教材摘要，然后立即通过编写伪代码、绘制电路图或大声解释概念来应用这些想法。每完成一个主题模块，至少解答两道来自 AQA AS 7516 考纲的历年真题。保持一本复习日志，记录错误并跟踪假期中的进步。
2. Programming Fundamentals: Sequence, Selection, Iteration, Subroutines | 编程基础：顺序、选择、迭代与子程序
Revisit the building blocks of structured programming. Ensure you can write correct pseudocode using sequence, selection (IF...THEN...ELSE...ENDIF), and iteration (FOR, WHILE, REPEAT...UNTIL). Practice translating simple problems into clear steps and algorithms, paying attention to correct indentation and logical flow.
重温结构化编程的基本构件。确保能够使用顺序、选择（IF...THEN...ELSE...ENDIF）和迭代（FOR, WHILE, REPEAT...UNTIL）编写正确的伪代码。练习将简单问题转化为清晰的步骤与算法，并注意正确的缩进和逻辑流。
Deepen your understanding of subroutines: the difference between procedures and functions, use of parameters, and passing arguments by value or by reference. Write a small program that uses both a procedure to display a menu and a function to calculate a result, then trace its execution manually.
加深对子程序的理解：过程与函数的区别、参数的使用、按值传递与按引用传递参数。编写一个同时使用过程显示菜单和函数计算结果的小程序，然后手动追踪其执行过程。
Also revisit data types (integer, real/float, Boolean, character, string) and standard arithmetic, relational, and Boolean operators. Construct truth tables for compound conditions and apply De Morgan's laws when simplifying logic.
还要重温数据类型（整型、实型/浮点型、布尔型、字符型、字符串）以及标准的算术、关系和布尔运算符。构建复合条件的真值表，并在简化逻辑时应用德摩根定律。
3. Object-Oriented Programming: Classes, Inheritance, Polymorphism | 面向对象编程：类、继承与多态
AQA often asks about the principles of OOP. Make sure you can define a class with attributes and methods, create objects from a class, and explain encapsulation, inheritance, and polymorphism using concrete examples. Draw simple UML-style class diagrams to show relationships.
AQA 常考面向对象编程的原理。确保你能够定义一个带有属性和方法的类，从类创建对象，并用具体例子解释封装、继承和多态。绘制简单的 UML 风格类图来展示关系。
Write pseudocode for a base class 'Vehicle' and a derived class 'Car' that inherits from it. Override a method to demonstrate polymorphism. Identify where private, public, and protected access modifiers would be used. Revise constructor methods and the 'self' or 'this' keyword.
为基类 'Vehicle' 和继承自它的派生类 'Car' 编写伪代码。重写一个方法以演示多态。辨识私有、公共和受保护访问修饰符的使用场景。复习构造方法以及 'self' 或 'this' 关键字。
Practise exam-style questions that ask you to compare aggregation vs composition, or to design classes for a given scenario such as a library management or a game character system.
练习考试风格的题目，例如比较聚合与组合，或为给定的场景（如图书管理或游戏角色系统）设计类。
4. Data Structures: Arrays, Lists, Records, and Files | 数据结构：数组、列表、记录与文件
Review fixed-size and dynamic data structures. Understand the properties of one- and two-dimensional arrays, lists (ordered and unordered), and records (structs). Be able to declare, initialise, and traverse these structures in pseudocode, and identify when each is most appropriate.
复习定长和动态数据结构。理解一维和二维数组、列表（有序和无序）以及记录（结构体）的特性。能够在伪代码中声明、初始化和遍历这些结构，并判断何时使用哪种最合适。
Practise algorithms that use arrays to store and process collections of data, such as finding minimum/maximum, calculating averages, and performing linear searches. Show how a list can grow dynamically, and contrast this with the static nature of an array.
练习使用数组存储和处理数据集合的算法，例如查找最小值/最大值、计算平均值和执行线性搜索。展示列表如何动态增长，并对比数组的静态特性。
File handling is essential: revise opening and closing files, reading lines, and writing data. Work through examples where a record structure is saved to a text file or a binary file, and consider the differences in file access (sequential vs random).
文件处理至关重要：复习打开和关闭文件、读取行和写入数据。演练将记录结构保存到文本文件或二进制文件中的例子，并考虑文件访问方式的差异（顺序访问与随机访问）。
5. Abstract Data Types: Stacks, Queues, Trees, and Graphs | 抽象数据类型：栈、队列、树和图
Study stacks and queues alongside their operations: push/pop/top for stacks; enqueue/dequeue/front for circular and linear queues. Know how these ADTs can be implemented using arrays or linked lists, and how to detect overflow and underflow conditions.
学习栈和队列及其操作：栈的 push/pop/top；循环队列和线性队列的 enqueue/dequeue/front。了解如何用数组或链表实现这些抽象数据类型，以及如何检测溢出和下溢条件。
Move on to trees: binary trees, binary search trees (BSTs). Be able to construct a BST from a list of values, perform in-order, pre-order, and post-order traversals, and write recursive tree algorithms. Understand that inorder traversal of a BST yields sorted output.
接着学习树：二叉树、二叉搜索树（BST）。能够从一组值构建 BST，执行中序、前序和后序遍历，并编写递归树算法。理解 BST 的中序遍历会产生有序输出。
For graphs, study adjacency matrices and adjacency lists. Practise breadth-first and depth-first traversals on a given graph. Devise simple path-finding applications and know where graphs are used in real systems (social networks, maps).
对于图，学习邻接矩阵和邻接表。练习在给定图上执行广度优先和深度优先遍历。设计简单的寻路应用，并了解图在实际系统中的应用（社交网络、地图）。
6. Searching and Sorting Algorithms | 搜索与排序算法
Master the two classic searching algorithms: linear search and binary search. Be able to write full pseudocode for both, explain their time complexities (O(n) for linear, O(log n) for binary), and identify the prerequisite that binary search requires a sorted list.
掌握两种经典搜索算法：线性搜索和二分搜索。能够为这两种算法编写完整的伪代码，解释它们的时间复杂度（线性 O(n)，二分 O(log n)），并指出二分搜索要求列表已排序的前提。
For sorting, concentrate on bubble sort, insertion sort, and merge sort (or quick sort as an alternative). Practise hand-tracing each sort on a small dataset, counting the number of comparisons and swaps. State their worst-case and average time complexities: bubble and insertion O(n²), merge O(n log n).
对于排序，重点学习冒泡排序、插入排序和归并排序（或使用快速排序作为替代）。练习在小型数据集上手动追踪每种排序，统计比较和交换次数。说明它们的最坏情况和平均时间复杂度：冒泡和插入 O(n²)，归并 O(n log n)。
Compare the efficiency of these algorithms in terms of space and time, and discuss which is most suitable for already-sorted or nearly-sorted data. Recognise stable vs unstable sorting if relevant to your specification.
比较这些算法在空间和时间上的效率，并讨论哪种最适合已经排序或接近排序的数据。如果考纲相关，辨别稳定排序与不稳定排序。
7. Theory of Computation: FSMs, Regular Expressions, and Turing Machines | 计算理论：有限状态机、正则表达式与图灵机
Construct deterministic finite state machines (FSMs) with given input and output conditions. Draw state transition diagrams for scenarios like a vending machine or light control. To revise, pick past paper tasks and design FSMs that accept or reject strings.
根据给定的输入输出条件构建确定型有限状态机（FSM）。为自动售货机或灯光控制等场景绘制状态转换图。复习时，挑选历年真题任务，设计接受或拒绝字符串的 FSM。
Learn regular expressions: understand the notation including *, +, ?, |, and brackets for grouping. Be able to write a regex to describe a set of strings (e.g., binary strings ending in '00') and conversely interpret a given regex. Study the relationship between regular expressions and FSMs.
学习正则表达式：理解符号表示法，包括 *、+、?、| 以及用于分组的括号。能够编写正则表达式来描述一组字符串（例如以 '00' 结尾的二进制串），并反过来解释给定的正则表达式。学习正则表达式与 FSM 之间的关系。
Finally, cover the concept of the Turing machine as an abstract model of computation. Explain its components (tape, head, state register, transition function) and why it is used to define what is computable. Although AQA Year 12 may not ask for complex implementations, you should be able to trace a simple TM and understand the Halting Problem conceptually.
最后，学习图灵机作为抽象计算模型的概念。解释其组成部分（纸带、读写头、状态寄存器、转移函数），以及为什么用它来定义可计算性。尽管 AQA Year 12 可能不要求复杂实现，但应能追踪一个简单的图灵机并从概念上理解停机问题。
8. Data Representation: Binary, Hexadecimal, and Character Sets | 数据表示：二进制、十六进制与字符集
Solidify your ability to convert between denary, binary, and hexadecimal. Practise unsigned and signed representations (sign-magnitude vs two's complement). Be able to perform binary addition and handle overflow. Know the ranges for n bits, e.g., unsigned n-bit range 0 to 2ⁿ-1, two's complement -2ⁿ⁻¹ to 2ⁿ⁻¹-1.
巩固十进制、二进制和十六进制之间转换的能力。练习无符号和有符号表示法（原码与补码）。能够进行二进制加法并处理溢出。了解 n 位二进制能表示的范围，例如无符号 n 位范围 0 到 2ⁿ-1，补码表示 -2ⁿ⁻¹ 到 2ⁿ⁻¹-1。
Revise character coding: ASCII (7-bit and 8-bit extended), Unicode (UTF-8, UTF-16). Explain why Unicode is essential for multilingual text. Convert short messages to binary using given coding tables.
复习字符编码：ASCII（7 位和 8 位扩展），Unicode（UTF-8、UTF-16）。解释为什么 Unicode 对多语种文本至关重要。使用给定的编码表将短消息转换为二进制。
lculate file sizes: image size = width × height × colour depth in bits; sound size = sample rate × bit depth × duration in seconds × number of channels. Know how sampling affects quality and Nyquist theorem basics.
学习图像的二进制表示（像素、颜色深度、分辨率、元数据）和声音的表示（采样率、位深度、采样分辨率）。计算文件大小：图像大小 = 宽度 × 高度 × 颜色深度（位）；声音大小 = 采样率 × 位深度 × 时长（秒）× 声道数。了解采样如何影响质量以及奈奎斯特定理基础。
9. Computer Organisation and Architecture | 计算机组成与体系结构
Examine the Von Neumann architecture: processor (ALU, control unit, registers), memory (RAM, ROM), input/output controllers, and buses (data, address, control). Describe the fetch-decode-execute cycle in detail, including how the program counter, MAR, MDR, CIR, and accumulator change at each step.
研究冯·诺依曼体系：处理器（ALU、控制单元、寄存器）、存储器（RAM、ROM）、输入/输出控制器以及总线（数据总线、地址总线、控制总线）。详细描述取指-译码-执行周期，包括程序计数器 PC、MAR、MDR、CIR 和累加器在每一步如何变化。
Study factors affecting CPU performance: clock speed, number of cores, cache memory. Compare CISC and RISC architectures. Learn about pipelining and how it speeds up instruction throughput, but may cause hazards.
学习影响 CPU 性能的因素：时钟频率、内核数量、高速缓存。比较 CISC 和 RISC 体系结构。了解流水线技术及其如何提高指令吞吐量，但可能引起冒险。
Work extensively with logic gates (AND, OR, NOT, NAND, NOR, XOR). Draw logic circuits from Boolean expressions, construct truth tables, and simplify using Boolean algebra identities and Karnaugh maps (if covered). At Year 12, expect questions to combine gates into adders or simple control logic.
大量练习逻辑门（与、或、非、与非、或非、异或）。根据布尔表达式画出逻辑电路，构建真值表，并使用布尔代数恒等式和卡诺图（如考纲涵盖）进行化简。Year 12 层面，预期会结合门电路构成加法器或简单控制逻辑。
10. Networking and the Internet | 网络与互联网
Review networking fundamentals: LAN vs WAN, network topologies (star, bus, mesh), and the roles of switches, routers, and gateways. Understand how data is broken into packets and how packet switching works.
复习网络基础：局域网与广域网、网络拓扑（星形、总线、网状），以及交换机、路由器和网关的作用。理解数据如何被分割成数据包，以及分组交换如何工作。
Study the TCP/IP protocol stack: application layer, transport layer, internet layer, link layer. Explain what each layer does, and give examples (HTTP, TCP, IP, Ethernet). Also learn about the client-server model and the difference between IPv4 and IPv6 addresses.
学习 TCP/IP 协议栈：应用层、传输层、互联网层、链路层。解释每一层的作用，并举例（HTTP、TCP、IP、以太网）。同时学习客户端-服务器模型，以及 IPv4 和 IPv6 地址的区别。
Explore network security: firewalls (packet filtering, stateful inspection), encryption (symmetric, asymmetric), digital signatures, and SSL/TLS. Discuss threats like malware, phishing, DDoS attacks, and measures such as penetration testing and user access levels.
探索网络安全：防火墙（包过滤、状态检测）、加密（对称、非对称）、数字签名和 SSL/TLS。讨论恶意软件、钓鱼攻击、DDoS 攻击等威胁，以及渗透测试和用户访问级别等防护措施。
11. Databases, SQL, and Big Data | 数据库、SQL 与大数据
Relational database concepts are key. Understand tables, rows, fields, primary keys, foreign keys, and entity-relationship diagrams. Normalise databases to 3NF by removing repeating groups and transitive dependencies.
关系数据库概念是重点。理解表、行、字段、主键、外键和实体关系图。通过消除重复组和传递依赖将数据库规范化至第三范式（3NF）。
Write SQL queries: SELECT, FROM, WHERE, ORDER BY, GROUP BY, HAVING, JOINs (INNER, LEFT). Practise combining tables and filtering data. For Year 12 AQA, be ready to interpret or write given SQL statements on a simple dataset.
编写 SQL 查询：SELECT、FROM、WHERE、ORDER BY、GROUP BY、HAVING、JOIN（内连接、左连接）。练习合并表格和过滤数据。对于 Year 12 AQA，准备好解释或为简单数据集编写给定的 SQL 语句。
Cover the basics of Big Data: volume, velocity, variety, veracity. Discuss distributed processing and the difference between structured and unstructured data. Relate these concepts to real-world applications like recommendation engines or scientific datasets.
学习大数据基础：容量、速度、多样性、真实性。讨论分布式处理以及结构化与非结构化数据的区别。将这些概念与实际应用联系起来，如推荐引擎或科学数据集。
12. Consequences of Computing and Effective Exam Technique | 计算机的影响与考试技巧
Evaluation questions on legal, ethical, cultural, and environmental impacts of computing appear on every paper. Create revision cards for topics such as data privacy, copyright, artificial intelligence, automation, e-waste, and digital divide. Use examples: GDPR, Creative Commons licences, autonomous vehicles, energy consumption of data centres.
计算机在法律、道德、文化和环境影响方面的评估题在每份试卷中都会出现。为数据隐私、版权、人工智能、自动化、电子垃圾和数字鸿沟等主题制作复习卡片。使用实例：GDPR、知识共享许可、自动驾驶汽车、数据中心的能源消耗。
In the final days, shift entirely to past paper practice under timed conditions. Aim to complete at least three full AS papers, then carefully mark your answers against the official mark scheme. Pay attention to how marks are awarded for pseudocode (clarity, logic, correct syntax), for diagram construction, and for extended written explanations.
在最后几天，完全转为计时完成历年真题。目标是至少完成三套完整的 AS 试卷，然后对照官方评分方案仔细批改。注意伪代码（清晰度、逻辑、正确语法）、图表构建和延伸性书面解释的评分方式。
For programming questions, always write a comment or brief header to state your intent. If stuck, attempt to outline the logic with bullet points to gain partial credit. Revisit your error logbook to ensure past mistakes have been corrected. Approach the exam with a disciplined time plan and the confidence that comes from structured revision.
对于编程题，务必加上注释或简要开头说明意图。如遇困难，尝试用要点列出逻辑以争取部分分数。重温错题日志，确保过去的错误已被纠正。带着有纪律的时间规划以及结构化复习带来的信心，走进考场。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图