📚 Year 13 OCR Computer Science: Core Knowledge Points Revision | 核心知识点梳理
This article distils the most essential content required for the Year 13 OCR Computer Science specification, bringing together computational thinking, advanced data structures, algorithms, systems architecture, networking, databases, and the wider social implications. It is designed as a focused revision resource that highlights key definitions, mechanisms, and interconnections you must master before the final examination.
本文提炼了 OCR 计算机科学 Year 13 课程中最核心的内容，涵盖计算思维、高级数据结构、算法、系统架构、网络、数据库以及更广泛的社会影响。它是一份重点突出的复习资料，帮助你在会考前掌握关键定义、运行机制以及各知识模块之间的内在联系。
1. Computational Thinking and Problem Solving | 计算思维与问题求解
Computational thinking involves decomposing complex problems into manageable parts, recognising patterns, abstracting away irrelevant detail, and designing step-by-step algorithms. OCR places a strong emphasis on applying these skills to unseen scenarios, requiring candidates to demonstrate how abstraction reduces complexity and how decomposition enables parallel development.
计算思维包括将复杂问题分解为可管理的部分、识别模式、抽象掉不相关的细节以及设计逐步执行的算法。OCR 非常注重在实际场景中运用这些技能，要求考生展示抽象如何降低复杂度，以及分解如何支持并行开发。
- Abstraction: removing unnecessary detail to focus on essential features. / 抽象：去除不必要的细节，聚焦本质特征。
- Decomposition: breaking a system into smaller, manageable sub-systems. / 分解：将系统拆分为更小、更易管理的子系统。
- Pattern recognition: identifying common characteristics in data or processes. / 模式识别：发现数据或过程中的共同特征。
- Algorithmic thinking: defining clear, unambiguous steps to achieve a solution. / 算法思维：定义清晰、无歧义的步骤来获得解决方案。
In OCR exams, you may be asked to describe how a computational thinking technique applies to a given problem, or to produce an algorithm for a scenario that requires both abstraction and decomposition prior to coding.
在 OCR 考试中，你可能需要描述计算思维技术如何应用于特定问题，或在编码前先通过抽象和分解来设计算法。
2. Advanced Data Structures | 高级数据结构
Year 13 students must understand not only the behaviour of standard data structures but also their efficient implementation. Stacks, queues, linked lists, hash tables, trees, and graphs all appear, often in combination with algorithmic analysis. The emphasis is on choosing the right structure for a given task, reasoning about time complexity, and manipulating these structures using pointers or object references.
Year 13 学生不仅要理解标准数据结构的行为，还要掌握它们的高效实现。栈、队列、链表、散列表、树和图都可能出现在考题中，且常常结合算法分析。重点在于为特定任务选择合适的数据结构、分析时间复杂度，以及使用指针或对象引用操作这些结构。
A stack is a LIFO (Last In, First Out) structure; typical operations are push, pop, peek. / 栈是一种后进先出（LIFO）结构，常见操作有 push、pop、peek。
A queue is FIFO (First In, First Out); used in breadth-first search and buffering. / 队列是先进先出（FIFO），用于广度优先搜索和缓冲。
A linked list allows dynamic insertion and deletion without shifting elements, but requires sequential access. / 链表支持动态插入和删除而无需移动元素，但需要顺序访问。
A hash table provides O(1) average-case lookup through a hash function; collisions are handled via chaining or open addressing. / 散列表通过散列函数实现平均 O(1) 的查找；冲突通过拉链法或开放定址法解决。
For graphs, directed and undirected variants are modelled using adjacency lists or matrices. Trees, particularly binary search trees, must be understood in terms of insertion, search, and deletion algorithms, as well as balancing via rotations (AVL or red-black trees).
对于图，有向和无向变体通过邻接表或邻接矩阵建模。树，尤其是二叉搜索树，需要理解插入、查找和删除算法，以及通过旋转（AVL 树或红黑树）实现平衡的方式。
3. Sorting, Searching and Optimisation Algorithms | 排序、搜索与优化算法
A working knowledge of standard sorting and searching algorithms is expected, along with the ability to trace them on sample data and compare their efficiency. Bubble sort, insertion sort, merge sort, and quicksort are explicitly named. Linear search and binary search are also examined, with binary search requiring sorted data.
考生需要掌握标准排序和搜索算法的工作方式，能够在示例数据上追踪它们，并比较其效率。明确提到的排序算法有冒泡排序、插入排序、归并排序和快速排序。线性搜索和二分搜索也在考查范围内，其中二分搜索要求数据已排序。
You should be able to express the worst-case time complexity of each using Big O notation: / 你应能用大 O 表示法表达每种算法的最坏情况时间复杂度：
| Algorithm 算法 | Worst-case complexity 最坏情况复杂度 |
| Bubble sort 冒泡排序 | O(n²) |
| Insertion sort 插入排序 | O(n²) |
| Merge sort 归并排序 | O(n log n) |
| Quicksort 快速排序 | O(n²) (but average O(n log n)) |
| Binary search 二分搜索 | O(log n) |
| Linear search 线性搜索 | O(n) |
Optimisation problems, such as the knapsack problem or shortest path, require understanding of brute-force, heuristic, and algorithmic solutions. Dijkstra's algorithm for single-source shortest paths and the A* search with a heuristic are especially relevant.
优化问题，如背包问题或最短路径，需要理解暴力求解、启发式和算法解。Dijkstra 的单源最短路径算法和带启发式的 A* 搜索尤其相关。
4. Programming Techniques and Paradigms | 编程技巧与编程范式
OCR expects fluency in a high-level language (commonly Python, Java, or C#) and the ability to read, write, trace, and debug code. Key topics include recursion, object-oriented programming (OOP), and the use of libraries. Recursive algorithms, such as factorial or tree traversal, must be understood in terms of base case, recursive step, and stack usage.
OCR 期望你能熟练使用一门高级语言（通常是 Python、Java 或 C#），并具备阅读、编写、追踪和调试代码的能力。关键主题包括递归、面向对象编程（OOP）以及库的使用。必须理解递归算法（如阶乘或树的遍历）中的基准情形、递归步和栈的使用。
OOP concepts – encapsulation, inheritance, polymorphism, and abstraction – are frequently tested. You should be able to design class diagrams, distinguish between public and private methods, and explain the advantages of code reuse and modularity.
面向对象概念——封装、继承、多态和抽象——是常考内容。你应能设计类图、区分公有和私有方法，并能说明代码重用和模块化的优势。
- Encapsulation: bundling data and methods, restricting direct access. / 封装：将数据和方法绑定，限制直接访问。
- Inheritance: deriving a class from a base class to share functionality. / 继承：从基类派生一个类以共享功能。
- Polymorphism: objects of different classes responding to the same interface. / 多态：不同类的对象对同一接口作出响应。
Functional programming elements – first-class functions, higher-order functions, immutability – appear in the specification, often illustrated through map, filter, and reduce operations.
函数式编程元素——一等函数、高阶函数、不可变性——出现在考纲中，通常通过 map、filter、reduce 加以说明。
5. Computer Architecture and the Fetch-Decode-Execute Cycle | 计算机体系结构与取指-译码-执行周期
The internal components of a processor (ALU, control unit, registers including PC, MAR, MDR, CIR, and accumulator) form the foundation of the fetch-decode-execute cycle. You must explain how instructions are fetched from memory, decoded by the control unit, and executed, possibly involving the ALU and register transfers.
处理器内部组件（ALU、控制单元、以及 PC、MAR、MDR、CIR 和累加器等寄存器）构成了取指-译码-执行周期的基础。你必须能够解释指令如何从内存中取出、由控制单元译码并执行，可能涉及 ALU 和寄存器间的数据传送。
The machine code pipeline, including multi-core and parallel processing, is also covered. Factors affecting processor performance – clock speed, number of cores, cache size, and word length – should be linked to real-world examples.
机器码流水线，包括多核与并行处理，也在考查范围内。影响处理器性能的因素——时钟频率、核心数、缓存大小、字长——应能结合实际例子加以说明。
Assembly language programming (using mnemonics like LDR, STR, ADD, SUB, B, CMP) and how it maps to machine code control flow is an essential skill. You should be able to trace simple assembly programs and understand addressing modes, including immediate, direct, and indirect.
汇编语言编程（使用 LDR、STR、ADD、SUB、B、CMP 等助记符）及其与机器码控制流的映射是一项基本技能。你需要能够追踪简单的汇编程序，并理解寻址模式，包括立即寻址、直接寻址和间接寻址。
6. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路
Boolean algebra underpins digital circuit design. You should be comfortable simplifying logical expressions using laws such as identity, complement, commutative, associative, distributive, and De Morgan's theorems. Karnaugh maps (up to 4 variables) are used to minimise circuits, and you must be able to construct a truth table from a given expression or diagram.
布尔代数是数字电路设计的基础。你应能熟练运用恒等律、互补律、交换律、结合律、分配律和德摩根定理等法则来化简逻辑表达式。卡诺图（最多 4 变量）可用于电路最小化，你还要能从给定的表达式或逻辑图中构建真值表。
Common gates – AND, OR, NOT, NAND, NOR, XOR, XNOR – are represented with standard symbols. You should be able to combine them into half-adders, full-adders, multiplexers, and flip-flops, and to explain how flip-flops create sequential circuits capable of storing state.
常见逻辑门——与、或、非、与非、或非、异或、同或——都有标准符号。你需要能把它们组合成半加器、全加器、多路选择器和触发器，并能解释触发器如何构成能够存储状态的时序电路。
7. Systems Software: Operating Systems, Translators, and Virtual Machines | 系统软件：操作系统、翻译器与虚拟机
The operating system acts as an intermediary between hardware and applications. You must describe its roles: memory management (paging, segmentation), interrupt handling, scheduling (round robin, priority-based, shortes t job first), and file management. The distinction between a hard real-time and a soft real-time OS should be clarified.
操作系统充硬件与应用程序之间的中介。你必须描述它的功能：内存管理（分页、分段）、中断处理、调度（时间片轮转、基于优先级、最短作业优先）和文件管理。还应明确硬实时操作系统与软实时操作系统的区别。
Translators turn source code into machine code. Compilers translate entire programs into object code before execution; interpreters translate line-by-line at run time. The specification also covers intermediate representations (bytecode) executed by virtual machines, such as the Java Virtual Machine, enabling platform independence.
翻译器将源代码转换为机器码。编译器在执行前将整个程序翻译为目标代码；解释器在运行时逐行翻译。考纲还涵盖了由虚拟机执行的中间表示（字节码），如 Java 虚拟机，从而实现平台无关性。
8. Networking, Protocols and the TCP/IP Stack | 网络、协议与 TCP/IP 协议栈
Networking concepts are central to modern computing. You need to explain the purpose and function of each layer in the TCP/IP stack: application, transport, internet, and link. Key protocols – HTTP, HTTPS, FTP, SMTP, POP3, IMAP, TCP, UDP, IP – must be matched to the correct layer and described in terms of their role and reliability.
网络概念是当代计算的核心。你需要解释 TCP/IP 协议栈各层（应用层、传输层、互联网层、链路层）的目的和功能。关键协议——HTTP、HTTPS、FTP、SMTP、POP3、IMAP、TCP、UDP、IP——必须对应到正确的层，并描述其作用和可靠性。
Packet switching and circuit switching are compared, as are client-server and peer-to-peer models. You should also understand the role of MAC addresses, IP addresses (IPv4 vs IPv6), and the Domain Name System (DNS) in routing and name resolution.
分组交换与电路交换会进行比较，客户-服务器模型与对等模型也是如此。你还应理解 MAC 地址、IP 地址（IPv4 与 IPv6）以及域名系统（DNS）在路由和名称解析中的作用。
9. Databases, Normalisation, and SQL | 数据库、规范化与 SQL
Relational databases are examined through entity-relationship diagrams (1:1, 1:M, M:M relationships) and the process of normalisation to 3NF. You should be able to identify functional dependencies, partial dependencies, and transitive dependencies, and systematically decompose an unnormalised set of attributes into 1NF, 2NF, and 3NF.
关系型数据库的考查包括实体关系图（1 对 1、1 对多、多对多关系）和到第三范式（3NF）的规范化过程。你要能识别函数依赖、部分依赖和传递依赖，并系统地将一组未规范化的属性分解为 1NF、2NF 和 3NF。
SQL statements must be written accurately: SELECT with WHERE, LIKE, BETWEEN, ORDER BY, GROUP BY, HAVING, and aggregate functions; INSERT, UPDATE, DELETE; and defining tables with CREATE TABLE, constraints (PRIMARY KEY, FOREIGN KEY, NOT NULL). Joins (INNER, LEFT, RIGHT) are used to combine related data from multiple tables.
SQL 语句必须书写准确：包含 WHERE、LIKE、BETWEEN、ORDER BY、GROUP BY、HAVING 和聚合函数的 SELECT；INSERT、UPDATE、DELETE；以及用 CREATE TABLE 定义表、使用约束（PRIMARY KEY、FOREIGN KEY、NOT NULL）。连接（INNER、LEFT、RIGHT）用于从多个表中组合相关数据。
10. Web Technologies: HTML, CSS, JavaScript, and Server-Side Processing | Web 技术：HTML、CSS、JavaScript 与服务器端处理
The client-server web model relies on HTML for structure, CSS for presentation, and JavaScript for client-side interactivity. You should be able to write and interpret basic HTML tags, CSS selectors and properties, and simple JavaScript event handlers. The separation of content, style, and behaviour is an important design principle.
客户-服务器 Web 模型依赖 HTML 提供结构、CSS 提供样式、JavaScript 提供客户端交互。你应能编写和解读基本的 HTML 标签、CSS 选择器与属性，以及简单的 JavaScript 事件处理程序。内容、样式和行为的分离是一项重要的设计原则。
Server-side technologies, such as PHP or ASP.NET, handle requests, process data, and return dynamic HTML. Understanding the difference between server-side and client-side execution, and the role of cookies and sessions for state management, is part of the specification.
服务器端技术（如 PHP 或 ASP.NET）处理请求、处理数据并返回动态 HTML。理解服务器端与客户端执行的区别，以及 cookie 和会话在状态管理中的作用，属于考纲的一部分。
11. Data Security, Encryption, and Threats | 数据安全、加密与威胁
Security threats include malware (viruses, worms, trojans), phishing, SQL injection, denial-of-service attacks, and social engineering. For each, you should describe the method and the recommended countermeasures, such as firewalls, intrusion detection systems, and regular software updates.
安全威胁包括恶意软件（病毒、蠕虫、特洛伊木马）、网络钓鱼、SQL 注入、拒绝服务攻击和社会工程学。对于每种威胁，你应描述其方法和推荐的应对措施，如防火墙、入侵检测系统和定期软件更新。
Encryption is fundamental for data confidentiality. Symmetric encryption (e.g. AES) uses a shared key; asymmetric encryption (e.g. RSA) uses a public/private key pair. Hashing (e.g. SHA‑256) provides data integrity. You should explain how digital certificates and SSL/TLS ensure secure communication, including the key exchange process.
加密是数据机密性的基础。对称加密（如 AES）使用共享密钥；非对称加密（如 RSA）使用公钥/私钥对。散列（如 SHA‑256）提供数据完整性。你应解释数字证书和 SSL/TLS 如何确保安全通信，包括密钥交换过程。
12. Legal, Moral, Ethical, and Cultural Implications | 法律、道德、伦理与文化影响
The OCR specification requires you to evaluate the wider impact of computing technology. Key legislation includes the Data Protection Act, Computer Misuse Act, Copyright, Designs and Patents Act, and Regulation of Investigatory Powers Act. You should be able to cite relevant provisions and explain their implications for developers and users.
OCR 考纲要求你评估计算技术更广泛的影响。关键立法包括《数据保护法》、《计算机滥用法》、《版权、设计和专利法》以及《调查权力规制法》。你需要引用相关条款，并解释它们对开发者和用户的影响。
Ethical debates focus on artificial intelligence, facial recognition, autonomous vehicles, and the digital divide. Moral reasoning frameworks – utilitarianism, deontology – may be applied to argue for or against a given technology. Cultural issues include the effect of technology on language, globalisation, and the accessibility gap.
伦理讨论主要集中在人工智能、人脸识别、自动驾驶汽车和数字鸿沟上。可运用道德推理框架（功利主义、义务论）来论证支持或反对某项技术。文化议题包括技术对语言、全球化和可访问性差距的影响。
You should be prepared to write extended essays that discuss stakeholders' perspectives, balancing benefits against risks, and that reach a reasoned conclusion.
你应准备好撰写扩展论述，讨论各利益相关方的观点，权衡利弊，并得出有理有据的结论。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图