Pre-U CCEA Computer Science: Summer Preview and Bridging Course | Pre-U CCEA 计算机：暑期预习与衔接课程

📚 Pre-U CCEA Computer Science: Summer Preview and Bridging Course | Pre-U CCEA 计算机：暑期预习与衔接课程

Embarking on a Pre-U Computer Science course with CCEA is an exciting challenge that builds a strong foundation for university-level computing and beyond. This summer preview guide is designed to help you bridge the gap between GCSE and the more rigorous demands of Pre-U study, ensuring you start the academic year with confidence and a clear understanding of what lies ahead.

踏上 CCEA 的 Pre-U 计算机科学课程是一段激动人心的挑战，它能为你大学阶段的计算机学习及更远的未来打下坚实的基础。这份暑期预习指南旨在帮助你衔接好 GCSE 与 Pre-U 更高要求之间的差距，确保你带着信心和对未来学习内容的清晰认识开启新学年。

1. Course Overview and Assessment Structure | 课程概览与评估结构

The CCEA Pre-U Computer Science course typically comprises four units over two years, blending theoretical knowledge with practical programming skills. The AS units include an introduction to computing principles and a programming project, while the A2 units delve into advanced computer systems and a substantial independent computing project.

CCEA 的 Pre-U 计算机科学课程通常在两年内包含四个单元，融合理论知识与实际编程技能。AS 单元包括计算机原理入门和一个编程项目，而 A2 单元则深入探讨高级计算机系统以及一个重要的独立计算项目。

Understanding the assessment weightings early on helps you allocate study time effectively. AS units often contribute 40% to the final grade, with A2 making up the remaining 60%, emphasising the importance of sustained effort throughout the course.

尽早了解各部分的评分权重有助于你有效分配学习时间。AS 单元通常占总成绩的 40%，A2 则占剩余的 60%，这凸显了整个课程中持续努力的重要性。

---

2. Computational Thinking and Problem Solving | 计算思维与问题解决

Computational thinking forms the backbone of the course, encompassing decomposition, pattern recognition, abstraction, and algorithm design. Before diving into code, practice breaking complex problems into smaller, manageable parts and identifying similarities in different scenarios.

计算思维是本课程的基石，涵盖问题分解、模式识别、抽象化和算法设计。在投入编程之前，请练习将复杂问题分解为更小、可处理的子问题，并在不同情境中识别相似之处。

Abstraction involves focusing on essential details while ignoring irrelevant ones, a skill you can sharpen by summarising real-world processes into flowcharts or pseudocode. For instance, modelling a library lending system without worrying about specific book titles is a classic abstraction exercise.

抽象化意味着关注关键细节而忽略无关信息，你可以通过将现实世界的过程总结为流程图或伪代码来打磨这一技能。例如，在不纠结具体书名的情况下为图书馆借阅系统建模，便是一个经典的抽象化练习。

---

3. Programming Fundamentals and Language Choice | 编程基础与语言选择

CCEA Pre-U courses often support languages such as Python, Java, or C#. Python is widely recommended for beginners due to its clear syntax, but your school may opt for another. Familiarise yourself with fundamental concepts: variables, data types, control structures (if-else, loops), functions, and basic input/output.

CCEA Pre-U 课程通常支持 Python、Java 或 C# 等编程语言。Python 因其清晰的语法而被广泛推荐给初学者，但你的学校可能选择其他语言。请熟悉基本概念：变量、数据类型、控制结构（if-else、循环）、函数以及基本的输入输出。

Practice writing short programs that solve mathematical problems or manipulate strings. Even simple tasks, such as calculating factorials or checking for palindromes, reinforce logical thinking and debugging skills that are vital for the AS programming project.

练习编写解决数学问题或操作字符串的简短程序。即使是像计算阶乘或检查回文这样的简单任务，也能强化逻辑思维和调试能力，这对 AS 编程项目至关重要。

Key programming constructs to master early are:

• Sequence, selection, and iteration

  顺序、选择和迭代

• Lists and arrays for storing multiple values

  用于存储多个值的列表和数组

• Modular programming with functions and procedures

  使用函数和过程进行模块化编程

---

4. Data Structures: The Building Blocks | 数据结构：构建块

Data structures organise and store data efficiently. Pre-U expects you to understand arrays, records, lists, stacks, queues, and perhaps linked lists. Start by visualising how arrays store elements in contiguous memory and how stacks follow LIFO (Last In, First Out) order.

数据结构能高效地组织和存储数据。Pre-U 期望你理解数组、记录、列表、栈、队列，或许还有链表。你可以先从可视化数组如何在连续内存中存储元素，以及栈如何遵循 LIFO（后进先出）原则开始。

Implement a stack using an array in your chosen language to appreciate its push and pop operations. Likewise, modelling a print queue demonstrates how a queue operates on a FIFO (First In, First Out) basis. These practical exercises bridge theory and application.

用你选择的语言通过数组实现一个栈，体会其压入和弹出操作。类似地，为打印队列建模可以展示队列如何基于 FIFO（先进先出）原则运作。这些实践练习能衔接理论与应用。

---

5. Algorithm Design and Analysis | 算法设计与分析

Algorithms are step-by-step procedures for solving problems, and you will study standard algorithms for searching (linear, binary) and sorting (bubble, insertion, merge). During the summer, try tracing these algorithms on paper with small datasets to understand their mechanics and complexity.

算法是解决问题的分步过程，你将学习标准的搜索算法（线性、二分）和排序算法（冒泡、插入、归并）。在暑期，尝试在小数据集上用纸笔追踪这些算法，以理解其机制和复杂度。

Big O notation is introduced informally at Pre-U level to compare algorithm efficiency. For example, binary search runs in O(log n) time, which is significantly faster than linear search’s O(n) for large datasets. Familiarity with this notation now will ease later formal analysis.

Pre-U 阶段会非正式地引入大 O 表示法来比较算法效率。例如，二分搜索的时间复杂度为 O(log n)，对于大数据集而言，远快于线性搜索的 O(n)。现在熟悉这种表示法将为日后的正式分析铺平道路。

A simple comparison of common algorithms:

Algorithm	Best Case	Worst Case	中文
Linear Search	O(1)	O(n)	线性搜索
Binary Search	O(1)	O(log n)	二分搜索
Bubble Sort	O(n)	O(n²)	冒泡排序
Merge Sort	O(n log n)	O(n log n)	归并排序

---

6. Computer Systems and Architecture | 计算机系统与体系结构

This topic covers the internal workings of a computer, including the CPU, memory, and von Neumann architecture. You should understand the fetch-decode-execute cycle and the roles of the control unit, ALU, and registers such as the program counter and accumulator.

本专题涵盖计算机的内部工作原理

Published by TutorHao | Pre-U Computer Science Revision Series | aleveler.com

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