📚 Pre-U Edexcel Computer Science: Core Concepts Review | 核心知识点梳理
The Pre-U Edexcel Computer Science course challenges students to develop a deep understanding of computing principles, from fundamental programming to complex systems. This review distills the core knowledge areas required for success, covering computational thinking, programming paradigms, data representation, algorithms, computer architecture, networks, databases, security, and societal impact. It serves as a guide to reinforce key concepts and connect theory with practical application.
Pre-U Edexcel 计算机科学课程要求学生深入理解计算原理，从基本编程到复杂系统。本文梳理了成功所需的核心知识领域，涵盖计算思维、编程范式、数据表示、算法、计算机体系结构、网络、数据库、安全和社会影响。旨在帮助学生巩固关键概念，并将理论与实践联系起来。
1. Computational Thinking and Problem Solving | 计算思维与问题解决
Computational thinking is the foundation of all problem-solving in computer science. It involves decomposition, breaking a complex problem into smaller, manageable parts. For example, building a chess game can be decomposed into modules for the board, piece movements, and win condition checks.
计算思维是计算机科学所有问题解决的基础。它包括分解，将复杂问题拆分为更小、可管理的部分。例如，构建国际象棋游戏可分解为棋盘模块、棋子移动模块和胜负判定模块。
Pattern recognition identifies similarities between problems to reuse solutions. Abstraction then focuses on essential features while ignoring irrelevant details, such as modelling a ‘Student’ with name and ID, leaving out height or hair colour. These steps lead to algorithm design, a precise step-by-step solution.
模式识别找出问题间的相似性以重用解决方案。抽象化则聚焦于本质特征，忽略无关细节，例如用 ‘Student’ 模型仅保留姓名和学号，忽略身高发色。这些步骤最终导向算法设计，即精确的分步求解方案。
2. Programming Fundamentals | 编程基础
Programming starts with understanding data types: integer, float, character, string, and Boolean. Variables store values, and constants hold data that cannot change during execution. Operators (arithmetic, relational, logical) build expressions, while assignment stores results.
编程始于理解数据类型：整型、浮点、字符、字符串和布尔型。变量存储值，常量保存执行期间不可变的数据。运算符（算术、关系、逻辑）构建表达式，赋值则存储结果。
Control structures direct the flow: sequence executes line by line; selection (if-else, switch) makes decisions; iteration (for, while, do-while) repeats code blocks. Subroutines—functions that return a value and procedures that do not—use parameter passing (by value or by reference) and local/global scope to modularise code.
控制结构引导程序流向：顺序结构逐行执行；选择结构（if-else、switch）进行决策；迭代结构（for、while、do-while）重复代码块。子程序——有返回值的函数和无返回值的过程——通过参数传递（值传递或引用传递）和局部/全局作用域实现代码模块化。
3. Data Structures | 数据结构
Data structures organise data for efficient access and modification. Arrays store elements of the same type in contiguous memory, offering O(1) random access but fixed size. Lists, such as linked lists, allow dynamic sizing with O(n) search but O(1) insertion at head.
数据结构组织数据以实现高效访问与修改。数组在连续内存中存储同类型元素，提供 O(1) 随机访问但大小固定。链表等列表允许动态调整大小，搜索为 O(n)，但在头部插入为 O(1)。
Stacks follow LIFO (last-in-first-out), used in recursion and undo operations. Queues follow FIFO (first-in-first-out), essential for scheduling and buffers. Trees (binary, BST) enable hierarchical representation and logarithmic search time. Hash tables map keys to values via a hash function, aiming for O(1) average lookup. Dictionaries or records group related data under named fields.
栈遵循 LIFO（后进先出），用于递归和撤销操作。队列遵循 FIFO（先进先出），对调度和缓冲区至关重要。树（二叉树、二叉搜索树）实现层次化表示和对数级搜索时间。哈希表通过哈希函数映射键到值，平均查找为 O(1)。字典或记录则将相关数据归入命名字段。
4. Algorithms | 算法设计
Algorithms are step-by-step procedures for solving problems. Linear search checks each element sequentially with O(n) time. Binary search requires a sorted array, repeatedly dividing the search interval in half, achieving O(log n). Sorting algorithms vary: bubble sort repeatedly swaps adjacent elements (O(n²)), while merge sort divides and conquers in O(n log n).
算法是解决问题的分步过程。线性搜索顺序检查每个元素，时间复杂度 O(n)。二分搜索要求数组已排序，反复将搜索区间减半，达到 O(log n)。排序算法各异：冒泡排序反复交换相邻元素（O(n²)），而归并排序采用分治法，复杂度 O(n log n)。
Big-O notation expresses worst-case complexity, ignoring constants and lower-order terms. Recursion solves problems by breaking them into smaller identical subproblems, with a base case to stop. Graph algorithms, such as Dijkstra’s for shortest path, use priority queues and have real-world applications in navigation systems.
大 O 表示法表达最坏情况复杂度，忽略常数和低阶项。递归通过将问题分解为更小的相同子问题求解，并设有基准情形停止。图算法，例如 Dijkstra 最短路径算法，利用优先队列，在导航系统中有实际应用。
5. Computer Architecture and Hardware | 计算机体系结构与硬件
The Von Neumann architecture forms the basis of most computers, with a single shared memory for data and instructions. The CPU contains the Arithmetic Logic Unit (ALU) for calculations, the Control Unit (CU) for instruction coordination, and registers (PC, MAR, MDR, accumulator) for temporary storage.
冯·诺依曼架构是大多数计算机的基础，数据和指令共享同一内存。CPU 包含用于计算的算术逻辑单元 (ALU)、协调指令的控制单元 (CU) 以及用于暂存的寄存器（PC、MAR、MDR、累加器）。
The fetch-decode-execute cycle drives operation: the next instruction is fetched from memory, decoded by the CU, and executed using the ALU and registers. Addressing modes (immediate, direct, indirect) determine operand access. Memory hierarchy (registers → cache → RAM → secondary storage) balances speed and cost. Logic gates (AND, OR, NOT, NAND) form the building blocks of digital circuits.
取指-译码-执行周期驱动运行：下一条指令从内存取出，由 CU 译码，再利用 ALU 和寄存器执行。寻址模式（立即、直接、间接）决定操作数访问方式。存储层次（寄存器 → 缓存 → RAM → 辅助存储）平衡速度与成本。逻辑门（AND、OR、NOT、NAND）是数字电路的基本构建块。
6. Operating Systems and System Software | 操作系统与系统软件
An operating system (OS) manages hardware and provides a user interface. It handles process management (scheduling, multitasking), memory management (paging, virtual memory), file system organisation, and I/O operations. Common scheduling algorithms include round-robin, priority, and shortest-job-first.
操作系统管理硬件并提供用户接口。它处理进程管理（调度、多任务处理）、内存管理（分页、虚拟内存）、文件系统组织和 I/O 操作。常见调度算法包括轮转法、优先级法和最短作业优先法。
Interrupts allow the CPU to respond to events like I/O completion, enabling efficient multitasking. Utility software (disk defragmenter, antivirus) supports the OS. Translators—compilers, interpreters, and assemblers—convert high-level and assembly code to machine code. Virtual machines emulate hardware, allowing multiple OS instances to run concurrently.
中断使 CPU 能够响应 I/O 完成等事件，从而实现高效多任务处理。实用程序（磁盘碎片整理、防病毒）辅助操作系统。翻译器——编译器、解释器和汇编器——将高级语言和汇编语言转换为机器码。虚拟机模拟硬件，允许多个操作系统实例并发运行。
7. Computer Networks and the Internet | 计算机网络与互联网
Networks connect devices to share resources. The OSI model (7 layers) and TCP/IP model (4 layers) standardise communication. Key protocols include HTTP/HTTPS for web, FTP for file transfer, SMTP for email, TCP for reliable delivery, and IP for addressing and routing.
网络连接设备以共享资源。OSI 模型（7 层）和 TCP/IP 模型（4 层）标准化了通信。关键协议包括用于 Web 的 HTTP/HTTPS、文件传输的 FTP、电子邮件的 SMTP、可靠传输的 TCP 以及寻址与路由的 IP。
IP addresses (IPv4 and IPv6) identify devices, while DNS translates domain names to IPs. Subnetting divides networks into smaller logical segments. Networks can be client-server (centralised) or peer-to-peer (decentralised). Firewalls and intrusion detection systems (IDS) protect network boundaries, and encryption (e.g., TLS) secures data in transit.
IP 地址（IPv4 和 IPv6）标识设备，DNS 将域名转换为 IP。子网划分将网络分割为更小的逻辑段。网络可以是客户端-服务器（集中式）或对等（去中心化）模式。防火墙和入侵检测系统保护网络边界，加密（如 TLS）保护传输中的数据。
8. Databases and SQL | 数据库与 SQL
Relational databases store data in tables with rows (records) and columns (attributes). Keys ensure uniqueness: primary keys identify records uniquely, foreign keys create relationships. Entity-relationship diagrams (ERD) model entities, attributes, and their relationships (one-to-one, one-to-many, many-to-many).
关系数据库以行（记录）列（属性）组成的表存储数据。键确保唯一性：主键唯一标识记录，外键建立关系。实体关系图 (ERD) 建模实体、属性及其关系（一对一、一对多、多对多）。
Normalisation removes redundancy through progressive forms (1NF, 2NF, 3NF). SQL (Structured Query Language) manages and queries data. Core commands: SELECT with JOIN to combine tables, WHERE to filter, GROUP BY for aggregation, and INSERT, UPDATE, DELETE for data manipulation. Transactions follow ACID properties (Atomicity, Consistency, Isolation, Durability) to maintain integrity.
规范化通过递进式范式（1NF、2NF、3NF）消除冗余。SQL（结构化查询语言）管理和查询数据。核心命令：SELECT 结合 JOIN 连结表，WHERE 过滤，GROUP BY 聚合，INSERT、UPDATE、DELETE 操作数据。事务遵循 ACID 特性（原子性、一致性、隔离性、持久性）以保持完整性。
9. Information Security and Cybersecurity | 信息安全与网络安全
Security protects data and systems from unauthorised access, misuse, and attacks. Threats include malware (viruses, worms, ransomware), phishing, and denial-of-service (DoS) attacks. Encryption converts plaintext to ciphertext: symmetric uses the same key (e.g., AES), asymmetric uses public/private key pairs (e.g., RSA).
安全保护数据和系统免受未经授权访问、滥用和攻击。威胁包括恶意软件（病毒、蠕虫、勒索软件）、网络钓鱼和拒绝服务攻击。加密将明文转换为密文：对称加密使用相同密钥（如 AES），非对称加密使用公钥/私钥对（如 RSA）。
Hashing (e.g., SHA-256) ensures data integrity by producing a fixed-size digest. Digital signatures combine hashing and asymmetric encryption to verify authenticity and non-repudiation. Firewalls filter traffic; strong authentication (multi-factor) prevents unauthorised access. Social engineering exploits human psychology, making user education critical. Backup and disaster recovery plans ensure business continuity.
哈希（如 SHA-256）通过生成固定大小摘要确保数据完整性。数字签名结合哈希与非对称加密，验证真实性和不可否认性。防火墙过滤流量；强身份认证（多因素）防止未授权访问。社会工程利用人类心理，因此用户教育至关重要。备份和灾难恢复计划确保业务连续性。
10. Ethical, Legal, and Environmental Impacts | 伦理、法律与环境影响
Computing professionals must adhere to ethical codes, respecting privacy, intellectual property, and public interest. Legislation like GDPR regulates personal data collection, processing, and storage, granting rights to individuals. Copyright and patents protect software and algorithms, while licensing governs use and distribution.
计算机专业人员须遵守伦理准则，尊重隐私、知识产权和公共利益。GDPR 等法规规范个人数据的收集、处理和存储，赋予个人权利。版权和专利保护软件和算法，许可证则管理使用与分发。
The digital divide separates those with and without access to technology, prompting initiatives for affordable connectivity and digital literacy. E-waste from obsolete hardware poses environmental risks, requiring responsible recycling and green computing practices. Algorithmic bias and the proliferation of misinformation highlight the need for critical evaluation of technology’s societal role.
数字鸿沟使有技术访问权与无访问权的人群分化，促使出现可负担连接和数字素养的倡议。废弃硬件产生的电子废物带来环境风险，需要负责任地回收和绿色计算实践。算法偏见和错误信息泛滥突出需要审慎评估技术的社会角色。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导