📚 Year 12 OCR Computer Science: Core Knowledge Points Review | Year 12 OCR 计算机：核心知识点梳理
This article provides a structured revision of the essential topics covered in the OCR A Level Computer Science Year 12 curriculum. It is designed to help you consolidate your understanding of fundamental concepts, from processor architecture and data representation to algorithms, system software, and legal frameworks. Each section pairs a concise explanation in English with its Chinese equivalent, ensuring clarity and exam‑focused content.
本文对 OCR A Level 计算机科学 Year 12 课程的核心知识点进行系统梳理，帮助你巩固从处理器架构、数据表示到算法、系统软件和法律框架的基础概念。每小节均提供精简的英文解析与对应的中文讲解，确保表述清晰并紧密贴合考试要求。
1. Processor Architecture | 处理器架构
The central processing unit (CPU) is the brain of a computer. It consists of the Arithmetic Logic Unit (ALU), which performs calculations and logical operations, and the Control Unit (CU), which directs the flow of data and coordinates activities. Key registers include the Program Counter (PC) holding the address of the next instruction, the Memory Address Register (MAR) and Memory Data Register (MDR) for memory access, the Current Instruction Register (CIR) holding the instruction being decoded, and the Accumulator (ACC) for intermediate results.
中央处理器(CPU)是计算机的核心，由执行算术与逻辑运算的算术逻辑单元(ALU)和负责控制数据流与协调各部件工作的控制单元(CU)组成。重要的寄存器包括存储下一条指令地址的程序计数器(PC)、用于访存的存储器地址寄存器(MAR)和存储器数据寄存器(MDR)、存放当前正在译码指令的当前指令寄存器(CIR)以及暂存中间结果的累加器(ACC)。
The Fetch‑Decode‑Execute (FDE) cycle is the fundamental operation of a processor. During the fetch stage, the address in the PC is transferred to the MAR, the instruction is read from memory into the MDR and then copied to the CIR, and the PC is incremented. In the decode stage, the CU interprets the opcode and identifies the operands. In the execute stage, the CU sends control signals to perform the required operation, which may involve the ALU or a memory read/write.
取指‑译码‑执行(FDE)周期是处理器最基本的工作流程。取指阶段将 PC 中的地址送入 MAR，从内存读出指令送入 MDR 再复制到 CIR，同时 PC 自增指向下一条指令。译码阶段由 CU 解析操作码并确定操作数。执行阶段 CU 发出控制信号完成所需操作，可能涉及 ALU 运算或内存读写。
Factors affecting CPU performance include clock speed (cycles per second), number of cores (parallel execution), cache size and levels (faster access to frequently used data), and the use of pipelining to overlap instruction stages. Pipelining improves throughput but can lead to hazards such as data dependencies.
影响处理器性能的因素包括时钟频率(每秒周期数)、核心数量(并行执行)、高速缓存的容量和层级(更快访问常用数据)，以及使用流水线技术让不同指令的阶段重叠执行。流水线提高了吞吐量，但可能因数据相关等问题产生冒险。
2. Data Representation | 数据表示
Computers store and process data in binary format. Denary integers can be converted to binary using repeated division by 2. Binary numbers are easily expressed in hexadecimal (base 16) because each hex digit corresponds to four bits, which simplifies reading and writing of long binary strings. For example, 1010 1101₂ can be written as AD₁₆.
计算机以二进制形式存储和处理数据。十进制整数可通过连续除以 2 的方法转换为二进制。二进制数易于用十六进制表示，因为每一位十六进制数恰好对应四位二进制，方便读写较长的二进制串。例如 1010 1101₂ 可表示为 AD₁₆。
To represent signed integers, two’s complement is widely used. The most significant bit acts as a sign bit (0 for positive, 1 for negative). To obtain the two’s complement of a negative number, invert all bits of its positive magnitude and add 1. For an n‑bit word, the range of representable values is –2ⁿ⁻¹ to 2ⁿ⁻¹ – 1. Floating‑point representation stores a number in the form mantissa × 2ᵉˣᵖᵒⁿᵉⁿᵗ, where both mantissa and exponent are stored as binary, allowing a wide dynamic range at the cost of reduced precision.
带符号整数通常使用二进制补码表示。最高位作为符号位(0 为正，1 为负)。求负数的补码时，先对其绝对值按位取反再加 1。对于 n 位字长，表示范围为 –2ⁿ⁻¹ 至 2ⁿ⁻¹ – 1。浮点表示将数值存储为尾数 × 2指数的形式，尾数和指数均以二进制存储，从而在牺牲一定精度的前提下获得更大的动态范围。
Characters are encoded using standard character sets. ASCII uses 7 bits to represent 128 characters, while extended ASCII uses 8 bits. Unicode (e.g., UTF‑8) provides a much larger code space, supporting thousands of characters for global languages and symbols.
字符通过标准字符集编码。ASCII 使用 7 位表示 128 个字符，扩展 ASCII 采用 8 位。Unicode(例如 UTF‑8)提供更庞大的编码空间，支持全球数千种语言的字符与符号。
3. Systems Software | 系统软件
An operating system (OS) is the essential software that manages hardware resources and provides a platform for application programs. Its core functions include memory management (allocating and deallocating RAM, virtual memory via paging or segmentation), process scheduling (ensuring fair and efficient use of the CPU), interrupt handling, input/output management, and providing a user interface (CLI or GUI).
操作系统(OS)是管理硬件资源并为应用程序提供平台的关键软件。其核心功能包括内存管理(分配和回收 RAM、通过分页或分段实现虚拟内存)、进程调度(确保 CPU 被公平高效地使用)、中断处理、输入/输出管理以及提供用户界面(命令行或图形界面)。
Common types of operating systems include multi‑tasking (allowing several tasks to run concurrently), real‑time (guaranteeing a response within a strict time limit, often used in embedded control systems), distributed (coordinating multiple computers across a network), and embedded (designed for specific devices with limited resources). Utility software performs maintenance tasks such as disk defragmentation, file compression, backup, and encryption.
常见的操作系统类型包括多任务(允许多个任务并发运行)、实时(保证在严格时限内响应，常用于嵌入式控制系统)、分布式(通过网络协调多台计算机)和嵌入式(为资源受限的特定设备设计)。实用工具软件用于完成磁盘碎片整理、文件压缩、备份和加密等维护任务。
Translators convert source code into machine code. A compiler translates the entire source program into object code before execution, a interpreter translates and executes line by line, and an assembler converts assembly language mnemonics into machine code. Each has trade‑offs in execution speed, memory usage, and error reporting.
翻译器负责将源代码转换为机器码。编译器在执行前将整个源程序一次性翻译为目标代码，解释器则逐条翻译并立即执行，而汇编器将汇编助记符转换为机器码。它们在执行速度、内存占用和错误报告上各有优劣。
4. Assembly Language & Addressing Modes | 汇编语言与寻址模式
Assembly language is a low‑level programming language that uses mnemonics (e.g., LDA, ADD, STA) to represent machine instructions. Each mnemonic corresponds to an opcode that the processor can execute. The Little Man Computer (LMC) is a simplified instructional model that helps students understand the FDE cycle and how instructions interact with memory.
汇编语言是一种使用助记符(如 LDA、ADD、STA)表示机器指令的低级编程语言，每条助记符对应一个处理器可执行的操作码。小个子计算机(LMC)是一个简化的教学模型，用于帮助学生理解 FDE 周期以及指令如何与内存交互。
Addressing modes specify how the operand of an instruction is accessed. Immediate addressing uses the actual value given in the instruction. Direct addressing provides the memory address of the operand. Indirect addressing uses the address stored at a given location to reach the operand, allowing greater flexibility. Indexed addressing adds an offset to a base address, which is useful for handling arrays and data structures efficiently.
寻址模式规定了如何访问指令中的操作数。立即寻址直接使用指令中给出的实际数值。直接寻址给出操作数所在的内存地址。间接寻址利用存储在指定位置中的地址来找到操作数，灵活性更高。变址寻址在基地址上叠加偏移量，便于高效处理数组等数据结构。
5. Networking Basics | 网络基础
A Local Area Network (LAN) connects computers within a small geographical area, usually using Ethernet or Wi‑Fi technologies. Wide Area Networks (WANs) span large distances and rely on leased communication lines or the internet. The choice of topology – star, bus, or mesh – affects performance, fault tolerance, and cost. A star topology, with a central switch, offers easy fault isolation but requires more cabling.
局域网(LAN)连接小范围内的计算机，通常采用以太网或 Wi‑Fi 技术。广域网(WAN)覆盖远距离，依赖租用线路或互联网。拓扑结构的选择(星形、总线形或网状)会影响性能、容错能力和成本。星形拓扑通过中央交换机连接各节点，便于定位故障但需要更多线缆。
Protocols are sets of rules governing communication. The TCP/IP stack layers – Application, Transport, Internet, and Network Access – provide a framework for data transmission. Key protocols include HTTP/HTTPS for web pages, FTP for file transfer, SMTP and POP3 for email, and TCP/UDP at the transport layer. Packet switching breaks data into packets that are routed independently, making efficient use of network capacity.
协议是规范通信的规则集合。TCP/IP 协议栈分层模型(应用层、传输层、互联网层和网络接入层)为数据传输提供框架。关键协议包括用于网页的 HTTP/ HTTPS、用于文件传输的 FTP、用于电子邮件的 SMTP 和 POP3，以及传输层的 TCP 和 UDP。分组交换将数据分割为数据包独立路由，高效利用网络容量。
Networks can operate in client‑server or peer‑to‑peer (P2P) models. In client‑server, a central server provides resources and services; in P2P, each node acts both as client and server, sharing resources directly. The choice depends on requirements for security, scalability, and central management.
网络可采用客户‑服务器或对等(P2P)模式。客户‑服务器模式下，由中心服务器提供资源和服务；P2P 模式下，每个节点既是客户机也是服务器，直接共享资源。具体选择取决于对安全性、可扩展性和集中管理的需求。
6. Databases | 数据库
A relational database organises data into tables (relations) with rows (records) and columns (attributes). Each table has a primary key, a unique identifier for each record. Foreign keys link related tables, enforcing referential integrity. Entity‑Relationship (E‑R) diagrams model these relationships as one‑to‑one, one‑to‑many, or many‑to‑many.
关系数据库将数据组织成由行(记录)和列(属性)构成的关系表。每个表有一个主键，作为每条记录的唯一标识。外键用于关联相关表，确保参照完整性。实体‑关系(E‑R)图将这些关系建模为一对一、一对多或多对多。
Structured Query Language (SQL) is used to manage and query data. The basic SELECT statement retrieves columns from tables; the WHERE clause filters rows; JOIN combines related rows from multiple tables. Normalisation is the process of reducing data redundancy and preventing update anomalies. The first three normal forms (1NF, 2NF, 3NF) eliminate repeating groups, partial dependencies, and transitive dependencies, respectively.
结构化查询语言(SQL)用于管理并查询数据。基本的 SELECT 语句从表中检索列，WHERE 子句过滤行，JOIN 则实现多表关联查询。规范化过程旨在减少数据冗余并避免更新异常。前三个范式(1NF, 2NF, 3NF)分别用于消除重复组、部分函数依赖和传递依赖。
7. Algorithms and Computational Thinking | 算法与计算思维
Computational thinking involves abstraction (focusing on essential details while ignoring irrelevant ones), decomposition (breaking a complex problem into smaller, manageable parts), and pattern recognition (identifying similarities to reuse existing solutions). Searching algorithms include linear search, which scans each element in turn, and binary search, which repeatedly halves a sorted list. Binary search has a time complexity of O(log n), much more efficient than linear search’s O(n) for large data sets.
计算思维包括抽象(关注关键细节忽略无关信息)、分解(将复杂问题拆分成可管理的小模块)和模式识别(发现相似性以复用已有方案)。搜索算法中的线性搜索逐个扫描元素，而二分查找在有序列表中反复折半搜索。二分查找的时间复杂度为 O(log n)，对于大数据集远比线性搜索的 O(n) 高效。
Common sorting algorithms demonstrate different complexities. Bubble sort repeatedly swaps adjacent items and has an average and worst‑case complexity of O(n²). Insertion sort builds a sorted portion one element at a time, also O(n²) in the worst case. Merge sort uses a divide‑and‑conquer strategy, achieving O(n log n) in all cases, which is optimal for comparison‑based sorts. Big‑O notation describes an algorithm’s growth rate, ignoring constant factors.
常见排序算法展现出不同的复杂度。冒泡排序反复交换相邻元素，平均和最坏情况复杂度均为 O(n²)。插入排序逐个构建有序部分，最坏情况同样是 O(n²)。归并排序采用分治策略，所有情况下均达到 O(n log n)，这是基于比较的排序算法的最优复杂度。大 O 表示法描述算法增长率，并忽略常数因子。
Standard algorithms include finding the minimum, maximum, and counting occurrences within a list. Understanding their logic and implementation is crucial for problem‑solving in examinations.
标准算法包括在列表中查找最小值、最大值以及统计出现次数。理解它们的逻辑和实现方式对考试中的解题至关重要。
8. Data Structures | 数据结构
Arrays store elements of the same data type in contiguous memory locations, allowing constant‑time access via an index. A record groups fields of potentially different types under one name. Linked lists consist of nodes that each store data and a pointer to the next node, enabling dynamic memory usage but requiring sequential traversal.
数组将相同数据类型的元素存储在连续的内存位置，可通过索引实现常数时间访问。记录则将可能不同类型的数据字段组合在一个名字下。链表由节点构成，每个节点包含数据和指向下一节点的指针，支持动态内存分配但需顺序遍历。
Abstract data types (ADTs) define behaviours independently of implementation. A stack is a Last‑In‑First‑Out (LIFO) structure with operations push and pop, applied in subroutine calls and expression evaluation. A queue is a First‑In‑First‑Out (FIFO) structure, used in print spooling and task scheduling. A hash table maps keys to values using a hash function; collisions can be resolved by open addressing or chaining. A binary search tree stores ordered data to enable O(log n) search, insertion, and deletion when balanced.
抽象数据类型(ADT)独立于具体实现来定义行为。栈是一种后进先出(LIFO)结构，支持入栈和出栈操作，应用于子程序调用和表达式求值。队列是先进先出(FIFO)结构，常用于打印队列和任务调度。哈希表利用哈希函数将键映射到值，冲突可通过开放寻址或链地址法解决。二叉搜索树存储有序数据，在保持平衡时可实现 O(log n) 的查找、插入和删除。
9. Programming Fundamentals | 编程基础
Programming languages provide a set of primitive data types, such as integer, real/float, character, string, and Boolean. Variables store data that can change, while constants hold immutable values. The three basic control structures are sequence, selection (if‑then‑else, switch), and iteration (for, while, do‑while loops), which form the foundation of all algorithms.
编程语言提供一组基本数据类型，如整型、实型/浮点型、字符、字符串和布尔型。变量用于存储可变数据，常量则保存不可变值。三种基本控制结构是顺序、选择(if‑then‑else、switch)和迭代(for、while、do‑while 循环)，它们是所有算法的基础。
Modular programming encourages breaking a program into subroutines – procedures (which perform an action) and functions (which return a value). Parameters can be passed by value (a copy) or by reference (the original variable). Recursion occurs when a subroutine calls itself; it requires a base case to terminate and can often be expressed more concisely than iterative solutions.
模块化编程提倡将程序拆分为子程序——过程(执行动作)和函数(返回值)。参数传递可按值(传递副本)或按引用(传递变量本身)。递归指子程序调用自身，必须包含终止基线条件，通常能以比迭代更简洁的方式表达。
Object‑Oriented Programming (OOP) organises code around objects that combine data (attributes) and methods. Classes act as blueprints, applying encapsulation to hide internal state. Inheritance allows a subclass to reuse and extend the properties of a superclass. Polymorphism enables objects of different classes to respond to the same method call in their own way. These concepts are frequently examined in the context of class diagrams and OOP‑based programming tasks.
面向对象编程(OOP)围绕将数据(属性)和方法结合在一起的对象来组织代码。类相当于蓝图，利用封装隐藏内部状态。继承允许子类继承并扩展父类的属性和方法。多态使不同类的对象能够以自己的方式响应同一方法调用。这些概念经常出现在类图解读和面向对象编程任务的考试中。
10. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路
Logic gates are the building blocks of digital circuits. The basic gates are AND, OR, and NOT. Compound gates such as NAND, NOR, and XOR can be constructed from these primitives. Truth tables map all possible input combinations to the corresponding output, providing a precise specification for a combinational circuit.
逻辑门是数字电路的基本构件，基本门电路包括与门、或门和非门。与非门、或非门和异或门等复合门可由这些基本门构成。真值表列出了所有可能的输入组合及其对应输出，为组合逻辑电路提供精确规格。
Boolean expressions can be simplified using identities such as commutative, associative, and distributive laws, and with De Morgan’s theorems. Simplification reduces the number of gates, lowering cost and power consumption. Karnaugh maps (K‑maps) offer a visual method to minimise Boolean expressions for up to four variables by grouping adjacent 1s.
布尔表达式可利用交换律、结合律、分配律以及德摩根定理等恒等式进行化简。化简可减少所需门电路数量，从而降低成本和功耗。卡诺图为至多四个变量的布尔表达式最小化提供了图形化方法，通过圈出相邻的 1 实现化简。
Combinational circuits perform specific computational tasks. A half adder adds two single bits producing a sum and a carry; a full adder adds two bits plus an incoming carry. Multiple full adders can be chained to build multi‑bit adders. D‑type flip‑flops act as memory elements, capturing the input value on a clock edge, and are essential in sequential logic and register design.
组合逻辑电路完成特定运算任务。半加器对两个二进制位相加，产生和与进位；全加器再加一个来自低位的进位。多个全加器可级联构成多位加法器。D 型触发器充当存储元件，在时钟边沿捕获输入值，是时序逻辑和寄存器设计中的关键器件。
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