📚 Year 10 Edexcel Computer Science Transition Guide | Year 10 Edexcel 计算机科学升学衔接指南
Year 10 marks a pivotal transition in your computing journey. It is the year where you start building the deep conceptual understanding and practical coding skills required for the Edexcel GCSE (9-1) Computer Science examination. This guide outlines the key topics, study strategies, and mindset shifts that will help you bridge the gap between introductory computing and the demands of a rigorous GCSE course, ensuring you make a confident start and maintain momentum throughout the year.
十年级是你计算机学习道路上一个关键的衔接点。在这一年，你将开始建立爱德思 GCSE（9-1）计算机科学考试所需的深层概念理解和实践编程技能。本指南概述了核心主题、学习策略和思维转变，帮助你从入门级的计算机知识平稳过渡到严格的 GCSE 课程要求，确保你自信起步并全年保持良好势头。
1. Understanding the Edexcel Computer Science Course | 了解 Edexcel 计算机科学课程
The Pearson Edexcel GCSE (9-1) Computer Science qualification is split into two components. Component 1: Principles of Computer Science is a written exam worth 50% of the total marks, covering theory topics such as data representation, hardware, networks, and ethical issues. Component 2: Application of Computational Thinking is an on-screen exam, also worth 50%, where you will write, test, and debug Python code to solve problems. Familiarising yourself with this structure early helps you allocate revision time proportionally between theory and practical coding.
培生爱德思 GCSE（9-1）计算机科学资格课程分为两个部分。第一部分“计算机科学原理”是笔试，占总分的 50%，涵盖数据表示、硬件、网络和伦理问题等理论主题。第二部分“计算思维的应用”是上机考试，同样占 50%，要求你使用 Python 编写、测试和调试代码来解决问题。尽早熟悉这一结构有助于你在理论和实践编程之间合理分配复习时间。
The Year 10 curriculum typically covers foundational concepts that appear in both components, such as binary arithmetic, system architecture, basic Python programming, and algorithm design. Your school may sequence these topics differently, but mastering them in Year 10 gives you a head start for the more advanced Year 11 content, like Boolean logic and complex data structures.
十年级的课程通常涵盖两个组成部分共有的基础概念，如二进制运算、系统架构、Python 基础编程和算法设计。各校安排这些主题的顺序可能不同，但在十年级就扎实掌握它们，能让你在十一年级学习布尔逻辑和复杂数据结构等更深入的内容时领先一步。
2. Computational Thinking Fundamentals | 计算思维基础
Computational thinking is the backbone of the course. It involves four cornerstones: decomposition (breaking a problem into smaller parts), pattern recognition (spotting similarities to past problems), abstraction (focusing on the key details while hiding unnecessary complexity), and algorithm design (creating a step-by-step solution). These techniques are assessed not only in Component 2 coding tasks but also in Component 1 theory questions where you may be asked to describe how a problem can be solved computationally.
计算思维是本课程的支柱。它包含四大基石：分解（将问题拆分为更小的部分）、模式识别（发现与过往问题的相似之处）、抽象（专注于关键细节、隐藏不必要的复杂性）以及算法设计（创建逐步解决方案）。这些方法不仅在第二部分编程任务中受到评估，在第一部分理论题中也常要求你描述如何用计算方法解决一个问题。
To strengthen your computational thinking, practise dissecting everyday processes—like organising a school trip or sorting a playlist. Write down the logical steps, spot repetitions, and remove irrelevant information. This habit will improve your pseudocode writing and help you design more efficient programs under exam pressure.
要加强计算思维，可以练习剖析日常过程——比如组织一次学校旅行或对播放列表排序。记录下逻辑步骤，找出重复之处，并去掉无关信息。这一习惯会提升你编写伪代码的能力，帮助你在考试压力下设计出更高效的程序。
3. Data Representation: Binary and Beyond | 数据表示：二进制及其扩展
Understanding how computers represent numbers, text, images, and sound is essential. You will work with binary (base-2), denary (base-10), and hexadecimal (base-16) number systems. A binary number like 1101₂ is calculated as (1×2³)+(1×2²)+(0×2¹)+(1×2⁰) = 8+4+0+1 = 13₁₀, which is D₁₆ in hex. Converting between these bases quickly and accurately is a skill that pays dividends in multiple exam topics.
理解计算机如何表示数字、文本、图像和声音至关重要。你会接触到二进制（基数为 2）、十进制（基数为 10）和十六进制（基数为 16）数字系统。像 1101₂ 这样的二进制数，其计算方式为 (1×2³)+(1×2²)+(0×2¹)+(1×2⁰) = 8+4+0+1 = 13₁₀，也就是十六进制的 D₁₆。快速而准确地在这几种进制之间转换，是一项能在多个考试主题中带来回报的技能。
Character encoding schemes (ASCII and Unicode) allow computers to store text. Image representation relies on pixels, bitmaps, resolution, and colour depth, while sound is stored by sampling an analogue wave at a specific sample rate and bit depth. File size calculations frequently appear in exams: the image file size formula is width (pixels) × height (pixels) × colour depth (bits). You should also be familiar with units of storage: bit, nibble, byte, kilobyte, megabyte, and beyond.
字符编码方案（ASCII 和 Unicode）使计算机能够存储文本。图像表示依赖于像素、位图、分辨率和色深，而声音则是通过以特定采样率和位深度对模拟波形采样来存储的。文件大小计算常出现在考试中：图像文件大小公式为宽度（像素）× 高度（像素）× 色深（位）。你还应该熟悉存储单位：位、半字节、字节、千字节、兆字节等。
4. Hardware and System Architecture | 硬件与系统架构
A solid grasp of the von Neumann architecture is required. The CPU contains the arithmetic logic unit (ALU), control unit (CU), and several registers—most notably the memory address register (MAR), memory data register (MDR), program counter (PC), and accumulator. The fetch-decode-execute cycle runs continuously: the address in the PC is copied to the MAR, the instruction is fetched into the MDR, it is decoded by the CU, and then executed, often involving the ALU. This cycle underpins all program execution.
你需要扎实掌握冯·诺依曼体系结构。CPU 包含算术逻辑单元（ALU）、控制单元（CU）以及多个寄存器——最重要的有内存地址寄存器（MAR）、内存数据寄存器（MDR）、程序计数器（PC）和累加器。“取指-译码-执行”周期持续运行：PC 中的地址被复制到 MAR，指令被取入 MDR，由 CU 译码，然后执行（通常会用到 ALU）。这一周期是所有程序执行的基础。
You must also differentiate between primary memory (RAM is volatile, ROM is non-volatile) and secondary storage devices (magnetic hard disks, optical discs, solid-state drives). Understand that cache memory is extremely fast and stores frequently used instructions. Embedded systems, such as those in washing machines or engine control units, are dedicated computers with limited resources—knowing their characteristics helps in systems design questions.
你还必须区分主存储器（RAM 是易失性的，ROM 是非易失性的）和辅助存储设备（磁性硬盘、光盘、固态硬盘）。要了解高速缓存极其快速，用于存储常用指令。嵌入式系统（如洗衣机或引擎控制单元中的系统）是资源有限的专用计算机，了解其特征有助于回答系统设计问题。
5. Networks and Communication | 网络与通信
Networks are classified as LAN (local area network) or WAN (wide area network), depending on their geographical spread. You will study network topologies—star, mesh, and bus—and evaluate their advantages and disadvantages in terms of reliability, cost, and scalability. The TCP/IP four-layer model (application, transport, internet, link) is a foundational concept for understanding how data is transmitted over the internet.
网络根据其地理覆盖范围分为局域网（LAN）和广域网（WAN）。你将学习星形、网状和总线等网络拓扑结构，并从可靠性、成本和可扩展性方面评估它们的优缺点。TCP/IP 四层模型（应用层、传输层、网络层、链路层）是理解数据如何在互联网上传输的基础概念。
Key protocols include HTTP/HTTPS for web browsing, FTP for file transfers, SMTP for sending emails, and TCP/IP for reliable data transport. Packet switching is the method used: data is split into packets, each with a header containing source and destination addresses, and they are reassembled at the receiving end. Understanding client-server and peer-to-peer models helps you compare how resources are shared on a network.
关键协议包括用于网页浏览的 HTTP/HTTPS、用于文件传输的 FTP、用于发送电子邮件的 SMTP，以及用于可靠数据传输的 TCP/IP。分组交换是所使用的方法：数据被拆分为数据包，每个包都有一个包含源地址和目标地址的头部，然后在接收端重新组装。理解客户机-服务器模型和对等网络模型有助于你比较网络上共享资源的方式。
6. Cybersecurity Essentials | 网络安全要点
Cybersecurity protects data, networks, and systems from attacks. Common threats include malware (viruses that replicate, worms that self-propagate, trojans disguised as legitimate software), phishing (social engineering to trick users into revealing credentials), brute-force attacks that guess passwords, and denial of service (DoS) attacks that overwhelm a server. You should be able to describe both the threat and the countermeasure for each.
网络安全保护数据、网络与系统免受攻击。常见威胁包括恶意软件（会自我复制的病毒、自行传播的蠕虫、伪装成合法软件的特洛伊木马）、网络钓鱼（利用社会工程学诱骗用户泄露凭据）、通过猜解密码的暴力攻击，以及使服务器不堪重负的拒绝服务攻击（DoS）。你应该能够描述每种威胁及其对应的应对措施。
Defensive strategies involve a multi-layered approach: firewalls to filter traffic, encryption to scramble data (both symmetric and asymmetric), regular software patches, strong password policies, two-factor authentication, and penetration testing to identify vulnerabilities. You may be asked to encrypt and decrypt short messages using a Caesar cipher with a given shift, which illustrates basic substitution encryption.
防御策略采用多层防护方法：用防火墙过滤流量、用加密技术扰乱数据（包括对称加密和非对称加密）、定期安装软件补丁、实施强密码策略、进行双因素身份认证，以及通过渗透测试发现漏洞。你可能会被要求使用给定移位数的凯撒密码加解密短消息，这展现了基本的替代加密原理。
7. Programming Fundamentals | 编程基础
Python is the mandated language for the on-screen Component 2 exam. You must be fluent in core syntax: declaring variables, using appropriate data types (int, float, str, bool), handling input() and print() for user interaction, and using arithmetic operators (+, -, *, /, //, %) and comparison operators (==, !=, >, <, >=, <=). Proper indentation is syntactically required in Python to define code blocks.
Python 是第二部分上机考试的指定语言。你必须熟练掌握核心语法：声明变量，使用合适的数据类型（整型、浮点型、字符串型、布尔型），通过 input() 和 print() 进行用户交互，并使用算术运算符（+、-、*、/、//、%）和比较运算符（==、!=、>、<、>=、<=）。在 Python 中，必须使用正确的缩进来定义代码块。
Control flow structures—if/elif/else selection and for/while loops—are fundamental. Lists (arrays) and two-dimensional lists allow you to store collections of data. File handling operations (open, read, write, close) will be tested. Build confidence by writing small programs such as a number guessing game, a temperature converter, or a quiz that reads questions from a text file.
控制流结构——if/elif/else 选择结构和 for/while 循环——是基础内容。列表（数组）和二维列表使你能够存储数据集合。文件处理操作（打开、读取、写入、关闭）也在考试范围内。通过编写小程序来建立信心，例如数字猜谜游戏、温度转换器，或从文本文件读取问题的测验程序。
8. Algorithms and Problem Solving | 算法与问题求解
Algorithms are expressed using flowcharts or pseudocode. You need to know standard searching and sorting algorithms: linear search (checking each element in order), binary search (works on sorted lists by halving the search interval), bubble sort (repeatedly swapping adjacent out-of-order elements), and merge sort (divide and conquer). Understanding their efficiencies is crucial: binary search has a time complexity of O(log n) while linear search is O(n).
算法通过流程图或伪代码来表示。你需要了解标准的搜索和排序算法：线性搜索（按顺序检查每个元素）、二分搜索（在有序列表中通过不断减半搜索区间来工作）、冒泡排序（反复交换相邻逆序元素）和归并排序（分治法）。理解它们的效率至关重要：二分搜索的时间复杂度为 O(log n)，而线性搜索为 O(n)。
Tracing algorithms using trace tables is a key exam skill. You will be given a piece of pseudocode or Python code and asked to complete a trace table showing the values of variables at each step. Practise with loops and nested conditionals. Remember that an algorithm’s output depends on the exact sequence of operations; careful step-by-step recording prevents careless mistakes.
使用追踪表（trace table）追踪算法是一项关键的考试技能。你会拿到一段伪代码或 Python 代码，并被要求填写追踪表，显示每一步变量值的演变。针对循环和嵌套条件语句多加练习。请记住，算法的输出取决于精确的操作顺序；仔细逐步记录可以避免粗心错误。
9. Logic Gates and Boolean Logic | 逻辑门与布尔逻辑
Logic gates (AND,
Published by TutorHao | Year 10 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导