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

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

Welcome to your summer bridging programme for AQA Pre-U Computer Science. This course bridges the gap between GCSE knowledge and the depth of Pre-U, providing a comprehensive overview of the syllabus while honing your computational thinking and programming skills. Whether you are looking to consolidate fundamentals or explore advanced topics, this guide will set you on the path to success.

欢迎参加 AQA Pre-U 计算机科学暑期衔接课程。这门课旨在弥合 GCSE 知识与 Pre-U 深度之间的差距，全面概述大纲内容，同时锻炼你的计算思维和编程技能。无论你是想巩固基础还是探索进阶主题，本指南都将为你铺就成功之路。

---

1. Understanding the Pre-U AQA Computer Science Syllabus | 了解 Pre-U AQA 计算机科学大纲

The AQA Pre-U Computer Science qualification comprises two written papers and a substantial programming project. Paper 1 (Computer Systems) covers hardware, networking, data representation, and ethical issues. Paper 2 (Algorithms and Programming) tests computational thinking, algorithm design, and programming concepts. The project allows you to develop a real-world software solution, demonstrating independent research and development skills. Familiarising yourself with this structure now will help you allocate your summer study effectively.

AQA Pre-U 计算机科学资格包含两份笔试和一个大型编程项目。试卷一（计算机系统）涵盖硬件、网络、数据表示和伦理问题；试卷二（算法与编程）考查计算思维、算法设计和编程概念。项目部分让你开发真实世界的软件解决方案，展现独立研究与开发能力。现在熟悉这一结构有助于你高效分配暑期学习时间。

---

2. Bridging the Gap from GCSE to Pre-U | 从 GCSE 到 Pre-U 的衔接

If you have studied GCSE Computer Science, you will notice a significant step up in both breadth and depth. Pre-U expects you to handle complex data structures, formal algorithm notation, and low-level system details such as floating-point normalisation and the TCP/IP stack. Revisiting your GCSE knowledge—binary conversions, Boolean logic, basic Python—will prevent gaps from widening. Use the summer to strengthen these foundations through mini-quizzes and practical exercises.

如果你学过 GCSE 计算机科学，会发现 Pre-U 在广度和深度上都有明显提升。Pre-U 要求你处理复杂的数据结构、形式化的算法记法以及底层系统细节，如浮点数规范化和 TCP/IP 协议栈。重温 GCSE 知识——二进制转换、布尔逻辑、基础 Python——可以防止差距扩大。利用暑期通过小测验和实操练习巩固这些基础。

---

3. Fundamentals of Algorithms and Pseudocode | 算法与伪代码基础

Algorithms are at the heart of computational problem solving. You must learn to express solutions in AQA-style pseudocode, which includes sequence, selection (IF…ELSE…ENDIF), iteration (FOR…ENDFOR, WHILE…ENDWHILE), and subroutines. For example, a linear search algorithm can be written as:

算法是计算问题解决的核心。你必须学会用 AQA 风格的伪代码表达解决方案，包括顺序、选择（IF…ELSE…ENDIF）、迭代（FOR…ENDFOR, WHILE…ENDWHILE）以及子程序。例如，线性搜索算法可以写为：

PROCEDURE linearSearch(list, target)
  FOR i ← 0 TO LEN(list)-1
    IF list[i] = target THEN
      OUTPUT i
      ENDPROCEDURE
    ENDIF
  ENDFOR
  OUTPUT -1
ENDPROCEDURE

Practising pseudocode regularly helps you think logically before touching a keyboard. Consider tracing code with trace tables to verify your understanding of loops and conditionals.

经常练习伪代码有助于在编写代码前进行逻辑思考。尝试使用跟踪表追踪代码，验证你对循环和条件的理解。

---

4. Exploring Data Structures | 探索数据结构

Pre-U introduces static and dynamic arrays, lists, stacks, queues, records, and files. Each structure has distinct behaviour: a stack follows Last In, First Out (LIFO) and suits undo mechanisms; a queue is First In, First Out (FIFO) and models printer spooling. In Python, you can simulate a stack using a list with .append() and .pop() methods. Experiment with implementing a linked list or building a priority queue to deepen your conceptual understanding.

Pre-U 介绍了静态与动态数组、列表、栈、队列、记录和文件。每种结构都有独特行为：栈遵循后进先出 (LIFO)，适用于撤销机制；队列遵循先进先出 (FIFO)，可模拟打印假脱机。在 Python 中，你可以使用列表的 .append() 和 .pop() 方法模拟栈。尝试实现链表或构建优先队列，以加深概念理解。

---

5. Programming Paradigms and Coding Practice | 编程范式与编码实践

You are expected to be comfortable with both procedural and object-oriented programming (OOP). Understand encapsulation, inheritance, and polymorphism, and apply them in small projects. For instance, design a library system with Book and Member classes. Additionally, explore functional programming concepts such as map, filter, and reduce to handle data gracefully. Summer coding challenges on platforms like Project Euler can sharpen your problem-solving skills.

你需要熟练掌握面向过程编程和面向对象编程 (OOP)。理解封装、继承和多态，并将它们应用到小项目中。例如，设计一个包含 Book 和 Member 类的图书系统。此外，探索函数式编程概念，如 map、filter 和 reduce，以优雅地处理数据。暑期在 Project Euler 等平台上的编程挑战可以磨练你的问题解决能力。

---

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

Paper 1 demands knowledge of the Von Neumann architecture, the CPU components (CU, ALU, registers), and the fetch-decode-execute cycle. You should also compare RAM, ROM, cache, and virtual memory, along with secondary storage (magnetic, optical, solid-state). Draw a detailed diagram of the processor and label buses (data, address, control). Using online CPU simulators allows you to watch instruction execution step by step, making abstract concepts tangible.

试卷一要求掌握冯·诺依曼架构、CPU 组件（控制单元、算术逻辑单元、寄存器）以及取指-解码-执行周期。你还应比较 RAM、ROM、缓存和虚拟内存，以及辅助存储（磁、光、固态）。绘制详细的处理器框图并标注总线（数据、地址、控制）。使用在线 CPU 模拟器逐步观察指令执行，使抽象概念变得具体。

---

7. Data Representation | 数据表示

Binary, hexadecimal, and denary conversions are fundamental, as are two’s complement for negative integers and floating-point normalisation. You must also represent characters (ASCII, Unicode), images (pixel resolution, colour depth), and sound (sampling rate, bit depth). Boolean algebra uses logic gates (AND, OR, NOT) with truth tables and simplification using identities or Karnaugh maps. Practice by converting the denary number 27 into 8-bit binary (00011011) and its two’s complement negative (-27) as 11100101.

二进制、十六进制和十进制转换是基础，负整数的补码表示和浮点数规范化同样重要。你还需表示字符（ASCII、Unicode）、图像（像素分辨率、色彩深度）和声音（采样率、位深度）。布尔代数使用逻辑门（与、或、非）和真值表，并用恒等式或卡诺图化简。练习将十进制数 27 转换为 8 位二进制 (00011011)，其补码负数表示为 11100101。

---

8. Networking Basics | 网络基础

Networking topics include topologies (star, bus, mesh), the TCP/IP model, and common protocols (HTTP, HTTPS, FTP, SMTP, POP3). Understand packet switching, MAC and IP addressing, and the function of routers, switches, and gateways. Security threats such as malware, phishing, and denial-of-service attacks, along with countermeasures like firewalls and encryption, are frequently examined. Map out a home network and trace the steps when a browser fetches a webpage, noting the protocols at each layer.

网络主题包括拓扑（星形、总线、网状）、TCP/IP 模型以及常见协议（HTTP、HTTPS、FTP、SMTP、POP3）。理解分组交换、MAC 与 IP 寻址以及路由器、交换机和网关的功能。安全威胁如恶意软件、网络钓鱼和拒绝服务攻击，以及防火墙和加密等应对措施，都是常考内容。绘制家庭网络图，追踪浏览器获取网页时的步骤，并标注各层协议。

---

9. Databases and SQL | 数据库与 SQL

The relational model, entity-relationship diagrams, and normalisation up to third normal form (3NF) form the theoretical core. Practical SQL skills include SELECT, FROM, WHERE, ORDER BY, GROUP BY, and aggregate functions (COUNT, SUM, AVG). Subqueries and JOIN operations often appear in exam scenarios. Set up a simple database using SQLite and create tables for a school timetable, then write queries to list teachers and their classes, which will build fluency in data manipulation.

关系模型、实体关系图和达到第三范式 (3NF) 的规范化构成了理论核心。实际 SQL 技能包括 SELECT、FROM、WHERE、ORDER BY、GROUP BY 以及聚合函数（COUNT、SUM、AVG）。子查询和 JOIN 操作经常出现在考题中。使用 SQLite 建一个简单数据库，创建学校课程表，然后编写查询列出教师及其班级，从而培养数据操作的熟练度。

---

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

Computational thinking involves decomposition, pattern recognition, abstraction, and algorithm design. Apply these to everyday challenges and exam-style scenarios. For example, designing a car park management system requires you to abstract vehicles, spaces, and payment into data fields, then devise algorithms for entry and exit. Writing an abstraction summary before coding improves your design process and prepares you for the paper where you might be asked to sketch solutions.

计算思维包括分解、模式识别、抽象和算法设计。将这些应用于日常挑战和考试风格的情景。例如，设计停车场管理系统需要你将车辆、车位和支付抽象为数据字段，然后设计进出算法。编码前先写抽象摘要可以改善设计过程，并为需要描绘解决方案的试卷做好准备。

---

11. Ethics, Legal and Moral Implications | 伦理、法律与道德影响

Computing carries ethical and legal responsibilities, covering data protection (GDPR, Data Protection Act), computer misuse, intellectual property (copyright, patents, open source), and the digital divide. You should be able to evaluate the societal impact of technologies like AI, automation, and social media. Practise building balanced arguments by writing short essays or engaging in debates, which will equip you for the extended discussion questions in Paper 1.

计算技术伴随伦理和法律责任，涉及数据保护（GDPR、《数据保护法》）、计算机滥用、知识产权（版权、专利、开源）和数字鸿沟。你应能够评估人工智能、自动化和社交媒体等技术的社会影响。通过写短文或参与辩论练习构建均衡的论点，为试卷一中的扩展讨论题做好准备。

---

12. Effective Summer Study Plan | 高效暑期学习计划

Create a weekly schedule that balances theory review, programming practice, and project ideation. Use the specification checklist to track progress and identify weak areas. Alternate between reading textbooks, solving past paper questions, and building mini-projects. Joining an online study group helps maintain motivation. Finally, keep a digital notebook of key terms, command words, and common mistakes. With consistent effort, you will enter your Pre-U course with confidence and a solid foundation.

制定一份周计划，平衡理论学习、编程实践和项目构思。利用大纲清单跟踪进度并找出薄弱环节。交替阅读教材、解答历年真题和构建小型项目。加入在线学习小组有助于保持动力。最后，维护一本数字笔记，记录关键术语、指令词和常见错误。通过持续努力，你将带着信心和坚实基础进入 Pre-U 课程。

---

Published by TutorHao | Computer Science Revision Series | aleveler.com

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