📚 Year 13 WJEC Computer Science: Summer Preparation & Bridging Course | Year 13 WJEC 计算机科学：暑期预习与衔接课程
Welcome to the Year 13 WJEC Computer Science summer bridging course. This resource is designed to help you transition smoothly from Year 12 by reinforcing foundational knowledge and introducing key Year 13 concepts. You will explore advanced programming techniques, computer architecture, databases, networking, and the theoretical underpinnings of computation. Mastering these areas will not only prepare you for examinations but also for the practical programming project. Let’s begin building your confidence for the year ahead.
欢迎来到 Year 13 WJEC 计算机科学暑期衔接课程。本资源旨在通过巩固 Year 12 的基础知识并引入关键的 Year 13 概念，帮助你顺利过渡。你将探索高级编程技术、计算机体系结构、数据库、网络以及计算的理论基础。掌握这些领域不仅能为你的考试做好准备，也能为你完成实践编程项目打下坚实基础。让我们开始为接下来的一年建立信心吧。
1. Advanced Data Structures: Stacks, Queues, Trees, and Graphs | 高级数据结构：栈、队列、树和图
Moving beyond simple arrays, Year 13 requires confidence with abstract data types (ADTs). A stack follows a Last In, First Out (LIFO) policy, used in recursion and undo operations. A queue uses First In, First Out (FIFO) and is essential for print spooling and buffer management. Understanding these linear structures sets the stage for non-linear data types such as trees and graphs, which directly support searching and routing algorithms.
超越简单的数组，Year 13 课程要求你对抽象数据类型（ADT）充满信心。栈遵循后进先出（LIFO）原则，用于递归和撤销操作；而队列采用先进先出（FIFO）原则，对于打印队列和缓冲区管理至关重要。理解这些线性结构为树和图等非线性数据类型打下了基础，它们直接支持搜索和路由算法。
Binary trees provide efficient searching and sorting when balanced. A binary search tree ensures that for any node, the left child holds a smaller key and the right child a larger key. Graphs, composed of vertices and edges, model real-world networks like social connections or transport systems. You should be able to traverse graphs using depth-first and breadth-first searches, implementing them with stacks and queues respectively.
平衡的二叉树能够提供高效的搜索和排序。二叉搜索树保证对于任意节点，左子节点的键值更小，右子节点的键值更大。图由顶点和边组成，可为社交网络或交通系统等现实世界中的网络建模。你应当能够使用深度优先和广度优先搜索来遍历图，并分别用栈和队列来实现它们。
Time complexity for typical operations becomes part of your design decisions. The average case for a balanced BST search is O(log n), whereas a linked-list implementation of a stack or queue offers O(1) for push and pop. You will be expected to select the correct ADT based on these performance characteristics in both written answers and your programming project.
典型操作的时间复杂度会成为你设计决策的一部分。在平衡的二叉搜索树中，搜索的平均时间复杂度为 O(log n)，而用链表实现的栈或队列，其压入和弹出操作的时间复杂度为 O(1)。在书面作答和编程项目中，你都应能根据这些性能特点选择合适的抽象数据类型。
2. Algorithm Complexity and Recursive Thinking | 算法复杂度与递归思维
Evaluating algorithm efficiency using Big O notation is central to Year 13. You will differentiate between constant time O(1), linear O(n), logarithmic O(log n), linearithmic O(n log n), quadratic O(n²), and exponential O(2ⁿ) growth. This analysis allows you to predict how an algorithm scales with input size and to justify your choice of sorting or searching methods.
使用大 O 表示法评估算法效率是 Year 13 的核心。你将区分常数时间 O(1)、线性时间 O(n)、对数时间 O(log n)、线性对数时间 O(n log n)、二次时间 O(n²) 和指数时间 O(2ⁿ) 的增长。这种分析能让你预测算法随输入规模扩展的情况，并为你选择的排序或搜索方法提供理由。
Recursion is a powerful technique where a function calls itself with a modified parameter until it reaches a base case. It is elegant for problems like calculating factorials, traversing tree structures, or solving the Tower of Hanoi. However, you must understand the trade-offs: every recursive call consumes stack memory, and deep recursion can trigger a stack overflow. Comparing recursive and iterative implementations highlights the balance between code clarity and performance.
递归是一种强大的技术，函数通过调用自身并每次传递修改后的参数，直到达到基准条件。它非常适合解决计算阶乘、遍历树结构或解决汉诺塔等问题。然而，你必须了解其中的权衡：每次递归调用都会消耗栈内存，深度递归可能引发栈溢出。比较递归和迭代的实现，可以凸显代码清晰度与性能之间的平衡。
You will apply algorithmic thinking to standard problems such as Dijkstra’s shortest path for graphs and the A* algorithm for pathfinding. Understanding how heuristics improve efficiency in A* is a common examination topic. Practising these algorithms on paper before coding them will strengthen your ability to trace and debug processes under timed conditions.
你会将算法思维应用于标准问题，例如图的 Dijkstra 最短路径算法和用于寻路的 A* 算法。理解启发式算法如何提升 A* 的效率是常见的考试主题。在编码之前先在纸上练习这些算法，将增强你在限时条件下跟踪和调试过程的能力。
3. Object-Oriented Design in Depth | 面向对象设计深入
In Year 13, object-oriented programming (OOP) moves beyond basic class creation to encompass inheritance, polymorphism, encapsulation, and aggregation. Inheritance allows you to derive a subclass that reuses and extends the functionality of a base class, reducing code duplication. Polymorphism enables objects of different classes to respond to the same method name, often through overriding, making systems more flexible.
在 Year 13，面向对象编程（OOP）超越了基本的类创建，涵盖了继承、多态、封装和聚合。继承允许你派生出一个子类，重用并扩展基类的功能，从而减少代码重复。多态则使不同类的对象能够对同一方法名做出响应，通常通过重写实现，让系统更加灵活。
Diagrams such as Unified Modeling Language (UML) class diagrams become essential tools for planning your programming project. You should be able to describe associations, multiplicities (1 to many, many to many), and the difference between composition (strong ownership) and aggregation (weaker relationship). Being able to translate a UML diagram into well-structured code is a skill assessed in both the written paper and the non-exam assessment.
诸如统一建模语言（UML）类图等图表，成为规划编程项目的必要工具。你应能描述关联关系、重数（一对多、多对多），以及组合（强拥有关系）和聚合（较弱关系）之间的区别。能够将 UML 图转化为结构良好的代码，是书面考卷和非考试评估中都会考察的技能。
Design patterns such as the Singleton pattern (ensuring only one instance of a class) or the Factory pattern may be introduced. While not always explicitly required by WJEC, applying these patterns demonstrates technical maturity. Furthermore, you must rigorously apply data hiding by using private attributes and public getters/setters, ensuring that objects control their own state.
设计模式，比如单例模式（确保一个类只有一个实例）或工厂模式，也可能会被引入。虽然 WJEC 不总是明确要求，但应用这些模式能体现技术成熟度。此外，你必须通过使用私有属性和公共的 getter/setter 方法严格实施数据隐藏，确保对象控制自己的状态。
4. Computer Architecture: CISC vs RISC and Pipelining | 计算机体系结构：CISC 与 RISC 及流水线
Year 13 deepens your understanding of the processor by comparing complex instruction set computer (CISC) and reduced instruction set computer (RISC) architectures. CISC processors, typical in desktop systems, use a large set of instructions of varying lengths that can perform multi-step operations in one command. RISC designs use a smaller set of simple, fixed-length instructions that execute in a single clock cycle, favouring compiler optimisation.
Year 13 通过比较复杂指令集计算机（CISC）和精简指令集计算机（RISC）架构，加深你对处理器的理解。CISC 处理器常见于桌面系统，它使用一大套不定长的指令，能够在一个命令中执行多步操作。RISC 设计则使用一套更小、更简单且定长的指令集，在一到两个时钟周期内即可执行完毕，更侧重于编译器的优化。
Pipelining is a key technique for improving CPU performance by allowing the fetch-decode-execute cycle to overlap for multiple instructions. While one instruction is being executed, the next can be decoded and the one after that fetched. You will need to explain pipeline hazards: data hazards (when an instruction depends on a previous result not yet written), control hazards (due to branches), and how techniques such as forwarding and branch prediction resolve them.
流水线是通过允许多条指令的取指-译码-执行周期重叠来提高 CPU 性能的关键技术。当一条指令正在执行时，下一条指令可以被译码，再下一条被取出。你需要解释流水线冒险：数据冒险（当一条指令依赖尚未写回的前一条指令结果时）、控制冒险（由于分支指令引起），以及如何通过转发和分支预测等技术来解决它们。
You will also examine contemporary architectures such as parallel processing (multi-core) and graphics processing units (GPUs). SIMD (Single Instruction, Multiple Data) processing illustrates how a single instruction can operate on multiple pieces of data simultaneously, which is fundamental to machine learning and scientific computation. Linking this to the Von Neumann bottleneck helps you understand why these advancements were necessary.
你还将研究当代架构，如并行处理（多核）和图形处理器（GPU）。单指令多数据流（SIMD）处理展示了单条指令如何同时操作多个数据片段，这是机器学习和科学计算的基础。将其与冯·诺依曼瓶颈联系起来，有助于你理解为何这些进步是必需的。
5. Operating System Functions and Scheduling | 操作系统功能与调度
An operating system manages hardware resources and provides services for application programs. In Year 13 you must explain memory management using paging, segmentation, and virtual memory. Virtual memory uses disk space to simulate extra RAM, but excessive paging (thrashing) degrades performance. Understanding how the memory management unit (MMU) translates logical addresses to physical addresses via a page table is critical.
操作系统管理硬件资源并为应用程序提供服务。在 Year 13，你必须解释使用分页、分段和虚拟内存的内存管理。虚拟内存利用磁盘空间来模拟额外的 RAM，但过多的页面调度（系统抖动）会降低性能。理解内存管理单元（MMU）如何通过页表将逻辑地址转换为物理地址至关重要。
Scheduling algorithms determine which process gets the CPU. You must compare round robin (fair, fixed time quantum), first come first served (simple but can starve short processes), shortest remaining time (optimises throughput), and multi-level feedback queues. Each has trade-offs regarding turnaround time, response time, and throughput. You should be prepared to calculate waiting times given Gantt charts.
调度算法决定了哪个进程占用 CPU。你必须比较轮转调度（公平，固定的时间片）、先来先服务（简单但可能导致短进程饥饿）、最短剩余时间优先（优化吞吐量）和多级反馈队列。它们在周转时间、响应时间和吞吐量之间各有取舍。你应做好根据甘特图计算等待时间的准备。
Interrupt handling and the role of the kernel are also examined. When an interrupt occurs, the CPU saves its state, runs the interrupt service routine (ISR), and then restores the previous process. This mechanism allows a system to respond to external events such as I/O completion or a mouse click. Real-time operating systems often prioritise interrupts to guarantee meeting deadlines.
中断处理和内核的角色也是考查内容。当中断发生时，CPU 保存其状态，运行中断服务程序（ISR），然后恢复先前的进程。这种机制让系统能够响应外部事件，如 I/O 完成或鼠标点击。实时操作系统通常优先处理中断，以保证满足截止时间。
6. Relational Databases and Normalisation to 3NF | 关系数据库与第三范式规范化
Building on Year 12 database concepts, you will master normalisation to eliminate data redundancy and update anomalies. The process involves taking unnormalised data (UNF) and converting it to first normal form (1NF) by removing repeating groups, then to second normal form (2NF) by removing partial dependencies, and finally to third normal form (3NF) by resolving transitive dependencies.
在 Year 12 数据库概念的基础上，你将掌握规范化以消除数据冗余和更新异常。该过程涉及将未规范化的数据（UNF）通过去除重复组转换为第一范式（1NF），再通过去除部分依赖转换为第二范式（2NF），最后通过解决传递依赖达到第三范式（3NF）。
Structured Query Language (SQL) becomes more sophisticated. You need to write queries using inner joins and outer joins, perform aggregate functions (COUNT, SUM, AVG, MIN, MAX) with GROUP BY and HAVING clauses, and create sub-queries. Being able to define a database schema using Data Definition Language (DDL), including primary key and foreign key constraints, is fundamental.
结构化查询语言（SQL）变得更加复杂。你需要编写使用内连接和外连接的查询，使用带 GROUP BY 和 HAVING 子句的聚合函数（COUNT、SUM、AVG、MIN、MAX），并创建子查询。能够使用数据定义语言（DDL）定义数据库模式，包括主键和外键约束，是基础能力。
You will also study the role of the database administrator, data warehousing, and the concept of ACID (Atomicity, Consistency, Isolation, Durability) properties that guarantee reliable transactions. Understanding record locking and deadlock resolution is a step toward designing robust multi-user systems, which often features in scenario-based questions.
你还将学习数据库管理员的角色、数据仓库，以及保证可靠事务的 ACID（原子性、一致性、隔离性、持久性）特性概念。理解记录锁定和死锁解决是迈向设计健壮多用户系统的一步，这在基于场景的问题中经常出现。
7. Networking Models and the TCP/IP Stack | 网络模型与 TCP/IP 协议栈
The TCP/IP five-layer model is the foundation of modern internet communication. You must describe the roles of the application layer (HTTP, SMTP, FTP), transport layer (TCP, UDP), network layer (IP), data link layer (MAC), and physical layer. Contrasting TCP (connection-oriented, guarantees delivery) with UDP (connectionless, low latency but no delivery guarantee) helps you decide which protocol suits applications like streaming or file transfer.
TCP/IP 五层模型是现代互联网通信的基础。你必须描述应用层（HTTP、SMTP、FTP）、传输层（TCP、UDP）、网络层（IP）、数据链路层（MAC）和物理层的作用。对比 TCP（面向连接，保证交付）和 UDP（无连接，低延迟但不保证交付）有助于你决定哪个协议适合流媒体或文件传输等应用。
IP addresses (IPv4 vs IPv6) and subnetting allow networks to be logically divided. Network address translation (NAT) lets multiple devices share a single public IP. You should be able to explain how a router uses a routing table to forward packets, and how the domain name system (DNS) resolves domain names to IP addresses through an iterative or recursive query process.
IP 地址（IPv4 与 IPv6）和子网划分允许网络被逻辑性地分割。网络地址转换（NAT）允许多个设备共享一个公共 IP。你应能解释路由器如何使用路由表转发数据包，以及域名系统（DNS）如何通过迭代或递归查询过程将域名解析为 IP 地址。
Network security topics, including firewalls (packet filtering and stateful inspection), encryption (symmetric vs asymmetric), and digital signatures, are examined. You must also understand threats such as man-in-the-middle attacks, SQL injection, and denial-of-service attacks, alongside preventative measures like penetration testing and strong authentication protocols.
网络安全主题，包括防火墙（包过滤和状态检测）、加密（对称与非对称）和数字签名，都是考查内容。你还必须理解中间人攻击、SQL 注入和拒绝服务攻击等威胁，以及渗透测试和强认证协议等预防措施。
8. Computational Theory: Regular Expressions and Turing Machines | 计算理论：正则表达式与图灵机
Regular languages and finite state machines (FSMs) form the theoretical basis for lexical analysis. You must describe how a finite state automaton (FSA) can accept or reject a given string, and how regular expressions define pattern sets. When creating a compiler, lexical analysers use FSMs to tokenise source code, a process you may need to simulate with state transition diagrams.
正则语言和有限状态机（FSM）构成了词法分析的理论基础。你必须描述有限状态自动机（FSA）如何接受或拒绝给定的字符串，以及正则表达式如何定义模式集合。在创建编译器时，词法分析器使用 FSM 来对源代码进行标记化，这一过程你可能需要借助状态转移图来模拟。
Turing machines provide a formal model of computation. A Turing machine consists of a tape, a head, a state register, and a transition table. You should be able to trace a simple Turing machine that performs addition or checks binary parity, and understand the significance of the Church–Turing thesis: anything computable by an algorithm can be computed by a Turing machine.
图灵机提供了计算的形式化模型。图灵机由一条纸带、一个读写头、一个状态寄存器和一张状态转换表组成。你应能跟踪执行加法或检查二进制奇偶性的简单图灵机，并理解丘奇-图灵论题的意义：任何算法可计算的问题都能被图灵机计算。
The halting problem demonstrates the limits of computation. It asks whether there exists an algorithm that can determine, for any program-input pair, whether the program will halt or run forever. Turing proved that no such algorithm exists, showing that some problems are undecidable. This insight directly influences how we understand software testing and verification.
停机问题展示了计算的局限性。它询问是否存在一种算法，能够对任意程序-输入对判定该程序是否会停止或永远运行。图灵证明了这种算法不存在，表明有些问题是不可判定的。这一深刻见解直接影响我们对软件测试和验证的理解。
9. Emerging Technologies and Big Data Analytics | 新兴技术与大数据分析
The WJEC specification expects you to discuss the impact of emerging technologies such as artificial intelligence, machine learning, and the Internet of Things (IoT). Machine learning models, particularly supervised and unsupervised learning, rely on massive datasets. You should be able to explain how training data is used to adjust weights in a simple neural network, even if you do not program one.
WJEC 考纲要求你讨论新兴技术的影响，例如人工智能、机器学习和物联网（IoT）。机器学习模型，尤其是监督学习和无监督学习，依赖于海量数据集。即使你不亲自编写程序，也应当能够解释如何使用训练数据在简单的神经网络中调整权重。
Big data is characterised by the three Vs: volume, velocity, and variety. Data is generated at high speed from sensors, social media, and transactions. Traditional relational databases often cannot handle this scale, leading to distributed storage solutions like Hadoop’s HDFS and the MapReduce programming model. Ethical issues around data mining, profiling, and privacy are integral to these discussions.
大数据的特点通常概括为三个 V：数量（Volume）、速度（Velocity）和多样性（Variety）。数据从传感器、社交媒体和交易中以高速产生。传统的关系型数据库通常无法处理这种规模，因此催生了分布式存储方案，比如 Hadoop 的 HDFS 和 MapReduce 编程模型。围绕数据挖掘、用户画像和隐私的道德问题，是这些讨论不可分割的一部分。
Cloud computing delivers on-demand services including IaaS, PaaS, and SaaS. Elasticity allows resources to scale automatically with demand. For your project, you could utilise cloud-based databases or APIs. Consider also the environmental impact of data centres and how green computing initiatives aim to reduce carbon footprints through efficient servers and cooling.
云计算提供按需服务，包括 IaaS、PaaS 和 SaaS。弹性伸缩让资源能够根据需求自动扩展。在你的项目中，你可以利用云端数据库或 API。还要考虑数据中心的环境影响，以及绿色计算倡议如何通过高效服务器和冷却技术来减少碳足迹。
10. Legislation, Ethics, and the Digital Society | 法律法规、伦理与数字社会
Computer science does not exist in a vacuum; you must navigate the legal framework surrounding technology. The Data Protection Act 2018 (incorporating GDPR) sets strict rules for processing personal data, granting individuals rights over their data. The Computer Misuse Act 1990 criminalises unauthorised access and modification of computer material. Being able to apply these acts to scenarios is a frequent exam requirement.
计算机科学并非存在于真空中；你必须了解围绕技术的法律框架。《2018 年数据保护法》（纳入了 GDPR）为处理个人数据设定了严格规则，赋予个人对其数据的权利。《1990 年计算机滥用法》将未经授权访问和修改计算机资料定为犯罪。能够将这些法案应用于具体情景，是常见的考试要求。
Ethical dilemmas arise in areas like artificial intelligence bias, autonomous vehicles, and facial recognition. You should be able to argue for and against the use of automated decision-making, considering the potential for discrimination versus efficiency gains. Professional bodies like the BCS (British Computer Society) provide codes of conduct that emphasise public interest, integrity, and competence.
在人工智能偏见、自动驾驶汽车和人脸识别等领域会出现道德困境。你应当能够对使用自动化决策进行正反两方面论证，权衡其歧视风险与效率收益。像 BCS（英国计算机协会）这样的专业机构提供的行为准则强调了公共利益、诚信和能力。
Digital society also includes the digital divide and accessibility standards. Web accessibility guidelines (WCAG) encourage inclusive design, ensuring systems can be used by people with disabilities. When you develop your project, considering accessible interfaces demonstrates a mature, professional approach that aligns with both legal obligations and ethical responsibilities.
数字社会还包括数字鸿沟和无障碍标准。网站内容无障碍指南（WCAG）鼓励包容性设计，确保系统能被残障人士使用。当你开发项目时，考虑无障碍界面展示了一种成熟、专业的方法，这既符合法律义务也符合道德责任。
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