📚 Pre-U CIE Computer Science: A Comprehensive Syllabus Breakdown | Pre-U CIE 计算机科学：课程大纲全面解析
The Cambridge Pre-U Computer Science (9765) is a demanding two-year pre-university course that provides an in-depth exploration of computational theory, practical programming, and independent project work. It is designed to equip students with the knowledge, analytical skills, and creativity required to excel in undergraduate computer science degrees and beyond. This article offers a thorough dissection of the entire syllabus, examining its structure, assessment components, and core content areas.
剑桥Pre-U计算机科学（9765）是一门要求严格的两年制大学预科课程，深入探索计算理论、实践编程和独立项目工作。其设计目标是为学生提供在计算机科学本科及更远阶段获得成功所需的知识、分析能力和创造力。本文将对整个课程大纲进行彻底剖析，审视其结构、评估组成部分以及核心内容领域。
1. Introduction to Cambridge Pre-U Computer Science | 剑桥Pre-U计算机科学简介
Cambridge Pre-U Computer Science is widely regarded as a more challenging alternative to traditional A Levels, fostering higher-order thinking and independent learning. The syllabus is linear, meaning all assessments are taken at the end of the two-year course. It encourages students to explore topics such as artificial intelligence, robotics, and cryptography through a contextual approach, ensuring a deep and robust understanding of both theory and practice.
剑桥Pre-U计算机科学被广泛视为比传统A Level更具挑战性的替代方案，培养高阶思维和自主学习能力。该大纲为线性制，即所有评估在两年课程结束后进行。它鼓励学生通过情境化方法探索人工智能、机器人学、密码学等主题，确保对理论和实践的深入而扎实的理解。
2. Assessment Objectives and Skills | 评估目标与技能
The qualification is built around three assessment objectives: AO1 (Knowledge with understanding) requires recall and comprehension of computer science principles; AO2 (Application of knowledge) demands the use of this understanding in both familiar and novel scenarios; AO3 (Analysis, evaluation and conclusion) involves critically examining solutions, making reasoned judgements, and justifying decisions. These objectives are woven into every exam paper and the coursework components.
该资格认证围绕三个评估目标构建：AO1（知识与理解）要求记忆和理解计算机科学原理；AO2（知识应用）要求将这种理解运用于熟悉的和新颖的场景；AO3（分析、评价与结论）涉及批判性地审视解决方案、作出合理判断并论证决策。这些目标融入每一份试卷和课程作业组成部分之中。
3. Syllabus Structure at a Glance | 课程大纲结构一览
The Pre-U Computer Science syllabus comprises four components, blending external examinations with substantial coursework. The balanced weighting ensures that both theoretical mastery and practical flair are rewarded. The table below summarises the structure.
Pre-U计算机科学课程大纲由四个部分组成，融合了外部考试与大量的课程作业。这种均衡的权重确保了理论掌握和实践才华都能得到回报。下表总结了该结构。
| Component | Weighting | Assessment Type |
|---|---|---|
| Paper 1: Computer Science Theory | 25% | Written exam (2 h 30 min) |
| Paper 2: Problem Solving and Programming | 25% | Written exam (2 h 30 min) |
| Paper 3: Computing Project | 30% | Coursework (guided learning hours ~80) |
| Paper 4: Written Report | 20% | Coursework report based on the project |
Candidates must complete all four components. Papers 1 and 2 are externally set and marked, while Papers 3 and 4 are internally assessed and externally moderated.
考生必须完成全部四个部分。试卷一和试卷二由外部出题并评分，而试卷三和试卷四则由内部评估并接受外部审核。
4. Paper 1: Computer Science Theory | 试卷一：计算机科学理论
Paper 1 examines the foundational principles of computer science. The 2-hour 30-minute written paper features a mix of short-answer, structured, and extended-response questions. Topics covered include data representation, communication and networking, processor architecture, system software, data security and integrity, as well as ethical, legal, and environmental implications of computing. A deep understanding of how hardware and software interact is essential for success.
试卷一考查计算机科学的基本原理。这份时长2小时30分钟的笔试包含简答题、结构化题和拓展回答题。涵盖的主题包括数据表示、通信与网络、处理器架构、系统软件、数据安全与完整性，以及计算的伦理、法律和环境影响。深入理解硬件与软件如何交互对成功至关重要。
5. Paper 2: Problem Solving and Programming | 试卷二：问题解决与编程
Paper 2 focuses on algorithmic thinking and programming proficiency. The 2-hour 30-minute exam requires candidates to design algorithms, interpret pseudocode, trace programs, and answer questions on data structures. The syllabus explicitly mentions stacks, queues, linked lists, trees, and hash tables. Students are expected to demonstrate competence in procedural, object-oriented, and functional paradigms, though the exam typically uses pseudocode or a generic high-level language for illustration.
试卷二聚焦算法思维和编程熟练度。时长2小时30分钟的考试要求考生设计算法、解释伪代码、跟踪程序并回答数据结构问题。大纲明确提及栈、队列、链表、树和哈希表。学生需要展示在过程式、面向对象和函数式范式方面的能力，尽管考试通常使用伪代码或一种通用的高级语言进行说明。
6. Coursework Components: Project and Report | 课程作业：项目与报告
The coursework element is a distinguishing feature of the Pre-U qualification. Paper 3 entails an extensive computing project where learners identify, design, implement, test, and evaluate a solution to a real-world problem. The project spans approximately 80 guided learning hours and can involve application development, simulation, data analysis, or hardware control. Paper 4 is a formal written report (typically 3,000–5,000 words) that documents the project’s rationale, development process, and critical evaluation. Together, these components assess a student’s ability to manage an independent software engineering endeavour.
课程作业部分是Pre-U资格的一个显著特色。试卷三要求一个广泛的计算项目，学习者需要识别、设计、实现、测试并评价一个现实世界问题的解决方案。项目横跨约80个指导学时，可涉及应用开发、模拟、数据分析或硬件控制。试卷四是一份正式的书面报告（通常3000–5000字），记录项目的依据、开发过程和批判性评价。这些部分共同评估学生管理一项独立软件工程工作的能力。
7. Key Topics in Theory | 理论部分关键主题
The theoretical content of the syllabus is organised into several major strands. These include the fundamentals of data representation and number bases, the architecture of the central processing unit (CPU) and the fetch-execute cycle, memory management, input/output systems, operating systems, translators and compilers, data communications and networking protocols, database concepts, and the social impact of computing. The syllabus also introduces elements of automata theory and Turing machines, giving a glimpse into the limits of computation.
课程大纲的理论内容被组织为若干主要分支。这些包括数据表示与数制基础、中央处理器架构与取指-执行周期、内存管理、输入/输出系统、操作系统、翻译器与编译器、数据通信与网络协议、数据库概念，以及计算的社会影响。大纲还引入了自动机理论和图灵机的元素，让人一窥计算的极限。
8. Data Representation and Number Systems | 数据表示与数制
A strong command of binary, denary, and hexadecimal systems is expected. Students must be able to convert between bases, perform binary addition and subtraction, understand two’s complement representation for negative integers, and manipulate floating-point numbers using mantissa and exponent notation. For instance, a binary value such as 1101.101₂ can be expressed in normalised floating-point form. This topic underpins much of the architecture content and commonly appears in Paper 1.
需要熟练掌握二进制、十进制和十六进制系统。学生必须能够进行基数转换、执行二进制加法和减法、理解用于负整数的二进制补码表示，以及使用尾数和阶码符号处理浮点数。例如，一个像1101.101₂这样的二进制值可以用规格化浮点形式表示。这一主题支撑着大量体系结构内容，常在试卷一出现。
9. Algorithms and Data Structures | 算法与数据结构
Algorithm design and analysis form the heart of Paper 2. Learners study classic sorting algorithms (bubble, insertion, merge, quicksort) and searching algorithms (linear, binary), together with their time complexity expressed in Big O notation, e.g. O(n log n), O(n²). They explore abstract data types: stacks (LIFO), queues (FIFO), singly and doubly linked lists, binary trees and binary search trees, and hash tables with collision resolution. Recursion and its comparison to iteration are also examined.
算法设计与分析构成试卷二的核心。学习者研究经典排序算法（冒泡、插入、归并、快速排序）和查找算法（线性、二分），以及它们以大O符号表示的时间复杂度，例如 O(n log n)、O(n²)。他们探索抽象数据类型：栈（LIFO）、队列（FIFO）、单向和双向链表、二叉树与二叉搜索树、以及带冲突解决的哈希表。递归及其与迭代的比较也受到考查。
10. Programming Paradigms and Languages | 编程范式与语言
The syllabus does not prescribe a specific programming language; centres frequently use Python, Java, C#, or similar. However, students must grasp the principles of three main paradigms. Procedural programming emphasises step-by-step instructions and modularity. Object-oriented programming (OOP) introduces classes, objects, inheritance, encapsulation, and polymorphism. Functional programming covers first-class functions, higher-order functions, pure functions, and immutability. Exam questions often ask candidates to compare these paradigms or write pseudocode demonstrating OOP concepts.
大纲未指定具体的编程语言；教学中心常使用Python、Java、C#或类似语言。但是，学生必须掌握三种主要范式的原理。过程式编程强调逐步指令和模块化。面向对象编程引入类、对象、继承、封装和多态。函数式编程涵盖一等函数、高阶函数、纯函数和不可变性。考试题目常要求考生比较这些范式，或编写展示面向对象概念的伪代码。
11. System Software and Security | 系统软件与安全
Understanding system software is crucial. The syllabus covers operating system functions such as memory management, process scheduling, file management, and interrupt handling. Students learn the distinctions between compilers, interpreters, and assemblers. Security topics include symmetric and asymmetric encryption, digital signatures, firewalls, malware types, and authentication methods. The relevance of these concepts is reinforced through case studies on data breaches and ethical hacking.
理解系统软件至关重要。大纲涵盖操作系统功能，如内存管理、进程调度、文件管理和中断处理。学生学习编译器、解释器和汇编器之间的区别。安全主题包括对称与非对称加密、数字签名、防火墙、恶意软件类型和认证方法。通过有关数据泄露和道德黑客攻击的案例研究，这些概念的现实关联性得以强化。
12. Preparing for the Pre-U Exam | Pre-U考试备考建议
Effective preparation demands a dual focus on theoretical rigour and consistent coding practice. Regularly revisiting past papers and specimen materials is essential to become familiar with the examiners’ style. For the project, start early, maintain detailed logs, and choose a genuinely engaging problem. Balance your study by interleaving topics: for example, study a theory chapter, then implement a related data structure. Utilise official Cambridge resources and keep abreast of technological news to enrich evaluation answers in Paper 4.
有效的备考需要同时注重理论严谨性和持续的编码实践。定期重温历年真题和样卷材料对于熟悉考官风格至关重要。对于项目，要尽早开始，保持详细日志，并选择一个真正引人入胜的问题。通过交替主题来均衡学习：例如，学习一个理论章节，然后实现一个相关的数据结构。利用剑桥官方资源，并关注科技新闻，以丰富试卷四中的评价答案。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导