Year 13 AQA Computer Science: Summer Prep & Bridging Course | AQA 计算机科学 Year 13 暑期预习与衔接课程

📚 Year 13 AQA Computer Science: Summer Prep & Bridging Course | AQA 计算机科学 Year 13 暑期预习与衔接课程

The leap from Year 12 to Year 13 in AQA Computer Science is significant. You move from foundational concepts to advanced computational thinking, from simple programs to formal algorithm analysis, and from theory in isolation to a major non-exam assessment project. This bridging guide is designed to help you prepare efficiently over the summer, solidify your Year 12 knowledge, and preview the key topics you will tackle in Year 13.

从 Year 12 到 Year 13 的 AQA 计算机科学课程是一个重要跨越。你要从基础概念过渡到高级计算思维，从简单编程转向形式化的算法分析，从相对独立的理论学习转向完成一个重要的非考试评估项目。这份衔接指南旨在帮助你利用暑假高效预习，巩固 Year 12 的知识，并提前预览 Year 13 将要学习的核心主题。

1. The Year 13 AQA Landscape | AQA 计算机 Year 13 概览

Year 13 covers the remainder of the A-level specification (7517). The examined content is split across two papers: Paper 1 tests fundamental principles of computer science, including programming, data structures, and theory of computation. Paper 2 focuses on computer systems, networking, databases, and ethical/legal aspects. Alongside these, you will complete a substantial programming project (NEA) worth 20% of the A-level.

Year 13 涵盖了 A-level 规格 (7517) 的剩余内容。考试分为两张试卷：试卷一侧重计算机科学的基本原理，包括编程、数据结构和计算理论；试卷二则聚焦于计算机系统、网络、数据库以及伦理和法律问题。与此同时，你还需要完成一个占 A-level 总分 20% 的重要编程项目（NEA）。

The key themes you will encounter include: abstract data types, algorithm efficiency, recursion, tree and graph traversal, hardware and low‑level programming, operating system concepts, relational databases, and modern network technologies. Understanding how these topics interconnect is essential for high marks.

你将遇到的关键主题包括：抽象数据类型、算法效率、递归、树与图的遍历、硬件与低级编程、操作系统概念、关系数据库以及现代网络技术。理解这些主题之间的内在联系是取得高分的关键。

2. Reinforcing Year 12 Programming Foundations | 巩固 Year 12 编程基础

Before diving into advanced material, it is vital to ensure your practical programming skills are robust. In Year 12 you learned the basics of a high‑level language such as Python, Java or C#. Over the summer, write short programs that use: sequence, selection, iteration, arrays/lists, string manipulation, file I/O, and subroutines. These should feel effortless by September.

在深入学习高阶内容之前，确保你的实际编程技能扎实至关重要。在 Year 12 你学习了 Python、Java 或 C# 等高级语言的基础知识。暑期可以编写一些简短程序，涵盖：顺序、选择、迭代、数组/列表、字符串操作、文件输入输出以及子程序。到 9 月时，这些操作对你来说应该已经得心应手。

Pay particular attention to parameter passing by value and by reference, as this concept underlies much of the data structure and recursion work ahead. Also practice writing code that is well‑structured, with meaningful identifiers and comments – habits that will be invaluable during your NEA.

尤其要留意按值传递和按引用传递参数的区别，这一概念是后续许多数据结构和递归工作的基础。同时要练习编写结构清晰、标识符有意义且注释合理的代码——这些习惯在你进行 NEA 时将非常宝贵。

• Set up an IDE or online environment (e.g. Replit) and solve five small coding challenges a week.
• 搭建一个 IDE 或在线环境（如 Replit），每周解决五个小型编程挑战。

3. Abstract Data Types: Stacks and Queues | 抽象数据类型：栈与队列

Year 13 introduces formal abstract data types (ADTs). A stack is a LIFO (Last In, First Out) structure with operations push, pop, and peek/top. A queue is a FIFO (First In, First Out) structure with enqueue and dequeue. You need to know how to implement both using arrays and linked lists, and be able to trace their behaviour.

Year 13 会正式引入抽象数据类型 (ADT)。栈是一种后进先出 (LIFO) 的结构，操作包括 push、pop 和 peek/top。队列是一种先进先出 (FIFO) 的结构，操作包括 enqueue 和 dequeue。你需要知道如何使用数组和链表来实现它们，并能追踪其行为。

For arrays, a stack can be implemented with a fixed‑size array and a top pointer. You must handle stack‑full and stack‑empty conditions. A linear queue with an array risks having unusable space; the circular queue solves this using two pointers (front and rear) and modular arithmetic.

对于数组实现，栈可以用固定大小的数组和一个栈顶指针实现，你必须处理栈满和栈空的情形。用数组实现的线性队列会产生不可用空间；而循环队列通过两个指针（front 和 rear）和取模运算解决了这个问题。

Operation	Stack (Array)	Circular Queue
Check empty	top = -1	front = rear
Check full	top = size – 1	(rear + 1) mod size = front

4. Linked Lists and Their Advantages | 链表及其优势

A linked list is a dynamic data structure where each node contains data and a pointer to the next node. Unlike arrays, linked lists do not require contiguous memory, making insertion and deletion more efficient when positions are known. However, they lack direct random access, requiring traversal from the head.

链表是一种动态数据结构，每个节点包含数据和指向下一个节点的指针。与数组不同，链表不需要连续的内存空间，因此在已知位置时插入和删除效率更高。但链表不支持直接随机访问，必须从头节点开始遍历。

You should be able to draw diagrams showing pointer assignment during insertion, and write pseudocode for traversing, adding, and removing nodes. AQA often asks about the memory footprint and the overhead of storing pointers alongside data.

你应该能够画出插入过程中指针赋值的示意图，并写出遍历、添加和删除节点的伪代码。AQA 常会考查内存占用，以及存储指针所带来的数据开销。

• Learn how to maintain a free‑pointer list for static implementation.
• 学习如何维护一个空闲指针列表以进行静态实现。

5. Algorithm Analysis: Big O Efficiency | 算法分析：大 O 效率

Building on Year 12 sorting and searching algorithms, you now need to formally describe their time complexity using Big O notation. Understand O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). You should be able to compare algorithms such as binary search O(log n) versus linear search O(n).

在 Year 12 排序和搜索算法的基础上，你现在需要正式使用大 O 表示法描述它们的时间复杂度。理解 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。你应该能够比较二分查找 O(log n) 与线性查找 O(n) 等算法。

The complexity depends on the input size n and measures the upper bound of the number of primitive operations. For example, a nested loop iterating over an n × n matrix is O(n²). Space complexity – the memory used – can also be described with Big O, though AQA mainly focuses on time.

复杂度取决于输入规模 n，衡量的是基本操作次数的上界。例如，遍历 n × n 矩阵的嵌套循环为 O(n²)。空间复杂度（使用的内存）也可以用大 O 描述，不过 AQA 主要关注时间复杂度。

Time(n) ≤ c · f(n) for all n ≥ n₀

Practice deriving the Big O for common Year 13 algorithms: recursive factorial, binary tree traversals, and Dijkstra’s shortest path.

练习推导 Year 13 常见算法的大 O 复杂度：递归阶乘、二叉树遍历和迪杰斯特拉最短路径算法。

6. Recursion and How the Call Stack Works | 递归与调用栈机制

Recursion is a technique where a subroutine calls itself. In Year 13 you must be able to trace recursive algorithms, identify base and recursive cases, and implement simple recursive solutions. Understanding how the call stack stores local variables and return addresses for each invocation is crucial for predicting output and diagnosing stack overflow.

递归是一种子程序调用自身的技术。在 Year 13 你需要能够追踪递归算法，识别基准情形和递归情形，并实现简单的递归解法。理解调用栈如何为每次调用存储局部变量和返回地址，对于预测输出结果和诊断栈溢出至关重要。

Classic examples include factorial, Fibonacci, and problem solving like the Tower of Hanoi. Recursion often leads to elegant code but can be less memory‑efficient than iteration. Be prepared to compare iterative and recursive implementations.

经典示例包括阶乘、斐波那契数列，以及汉诺塔等问题求解。递归通常使代码更加优雅，但可能不如迭代节省内存。准备好比较迭代和递归实现。

• Factorial(n) = n × Factorial(n−1) with base case Factorial(0) = 1
• Factorial(n) = n × Factorial(n−1)，基准情形 Factorial(0) = 1

7. Trees and Traversal Algorithms | 树与遍历算法

Trees are hierarchical data structures that appear frequently in Year 13. You need to know binary trees and binary search trees, and perform three depth‑first traversals: pre‑order, in‑order, and post‑order. Be able to reconstruct a tree from its traversals or derive an expression tree for prefix/infix/postfix notations.

树是一种层次化的数据结构，在 Year 13 中频繁出现。你需要了解二叉树和二叉搜索树，并执行三种深度优先遍历：前序、中序和后序遍历。要能够根据遍历结果重构树，或推导出用于前缀/中缀/后缀表示法的表达式树。

In an expression tree, leaves hold operands and internal nodes hold operators. An in‑order traversal produces the infix expression (though parentheses are often required). A post‑order traversal yields postfix, which is used by stack‑based evaluators.

在表达式树中，叶节点存放操作数，内部节点存放运算符。中序遍历产生中缀表达式（尽管通常需添加括号）。后序遍历产生后缀表达式，后者用于基于栈的求值器。

Also introduce the concept of a graph, potentially with adjacency matrix and list representations, setting the stage for network routing algorithms.

同时引入图的概念，包括邻接矩阵和邻接表表示法，为网络路由算法做好准备。

8. Computer Architecture: Processor and Low‑level Code | 计算机体系结构：处理器与低级代码

Year 13 revives processor architecture with greater depth. You will study the Fetch‑Decode‑Execute cycle in detail, the roles of essential registers (PC, MAR, MDR, CIR, ACC), and the difference between immediate and direct addressing. The ALU, control unit, and clock speed become central to performance analysis.

Year 13 会以更深的层次重新探讨处理器架构。你将详细学习取指-译码-执行周期，基本寄存器（PC、MAR、MDR、CIR、ACC）的作用，以及立即寻址和直接寻址的区别。ALU、控制单元和时钟速度成为性能分析的核心。

You are also expected to read and write simple assembly language programs using a simplified instruction set such as LMC (Little Man Computer). Understanding mnemonic operations (LDA, STA, ADD, SUB, BRP, BRZ, BRA) and how high‑level constructs map to branching and loops is examinable.

你还需要使用简化指令集（如 LMC 小矮人计算机）阅读和编写简单的汇编语言程序。理解助记符操作（LDA、STA、ADD、SUB、BRP、BRZ、BRA）以及高级结构如何映射为分支和循环，这些都是考试内容。

• Explain the effect of increasing clock speed, cores, and cache on performance.
• 解释提高时钟速度、增加内核数量和缓存对性能的影响。

9. Relational Databases and Normalisation | 关系数据库与规范化

Databases reappear with a focus on normalisation to Third Normal Form (3NF). You must be able to identify partial and transitive dependencies, and transform a dataset from Unnormalised Form (UNF) into 1NF, 2NF, and 3NF. Codd’s definitions are key: each table should represent a single entity, and all non‑key attributes must depend on the key, the whole key, and nothing but the key.

数据库主题再次出现，重点是规范化至第三范式 (3NF)。你必须能识别部分依赖和传递依赖，并将数据集从未范式 (UNF) 转化为 1NF、2NF 和 3NF。科德的定义是关键：每个表应代表单一实体，所有非主键属性必须依赖于键、整个键，且只依赖于键。

Entity Relationship diagrams and SQL DDL/DML commands are also deepened. Practice writing JOINs, subqueries, and statements that enforce referential integrity. Additionally, understand the role of indexes and the concept of ACID (Atomicity, Consistency, Isolation, Durability) for transactions.

实体关系图和 SQL 的 DDL/DML 命令也更加深入。练习编写连接、子查询以及实施参照完整性的语句。此外，理解索引的作用以及事务的 ACID 特性（原子性、一致性、隔离性、持久性）。

10. Networking, Security, and the TCP/IP Stack | 网络、安全与 TCP/IP 协议栈

Year 13 networking covers the TCP/IP stack in detail: Application (HTTP, FTP, SMTP), Transport (TCP/UDP), Internet (IP), and Network Interface layers. Understand how packets are routed across the internet, the significance of MAC and IP addresses, and the role of protocols like DHCP and NAT.

Year 13 的网络部分详细介绍了 TCP/IP 协议栈：应用层（HTTP、FTP、SMTP）、传输层（TCP/UDP）、网络层（IP）和网络接口层。理解数据包如何在互联网中路由、MAC 地址和 IP 地址的意义，以及 DHCP 和 NAT 等协议的作用。

In the age of cloud computing, be familiar with client‑server and peer‑to‑peer models, and how firewalls, encryption (symmetric and public key), and digital signatures provide security. Knowing the handshake process of TLS/SSL provides a strong applied context.

在云时代，你需要熟悉客户端-服务器和对等网络模型，以及防火墙、加密（对称与公钥加密）和数字签名如何提供安全性。了解 TLS/SSL 的握手过程可提供扎实的应用背景。

11. Preparing for the Non‑Exam Assessment (NEA) | 准备非考试评估项目

The NEA is a major programming project where you will develop a substantial solution for a real‑world problem. Over the summer, brainstorm project ideas that are complex enough to demonstrate high‑level skills: databases, file handling, graph algorithms, or hardware interfacing. Ensure the project has a clear intended user and a scope that you can realistically complete.

NEA 是一个重要的编程项目，你需要为实际问题开发一个实质性的解决方案。暑期可以构思项目创意，其复杂程度要足以展示高阶技能：如数据库、文件处理、图算法或硬件接口。确保项目有明确的预期用户，且范围在你能够实际完成的范围内。

Start learning the software development methodologies (waterfall, agile) and prepare a logbook habit. Your analysis, design, testing, and evaluation sections will be graded, so read through the AQA marking criteria early. The more planning you do now, the smoother your Year 13 term will be.

开始学习软件开发方法（瀑布模型、敏捷开发），并养成撰写日志的习惯。你的分析、设计、测试和评估部分都会被评分，因此尽早阅读 AQA 的评分标准。现在做得越多规划，你 Year 13 的学期就会越顺利。

12. Designing Your Summer Study Plan | 制定你的暑期学习计划

A structured approach will keep your revision manageable. Dedicate 3–4 hours per week to Computer Science. Alternate between revisiting Year 12 notes (1 hour), learning a new Year 13 topic (1.5 hours), and reinforcing through programming or exam‑style questions (1 hour). Use the AQA specification as your checklist.

有结构的方法能让复习保持可控。每周投入 3-4 小时在计算机科学上。交替进行：复习 Year 12 笔记（1 小时），学习一个新的 Year 13 主题（1.5 小时），并通过编程或考试风格的问题来巩固（1 小时）。用 AQA 考纲作为你的检查清单。

By the end of summer, you should feel confident with: Big O notation, stacks, queues, linked lists, recursion, tree traversals, and the basics of assembly language. This head start will allow you to focus on the NEA and deeper theory without falling behind.

到暑假结束时，你应该对大 O 表示法、栈、队列、链表、递归、树遍历以及汇编语言基础感到有信心。这个先发优势将使你在投入 NEA 和更深理论时，不至于落后。

Week	Focus Topic	Activities
1-2	Programming refresh	Write 10 short programs; review parameter passing
3-4	ADTs: Stacks & Queues	Implement in code; trace exercises
5-6	Big O & Recursion	Complexity problems; Tower of Hanoi
7-8	Trees & Assembly	Traversal tasks; LMC programs
9-10	NEA planning	Draft problem statement; sketch design

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

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