📚 Year 13 AQA Computer Science: Complete Syllabus Breakdown | Year 13 AQA 计算机：课程大纲全面解析
The second year of the AQA A‑level Computer Science (7517) deepens your understanding of theoretical concepts and practical skills. While AS covers fundamentals, Year 13 extends into advanced algorithms, data structures, computational theory, and a substantial programming project. This article provides a detailed walk‑through of every topic you will encounter, illustrating how they connect to exam papers and the non‑exam assessment.
AQA A‑level 计算机科学（7517）的第二年将加深你对理论概念和实践技能的理解。AS 阶段覆盖基础知识，而 Year 13 则扩展到高级算法、数据结构、计算理论和一个重要的编程项目。本文将详细剖析你将遇到的每一个主题，并说明它们与试卷和非考试评估的关联。
1. Overview of the Year 13 Syllabus | Year 13 课程大纲概览
The A‑level qualification is assessed through two written papers and a non‑exam assessment (NEA). Paper 1 (on‑screen programming exam) tests practical problem‑solving, and Paper 2 (written) covers theory. Year 13 content appears extensively in both papers, especially the more challenging sections on data structures, algorithms, and the theory of computation.
A‑level 资格通过两份笔试和一项非考试评估（NEA）进行测评。试卷一（上机编程考试）考查实际问题解决能力，试卷二（笔试）覆盖理论知识。Year 13 的内容在两份试卷中大量出现，尤其是数据结构、算法和计算理论等更具挑战性的部分。
You will also complete a substantial programming project that draws together analysis, design, implementation, testing, and evaluation. The NEA is a chance to demonstrate independent problem‑solving using the advanced programming techniques you learn this year.
你还将完成一个综合性的编程项目，该项目汇集了分析、设计、实现、测试和评估。NEA 是一个展示你运用今年所学高级编程技术进行独立解决问题的机会。
2. Advanced Programming Concepts | 高级编程概念
Year 13 programming goes beyond basic constructs to include recursion, object‑oriented programming (OOP), and functional programming paradigms. You are expected to use recursion to solve problems elegantly, such as traversing trees or implementing quick sort.
Year 13 的编程超越了基本结构，涵盖递归、面向对象编程（OOP）和函数式编程范式。你将被要求使用递归优雅地解决问题，例如遍历树或实现快速排序。
OOP principles — encapsulation, inheritance, polymorphism, and abstraction — become central. You need to design classes, use interfaces or abstract classes, and apply design patterns where appropriate. Understanding how to break a problem into cooperating objects is a key skill for the NEA project.
OOP 原则——封装、继承、多态和抽象——成为核心。你需要设计类，使用接口或抽象类，并在适当的地方应用设计模式。理解如何将问题分解为协作的对象是 NEA 项目的一项关键技能。
3. Data Structures (Stacks, Queues, Trees, Graphs) | 数据结构（栈、队列、树、图）
AQA expects you to know both static and dynamic implementations of core structures. You should be able to implement stacks and queues using arrays and linked lists, and describe their operations (push, pop, enqueue, dequeue) with step‑by‑step memory diagrams.
AQA 希望你了解核心结构的静态和动态实现。你应该能够用数组和链表实现栈和队列，并通过逐步的内存图描述它们的操作（push、pop、enqueue、dequeue）。
Trees appear as binary trees and binary search trees. You need to perform pre‑order, in‑order, and post‑order traversals, and understand how to insert and delete nodes while maintaining the BST property. Be ready to draw trees after a series of operations.
树以二叉树和二叉搜索树的形式出现。你需要执行前序、中序和后序遍历，并理解如何在维持 BST 性质的同时插入和删除节点。准备好根据一系列操作绘制树结构。
Graphs are introduced in depth, including directed and undirected graphs, adjacency matrices, and adjacency lists. You use these representations to inform graph traversal algorithms that appear in the algorithms section.
图被深入地介绍，包括有向图、无向图、邻接矩阵和邻接表。你将使用这些表示来指导在算法部分出现的图遍历算法。
4. Algorithms (Graph Traversal & Optimisation) | 算法（图遍历与优化）
The algorithm specification in Year 13 focuses heavily on graph algorithms. You must know breadth‑first search (BFS) and depth‑first search (DFS) in detail, including tracing them on a given graph and understanding their applications (shortest path in unweighted graphs for BFS, or topological sorting).
Year 13 的算法规范重点关注图算法。你必须详细了解广度优先搜索（BFS）和深度优先搜索（DFS），包括在给定图上进行跟踪，并理解它们的应用（BFS 用于无权图的最短路径，或拓扑排序）。
Dijkstra’s shortest path algorithm is a core topic: you need to be able to execute it manually on weighted graphs, using a priority queue efficiently. The A* algorithm may be mentioned as an extension, but the exam focuses on Dijkstra.
Dijkstra 最短路径算法是核心主题：你需要能够在加权图上手动执行它，并有效利用优先队列。A* 算法可能作为扩展被提及，但考试重点在 Dijkstra。
You also study sorting algorithms again, this time with greater emphasis on merge sort and quick sort as examples of divide‑and‑conquer strategies, and you learn to compare their time and space complexities using Big O notation.
你还会再次学习排序算法，这次更加强调归并排序和快速排序作为分治策略的实例，并学会使用大 O 表示法比较它们的时间和空间复杂度。
5. Theory of Computation | 计算理论
This abstract topic covers finite state machines (FSMs), regular expressions, and the concept of Turing machines. You must draw and interpret state transition diagrams for FSMs and be able to convert simple regular expressions to FSMs and vice versa.
这个抽象的主题涵盖有限状态机（FSM）、正则表达式和图灵机的概念。你必须能绘制和解释 FSM 的状态转换图，并能够将简单的正则表达式转换为 FSM，反之亦然。
The Turing machine is introduced as a model of computation. You need to describe its components (tape, head, state register, transition function) and explain why it is considered a universal model of computation. You should also understand the notion of computability and the halting problem as a limit of computation.
图灵机作为一种计算模型被引入。你需要描述其组件（纸带、读写头、状态寄存器、转换函数），并解释为什么它被认为是通用的计算模型。你还应理解可计算性的概念以及停机问题作为计算的局限性。
6. Computer Architecture & Organisation | 计算机体系结构与组成
Building on Year 12, you now explore advanced processor topics such as pipelining, parallel processing, and co‑processors (GPU). You must explain how pipelining improves throughput and what hazards may arise (data, control).
在 Year 12 的基础上，你现在要探索高级处理器主题，如流水线、并行处理和协处理器（GPU）。你必须解释流水线如何提高吞吐量以及可能出现的冒险（数据冒险、控制冒险）。
You also study the fetch‑decode‑execute cycle at a deeper level, including the role of registers like the MDR, MAR, CIR, and program counter. The distinction between CISC and RISC architectures becomes important, and you need to evaluate their trade‑offs.
你还将更深入地学习取指‑译码‑执行周期，包括 MDR、MAR、CIR 和程序计数器等寄存器的作用。CISC 与 RISC 体系结构之间的区别变得重要，你需要评估它们的权衡。
7. Data Communication & Networking | 数据通信与网络
The networking content expands to cover the TCP/IP stack, client‑server and peer‑to‑peer models, and wireless communication. You must be able to explain the function of each layer (application, transport, internet, link) and how packets are formed.
网络内容扩展到 TCP/IP 协议栈、客户‑服务器和对等模型，以及无线通信。你必须能解释每一层（应用层、传输层、互联网层、链路层）的功能以及数据包的形成过程。
Network security threats and prevention measures are also examined. You should discuss firewalls, encryption (symmetric and asymmetric), digital signatures, and secure protocols like SSL/TLS. Understanding how a public‑/private‑key pair works is essential.
网络安全威胁和预防措施也会被考查。你应该讨论防火墙、加密（对称和非对称）、数字签名以及 SSL/TLS 等安全协议。理解公钥/私钥对的工作原理至关重要。
8. Big Data, Databases & SQL | 大数据、数据库与 SQL
Year 13 introduces the concept of big data, including volume, velocity, and variety. You learn how distributed computing (e.g., MapReduce) handles large datasets and how functional programming supports parallel data processing.
Year 13 引入了大数据的概念，包括数量、速度和多样性。你将学习分布式计算（例如 MapReduce）如何处理大型数据集，以及函数式编程如何支持并行数据处理。
Relational databases and SQL continue to be a focus. You must write complex queries involving JOINs, subqueries, GROUP BY, and aggregate functions. You also need to normalise relations to third normal form (3NF) and understand the importance of ACID (Atomicity, Consistency, Isolation, Durability).
关系数据库和 SQL 仍然是重点。你必须编写涉及 JOIN、子查询、GROUP BY 和聚合函数的复杂查询。你还需要将关系规范化为第三范式（3NF），并理解 ACID（原子性、一致性、隔离性、持久性）的重要性。
9. Functional Programming | 函数式编程
Functional programming is a distinct paradigm that treats computation as the evaluation of mathematical functions. You learn about first‑class functions, higher‑order functions (map, filter, fold/reduce), and referential transparency.
函数式编程是一种独特的范式，它将计算视为数学函数的求值。你将学习第一类函数、高阶函数（map、filter、fold/reduce）以及引用透明性。
Recursion is often used instead of loops, and you work with immutable data structures. AQA typically presents questions using a functional language notation (often based on Haskell) where you need to trace expressions and write simple function definitions.
递归常被用来代替循环，并且你使用不可变数据结构。AQA 通常使用函数式语言符号（通常基于 Haskell）呈现问题，你需要跟踪表达式并编写简单的函数定义。
10. Non‑Exam Assessment (NEA) | 非考试评估
The NEA is a substantial piece of coursework where you create a solution to a real‑world problem. It carries 75 marks and is internally assessed but externally moderated. You document the entire lifecycle: analysis, design, implementation, testing, and evaluation.
NEA 是一项重要的课程作业，你将为解决一个现实问题创建解决方案。它占总分 75 分，由内部评估但外部审核。你需记录整个生命周期：分析、设计、实现、测试和评估。
You must demonstrate advanced programming skills appropriate to Year 13, such as OOP, recursion, and the use of appropriate data structures. The project must be complex enough to show genuine problem‑solving — something like a game, a management system, or a data analysis tool. Clear, commented code and thorough testing are vital.
你必须展示与 Year 13 相匹配的高级编程技能，如 OOP、递归以及合适的数据结构的使用。项目必须足够复杂以展示真实的问题解决能力——例如一个游戏、一个管理系统或一个数据分析工具。清晰的注释代码和全面的测试至关重要。
11. Ethical, Legal & Cultural Impacts | 道德、法律与文化影响
Computing does not exist in a vacuum. You must analyse the impact of technology on individuals and society. Topics include artificial intelligence, automation, privacy, surveillance, intellectual property, and the digital divide.
计算技术并非存在于真空中。你必须分析技术对个人和社会的影响。主题包括人工智能、自动化、隐私、监控、知识产权和数字鸿沟。
Key UK legislation — the Data Protection Act, Computer Misuse Act, and Copyright, Designs and Patents Act — must be understood, along with the principles of the GDPR. Questions often present a scenario and ask you to discuss the ethical and legal considerations.
必须理解关键的英国立法——《数据保护法》、《计算机滥用法》和《版权、设计和专利法》，以及 GDPR 的原则。题目常常给出一个场景，要求你讨论其中的道德和法律考量。
12. How the Syllabus Maps to Assessment | 课程大纲与测评的对应
Paper 1 (2 hours 30 minutes, on‑screen) focuses on programming and problem‑solving. You will write code in a pre‑released skeleton program, answer short practical questions, and complete structured programming tasks. This paper tests your practical command of data structures, algorithms, and software development.
试卷一（2 小时 30 分钟，上机考试）重点关注编程和问题解决。你将在预先发布的骨架程序中编写代码，回答简短的实际问题，并完成结构化的编程任务。这份试卷考查你对数据结构、算法和软件开发的实践掌握。
Paper 2 (2 hours 30 minutes, written) assesses theory. It includes short‑answer and extended‑writing questions covering computer architecture, networking, theory of computation, big data, and ethical issues. All Year 13 theory topics can appear here, often in integrated scenarios.
试卷二（2 小时 30 分钟，笔试）评估理论知识。它包括简答题和扩展写作题，覆盖计算机体系结构、网络、计算理论、大数据和道德问题。所有 Year 13 的理论主题都可能在此出现，且常常以综合场景的形式呈现。
The NEA is a year‑long project that allows you to demonstrate practical skills in depth. It is best started early, with a clear schedule for analysis, design, coding, and testing.
NEA 是一个为期一年的项目，让你能够深度展示实践技能。最好尽早开始，并制定清晰的分析、设计、编码和测试计划。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导