📚 Pre-U OCR Computer Science: Full Syllabus Breakdown | Pre-U OCR 计算机：课程大纲全面解析
The Cambridge Pre-U Computer Science (OCR) qualification is a rigorous two-year pre-university course that goes beyond standard A-Levels to cultivate deep computational thinking, robust programming expertise, and the ability to manage large-scale independent projects. This comprehensive breakdown walks you through the entire syllabus structure, assessment components, core knowledge domains, and practical strategies for achieving top marks.
剑桥 Pre-U 计算机科学（OCR）是一门严格的两年制大学预科课程，它超越普通 A-Level 水平，旨在培养深度计算思维、扎实的编程技能以及管理大型独立项目的能力。本文将全面解析课程结构、评估构成、核心知识领域以及获得高分的实用策略。
The syllabus is designed to reflect the demands of undergraduate computer science, placing equal emphasis on theory, applied programming, and a substantial coursework project. Students must master a broad range of topics from low-level data representation to high-level software engineering and ethical considerations, making it one of the most respected computing qualifications in the UK.
该课程大纲旨在反映本科计算机科学的要求，同等重视理论、应用编程和一项重要的课程项目。学生必须掌握从底层数据表示到高层软件工程和伦理考量的广泛主题，使其成为英国最受推崇的计算学科资格之一。
1. Course Overview and Aims | 课程总览与目标
The Pre-U Computer Science course aims to develop an understanding of the fundamental principles of computing and the ability to apply them to solve problems. It encourages students to think creatively, analytically and logically, while fostering skills in independent research and project management that are essential for higher education.
Pre-U 计算机科学课程旨在培养学生对计算基本原理的理解，并具备应用这些原理解决问题的能力。它鼓励创造性、分析性和逻辑性思维，同时培养高等教育所必需的独立研究和项目管理技能。
Unlike many modular A-Levels, Pre-U is linear with all externally assessed exams taken at the end of the two-year programme. The internally assessed project runs alongside the taught content and allows students to explore an area of personal interest, giving the qualification a distinctive flavour of academic freedom.
与许多模块化的 A-Level 不同，Pre-U 采用线性结构，所有外部评估考试在两年课程结束时进行。内部评估项目与教学内容并行展开，使学生能够探索个人感兴趣的领域，赋予该资格一种独特的学术自由风味。
OCR administers the Cambridge Pre-U Computer Science specification (9791). It is graded on a nine-point scale: Distinction 1, 2, 3; Merit 1, 2, 3; Pass 1, 2, 3. This provides a finer discrimination at the top end than A-Level A* grades and is highly valued by competitive university admissions tutors.
OCR 负责管理剑桥 Pre-U 计算机科学大纲（9791）。它的成绩分为九等：优秀 1、2、3；良好 1、2、3；及格 1、2、3。这在高分段比 A-Level 的 A* 等级提供了更精细的区分度，受到顶尖大学招生导师的高度重视。
2. Assessment Structure at a Glance | 评估结构一览
The qualification comprises three mandatory components, each assessing different skill sets. The following table summarises the weighting, duration and nature of each assessment.
该资格包含三个必修部分，每部分评估不同的技能组合。下表总结了各评估的权重、时长和性质。
| Component | Title | Weighting | Duration | Type |
|---|---|---|---|---|
| 1 | Computer Fundamentals | 40% | 2 h 30 min | Written paper |
| 2 | Programming and Problem-solving | 30% | 2 h 00 min | Written paper |
| 3 | Computing Project | 30% | Coursework | Internally assessed, externally moderated |
Component 1 Computer Fundamentals is a synoptic paper that examines knowledge and understanding of the entire theoretical syllabus. Component 2 focuses on practical programming, algorithm design and problem-solving techniques, answered in a choice of programming languages. Component 3 is an in-depth project where students identify, analyse, design, implement and evaluate a substantial computer-based solution.
卷一“计算机基础”是一份综合试卷，考察对整个理论大纲的知识和理解。卷二侧重于实际编程、算法设计和问题解决技巧，考生可选一种编程语言作答。卷三是一个深入的项目，学生需要识别、分析、设计、实现并评估一个重要的基于计算机的解决方案。
3. Component 1: Computer Fundamentals | 卷一：计算机基础
This written paper covers the full breadth of theoretical content, ranging from the inner workings of a processor to the societal impact of digital technology. It is marked out of 120 and includes a variety of question types: short-answer, structured and extended prose questions.
这份笔试试卷覆盖了理论内容的全部广度，从处理器内部工作原理到数字技术的社会影响。卷面总分 120 分，包含多种题型：简答题、结构化问题和论述题。
Candidates must demonstrate a firm grasp of computer architecture, data representation, operating systems, networking, databases, programming language translators, software engineering and the legal-ethical framework. Synoptic questions often require linking concepts from multiple syllabus areas, so a compartmentalised approach to revision will not suffice.
考生必须展示对计算机体系结构、数据表示、操作系统、网络、数据库、编程语言翻译器、软件工程以及法律伦理框架的牢固掌握。综合性问题通常需要联系多个大纲领域的概念，因此分割式的复习方法是行不通的。
Typical topics assessed include Boolean algebra and logic circuit design, memory management, virtualisation, TCP/IP protocol stack, normalisation of relational databases, and the implications of the Data Protection Act and Computer Misuse Act. Pay particular attention to command words such as “describe”, “explain”, “compare” and “evaluate” as they dictate the depth of response required.
评估的典型主题包括布尔代数与逻辑电路设计、内存管理、虚拟化、TCP/IP 协议栈、关系数据库的规范化，以及《数据保护法》和《计算机滥用法》的影响。要特别注意指令词，如“描述”、“解释”、“比较”和“评价”，它们决定了回答所需的深度。
4. Component 2: Programming and Problem-solving | 卷二：编程与问题解决
Although sat as a written examination, Component 2 is fundamentally a test of practical programming ability. Students answer algorithm design, code tracing, code completion and original code writing questions using a pre-declared programming language from an approved list (commonly Python, Java, C# or Visual Basic).
尽管卷二是以笔试形式进行，但它本质上是对实际编程能力的测试。学生需要使用预先声明的获批准编程语言（通常为 Python、Java、C# 或 Visual Basic）来回答算法设计、代码追溯、代码补全和原创代码编写问题。
The paper places heavy emphasis on computational thinking: decomposition, pattern recognition, abstraction and algorithm design. Candidates might be asked to solve a maze problem, implement a sorting algorithm, manipulate a stack or queue, traverse a tree, or process records from a database. Pseudocode and flowcharts are also assessed, so fluency in the prescribed pseudocode syntax is essential.
该试卷高度重视计算思维：分解、模式识别、抽象和算法设计。考生可能被要求解决迷宫问题、实现排序算法、操作栈或队列、遍历树，或处理数据库中的记录。伪代码和流程图也是考察内容，因此熟练使用规定伪代码语法至关重要。
Common pitfalls include failing to initialise variables, ignoring edge cases, and inefficient use of searching or sorting algorithms. Practising past paper questions under timed conditions, and using an iterative approach to refinement, will build the speed and accuracy needed to score highly on this demanding paper.
常见错误包括未初始化变量、忽略边界情况，以及低效地使用搜索或排序算法。在计时条件下练习历年真题，并采用迭代求精的方法，将培养在这份要求颇高的试卷上获得高分所需的速度和准确性。
5. Component 3: The Computing Project | 卷三：计算项目
The Computing Project accounts for 30% of the total qualification and is a unique opportunity for students to showcase their independent problem-solving skills. The project must involve significant programming and produce a working solution to a genuine problem, accompanied by a detailed written report of approximately 40–60 pages.
计算项目占总成绩的 30%，是学生展示独立解决问题能力的独特机会。项目必须包含重要的编程工作，并针对一个真实问题产出一个可运行的解决方案，同时附上一份约 40 至 60 页的详细书面报告。
The project is assessed against four criteria: Analysis and Design (15 marks), Technical Solution (25 marks), Testing and Evaluation (15 marks), and Project Report (15 marks). Therefore, code quality alone is not enough; thorough analysis, logical design, evidence of iterative testing, and critical evaluation are equally weighted.
项目根据四项标准进行评估：分析与设计（15 分）、技术方案（25 分）、测试与评估（15 分）以及项目报告（15 分）。因此，仅有代码质量还不够，透彻的分析、合理的设计、迭代测试的证据和批判性评估同等重要。
Successful projects often tackle areas such as machine learning for image classification, mobile app development for campus services, simulation of physical systems, or custom database-driven web applications. The chosen topic must stretch the student beyond the taught curriculum and show genuine depth, but must also be realistically achievable within the timeframe. Clear, professional documentation with UML diagrams, test plans, and version control logs will significantly elevate the report quality.
成功项目通常涉及诸如用于图像分类的机器学习、校园服务移动应用开发、物理系统模拟或自定义数据库驱动的 Web 应用等领域。所选主题必须超越课堂教学大纲并展现出真正的深度，但也必须在时间框架内切实可行。带有 UML 图表、测试计划和版本控制日志的清晰专业文档将显著提升报告质量。
6. Core Content: Data Representation | 核心内容：数据表示
Number systems: binary, denary and hexadecimal representations, and efficient conversion between them.
数系：二进制、十进制和十六进制表示法，以及它们之间的高效转换。
Binary arithmetic: addition, subtraction using two’s complement, handling overflow and underflow errors.
二进制运算：加法、使用二进制补码的减法，处理溢出和下溢错误。
Floating-point representation: mantissa and exponent, normalisation, precision trade-offs and the limitations of binary floating point for representing real numbers.
浮点表示：尾数和阶码、规格化、精度权衡以及二进制浮点数在表示实数时的局限性。
Character encoding: ASCII, extended ASCII, Unicode (UTF-8, UTF-16) and the rationale behind different encoding schemes.
字符编码：ASCII、扩展 ASCII、Unicode（UTF-8、UTF-16）以及不同编码方案背后的原理。
Sound and image representation: sampling rate, bit depth, resolution, colour depth, vector vs. bitmap graphics, and the need for compression.
声音与图像表示：采样率、位深度、分辨率、颜色深度、矢量与位图图形，以及压缩的必要性。
Lossy and lossless compression: run-length encoding, Huffman coding, dictionary-based methods for lossless; perceptual coding, JPEG and MP3 for lossy compression.
有损与无损压缩：游程编码、霍夫曼编码、基于字典的无损压缩方法；感知编码、JPEG 和 MP3 等有损压缩。
7. Core Content: Computer Systems and Architecture | 计算机系统与体系结构
Von Neumann architecture: stored-program concept, the fetch-decode-execute cycle, and the roles of the control unit, ALU, registers and buses.
冯·诺依曼体系结构：存储程序概念，取指-译码-执行周期，以及控制器、ALU、寄存器和总线的作用。
Processor performance factors: clock speed, number of cores, cache memory, pipelining, and the effect of each on throughput and latency.
处理器性能因素：时钟速度、核心数量、缓存、流水线，以及每种因素对吞吐量和延迟的影响。
Memory and storage hierarchy: registers, cache, main memory (RAM/ROM), virtual memory, secondary storage (magnetic, optical, solid-state) and their relative speed, cost and volatility.
存储器与存储层次：寄存器、缓存、主存（RAM/ROM）、虚拟内存、二级存储（磁性、光学、固态）及其相对速度、成本和易失性。
Boolean algebra and logic gates: AND, OR, NOT, NAND, NOR, XOR, truth tables, Boolean expressions, De Morgan’s laws and simplification using algebraic laws or Karnaugh maps.
布尔代数与逻辑门：与、或、非、与非、或非、异或，真值表，布尔表达式，德摩根定律以及用代数定律或卡诺图进行化简。
Operating systems: functions of an OS (memory management, process scheduling, interrupt handling, file management), types (real-time, multi-user, distributed) and the concept of virtual machines.
操作系统：操作系统的功能（内存管理、进程调度、中断处理、文件管理），类型（实时、多用户、分布式）以及虚拟机概念。
8. Core Content: Communication and Networking | 通信与网络
Network types and topologies: LAN, WAN, PAN, star, bus, mesh and hybrid topologies, along with their advantages, disadvantages and typical use cases.
网络类型和拓扑：局域网、广域网、个域网、星型、总线、网状和混合拓扑，以及各自的优缺点和典型应用场景。
The TCP/IP protocol stack: application layer, transport layer (TCP/UDP), internet layer (IP) and link layer; the role of packet switching and protocols such as HTTP, FTP, SMTP, POP3, DNS.
TCP/IP 协议栈：应用层，传输层（TCP/UDP），互联网层（IP）和链路层；数据包交换以及 HTTP、FTP、SMTP、POP3、DNS 等协议的作用。
IP addressing and subnetting: IPv4 and IPv6 structure, classful and classless addressing, subnet masks, CIDR notation, and calculating network and host addresses.
IP 地址与子网划分：IPv4 和 IPv6 结构，有类与无类寻址，子网掩码，CIDR 表示法，以及计算网络地址和主机地址。
Network security: threats (malware, phishing, DoS, brute-force attacks), cryptographic methods (symmetric and asymmetric encryption, digital signatures, certificates) and security measures such as firewalls, VPNs and access control.
网络安全：威胁（恶意软件、网络钓鱼、拒绝服务攻击、暴力攻击），加密方法（对称与非对称加密、数字签名、数字证书）以及防火墙、VPN 和访问控制等安全措施。
The client-server and peer-to-peer models; wireless networking (Wi-Fi, Bluetooth) and the electromagnetic spectrum issues that affect data transmission.
客户机-服务器模型和对等模型；无线网络（Wi-Fi、蓝牙）以及影响数据传输的电磁频谱问题。
9. Core Content: Software Development and Programming Paradigms | 软件开发与编程范式
Software development life cycle (SDLC): requirements analysis, design, implementation, testing, deployment and maintenance. Comparison of waterfall, iterative, spiral and agile methodologies.
软件开发生命周期：需求分析、设计、实现、测试、部署和维护。比较瀑布模型、迭代模型、螺旋模型和敏捷方法。
Object-oriented programming (OOP): classes, objects, encapsulation, inheritance, polymorphism and abstraction. Use of UML class diagrams to model OOP designs.
面向对象编程（OOP）：类、对象、封装、继承、多态和抽象。使用 UML 类图对 OOP 设计进行建模。
Functional programming paradigm: first-class functions, higher-order functions, recursion, immutability, map/reduce/filter operations, and declarative vs. imperative style.
函数式编程范式：一等函数、高阶函数、递归、不可变性、映射/归约/过滤操作，以及声明式与命令式风格。
Program translation: interpreters, compilers and assemblers; lexical analysis, syntax analysis, code generation and optimisation. Linkers and loaders.
程序翻译：解释器、编译器和汇编器；词法分析、语法分析、代码生成和优化。连接器和加载器。
Debugging, testing and quality assurance: types of testing (unit, integration, system, acceptance), black-box and white-box testing, test-driven development, and the importance of maintainable code.
调试、测试与质量保证：测试类型（单元、集成、系统、验收），黑盒与白盒测试，测试驱动开发，以及可维护代码的重要性。
10. Core Content: Algorithms and Problem-solving | 算法与问题解决
Algorithm analysis: Big O notation for time and space complexity, typical complexities (O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)) and choosing appropriate algorithms based on data size.
算法分析：时间与空间复杂度的 Big O 表示法，典型复杂度（O(1)、O(log n)、O(n)、O(n log n)、O(n²)、O(2ⁿ)）以及根据数据规模选择合适算法。
Searching algorithms: linear search and binary search; their implementation, efficiency comparisons, and preconditions (e.g. binary search requires sorted data).
搜索算法：线性搜索和二分搜索；它们的实现、效率比较以及前提条件（如二分搜索要求数据已排序）。
Sorting algorithms: bubble sort, insertion sort, merge sort and quicksort. Understanding how each divides and conquers, their stability, space complexity and best/worst case scenarios.
排序算法：冒泡排序、插入排序、归并排序和快速排序。理解每种算法如何进行分治，它们的稳定性、空间复杂度和最佳/最差情况。
Data structures: arrays (1D, 2D), lists, stacks (LIFO), queues (FIFO), linked lists, binary trees and hash tables. Operations such as pushing, popping, enqueuing, tree traversals (pre-order, in-order, post-order) and hashing with collision resolution.
数据结构：数组（一维、二维）、列表、栈（后进先出）、队列（先进先出）、链表、二叉树和哈希表。操作如压栈、弹栈、入队，树遍历（先序、中序、后序），以及带冲突解决的哈希。
Graph algorithms: representation using adjacency matrices and lists, breadth-first and depth-first traversal, and shortest-path algorithms such as Dijkstra’s algorithm. Practical applications in routing and social networks.
图算法：使用邻接矩阵和邻接表的表示方法，广度优先和深度优先遍历，以及如 Dijkstra 算法的最短路径算法。在路由和社交网络中的实际应用。
11. Legal, Moral, Ethical and Cultural Issues | 法律、道德、伦理与文化问题
Data protection legislation: principles of the UK Data Protection Act and GDPR, rights of data subjects, obligations of data controllers and processors, and the impact on system design.
数据保护立法：英国《数据保护法》和 GDPR 的原则，数据主体的权利，数据控制者和处理者的义务，以及对系统设计的影响。
Computer misuse and cybercrime: offences under the Computer Misuse Act (unauthorised access, unauthorised modification, and making, supplying or obtaining articles for use in offences).
计算机滥用法与网络犯罪：《计算机滥用法》规定的罪行（未经授权访问、未经授权修改，以及制作、提供或获取用于犯罪的物品）。
Moral and ethical dilemmas: automated decision-making, algorithmic bias, surveillance, privacy vs. security, and the ethical responsibilities of computing professionals. Professional codes such as the BCS Code of Conduct.
道德与伦理困境：自动决策、算法偏见、监控、隐私与安全的权衡，以及计算专业人士的伦理责任。如 BCS 行为准则等专业规范。
Digital divide and cultural implications: unequal access to technology, globalisation effects, accessibility standards (e.g. WCAG), and designing inclusive interfaces for diverse user groups.
数字鸿沟与文化影响：技术获取的不平等、全球化效应、无障碍标准（如 WCAG），以及为不同用户群体设计包容性界面。
Environmental impact: energy consumption of data centres, e-waste, sustainable computing practices and the potential of ICT to reduce carbon footprint through smart systems.
环境影响：数据中心的能源消耗、电子废弃物、可持续计算实践，以及 ICT 通过智能系统减少碳足迹的潜力。
12. Preparing for Success: Revision and Project Tips | 备考成功：复习与项目建议
Start early and map your revision to the syllabus statements. Create concise topic summaries and focus on understanding rather than rote memorisation, as the Pre-U rewards the ability to apply knowledge in unfamiliar contexts.
尽早开始，根据大纲陈述安排复习计划。创建简洁的主题总结，注重理解而非死记硬背，因为 Pre-U 奖励在不熟悉情境中应用知识的能力。
For Component 1, practise writing extended answers under timed conditions. Use the mark schemes to understand how examiners allocate points for clarity, structure, and use of technical terminology.
对于卷一，要在计时条件下练习构建拓展性答案。利用评分方案理解考官如何根据清晰度
Published by TutorHao | Pre-U Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导