Summer Preparation and Bridging Course for Year 13 OCR Computer Science | A Level计算机暑期预习与衔接课

📚 Summer Preparation and Bridging Course for Year 13 OCR Computer Science | A Level计算机暑期预习与衔接课

Welcome to your Year 13 OCR Computer Science summer preparation guide. This bridging course is designed to consolidate your AS knowledge and introduce the advanced A2 topics you will encounter. Whether you are revisiting processor architecture, diving into algorithm complexity, or planning your programming project, this structured journey will give you the confidence to start Year 13 ahead of the curve.

欢迎来到 Year 13 OCR 计算机科学暑期预习指南。本衔接课程旨在巩固你的 AS 知识，并介绍你将遇到的 A2 高级主题。无论你是在复习处理器架构、钻研算法复杂度，还是规划编程项目，这段结构化的学习之旅都将让你在新学年开始时自信满满、领先一步。

---

1. Review of Key AS Concepts | AS关键概念回顾

Before tackling new material, it is essential to revisit the foundations. Refresh your understanding of binary representation, two’s complement, floating point, and character sets such as ASCII and Unicode. Make sure you can convert between binary, denary, and hexadecimal fluently, as these skills underpin many A2 topics.

在学习新内容之前，巩固基础至关重要。重温二进制表示、二进制补码、浮点数以及 ASCII 和 Unicode 等字符集。确保你能熟练地在二进制、十进制和十六进制之间进行转换，因为这些技能是许多 A2 主题的基础。

Also revisit the AS programming concepts: sequence, selection, iteration, and subroutines. Practice writing pseudocode and tracing algorithms. Understanding how to read and interpret code is just as important as writing it, especially when you move into algorithm analysis.

同时回顾 AS 编程概念：顺序、选择、迭代和子程序。练习编写伪代码并追踪算法。理解如何阅读和解读代码与编写代码同样重要，尤其是在你进入算法分析阶段时。

---

2. Processor Architecture and Assembly Language | 处理器架构与汇编语言

The A2 specification deepens your knowledge of the CPU. You need to understand the fetch-decode-execute cycle in detail, the role of registers (PC, MAR, MDR, CIR, ACC), and how the ALU and control unit coordinate. Be ready to explain pipelining and its effect on performance, including the challenges of data and control hazards.

A2 大纲会深化你对 CPU 的认识。你需要详细理解取指-解码-执行周期、寄存器（PC、MAR、MDR、CIR、ACC）的作用，以及 ALU 和控制单元如何协调工作。准备好解释流水线技术及其对性能的影响，包括数据冒险和控制冒险的挑战。

Assembly language becomes a focus. You will learn to write simple programs using mnemonics like LDA, STA, ADD, SUB, JMP, and branching instructions. Practice tracing assembly code and mapping it to machine code. Knowing the relationship between high-level constructs and their low-level implementation is a core skill.

汇编语言成为一个重点。你将学习使用 LDA、STA、ADD、SUB、JMP 和分支指令等助记符编写简单程序。练习追踪汇编代码并将其映射到机器码。理解高级结构与底层实现之间的关系是一项核心技能。

---

3. Advanced Data Structures | 高级数据结构

Year 13 introduces stacks, queues, linked lists, and trees. Understand how each structure works in memory and when to apply it. Stacks (LIFO) are used in recursion and backtracking, while queues (FIFO) are essential for buffers and scheduling. Linked lists allow dynamic memory management, and trees underpin efficient searching and sorting.

Year 13 介绍栈、队列、链表和树。理解每种结构在内存中的工作方式以及适用场景。栈（后进先出）用于递归和回溯，而队列（先进先出）对缓冲区和调度至关重要。链表支持动态内存管理，而树则支撑高效的搜索和排序。

You should be able to implement these structures in pseudocode and optionally in a high-level language. Trace operations such as push, pop, enqueue, dequeue, and traversals. For trees, focus on binary search trees: insertion, search, and tree traversal algorithms (in-order, pre-order, post-order).

你应能用伪代码以及选用的高级语言实现这些结构。追踪 push、pop、入队、出队和遍历等操作。对于树，重点掌握二叉搜索树：插入、搜索以及树的遍历算法（中序、前序、后序）。

---

4. Graph Theory and Algorithms | 图论与算法

Graphs model complex relationships and are central to many computational problems. Learn the terminology: vertices, edges, directed/undirected, weighted/unweighted. Be comfortable with adjacency matrices and adjacency lists as representations.

图模型用于复杂关系建模，是许多计算问题的核心。学习相关术语：顶点、边、有向/无向、加权/非加权。熟悉邻接矩阵和邻接表这两种表示方式。

Master key graph traversal algorithms: breadth-first search (BFS) and depth-first search (DFS). Understand how Dijkstra’s shortest path algorithm works on weighted graphs. Practice tracing these algorithms step by step on small graphs, identifying the order of visited nodes and the final shortest paths.

掌握关键的图遍历算法：广度优先搜索（BFS）和深度优先搜索（DFS）。理解 Dijkstra 最短路径算法在加权图上的工作原理。练习在小图上逐步追踪这些算法，识别节点的访问顺序以及最终的最短路径。

---

5. Algorithm Complexity and Big-O Notation | 算法复杂度与大O表示法

Analysing the efficiency of algorithms is a major A2 theme. Big-O notation describes how the time or space requirements grow with input size. You will encounter O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). Learn to identify the complexity of common algorithms, such as linear search (O(n)) and binary search (O(log n)).

分析算法的效率是 A2 的一个重要主题。大 O 表示法描述了时间或空间需求如何随输入规模增长。你会遇到 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。学会识别常见算法的复杂度，例如线性搜索（O(n)）和二分搜索（O(log n)）。

You must also be able to assess the complexity of sorting algorithms: bubble sort (O(n²)), insertion sort (O(n²)), merge sort (O(n log n)), and quick sort (average O(n log n), worst O(n²)). Understand how to derive the complexity from nested loops and recursive calls. Space complexity is equally important.

你还必须能够评估排序算法的复杂度：冒泡排序（O(n²)）、插入排序（O(n²)）、归并排序（O(n log n)）和快速排序（平均 O(n log n)，最差 O(n²)）。理解如何从嵌套循环和递归调用推导复杂度。空间复杂度同样重要。

---

6. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路

Boolean algebra is the mathematical backbone of digital circuits. You will simplify expressions using identities such as De Morgan’s laws, the distributive law, and absorption. Practice manipulating expressions to reduce the number of logic gates in a circuit.

布尔代数是数字电路的数学基础。你将使用德摩根定律、分配律和吸收律等恒等式来化简表达式。练习处理表达式，以减少电路中逻辑门的数量。

You also need to work with half adders, full adders, and flip-flops. Understand how to build a full adder from two half adders and an OR gate. Introduce yourself to the concept of sequential circuits and the role of the clock. This foundation is vital for the processor architecture unit.

你还需要掌握半加器、全加器和触发器。理解如何用两个半加器和一个或门构建一个全加器。熟悉时序电路的概念以及时钟的作用。这个基础对于处理器架构单元至关重要。

---

7. System Software and Operating Systems | 系统软件与操作系统

Operating systems manage hardware and provide a platform for applications. Study the functions of an OS: memory management (paging, segmentation, virtual memory), processor scheduling (round robin, priority-based), and file management. You should be able to compare scheduling algorithms in terms of fairness, throughput, and response time.

操作系统管理硬件并为应用程序提供平台。学习操作系统的功能：内存管理（分页、分段、虚拟内存）、处理器调度（轮转调度、基于优先级的调度）以及文件管理。你应该能够从公平性、吞吐量和响应时间等方面比较调度算法。

Understand the role of interrupts and the interrupt service routine. Explore the kernel, its privileged mode, and how system calls mediate between user programs and hardware. Real-time operating systems (RTOS) and their use in embedded devices is also part of the A2 specification.

理解中断和中断服务例程的作用。探索内核、其特权模式以及系统调用如何在用户程序和硬件之间进行中介。实时操作系统（RTOS）及其在嵌入式设备中的应用也是 A2 大纲的一部分。

---

8. Databases and SQL | 数据库与SQL

Relational databases are built on tables linked by keys. Revise entity-relationship diagrams, normalisation (1NF, 2NF, 3NF), and referential integrity. The ability to normalise a dataset to 3NF is a common exam requirement.

关系数据库建立在通过键连接的表之上。复习实体关系图、规范化（1NF、2NF、3NF）和参照完整性。将数据集规范化为 3NF 的能力是常见的考试要求。

SQL proficiency is essential. Practice writing queries using SELECT, FROM, WHERE, JOIN, and GROUP BY. Be prepared to handle aggregate functions (COUNT, SUM, AVG, MAX, MIN) and sub-queries. Transaction processing concepts, including ACID (Atomicity, Consistency, Isolation, Durability), must also be understood.

熟练掌握 SQL 至关重要。练习使用 SELECT、FROM、WHERE、JOIN 和 GROUP BY 编写查询。准备好处理聚合函数（COUNT、SUM、AVG、MAX、MIN）和子查询。还必须理解事务处理概念，包括 ACID（原子性、一致性、隔离性、持久性）。

---

9. Networking and the Internet | 网络与互联网

Year 13 builds on the AS networking knowledge. Study the TCP/IP stack in depth: application, transport, network, and link layers. Understand how protocols like HTTP, FTP, SMTP, TCP, and IP interact. Packet switching, routing, and the role of routers and gateways are central topics.

Year 13 在 AS 网络知识的基础上深入学习。研究 TCP/IP 协议栈：应用层、传输层、网络层和链路层。理解 HTTP、FTP、SMTP、TCP 和 IP 等协议如何相互作用。分组交换、路由以及路由器和网关的作用是核心主题。

Network security becomes more prominent. You need to know about firewalls, encryption (symmetric and asymmetric), and digital signatures. Understand the purpose of SSL/TLS in securing web traffic. Be able to discuss threats such as SQL injection, DDoS attacks, and malware.

网络安全变得更加突出。你需要了解防火墙、加密（对称与非对称）和数字签名。理解 SSL/TLS 在保护网络通信中的目的。能够讨论 SQL 注入、DDoS 攻击和恶意软件等威胁。

---

10. Computational Theory: Finite State Machines, Turing Machines | 计算理论：有限状态机、图灵机

Formal language and automata theory are introduced. Finite state machines (FSMs) model systems with a limited number of states. Learn to draw state transition diagrams and tables. Practice designing FSMs that recognise simple patterns, such as a binary sequence ending in ’01’.

形式语言和自动机理论被引入。有限状态机（FSM）用于对状态数量有限的系统进行建模。学习绘制状态转换图和状态转换表。练习设计能够识别简单模式的 FSM，例如以 ’01’ 结尾的二进制序列。

Turing machines provide a model of computation. Understand the components: tape, head, state register, and transition function. You should be able to trace a Turing machine for simple arithmetic or string operations. This theory connects to the concept of computability and the limits of computation.

图灵机提供了一种计算模型。理解其组成部分：纸带、读写头、状态寄存器和转换函数。你应该能够为一个简单的算术或字符串操作追踪图灵机的执行过程。这一理论与可计算性的概念以及计算的极限相联系。

---

11. Programming Project Planning | 编程项目规划

The programming project is a substantial part of Year 13. Use the summer to identify a realistic problem and define the scope. Document the stakeholders, objectives, and success criteria. Draft an outline of the system, considering input, output, processing, and storage.

编程项目是 Year 13 的重要组成部分。利用暑假确定一个切实可行的问题并界定范围。记录利益相关者、目标和成功标准。拟定系统的大纲，考虑输入、输出、处理和存储。

Sketch a plan for your analysis, design, development, testing, and evaluation phases. Choose a programming paradigm (procedural, object-oriented) and environment. Even a brief literature review of similar solutions will strengthen your analysis section later.

草拟一份分析、设计、开发、测试和评估阶段的计划。选择一个编程范式（过程式、面向对象）和开发环境。即使是对类似解决方案进行简短的文献综述，也会为你的后续分析部分增色。

---

12. Preparation for Year 13 Success | 为A2成功做好准备

Transitioning to A2 requires a change in study habits. Practice past paper questions regularly, focusing on the extended writing and the mathematical components. Form study groups to discuss complex topics like scheduling algorithms or Turing machines.

过渡到 A2 需要改变学习习惯。定期练习历年真题，重点关注扩展写作和数学部分。组成学习小组，讨论调度算法或图灵机等复杂主题。

Create a glossary of key terms as you progress. Use active recall and spaced repetition to reinforce memory. Remember that OCR assessment rewards precision in terminology and clarity in algorithmic thinking. Approach the summer as an opportunity to deepen your passion for computer science, not just a checklist of topics.

随着学习的推进，创建关键术语词汇表。使用主动回忆和间隔重复来强化记忆。请记住，OCR 评估要求术语精确、算法思维清晰。将暑假视为激发你对计算机科学热忱的机会，而不仅仅是完成主题清单。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）