📚 Year 13 WJEC Computer Science: Complete Specification Breakdown | Year 13 WJEC 计算机：课程大纲全面解析
In Year 13, WJEC A Level Computer Science moves beyond the fundamentals introduced at AS and asks you to engage deeply with abstract concepts, systems thinking, and professional-grade programming. This article provides a full walk‑through of the A2 specification, covering Units 3 and 4, and links each topic to the skills you will need for the examination and the non‑exam assessment (Unit 5). Whether you are revising for your final written papers or refining your project, a clear map of the syllabus is your most valuable tool.
在 Year 13，WJEC A Level 计算机科学课程超越了 AS 阶段的基础知识，要求你深入理解抽象概念、系统思维和专业级编程。本文全面梳理 A2 规格，涵盖单元三和单元四，并将每个主题与考试及非考试评估（单元五）所需技能联系起来。无论你是在为最后的笔试复习，还是在打磨课程项目，一张清晰的课程地图都是你最宝贵的工具。
1. Abstract Data Types and Data Structures | 抽象数据类型与数据结构
A key intellectual leap in Year 13 is the formal treatment of data structures as abstract data types (ADTs). An ADT is defined by the operations that can be performed on it rather than by its implementation. You are expected to understand, implement, and compare stacks, queues, linked lists, trees, and graphs.
Year 13 的一个关键思维跃迁是将数据结构正式视为抽象数据类型（ADT）。ADT 由可在其上执行的操作来定义，而非其实现方式。你需要理解、实现并比较栈、队列、链表、树和图。
A stack is a last‑in‑first‑out (LIFO) collection supporting push, pop, and peek (or top). You must be able to describe applications such as subroutine call‑return stacks and undo buffers. A queue is first‑in‑first‑out (FIFO), with applications in print spooling and keyboard buffers. Both can be implemented using arrays with pointers or using dynamic linked lists.
栈是一种后进先出（LIFO）集合，支持 push、pop 和 peek（或 top）操作。你必须能够描述其应用，如子程序调用返回栈和撤销缓冲区。队列是先进先出（FIFO），应用于打印假脱机和键盘缓冲区。两者都可以使用带指针的数组或动态链表来实现。
Linked lists introduce the concept of nodes containing a data field and a reference to the next node. You need to know how to add, delete, and traverse nodes in singly, doubly, and circular linked lists, and be able to compare their memory usage and performance with arrays. Trees, especially binary search trees, are used to maintain ordered data for efficient searching, insertion, and deletion. You should be able to draw and manipulate BSTs and describe in‑order, pre‑order, and post‑order traversals.
链表引入了节点的概念，节点包含数据域和指向下一个节点的引用。你需要知道如何在单向、双向和循环链表中添加、删除和遍历节点，并能比较它们与数组在内存使用和性能上的差异。树，特别是二叉搜索树，用于维护有序数据，以实现高效的搜索、插入和删除。你应该能够绘制和操作 BST，并描述中序、前序和后序遍历。
Graphs are modelled as sets of vertices connected by edges. Representations include adjacency matrices and adjacency lists, each suited to different types of algorithms. You should understand directed and undirected graphs and be able to apply depth‑first and breadth‑first traversal.
图被建模为由边连接的顶点集合。表示方法包括邻接矩阵和邻接表，各自适用于不同类型的算法。你需要理解有向图和无向图，并能够应用深度优先和广度优先遍历。
2. Algorithms: Design, Analysis, and Efficiency | 算法：设计、分析与效率
Year 13 demands a rigorous approach to algorithm design. You are expected to use standard algorithms for searching (linear and binary search) and sorting (bubble, insertion, merge, and quicksort) and to be able to trace, implement, and compare them in terms of time complexity.
Year 13 要求以严谨的方式对待算法设计。你需要使用标准的搜索算法（线性搜索和二分搜索）和排序算法（冒泡排序、插入排序、归并排序和快速排序），并能够追踪、实现它们，并根据时间复杂度进行比较。
Big O notation is introduced as a way of describing the upper bound of an algorithm’s running time or space usage in relation to the input size n. Common complexities include O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). You must be able to justify the worst‑case complexity for each sorting and searching algorithm.
大 O 表示法用于描述算法运行时间或空间使用的上界与输入规模 n 的关系。常见的复杂度有 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。你必须能够说明每种排序和搜索算法的最坏情况复杂度。
Algorithm design strategies also include recursion. You should be comfortable writing recursive solutions for problems such as factorial, Fibonacci, and traversing trees. Understanding how recursion uses the call stack and the potential for stack overflow is essential. In addition, you will explore Dijkstra’s shortest‑path algorithm for weighted graphs, which involves a priority queue and greedy decision making.
算法设计策略还包括递归。你应当能够为阶乘、斐波那契和树遍历等问题编写递归解决方案。理解递归如何利用调用栈以及潜在的栈溢出风险至关重要。此外，你还会探索加权图的 Dijkstra 最短路径算法，它涉及优先队列和贪心决策。
3. Object‑Oriented Programming in Depth | 面向对象编程深入
While AS introduces the basic ideas of objects and classes, Year 13 requires a mature understanding of object‑oriented programming (OOP) principles. You must be able to design and implement a system using encapsulation, inheritance, polymorphism, and association relationships such as aggregation and composition.
虽然 AS 引入了对象和类的基本思想，但 Year 13 要求对面向对象编程（OOP）原则有成熟的理解。你必须能够使用封装、继承、多态以及关联关系（如聚合和组合）来设计和实现一个系统。
Encapsulation means bundling data and methods within a class and restricting direct access by making attributes private. You must use public getter and setter methods to control access. Inheritance allows a subclass to derive attributes and methods from a superclass, promoting code reuse. Polymorphism enables a single interface to be used for different underlying forms: method overriding allows a subclass to provide a specific implementation of a method already defined in its superclass.
封装意味着将数据和方法捆绑在类中，并通过将属性设为私有来限制直接访问。你必须使用公共的 getter 和 setter 方法来控制访问。继承允许子类从超类派生属性和方法，促进代码复用。多态使得单一接口可以用于不同底层形式：方法重写允许子类为其超类中已定义的方法提供具体实现。
You will be expected to produce class diagrams using Unified Modelling Language (UML), showing class names, attributes, methods, visibility markers (+, ‑, #), and relationships including inheritance arrows and multiplicity. Practical coding tasks in the on‑screen exam and project require you to demonstrate these concepts in a high‑level language such as Python, Java, or C#.
你需要使用统一建模语言（UML）生成类图，显示类名、属性、方法、可见性标记（+、‑、#）以及关系，包括继承箭头和多重性。机考和项目中的实际编码任务要求你用 Python、Java 或 C# 等高级语言演示这些概念。
4. Systems Analysis and Software Development Life Cycles | 系统分析与软件开发生命周期
Unit 3 places significant weight on the process of developing software. You must be familiar with the stages of the software development life cycle (SDLC): feasibility study, analysis, design, implementation, testing, installation, and maintenance. You should be able to compare different lifecycle models, particularly the waterfall model and iterative/agile approaches.
单元三对软件开发过程给予了相当大的权重。你必须熟悉软件开发生命周期（SDLC）的阶段：可行性研究、分析、设计、实现、测试、安装和维护。你需要比较不同的生命周期模型，特别是瀑布模型和迭代/敏捷方法。
Feasibility study examines whether a project is technically, economically, and operationally viable. During analysis, requirements are captured using techniques such as interviews, questionnaires, and observation. You need to be able to produce data flow diagrams (DFDs) and entity‑relationship diagrams (ERDs) to model current and proposed systems. Design covers user interface, data structures, algorithms, and system architecture.
可行性研究考察项目在技术、经济和操作上是否可行。在分析阶段，通过访谈、问卷和观察等技术捕获需求。你需要能够绘制数据流图（DFD）和实体关系图（ERD）来对当前和拟议系统建模。设计覆盖用户界面、数据结构、算法和系统架构。
Testing strategies include unit testing, integration testing, system testing, and acceptance testing. You must understand the difference between black‑box and white‑box testing and be able to design test plans with normal, boundary, and erroneous data. Maintenance types—corrective, adaptive, and perfective—complete the lifecycle.
测试策略包括单元测试、集成测试、系统测试和验收测试。你必须理解黑盒测试与白盒测试的区别，并能设计包含正常、边界和错误数据的测试计划。维护类型——纠正性、适应性和完善性——完成整个生命周期。
5. Computer Architecture and Fetch‑Execute Cycle | 计算机体系结构与取指‑执行周期
Unit 4 revisits the internal workings of a processor at a deeper level. You must explain the fetch‑decode‑execute cycle and the role of registers such as the program counter (PC), memory address register (MAR), memory data register (MDR), current instruction register (CIR), and accumulator (ACC). The control unit, arithmetic logic unit (ALU), and clock are central to coordinating instruction execution.
单元四在更深层次上重新审视处理器的内部工作原理。你必须解释取指‑解码‑执行周期以及寄存器的作用，如程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器（ACC）。控制单元、算术逻辑单元（ALU）和时钟是协调指令执行的核心。
You should be able to describe how factors such as clock speed, number of cores, cache memory, and word length affect processor performance. The concept of pipelining is examined as a means of improving throughput by overlapping fetch, decode, and execute stages for successive instructions.
你需要描述时钟速度、核心数量、高速缓存和字长等因素如何影响处理器性能。流水线的概念作为一种通过在连续指令间重叠取指、解码和执行阶段来提高吞吐量的手段被考察。
Memory hierarchy is important: registers, cache, main memory (RAM), and secondary storage are compared by speed, cost, and capacity. You must understand the use of virtual memory and how paging and segmentation work to manage memory efficiently. Input/output techniques including programmed I/O, interrupt‑driven I/O, and direct memory access (DMA) are covered.
存储层次结构非常重要：寄存器、缓存、主存（RAM）和辅存按速度、成本和容量进行比较。你必须理解虚拟内存的使用，以及分页和分段如何有效管理内存。输入/输出技术包括程序控制 I/O、中断驱动 I/O 和直接存储器访问（DMA）。
6. Operating Systems and Utility Software | 操作系统与实用程序
The operating system (OS) is examined as an intermediary between user and hardware. You need to explain its functions: memory management, processor scheduling, file management, input/output control, and providing a user interface. Distinctions between single‑user, multi‑user, multi‑tasking, and real‑time operating systems should be clear.
操作系统（OS）被考察为用户与硬件之间的中介。你需要解释其功能：内存管理、处理器调度、文件管理、输入/输出控制以及提供用户界面。应清楚区分单用户、多用户、多任务和实时操作系统。
Scheduling algorithms such as round‑robin, first‑come‑first‑served, shortest‑job‑first, and priority‑based scheduling are evaluated in terms of throughput, turnaround time, waiting time, and response time. Disk scheduling algorithms (e.g., FCFS, SSTF, SCAN) also feature in the specification.
调度算法如轮转调度、先来先服务、最短作业优先和基于优先级的调度，根据吞吐量、周转时间、等待时间和响应时间进行评估。磁盘调度算法（如 FCFS、SSTF、SCAN）也出现在规格中。
Utilities such as disk defragmenters, backup software, compression tools, and anti‑malware programs are part of the system software landscape. You should be able to explain how each utility supports the efficient and secure operation of a computer system.
实用程序如磁盘碎片整理程序、备份软件、压缩工具和反恶意软件程序是系统软件范畴的一部分。你需要解释每种实用程序如何支持计算机系统高效、安全地运行。
7. Databases, SQL, and Normalisation | 数据库、SQL 与规范化
The database section expands on AS knowledge by introducing relational algebra and a rigorous approach to normalisation. You need to understand the concepts of entity integrity (primary keys) and referential integrity (foreign keys) and be able to write SQL queries that retrieve, insert, update, and delete data.
数据库部分在 AS 知识基础上引入了关系代数和严格的规范化方法。你需要理解实体完整性（主键）和参照完整性（外键）的概念，并能编写 SQL 查询来检索、插入、更新和删除数据。
SQL skills must include the use of SELECT, FROM, WHERE, GROUP BY, HAVING, ORDER BY, and aggregate functions (COUNT, SUM, AVG, MAX, MIN). You should be able to join multiple tables using INNER JOIN, LEFT/RIGHT JOIN, and use sub‑queries.
SQL 技能必须包括使用 SELECT、FROM、WHERE、GROUP BY、HAVING、ORDER BY 以及聚合函数（COUNT、SUM、AVG、MAX、MIN）。你需要能够使用 INNER JOIN、LEFT/RIGHT JOIN 连接多个表，并使用子查询。
Normalisation is a process for eliminating data redundancy and anomalies. You must apply the rules for first (1NF), second (2NF), and third normal form (3NF). Given a set of unnormalised data and functional dependencies, you should be able to produce a normalised relational schema. Entity‑relationship diagrams (crow’s foot notation) are used to model data requirements before implementation.
规范化是消除数据冗余和异常的过程。你必须应用第一范式（1NF）、第二范式（2NF）和第三范式（3NF）的规则。给定一组非规范化数据和函数依赖，你应该能够生成规范化的关系模式。实体关系图（鱼尾纹符号）用于在实现之前对数据需求建模。
8. Networking, Protocols, and the TCP/IP Stack | 网络、协议与 TCP/IP 协议栈
Networking coverage includes LANs and WANs, topologies (star, bus, mesh), and transmission media. You must be able to compare circuit switching and packet switching and explain how data is routed across the Internet using routers and gateways.
网络覆盖内容包括 LAN 和 WAN、拓扑结构（星形、总线形、网状）以及传输介质。你必须能够比较电路交换和分组交换，并解释数据如何使用路由器和网关在互联网上路由。
The TCP/IP stack is a central model. You must know the four layers—application, transport, internet, and link—and the function of protocols at each layer. At the transport layer, you must explain how TCP provides reliable, connection‑oriented communication using sequence numbers and acknowledgements, while UDP offers a connectionless service suitable for streaming. IP addressing, including the structure of IPv4 and IPv6 addresses and the use of subnet masks, must be understood.
TCP/IP 协议栈是一个核心模型。你必须了解四层——应用层、传输层、互联网层和链路层——以及每层协议的功能。在传输层，你需要解释 TCP 如何使用序列号和确认提供可靠的、面向连接的通信，而 UDP 提供适合流媒体的无连接服务。必须理解 IP 寻址，包括 IPv4 和 IPv6 地址的结构以及子网掩码的使用。
Network security threats such as malware, phishing, denial‑of‑service attacks, and SQL injection are studied alongside countermeasures including firewalls, encryption, penetration testing, and biometric authentication. You must be able to discuss the effectiveness and trade‑offs of different security measures.
网络安全威胁如恶意软件、网络钓鱼、拒绝服务攻击和 SQL 注入，与防火墙、加密、渗透测试和生物特征认证等对策一并学习。你需要能够讨论不同安全措施的有效性和权衡。
9. Theory of Computation and Finite State Machines | 计算理论与有限状态机
Year 13 introduces formal computational models. Finite state machines (FSMs) and their Mealy and Moore variants are used to model systems with a limited number of conditions. You should be able to draw state transition diagrams and tables, and discuss their applications in lexical analysis, vending machines, and digital watches.
Year 13 引入了形式化计算模型。有限状态机（FSM）及其 Mealy 和 Moore 变体用于建模状态有限的系统。你需要能够绘制状态转换图和状态转换表，并讨论它们在词法分析、自动售货机和数字手表中的应用。
Regular expressions and regular languages are introduced as a notation for describing patterns of strings. You must be able to write regular expressions and interpret their meanings. The relationship between FSMs and regular languages is examined: every regular language can be represented by an FSM and vice versa.
正则表达式和正则语言作为一种描述字符串模式的符号被引入。你必须能够编写正则表达式并解释其含义。FSM 与正则语言之间的关系被考察：每个正则语言都可以用 FSM 表示，反之亦然。
The idea of Turing machines as a universal model of computation is explored. You need to describe the components of a Turing machine (tape, head, state register, transition rules) and understand the Church‑Turing thesis. The halting problem is used to illustrate the existence of uncomputable problems, laying a philosophical foundation for the limits of computation.
图灵机作为通用计算模型的理念被探讨。你需要描述图灵机的组成部分（纸带、磁头、状态寄存器、转换规则），并理解邱奇‑图灵论题。停机问题被用来阐明存在不可计算的问题，为计算的极限奠定了哲学基础。
10. Legal, Ethical, and Cultural Implications | 法律、道德与文化影响
Computing does not exist in a vacuum. Year 13 requires you to engage with the societal impact of digital technologies. The Data Protection Act 2018 (incorporating GDPR) is a key piece of legislation: you must know the principles relating to the processing of personal data, the rights of data subjects, and the responsibilities of data controllers.
计算并非存在于真空中。Year 13 要求你探讨数字技术的社会影响。《2018 年数据保护法》（纳入了 GDPR）是一部关键立法：你必须了解与个人数据处理相关的原则、数据主体的权利以及数据控制者的责任。
The Computer Misuse Act 1990 criminalises unauthorised access to computer material, unauthorised access with intent to commit further offences, and unauthorised acts with intent to impair the operation of a computer. You need to connect these offences to real‑world cases of hacking and malware distribution. The Regulation of Investigatory Powers Act 2000 and the Copyright, Designs and Patents Act 1988 also feature in the specification.
《1990 年计算机滥用法》将未经授权访问计算机材料、未经授权访问意图实施进一步犯罪以及未经授权行为意图损害计算机运行定为刑事犯罪。你需要将这些罪行与黑客攻击和恶意软件传播的现实案例联系起来。《2000 年调查权力规制法》和《1988 年版权、外观设计和专利法》也在规格中出现。
Ethical discussions should cover automation and job displacement, the digital divide, environmental effects of e‑waste and data centres, and the moral responsibilities of software developers. You may be asked to argue a balanced viewpoint in an essay, using structured paragraphs and reasoned conclusions.
伦理讨论应涵盖自动化和就业替代、数字鸿沟、电子废弃物和数据中心的环境影响，以及软件开发人员的道德责任。你可能需要在论文中论证一个均衡的观点，使用结构化的段落和基于推理的结论。
11. Examination Preparation and Unit 5 Project | 考试准备与单元五项目
The A2 qualification is assessed through two written papers and a non‑exam assessment (NEA). Unit 3 (Programming and System Development) is a 2‑hour on‑screen examination that includes programming tasks, algorithm tracing, and systems analysis questions. Unit 4 (Computer Architecture, Data, Communication and Applications) is a 2‑hour written paper with a mixture of short‑answer and extended‑response questions.
A2 资格证书通过两份笔试和一份非考试评估（NEA）来评定。单元三（编程与系统开发）为 2 小时机考，包含编程任务、算法跟踪和系统分析问题。单元四（计算机体系结构、数据、通信和应用）为 2 小时笔试，题型包括简答题和拓展回答题。
For the Unit 5 project, you must identify a real problem for a client, analyse requirements, design a solution, implement it in a suitable language, test and document the software, and evaluate the final product. The project is an opportunity to demonstrate synthesis of all A2 knowledge—OOP, data structures, algorithms, and systems development practises—in a substantial piece of work.
对于单元五项目，你必须为客户识别一个真实问题，分析需求，设计方案，用合适的语言实现，测试并记录软件，以及评估最终产品。该项目是一个机会，让你在一项实质性的工作中展示所有 A2 知识的综合——OOP、数据结构、算法和系统开发实践。
Effective revision should interleave theory with practical coding. Use past papers to familiarise yourself with the style and timing of questions. For topics such as Big O and logic, create flashcards. For databases and programming, write code daily. The depth of Year 13 content rewards consistent, active engagement over many months.
有效的复习应将理论与实践编码交替进行。使用过往试卷熟悉问题的风格和时间限制。对于大 O 和逻辑等主题，制作记忆卡片。对于数据库和编程，每天编写代码。Year 13 内容的深度会回报你数月以来持续、积极的投入。
12. Putting It All Together: A Synoptic View | 汇总：综合视角
WJEC Computer Science at Year 13 is intentionally synoptic. The same core themes—data, algorithms, systems, and societal impact—recur across all units. A deep understanding of how a processor executes machine code informs your appreciation of high‑level language performance; knowledge of network protocols connects to database client‑server models; appreciation of ethical constraints shapes how you justify design decisions in your project.
WJEC Year 13 计算机科学有意设计为综合性的。相同的核心主题——数据、算法、系统和社会影响——贯穿所有单元。深刻理解处理器如何执行机器代码有助于你领会高级语言的性能；网络协议知识连接数据库客户‑服务器模型；理解道德约束塑造了你如何在项目中论证设计决策。
By treating the specification not as a checklist of isolated facts but as a coherent narrative, you will be able to answer high‑band questions that require evaluation, synthesis, and justification. The examiners look for evidence that you can think like a computer scientist—rigorous, logical, and mindful of the wider world.
通过将课程规格视为一个连贯的叙述而非孤立事实的清单，你将能够回答需要评估、综合和论证的高分问题。考官寻找的是你能像计算机科学家一样思考的证据——严谨、合乎逻辑并关心更广阔的世界。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply