📚 Summer Preparation and Bridging Course for Year 13 WJEC Computer Science | Year 13 WJEC 计算机：暑期预习与衔接课程
This bridging guide is designed to help you make a smooth transition from Year 12 into the demanding Year 13 WJEC Computer Science curriculum. It revisits core AS topics, introduces the key A2 concepts, and offers a structured summer study plan. By working through essential data structures, algorithm analysis, object-oriented programming, computational theory and system architecture, you will build the confidence to tackle the final year effectively.
本衔接指南旨在帮助你从 Year 12 平稳过渡到要求更高的 Year 13 WJEC 计算机科学课程。它回顾了 AS 阶段的核心主题，介绍了 A2 阶段的关键概念，并提供一个结构化的暑期自学计划。掌握核心数据结构、算法分析、面向对象编程、计算理论和系统架构之后，你将更有信心高效地应对最后这一年的学习。
1. Reviewing Year 12 Foundations | 回顾 Year 12 基础
Before diving into new topics, take time to consolidate your understanding of fundamental programming, binary arithmetic, data representation (including floating-point and ASCII/Unicode), and the fetch–decode–execute cycle. These building blocks underpin almost every A2 topic, from processor pipelining to data structures. Write short programs in Python or your chosen language to practise control flow, arrays and file handling – fluency here will pay dividends later.
在接触新专题之前，请花时间巩固对基础编程、二进制算术、数据表示（包括浮点数和 ASCII/Unicode）以及取指－译码－执行周期的理解。这些基石几乎支撑着每一个 A2 主题，从处理器流水线到数据结构都要用到它们。用 Python 或你选择的语言编写小程序，练习控制流、数组和文件处理——这里练熟的技能日后会让你事半功倍。
2. Data Structures: Stacks, Queues, and Linked Lists | 数据结构：栈、队列与链表
Year 13 expects you to understand abstract data types and their implementations. A stack is a LIFO (last-in, first-out) structure with push and pop operations, typically implemented using an array or a linked list. A queue is FIFO (first-in, first-out) and supports enqueue and dequeue. Linked lists consist of nodes that hold data and a pointer to the next node; they allow dynamic memory allocation and efficient insertion/deletion. Knowing the time complexity of each operation – O(1) for push/pop in a stack, O(1) for enqueue/dequeue in a queue, and O(n) for search in a linked list – is essential.
Year 13 要求你理解抽象数据类型及其实现。栈是一种后进先出 (LIFO) 结构，支持入栈 (push) 和出栈 (pop) 操作，通常用数组或链表实现。队列是先进先出 (FIFO) 结构，支持入队和出队。链表由包含数据及指向下一个节点的指针的结点组成，允许动态内存分配和高效的插入与删除。了解每个操作的时间复杂度至关重要——例如栈的入栈/出栈为 O(1)，队列的入队/出队为 O(1)，而链表中的查找为 O(n)。
3. Algorithms and Complexity: Big O Notation | 算法与复杂度：大 O 表示法
Big O notation describes the worst-case time or space complexity of an algorithm as the input size n grows. Common classes you must recognise are O(1) (constant), O(n) (linear), O(n²) (quadratic), O(log₂ n) (logarithmic) and O(n log₂ n) (linearithmic). In Year 13 you will apply this to sorting, searching and recursive algorithms. Always express complexity in its simplest form: for example, a loop inside another loop yields O(n²), not O(3n² + n).
大 O 表示法描述当输入规模 n 增大时算法的最坏情况时间复杂度或空间复杂度。你必须识别的常见阶有 O(1)（常数）、O(n)（线性）、O(n²)（平方）、O(log₂ n)（对数）和 O(n log₂ n)（线性对数）。在 Year 13，你将把它应用到排序、搜索和递归算法中。请始终以最简形式表示复杂度：例如一层循环内嵌另一层循环给出 O(n²)，而不是 O(3n² + n)。
4. Advanced Sorting and Searching | 高级排序与搜索
Moving beyond bubble sort, you will study quicksort (average O(n log₂ n), worst-case O(n²) if pivot chosen poorly), merge sort (consistently O(n log₂ n)) and heap sort. For searching, understand binary search on a sorted array (O(log₂ n)) and its requirement that the list remains sorted. WJEC expects you to be able to trace these algorithms step-by-step and compare their performance on different data sets.
在冒泡排序的基础上，你会学习快速排序（平均 O(n log₂ n)，若主元选择不当则最坏 O(n²)）、归并排序（稳定 O(n log₂ n) ）和堆排序。在搜索方面，要理解对有序数组进行的二分查找（O(log₂ n)），以及它要求列表始终保持有序。WJEC 期望你能逐步追踪这些算法，并比较它们在不同数据集上的表现。
5. Recursion and Divide-and-Conquer | 递归与分治法
Recursion is a technique where a function calls itself to solve smaller instances of the same problem. You must identify the base case (stopping condition) and the recursive step. Divide-and-conquer algorithms, such as merge sort and quicksort, split the problem into smaller sub-problems, solve them recursively and combine the results. Year 13 requires you to write and trace recursive code, so practise tree traversals, factorial and Fibonacci examples.
递归是一种函数调用自身来解决同问题更小实例的技术。你必须能识别基准情形（停止条件）和递归步骤。分治算法，如归并排序和快速排序，会将问题分解成更小的子问题，递归求解后合并结果。Year 13 要求你编写和追踪递归代码，因此请多练习树的遍历、阶乘和斐波那契等例子。
6. Trees and Binary Search Trees | 树与二叉搜索树
Trees are hierarchical data structures consisting of nodes connected by edges. A binary tree has at most two children per node. The binary search tree (BST) maintains the property: left child < parent < right child. Operations such as search, insertion and deletion take O(log₂ n) on average but can degrade to O(n) if the tree becomes unbalanced. Make sure you can perform pre-order, in-order and post-order traversals and explain their use cases.
树是由边相连的结点构成的层次数据结构。二叉树每个结点最多有两个子结点。二叉搜索树 (BST) 维护着“左子 < 父 < 右子”的性质。查找、插入和删除操作平均时间复杂度为 O(log₂ n)，但如果树变得不平衡，可能退化到 O(n)。请确保你能执行前序、中序和后序遍历，并解释它们的应用场景。
7. Object-Oriented Programming Concepts | 面向对象编程概念
Class, object, encapsulation, inheritance and polymorphism form the backbone of A2 programming. You will design classes with attributes and methods, use constructors, and apply the principle of information hiding by making data members private. Inheritance allows a subclass to reuse and extend superclass behaviour, while polymorphism lets a single interface represent different underlying types – often implemented through method overriding.
类、对象、封装、继承和多态构成 A2 编程的脊梁。你将设计包含属性和方法的类，使用构造函数，并通过将数据成员设为私有来实践信息隐藏原则。继承让子类能复用和扩展父类的行为，而多态允许单一接口代表不同的底层类型——通常通过方法覆盖来实现。
8. Computational Theory: Finite State Machines | 计算理论：有限状态机
A finite state machine (FSM) consists of a finite number of states, an initial state, a set of inputs and transition rules. You must be able to draw state transition diagrams and construct a state transition table. WJEC also distinguishes between a deterministic FSM (each input leads to exactly one next state) and a non-deterministic FSM. FSMs model the control unit of a processor, vending machines and communication protocols.
有限状态机 (FSM) 由有限数量的状态、一个初始状态、一组输入和转移规则组成。你必须能够绘制状态转移图并构建状态转移表。WJEC 还区分确定性 FSM（每个输入唯一确定下一个状态）和非确定性 FSM。FSM 可用于对处理器的控制单元、自动售货机和通信协议建模。
9. Computer Architecture: The Processor and Pipelining | 计算机架构：处理器与流水线
Building on the fetch–decode–execute cycle, you will explore how modern processors improve performance through pipelining. Instructions are divided into stages (fetch, decode, execute, memory access, write-back) and overlapped so that while one instruction is being executed, the next is being decoded. You must be able to identify pipeline hazards – structural, data and control – and explain how techniques such as forwarding and branch prediction mitigate them.
在取指－译码－执行周期的基础上，你将探究现代处理器如何通过流水线提升性能。指令被划分为若干级（取指、译码、执行、访存、写回）并重叠执行：当一条指令正在执行时，下一条正在译码。你必须能够识别流水线冒险——结构冒险、数据冒险和控制冒险——并解释转发和分支预测等技术如何缓解它们。
10. Networking and the TCP/IP Model | 网络与 TCP/IP 模型
Year 13 extends networking knowledge from LAN topologies to the protocol stack. Compare the four-layer TCP/IP model (Application, Transport, Internet, Network Access) with the OSI model. Understand the role of protocols such as HTTP, FTP, TCP and IP, and how packet switching works. You should also be familiar with client–server and peer-to-peer architectures, and be able to discuss security concerns including firewalls and encryption.
Year 13 将网络知识从局域网拓扑延伸到协议栈。比较四层 TCP/IP 模型（应用层、传输层、互联网层、网络接入层）与 OSI 模型。理解 HTTP、FTP、TCP 和 IP 等协议的角色，以及分组交换如何工作。你还应熟悉客户端－服务器和对等网络架构，并能讨论防火墙和加密等安全问题。
11. Databases: Normalisation and SQL | 数据库：规范化与 SQL
Relational databases are a major A2 topic. You need to be able to move from an unnormalised form through first (1NF), second (2NF) and third normal form (3NF) by removing repeating groups, partial dependencies and transitive dependencies. Practise writing SQL statements: SELECT with WHERE, JOIN, GROUP BY and ORDER BY, as well as INSERT, UPDATE and DELETE. Understand the importance of primary and foreign keys for referential integrity.
关系数据库是 A2 的一大主题。你需要能够从非规范化形式出发，通过消除重复组、部分依赖和传递依赖，逐步达到第一范式 (1NF)、第二范式 (2NF) 和第三范式 (3NF)。练习编写 SQL 语句：带 WHERE 的 SELECT、JOIN、GROUP BY 和 ORDER BY，以及 INSERT、UPDATE 和 DELETE。理解主键和外键对参照完整性的重要性。
12. Exam Preparation and Summer Self-Study Plan | 考试准备与暑期自学计划
Start your summer by setting a weekly schedule: review one Year 12 unit each morning and one new A2 topic each afternoon. Create a glossary of key terms (e.g., encapsulation, Big O, pipelining, normalisation). Use past papers to identify command words and practise writing exam-style answers. Aim to complete one full programming project that implements a GUI and a database backend, as this mirrors the non-exam assessment (NEA) requirements. Consistency is more important than volume – even 30 minutes a day will build a strong foundation.
暑假开始时先制定每周计划：每天上午复习一个 Year 12 单元，下午学习一个新的 A2 主题。建立一个关键术语词汇表（例如：封装、大 O、流水线、规范化）。利用往年真题识别指令词，并练习写出考试风格的答案。争取完成一个包含图形用户界面和数据库后端的完整编程项目，这与非考试评估 (NEA) 的要求相一致。持之以恒比大量突击更重要——每天哪怕只学 30 分钟也能打下坚实的基础。
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