📚 GCSE Edexcel Computer Science: Final Revision Summary | GCSE Edexcel 计算机：期末复习提纲
This revision guide covers the core topics of the Edexcel GCSE Computer Science (1CP2) specification. Use it to refresh your knowledge and identify weaker areas before the exam. Each section provides key points in both English and Chinese, helping you grasp concepts clearly and quickly.
本复习指南涵盖了 Edexcel GCSE 计算机科学 (1CP2) 考纲的核心主题。可用它来巩固知识、查找薄弱环节。每节以英中双语列出要点，帮助你清晰快速地掌握概念。
1. Computer Systems Overview | 计算机系统概述
The CPU (Central Processing Unit) executes instructions through the fetch-decode-execute cycle. Its performance depends on clock speed, number of cores, and cache size. Von Neumann architecture stores data and instructions in the same memory, using the control unit, arithmetic logic unit (ALU), registers (PC, MAR, MDR, ACC), and buses.
CPU 通过取指-解码-执行循环来运行指令。其性能取决于时钟速度、核心数量和缓存大小。冯·诺依曼架构将数据与指令存放在同一内存中，使用控制器、算术逻辑单元 (ALU)、寄存器 (PC、MAR、MDR、ACC) 和总线。
Primary memory includes RAM (volatile, holds programs and data in use) and ROM (non-volatile, stores firmware and boot instructions). Secondary storage can be magnetic (hard disk), optical (CD, DVD), or solid state (SSD, flash). Characteristics to compare are capacity, speed, portability, durability, and cost.
主存包括 RAM (易失性，存放运行中的程序和数据) 和 ROM (非易失性，存储固件和启动指令)。辅助存储可以是磁存储 (硬盘)、光存储 (CD、DVD) 或固态存储 (SSD、闪存)。比较时关注容量、速度、便携性、耐久性和成本。
Embedded systems are dedicated computers within larger devices (e.g., microwave, car engine control). They are often cheaper, more reliable, and consume less power but have limited functionality.
嵌入式系统是大型设备中的专用计算机 (如微波炉、汽车引擎控制)。它们通常更便宜、更可靠且功耗更低，但功能有限。
2. Data Representation | 数据表示
Computers use binary (base-2). Denary (base-10) numbers can be converted to binary and hexadecimal (base-16). Hex is shorter and easier for humans to read, using digits 0-9 and letters A-F. A single hex digit represents 4 bits (a nibble).
计算机使用二进制 (基数为2)。十进制数可转换为二进制和十六进制 (基数为16)。十六进制更短更易读，使用数字 0-9 和字母 A-F。每个十六进制位代表 4 个二进制位 (半个字节)。
Binary addition follows simple rules: 0+0=0, 0+1=1, 1+0=1, 1+1=0 carry 1. Overflow occurs when the result exceeds available bits, potentially causing errors in calculations.
二进制加法遵循简单规则：0+0=0、0+1=1、1+0=1、1+1=0 进位 1。当结果超出可用位数时发生溢出，可能导致计算错误。
Images are represented as bitmaps: a grid of pixels, each with a binary colour value. Image quality increases with higher resolution (more pixels) and colour depth (more bits per pixel). Sound is sampled at intervals; sample rate (Hz) and bit depth affect quality and file size. File size can be estimated using these formulas:
图像以位图表示：像素网格，每个像素带有一个二进制颜色值。分辨率和颜色深度越高，图像质量越好。声音以一定间隔采样；采样率 (Hz) 和采样位数影响质量和文件大小。文件大小可用以下公式估算：
Image file size = width × height × colour depth (bits)
Sound file size = sample rate × bit depth × duration (s) × channels
Characters are encoded using standards like ASCII (7-bit, 128 characters) and Unicode (up to 32-bit, covering nearly all scripts). Unicode solves the limitation of ASCII for global text.
字符使用 ASCII (7位，128个字符) 和 Unicode (最多32位，覆盖几乎所有文字) 等标准编码。Unicode 解决了 ASCII 无法处理全球文字的问题。
3. Networks and Protocols | 网络与协议
A network connects devices to share resources and data. LANs (Local Area Networks) cover a small area with privately owned infrastructure; WANs (Wide Area Networks) connect LANs over large distances using leased lines or the internet.
网络将设备连接起来以共享资源和数据。LAN 覆盖小范围，基础架构为私有；WAN 通过租用线路或互联网将远程 LAN 相连。
Common topologies include star (all nodes connect to a central switch, easy to manage but single point of failure) and mesh (full or partial, robust but expensive). The bus topology is rarely used today. Modern Ethernet networks often use a star topology with switches.
常见拓扑包括星型 (所有节点连接到中央交换机，易于管理但有单点故障) 和网状 (全互连或部分互连，鲁棒但昂贵)。总线拓扑现已少用。现代以太网通常采用交换式星型拓扑。
Protocols are sets of rules. Key examples: TCP/IP for transmitting data packets reliably, HTTP/HTTPS for web pages, FTP for file transfers, SMTP and IMAP for emails, and VoIP for voice calls. The 4-layer TCP/IP model (application, transport, internet, link) is often used instead of the 7-layer OSI model at this level.
协议是一组规则。关键示例：TCP/IP 用于可靠传输数据包，HTTP/HTTPS 用于网页，FTP 用于文件传输，SMTP 和 IMAP 用于电子邮件，VoIP 用于语音通话。在 GCSE 阶段常使用 TCP/IP 四层模型 (应用层、传输层、互联网层、链路层)。
Packet switching breaks data into packets, each containing source and destination addresses and a sequence number. Routers direct packets independently; they can take different paths and are reassembled at the destination. This is efficient but can cause latency.
包交换将数据拆分为数据包，每个包含源地址、目的地址和序号。路由器独立引导数据包，它们可走不同路径并在目的地重组。这种方式高效但可能引起延迟。
4. Cybersecurity Threats and Prevention | 网络安全威胁与预防
Malware includes viruses (attach to files, spread by user action), worms (self-replicate without user action), Trojan horses (disguised as legitimate software), spyware (monitors activity), and ransomware (encrypts files for ransom).
恶意软件包括病毒 (依附文件传播，需用户操作)、蠕虫 (无需用户操作自我复制)、特洛伊木马 (伪装成合法软件)、间谍软件 (监视活动) 和勒索软件 (加密文件以索赎)。
Social engineering tricks users into revealing confidential information. Phishing uses deceptive emails or websites; shoulder surfing watches someone type; blagging (pretexting) invents a scenario to obtain data.
社会工程学诱骗用户泄露机密信息。网络钓鱼使用欺骗性邮件或网站；肩窥是偷看他人输入；假冒身份骗取信息则是编造情景获取数据。
Network attacks: denial-of-service (DoS) overloads a server with traffic, preventing legitimate access. SQL injection inserts malicious SQL code into database queries to steal or destroy data. Brute-force attacks try many passwords automatically.
网络攻击：拒绝服务攻击 (DoS) 用流量压垮服务器，阻止合法访问。SQL 注入将恶意 SQL 代码插入数据库查询以窃取或破坏数据。暴力攻击自动尝试大量密码。
Prevention methods include anti-malware software, firewalls (filter incoming/outgoing traffic), strong passwords, two-factor authentication, user access levels, encryption (plaintext becomes ciphertext), penetration testing, and regular security updates.
防范方法包括反恶意软件、防火墙 (过滤进出流量)、强密码、双因素认证、用户访问权限级别、加密 (明文转密文)、渗透测试和定期安全更新。
5. Ethical, Legal, Cultural and Environmental Impact | 道德、法律、文化与环境影响
Key UK legislation: The Data Protection Act 2018 (controls how personal data is used), Computer Misuse Act 1990 (makes hacking, malware distribution illegal), Copyright, Designs and Patents Act 1988 (protects intellectual property), and Equality Act 2010 (ensures digital services are accessible).
英国主要法规：2018 年数据保护法 (管控个人数据使用)、1990 年计算机滥用法 (将黑客行为、传播恶意软件定为非法)、1988 年著作权、设计和专利法 (保护知识产权) 以及 2010 年平等法 (确保数字服务无障碍)。
Ethical concerns involve privacy (facial recognition, tracking), surveillance, and algorithmic bias. Cultural impacts include the digital divide (unequal access to technology) and globalisation of media. Environmental considerations focus on e-waste, energy consumption of data centres, and the benefits of paperless offices.
道德关切涉及隐私 (人脸识别、追踪)、监控和算法偏见。文化影响包括数字鸿沟 (技术获取不均) 和媒体全球化。环境方面关注电子废物、数据中心能耗以及无纸化办公的益处。
Open source vs proprietary software: open source allows access to source code, can be modified and redistributed, often free. Proprietary software restricts source code access, requires a licence, but comes with dedicated support.
开源与专有软件：开源允许访问源代码，可修改和重新分发，通常免费。专有软件限制源代码访问，需许可证，但提供专门支持。
6. Algorithms: Searching and Sorting | 算法：搜索与排序
Computational thinking uses decomposition (breaking problems down), pattern recognition, abstraction (ignoring unnecessary detail), and algorithmic design.
计算思维运用分解、模式识别、抽象 (忽略不必要细节) 和算法设计。
Searching algorithms: Linear search checks each item in order until the target is found; works on unsorted lists, O(n). Binary search repeatedly halves a sorted list by comparing the middle element; O(log n) but requires sorted data.
搜索算法：线性搜索按顺序逐个检查直到找到目标；可用于未排序列表，时间复杂度 O(n)。二分搜索反复将已排序列表折半，比较中间元素；时间复杂度 O(log n) 但需数据已排序。
Sorting algorithms: Bubble sort repeatedly steps through the list, compares adjacent pairs and swaps if out of order; O(n²). Merge sort uses divide-and-conquer: splits list into halves, recursively sorts, then merges; O(n log n). Insertion sort picks elements one by one and inserts them into the correct position in a sorted sublist; O(n²) but efficient for small or nearly sorted lists.
排序算法：冒泡排序反复遍历列表，比较相邻项并在顺序错误时交换；时间复杂度 O(n²)。归并排序采用分治法：将列表分成两半，递归排序后合并；时间复杂度 O(n log n)。插入排序逐个选取元素并将其插入已排序子列表的正确位置；时间复杂度 O(n²)，但对于小型或近排序列表效率较高。
Algorithms can be expressed as flowcharts or pseudocode. Trace tables help step through code to check logic and variable values.
算法可用流程图或伪代码表示。跟踪表有助于逐步执行代码，检查逻辑和变量值。
7. Programming Fundamentals | 编程基础
Data types: integer (whole numbers), real/float (decimal), Boolean (True/False), character, string (sequence of characters). Variables are named memory locations storing values that can change during execution. Constants are fixed values declared once.
数据类型：整型 (整数)、实型/浮点型 (小数)、布尔型 (真/假)、字符型和字符串 (字符序列)。变量是命名的内存位置，存储可在执行期间改变的值。常量是声明后不变的固定值。
Control structures: Sequence (lines run in order), selection (if-else, switch), and iteration (for, while, do-while). Count-controlled loops repeat a set number of times; condition-controlled loops continue while a condition is true.
控制结构：顺序 (逐行运行)、选择 (if-else、switch) 和迭代 (for、while、do-while)。计数控制循环重复固定次数；条件控制循环当条件为真时继续。
Arrays (lists) store multiple items under one name, accessed by index (usually starting at 0). Two-dimensional arrays are like tables. String manipulation includes concatenation, slicing, length, and character access.
数组 (列表) 在一个名称下存储多项，通过索引访问 (通常从 0 开始)。二维数组类似表格。字符串操作包括拼接、切片、求长度和字符访问。
Subroutines: procedures (do not return a value) and functions (return a value). Parameters pass data in; arguments are actual values. Local variables exist only inside a subroutine.
子程序：过程 (不返回值) 和函数 (返回值)。形参用于传入数据；实参是实际值。局部变量仅在子程序内部存在。
Testing: syntax errors break language rules, logic errors cause incorrect output, runtime errors occur during execution (e.g., division by zero). Test plans with normal, boundary, and erroneous data improve robustness.
测试：语法错误违反语言规则，逻辑错误导致错误输出，运行时错误在执行中发生 (如除零)。使用正常、边界和异常数据的测试计划可提高程序稳健性。
8. Boolean Logic and Truth Tables | 布尔逻辑与真值表
Logic gates operate on binary inputs. The main gates: NOT (outputs opposite), AND (outputs 1 only if both inputs are 1), OR (outputs 1 if at least one input is 1), and XOR (outputs 1 if inputs are different).
逻辑门对二进制输入进行运算。主要门电路：非门 (输出相反值)、与门 (仅当两个输入均为 1 时输出 1)、或门 (至少一个输入为 1 时输出 1) 和异或门 (输入不同时输出 1)。
Logic circuits combine gates. A truth table lists all possible input combinations and the resulting output. You must be able to draw circuits from Boolean expressions and vice versa.
逻辑电路由多个门组合而成。真值表列出所有可能的输入组合及对应输出。你必须能从布尔表达式绘制电路，反之亦然。
| A | B | AND | OR | XOR |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 |
Simplify Boolean expressions using laws like De Morgan’s: NOT(A AND B) = (NOT A) OR (NOT B). Logic diagrams using standard symbols (flat-ended AND, curved OR, triangle NOT) are essential.
使用德·摩根律等化简布尔表达式：NOT(A AND B) = (NOT A) OR (NOT B)。使用标准符号 (平端与门、曲线或门、三角形非门) 的逻辑图是必考内容。
9. Exam Technique and Key Revision Tips | 考试技巧与重点复习提示
Read questions carefully, especially for ‘state’, ‘describe’, ‘explain’, and ‘compare’ command words. For coding questions, check for off-by-one errors, correct indentation, and variable scope. Manage time: spend roughly 1 minute per mark.
仔细审题，尤其注意 ‘state’、’describe’、’explain’ 和 ‘compare’ 等指令词。编程题要检查 off-by-one 错误、正确缩进和变量作用域。合理分配时间：大致 1 分钟得 1 分。
Practice past papers under timed conditions. Create flashcards for protocols, legislation, and logic gates. Draw memory diagrams when tracing code. Always show your working in calculations (e.g., file size, binary conversions).
在计时条件下练习历年真题。制作协议、法规和逻辑门的记忆卡片。跟踪代码时可绘制内存图。计算题 (如文件大小、二进制转换) 务必展示过程。
Revise key definitions: algorithm, firewall, encryption, protocol, embedded system. Be able to compare storage types and network topologies using criteria like speed, reliability, cost. For the programming paper, review common patterns like input validation, linear search, and running totals.
复习关键定义：算法、防火墙、加密、协议、嵌入式系统。能够依据速度、可靠性、成本等标准比较存储类型和网络拓扑。针对编程试卷，回顾常见模式，如输入验证、线性搜索和累积求和。
Use TutorHao resources and topic quizzes to test yourself regularly. Identify weak areas and re-read summary notes before the final exam.
利用 TutorHao 资源和主题测验定期自测。在期末考试前找出薄弱环节，重读总结笔记。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导