📚 Comprehensive Analysis of the Year 13 AQA Computer Science Syllabus | Year 13 AQA 计算机：课程大纲全面解析
The final year of AQA A-Level Computer Science (7517) builds upon Year 12 foundations and demands deep understanding of advanced computing concepts. From complex data structures and algorithm analysis to computer architecture, networking, databases, and functional programming, Year 13 students must integrate theory with practical problem-solving to excel in both written papers and the substantial programming project. This comprehensive guide dissects every component of the syllabus, providing clarity on what is examined and how to master each area.
AQA A-Level 计算机科学（7517）的最后一年建立在 Year 12 基础之上，要求对高级计算概念有深入理解。从复杂的数据结构和算法分析，到计算机体系结构、网络、数据库和函数式编程，Year 13 学生必须将理论与实践问题解决相结合，才能在书面考试和大型编程项目中取得优异成绩。这份全面指南深入剖析课程大纲的每个组成部分，清晰地说明考试内容以及如何掌握各个领域。
1. Overview of the AQA A-Level Computer Science Specification | AQA A-Level 计算机科学规范概览
The AQA A-Level Computer Science qualification is assessed through two written examinations and a non-exam assessment (NEA). Paper 1 (on-screen programming exam) tests practical programming skills and theoretical knowledge including data structures, algorithms, and theory of computation. Paper 2 (written exam) covers computer systems, networking, databases, big data, and functional programming. The NEA is an individual programming project that showcases the candidate's ability to analyse, design, implement, test, and evaluate a solution to a real problem.
AQA A-Level 计算机科学资格证书通过两次书面考试和一项非考试评估（NEA）进行考查。试卷一（上机编程考试）测试实践编程技能以及包括数据结构、算法和计算理论在内的理论知识。试卷二（笔试）涵盖计算机系统、网络、数据库、大数据和函数式编程。NEA 是一个个人编程项目，旨在展示考生分析、设计、实现、测试和评估现实问题解决方案的能力。
The specification focuses on developing computational thinking, an essential skill for solving problems with computers. Year 13 content extends the AS topics and introduces deeper concepts like recursion, tree and graph traversal, advanced Boolean algebra, floating point representation, and the client–server model. Understanding how the assessment objectives (AO1: knowledge, AO2: application, AO3: analysis and evaluation) are distributed is crucial for targeted revision.
该规范侧重于培养计算思维，这是使用计算机解决问题的基本技能。Year 13 的内容拓展了 AS 主题，并引入更深入的概念，如递归、树与图的遍历、高级布尔代数、浮点表示以及客户端-服务器模型。理解评估目标（AO1：知识，AO2：应用，AO3：分析与评价）的分布对于有针对性的复习至关重要。
2. Paper 1: Fundamentals of Programming and Data Structures | 试卷一：编程与数据结构基础
Paper 1 is a practical on-screen exam where students write code, debug, and answer short-answer questions on programming concepts. A core focus is data structures: arrays, records, lists, stacks, queues, linked lists, trees, and hash tables. Candidates must be able to implement these structures in their chosen language (Python, Java, C#, etc.) and explain their operations and use cases. For example, a stack is LIFO (last-in-first-out) and supports push, pop, and peek operations, making it suitable for undo functionalities or expression evaluation.
试卷一是一场实践性上机考试，学生需要编写代码、调试，并回答关于编程概念的简答题。核心重点是数据结构：数组、记录、列表、栈、队列、链表、树和哈希表。考生必须能用所选语言（Python、Java、C# 等）实现这些结构，并解释其操作和用例。例如，栈是后进先出（LIFO）结构，支持压入、弹出和读取栈顶操作，使其适合撤销功能或表达式求值。
Manipulating strings, integers, and real numbers, along with file handling, is fundamental. Students must be adept at using functions and procedures with parameter passing by value and by reference. Exception handling and defensive design, including validation and testing, are also examined. Questions often present incomplete code snippets requiring completion or debugging, so a solid grasp of syntax and logic is essential.
字符串、整数和实数的操作以及文件处理是基础。学生必须熟练使用通过值传递和引用传递参数的函数与过程。异常处理和包括验证与测试在内的防御性设计也会被考查。试题通常给出不完整的代码片段，需要补全或调试，因此扎实掌握语法和逻辑至关重要。
3. Paper 1: Algorithms and Problem-Solving | 试卷一：算法与问题解决
Algorithms form the heart of computational problem-solving. Year 13 students must analyse and compare classic search algorithms (linear, binary) and sorting algorithms (bubble, insertion, merge, quicksort). Understanding their time and space complexity using Big-O notation, such as O(n) or O(n²), is key. Merge sort, for instance, has a worst-case time complexity of O(n log₂ n), making it more efficient than bubble sort for large datasets.
算法是计算问题解决的核心。Year 13 学生必须分析并比较经典搜索算法（线性、二分）和排序算法（冒泡、插入、归并、快速排序）。用大 O 表示法理解它们的时间与空间复杂度，如 O(n) 或 O(n²)，是关键。例如，归并排序的最坏时间复杂度为 O(n log₂ n)，使其在处理大数据集时比冒泡排序更高效。
Graph traversal algorithms, Dijkstra's shortest path, and the A* algorithm are required topics. Recursion and its applications, such as calculating factorials or traversing trees, must be mastered alongside the ability to convert between iterative and recursive solutions. The exam may ask for dry-run tables of recursive calls. Understanding tractable and intractable problems, as well as the concept of the halting problem, rounds off this section.
图遍历算法、Dijkstra 最短路径算法和 A* 算法是必考主题。必须掌握递归及其应用，如计算阶乘或遍历树，并能够在迭代和递归解决方案之间进行转换。考试可能会要求填写递归调用的手工推演表。理解可解与不可解问题以及停机问题的概念，为这一部分画上句号。
4. Paper 1: Theory of Computation | 试卷一：计算理论
The theory of computation introduces abstract models that define what a computer can do. Finite state machines (FSMs) with and without output (Mealy and Moore machines) are used to model sequential logic. Students must be able to draw transition diagrams and state transition tables for problems like a vending machine controller. Regular expressions and regular languages provide a link to lexical analysis in compilers.
计算理论介绍了定义计算机能做什么的抽象模型。带输出和不带输出的有限状态机（Mealy 机和 Moore 机）用于建模顺序逻辑。学生必须能为自动售货机控制器等问题绘制转移图和状态转移表。正则表达式和正则语言为编译器中的词法分析提供了链接。
Context-free languages and Backus-Naur Form (BNF) are essential for describing programming language syntax. Syntax diagrams and parsing are examined. The Turing machine, seen as the ultimate model of computation, must be understood in terms of its operation and significance. The Church-Turing thesis and the notion of universal machines underpin theoretical limits like the halting problem, which demonstrates that not all problems are decidable.
上下文无关语言和巴科斯-瑙尔范式（BNF）对于描述编程语言语法至关重要。会考查语法图和解析。必须从其操作和重要性方面理解被视为终极计算模型的图灵机。丘奇-图灵论题和通用机的概念奠定了停机问题等理论限制的基础，该问题表明并非所有问题都是可判定的。
5. Paper 2: Fundamentals of Computer Systems | 试卷二：计算机系统基础
Paper 2 begins with a hardware-focused exploration. Logic gates and Boolean algebra are extended to include XOR, NAND, and NOR, with simplification using Karnaugh maps and De Morgan's laws. Students must construct truth tables and logic circuits. The relationship between Boolean expressions and programming conditionals is highlighted. Supplementary topics like adders, flip-flops, and registers link logic to computer architecture.
试卷二从以硬件为核心的探索开始。逻辑门和布尔代数扩展到包括异或、与非和或非门，并使用卡诺图和德摩根律进行化简。学生必须构建真值表和逻辑电路。强调了布尔表达式与编程条件语句之间的关系。加法器、触发器和寄存器等补充主题将逻辑与计算机体系结构联系起来。
Internal components such as the processor (ALU, control unit, registers), system buses (data, address, control), and the fetch-decode-execute cycle are examined in depth. The stored program concept, main memory (RAM, ROM), and cache memory are fundamental. Factors affecting CPU performance—clock speed, number of cores, and cache size—must be discussed with reference to their impact on the processor cycle.
内部组件，如处理器（ALU、控制单元、寄存器）、系统总线（数据、地址、控制）以及取指-解码-执行周期，都会被深入考查。存储程序概念、主存储器（RAM、ROM）和高速缓存是基础。影响 CPU 性能的因素——时钟速度、核心数量和缓存大小——必须结合它们对处理器周期的影响进行讨论。
6. Paper 2: Computer Organization and Architecture | 试卷二：计算机组成与架构
This section bridges the gap between software and hardware. It covers the architecture of the processor, including CISC versus RISC architectures, pipelining, and parallel processing. The concept of an instruction set and addressing modes (immediate, direct, indirect, indexed) is crucial for understanding machine code and assembly language programming. Students should be able to interpret simple assembly instructions and explain how the operand is accessed.
本节弥合了软件与硬件之间的鸿沟。它涵盖处理器体系结构，包括 CISC 与 RISC 架构、流水线和并行处理。指令集和寻址模式（立即、直接、间接、变址）的概念对于理解机器码和汇编语言编程至关重要。学生应能解释简单的汇编指令，并说明如何访问操作数。
Number representation is deepened with floating point binary, normalisation, and reasons for errors such as overflow and underflow. Negative numbers are represented in two's complement for integer arithmetic and in sign-and-magnitude for floating point. The Von Neumann and Harvard architectures are contrasted, especially regarding separate memory for instructions and data. Interrupts and their role in handling I/O requests are also tested.
数字表示通过浮点二进制、规格化以及溢出和下溢等错误原因深入展开。负整数用二进制补码表示，而浮点数用符号和数值表示。比较了冯·诺依曼和哈佛架构，特别是在指令和数据独立存储器方面。中断及其在处理 I/O 请求中的作用也会被测试。
7. Paper 2: Communication and Networking | 试卷二：通信与网络
Understanding modern networks requires knowledge of the TCP/IP protocol stack: application, transport, network, and link layers. The role of each layer, including protocols like HTTP, FTP, TCP, UDP, IP, and Ethernet, must be explained. The OSI model is not explicitly required but provides context; AQA focuses on the four-layer TCP/IP model. Students should detail the process of packet switching, including the role of routers and gateways.
理解现代网络需要了解 TCP/IP 协议栈：应用层、传输层、网络层和链路层。必须解释每一层的作用，包括 HTTP、FTP、TCP、UDP、IP 和以太网等协议。OSI 模型虽未明确要求，但提供了背景；AQA 侧重于四层 TCP/IP 模型。学生应详细说明分组交换的过程，包括路由器和网关的作用。
Network topologies (star, bus, mesh), wired and wireless transmission media, and media access control methods like CSMA/CA are examined. Internet security is a critical topic: firewalls, encryption (symmetric and asymmetric including public key), digital signatures, and certificates are discussed. Students must be able to explain how a digital certificate helps authenticate a website and prevent man-in-the-middle attacks.
网络拓扑（星型、总线型、网状）、有线和无线传输介质以及载波侦听多路访问/碰撞避免等介质访问控制方法都会被考查。互联网安全是一个关键主题：讨论了防火墙、加密（包括对称和非对称，以及公钥）、数字签名和证书。学生必须能够解释数字证书如何帮助验证网站并防止中间人攻击。
8. Paper 2: Databases and Big Data | 试卷二：数据库与大数据
Relational databases are a mainstay of the examination. Students must be fluent in SQL, writing queries using SELECT, FROM, WHERE, JOIN, GROUP BY, and HAVING clauses. Normalisation up to third normal form (3NF) is tested through practical exercises: identifying repeating groups, partial dependencies, and transitive dependencies. Understanding primary, foreign, and composite keys is essential for designing robust database schemas.
关系数据库是考试的中流砥柱。学生必须精通 SQL，能使用 SELECT、FROM、WHERE、JOIN、GROUP BY 和 HAVING 子句编写查询。通过实际练习考查规范化至第三范式（3NF）：识别重复组、部分依赖和传递依赖。理解主键、外键和复合键对于设计稳健的数据库模式至关重要。
Big data introduces challenges of volume, velocity, and variety. Concepts of distributed computing, Hadoop, and MapReduce are explored alongside transaction processing (ACID: Atomicity, Consistency, Isolation, Durability) and the necessity for eventual consistency in large distributed systems. Data warehousing and data mining, including the use of algorithms to find patterns, link to business intelligence applications.
大数据引入了数据量、速度和多样性的挑战。在探讨分布式计算、Hadoop 和 MapReduce 概念的同时，也讲解了事务处理（ACID：原子性、一致性、隔离性、持久性）以及大型分布式系统中最终一致性的必要性。数据仓库和数据挖掘，包括使用算法发现模式，与商业智能应用相关联。
9. Paper 2: Functional Programming and Systematic Approach to Problem Solving | 试卷二：函数式编程与系统性解决问题方法
Functional programming is a distinct paradigm increasingly emphasised by AQA. Students must understand first-class functions, higher-order functions (map, filter, reduce/fold), and the principle of immutable data. The exam expects candidates to evaluate functional expressions and write simple functions without side effects. A comparison with procedural and object-oriented paradigms highlights where functional programming excels, such as in concurrent processing.
函数式编程是 AQA 日益强调的一个独特范式。学生必须理解一等函数、高阶函数（map、filter、reduce/fold）以及不可变数据的原理。考试要求考生能计算函数表达式，并编写无副作用的简单函数。与过程式和面向对象范式的比较，突显了函数式编程的优势所在，例如在并发处理中。
The systematic approach to problem solving encompasses the entire software lifecycle: analysis, design, implementation, testing, and evaluation. Construction of structure charts, data flow diagrams, and use of pseudocode are revisited. Understanding different test strategies—black-box, white-box, unit, integration, alpha/beta—and the importance of trace tables for algorithm verification is vital for both Paper 1 and the NEA.
系统性解决问题方法涵盖了整个软件生命周期：分析、设计、实现、测试和评估。重温了结构图、数据流图的构建以及伪代码的使用。理解不同的测试策略——黑盒、白盒、单元、集成、alpha/beta 测试——以及手工推演表对于算法验证的重要性，对试卷一和 NEA 都至关重要。
10. Non-Exam Assessment (NEA): The Programming Project | 非考试评估（NEA）：编程项目
The NEA accounts for 20% of the A-level and is a substantial piece of work requiring students to independently develop a software solution. The project is assessed on analysis (problem description, objectives, user needs), documented design (algorithms, data structures, GUI, test plans), technical solution (code listing with evidence of techniques such as OOP, recursion, or database integration), testing (evidencing error resolution and coverage), and evaluation (discussing success and potential improvements).
NEA 占 A-level 总成绩的 20%，是一项需要学生独立开发软件解决方案的实质性工作。项目评估基于分析（问题描述、目标、用户需求）、有文档记录的设计（算法、数据结构、GUI、测试计划）、技术解决方案（带有体现面向对象编程、递归或数据库集成等技术证据的代码清单）、测试（证明错误解决和覆盖率）以及评估（讨论成功之处和潜在改进）。
The project must have a clear real-world purpose and demonstrate complexity worthy of A2. Common choices include games, mobile apps, and management systems. Consistent use of version control and systematic testing methodologies is encouraged. The write-up must evidence the entire development journey, from initial scope through to reflective evaluation, with clear linkage between requirements and implemented features.
项目必须有明确的现实目的，并展示出符合 A2 水平的复杂性。常见选择包括游戏、移动应用和管理系统。鼓励持续使用版本控制和系统性测试方法。报告必须证明整个开发过程，从最初的范围到反思性评价，并在需求和已实现功能之间建立清晰的联系。
11. Assessment Structure and Mark Distribution | 评估结构与分数分布
Paper 1 is a 2.5-hour on-screen test worth 40% of the A-level. Candidates answer short questions and write programs on a computer, typically using an integrated development environment provided by centres. Paper 2 is a 2.5-hour written paper also worth 40%, featuring short- and extended-answer questions. The NEA contributes 20% and is internally marked, externally moderated. The overall grade relies on mastery across all three components.
试卷一为时长 2.5 小时的上机考试，占 A-level 总分的 40%。考生在计算机上回答简答题并编写程序，通常使用考试中心提供的集成开发环境。试卷二为时长 2.5 小时的笔试，同样占 40%，包含简短和扩展答题。NEA 占 20%，由学校内部评分、外部审核。总成绩取决于对所有三个组成部分的精通程度。
Assessment objectives are split as follows: AO1 (knowledge and understanding of computing principles and concepts) carries 40% across both papers; AO2 (application of knowledge to real contexts) is 30%; AO3 (analysis, design, evaluation) is 30%. For the NEA, the emphasis is heavily on AO3. Understanding this weighting can guide how students allocate study time and how much detail to provide in long-answer questions.
评估目标划分如下：AO1（对计算原理和概念的知识与理解）在两篇试卷中共占 40%；AO2（将知识应用于实际情境）占 30%；AO3（分析、设计、评价）占 30%。对于 NEA，重点大幅倾向于 AO3。理解这一权重可以指导学生如何分配学习时间，以及在长答题中应提供多少细节。
12. Effective Revision and Exam Techniques | 有效复习与应试技巧
Effective revision for AQA Computer Science requires a blend of theory memorisation and practical coding practice. Regularly implement data structures and algorithms from scratch; use past paper programming tasks under timed conditions. Create flash cards for definitions of key terms—such as the difference between lossy and lossless compression, or the four ACID properties—to handle the short-answer questions in Paper 2.
对 AQA 计算机科学进行有效复习，需要理论记忆与实践编码相结合。定期从零开始实现数据结构和算法；在限时条件下完成历年试卷的编程任务。制作关键术语定义的闪卡——例如有损压缩和无损压缩的区别，或 ACID 的四个属性——以应对试卷二中简答题。
For Paper 1, ensure full familiarity with the on-screen exam environment. Practice navigating the IDE without error prompts and get comfortable reading and writing pseudocode quickly. Draw trace tables for recursive functions in your explanations. In Paper 2, always relate your answers to the context given in the scenario. Use precise technical language: say 'authentication via digital signature' rather than just 'security'. For the NEA, start early, maintain a detailed diary, and consistently back up your work. Reviewing examiner reports reveals common pitfalls, such as failing to meet complexity requirements or providing insufficient evidence of testing.
对于试卷一，务必完全熟悉上机考试环境。练习在没有错误提示的情况下操作 IDE，并快速习惯阅读和编写伪代码。在解释中为递归函数绘制手工推演表。在试卷二中，始终将答案与题目给出的情境联系起来。使用精确的技术语言：说“通过数字签名进行身份验证”而不只是“安全”。对于 NEA，尽早开始，保持详细日志，并持续备份工作。阅读考官报告可发现常见陷阱，如未能满足复杂性要求或提供的测试证据不足。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图