📚 Core Knowledge for WJEC Pre-U Computer Science | WJEC Pre-U 计算机核心知识点梳理
The WJEC Pre-U Computer Science course challenges students to develop a deep understanding of the principles of computation, from the hardware level to high-level problem solving. Mastery requires a firm grasp of core topics spanning data representation, computer architecture, operating systems, programming paradigms, data structures, algorithms, networking, databases, systems development, and information security. This article distils the essential knowledge points to support effective revision and deeper learning.
WJEC Pre-U 计算机科学课程要求学生从硬件层面到高阶问题求解，深度理解计算原理。掌握这些知识需要牢固把握数据表示、计算机体系结构、操作系统、编程范式、数据结构、算法、网络、数据库、系统开发以及信息安全等核心主题。本文凝练了关键知识点，助力高效复习与深入学习。
1. Number Systems and Data Representation | 数制与数据表示
Computers represent all data as binary digits (bits). The decimal system uses base 10, binary uses base 2, and hexadecimal uses base 16 (digits 0–9 and A–F). Conversions between these bases are fundamental. For example, the binary number 1101₂ equals 13₁₀ and D₁₆.
计算机以二进制数字（比特）表示所有数据。十进制以 10 为基数，二进制以 2 为基数，十六进制以 16 为基数（数字 0–9 和 A–F）。这些进制之间的转换是基础。例如，二进制数 1101₂ 等于 13₁₀ 和 D₁₆。
Negative integers are often stored using two’s complement representation, where the most significant bit has a negative weight. For an 8-bit number, the range is -128 to +127. Floating-point numbers, typically using the IEEE 754 standard, store a sign, exponent, and mantissa to approximate real numbers. Characters are encoded using ASCII (7-bit) or Unicode (e.g., UTF-8) to support global scripts.
负整数常常使用二进制补码表示，其最高有效位具有负权重。对于 8 位数，取值范围为 -128 到 +127。浮点数通常采用 IEEE 754 标准，用符号、指数和尾数来近似表示实数。字符通过 ASCII（7 位）或 Unicode（如 UTF-8）进行编码，以支持全球文字。
Key conversions: binary ↔ denary ↔ hexadecimal; two’s complement negation (invert bits +1); floating-point normalisation.
关键转换：二进制 ↔ 十进制 ↔ 十六进制；补码求负（按位取反加一）；浮点数规格化。
2. Computer Architecture | 计算机体系结构
The Von Neumann architecture underpins most modern computers, featuring a control unit (CU), arithmetic logic unit (ALU), registers (such as the program counter, memory address register, memory data register, and accumulator), and a single shared memory for data and instructions. The fetch–decode–execute cycle describes how the processor retrieves an instruction, decodes it, and carries out the operation, repeating indefinitely.
冯·诺依曼架构是大多数现代计算机的基础，包含控制单元（CU）、算术逻辑单元（ALU）、寄存器（如程序计数器、内存地址寄存器、内存数据寄存器和累加器），以及用于数据和指令的单一共享存储器。取指—译码—执行周期描述了处理器如何取出一条指令、对其进行译码并执行操作，如此循环往复。
Factors affecting CPU performance include clock speed, number of cores, cache size and levels (L1, L2, L3), and word length. Pipelining improves throughput by overlapping instruction execution stages, though branch hazards can cause stalls. Harvard architecture, by contrast, uses separate memory for instructions and data, allowing simultaneous access and enhancing performance in embedded systems.
影响 CPU 性能的因素包括时钟速度、核心数量、缓存大小和层级（L1、L2、L3）以及字长。流水线技术通过重叠指令执行阶段来提高吞吐量，但分支冲突可能导致暂停。相比之下，哈佛架构为指令和数据使用独立存储器，允许同时访问，从而提升嵌入式系统的性能。
3. Operating Systems | 操作系统
An operating system (OS) manages hardware resources and provides services to application software. Core functions include process management (creation, scheduling, termination), memory management (allocation, paging, segmentation, virtual memory), file system management, device handling through drivers, and user interface provision (CLI or GUI).
操作系统管理硬件资源，并为应用软件提供服务。核心功能包括进程管理（创建、调度、终止）、内存管理（分配、分页、分段、虚拟内存）、文件系统管理、通过驱动程序处理设备以及提供用户接口（命令行或图形界面）。
Process scheduling algorithms such as first-come first-served (FCFS), shortest job first (SJF), round-robin (RR), and multi-level feedback queues aim to balance throughput, turnaround time, and responsiveness. Virtual memory uses disk space to simulate extra RAM, enabling the execution of larger programs but potentially causing thrashing if page swapping becomes excessive.
进程调度算法如先到先服务（FCFS）、最短作业优先（SJF）、时间片轮转（RR）以及多级反馈队列，旨在均衡吞吐量、周转时间和响应性。虚拟内存利用磁盘空间模拟额外的内存，允许运行更大的程序，但若页面交换过度则可能导致“抖动”。
4. Programming Paradigms and Languages | 编程范式与语言
Imperative/procedural programming (e.g., C, Pascal) focuses on sequences of commands and state changes. Object-oriented programming (OOP) organises code into classes and objects, emphasising encapsulation, inheritance, and polymorphism. Functional programming (e.g., Haskell) treats computation as evaluation of mathematical functions, avoiding side effects and mutable data, with first-class functions and recursion. Logic programming (e.g., Prolog) defines facts and rules to derive conclusions through inference.
命令式/过程式编程（如 C、Pascal）侧重于命令序列和状态改变。面向对象编程（OOP）将代码组织为类和对象，强调封装、继承和多态。函数式编程（如 Haskell）将计算视为数学函数的求值，避免副作用和可变状态，支持一等函数和递归。逻辑编程（如 Prolog）定义事实和规则，通过推理得出结论。
Programs can be translated via compilation (translating high-level code to machine code all at once, producing an executable) or interpretation (line-by-line translation). Hybrid approaches use bytecode and a virtual machine (e.g., Java). Understanding the trade-offs between performance and portability is essential.
程序可通过编译（一次性将高级代码翻译为机器码，生成可执行文件）或解释（逐行翻译）进行处理。混合方法使用字节码和虚拟机（如 Java）。理解性能与可移植性之间的权衡至关重要。
5. Data Structures | 数据结构
Efficient data organisation is critical for algorithm performance. Arrays provide contiguous storage with O(1) access but fixed size. Linked lists allow dynamic memory use but require sequential traversal. Stacks (LIFO) and queues (FIFO) are restricted-access structures widely used in recursion, expression evaluation, and scheduling. Trees (especially binary search trees) enable logarithmic search time if balanced. Hash tables use a hash function to map keys to indices, offering average O(1) lookup.
高效的数据组织对算法性能至关重要。数组提供连续存储和 O(1) 访问，但大小固定。链表支持动态内存使用，但需要顺序遍历。栈（后进先出）和队列（先进先出）是访问受限的结构，广泛用于递归、表达式求值和调度。树（尤其是二叉搜索树）在平衡时能实现对数级搜索时间。哈希表通过哈希函数将键映射到索引，提供平均 O(1) 的查找。
Abstract data types (ADTs) specify the behaviour of a data structure independently of its implementation. For example, a priority queue ADT can be implemented with a heap. Understanding when to use each structure based on time and space complexity is a key skill.
抽象数据类型（ADT）定义了数据结构的行为，与其具体实现无关。例如，优先队列 ADT 可以用堆来实现。根据时间与空间复杂度选择合适的结构是一项关键技能。
6. Algorithms and Complexity | 算法与复杂度
An algorithm is a finite sequence of well-defined steps to solve a problem. Searching algorithms include linear search (O(n)) and binary search (O(log n)), the latter requiring sorted data. Sorting algorithms range from simple quadratic methods like bubble sort (O(n²)) to more efficient divide-and-conquer methods such as merge sort and quicksort (both O(n log n) on average).
算法是求解问题的有限且定义明确的步骤序列。搜索算法包括线性搜索（O(n)）和二分搜索（O(log n)），后者要求数据已排序。排序算法从简单的二次方法如冒泡排序（O(n²)）到更高效的分治法如归并排序和快速排序（平均均为 O(n log n)）。
Algorithm complexity is analysed using Big O notation, which describes the upper bound of time or space as input size n grows. Common classes: O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ). Recursion is a technique where a function calls itself; it must have a base case to terminate. Computability theory introduces the limits of computation – Alan Turing’s universal machine and the halting problem demonstrate that some problems are undecidable.
算法复杂度使用大 O 符号进行分析，它描述了随着输入规模 n 的增长，时间或空间的上界。常见类别：O(1)、O(log n)、O(n)、O(n log n)、O(n²)、O(2ⁿ)。递归是一种函数调用自身的技术，必须有终止条件。可计算性理论引入了计算的局限——艾伦·图灵的通用机以及停机问题表明，有些问题是不可判定的。
7. Networking and the Internet | 网络与互联网
Computer networks are modelled with the OSI seven-layer model or the simpler TCP/IP four-layer model (application, transport, internet, network access). Protocols define rules for communication: IP handles logical addressing and routing, TCP provides reliable, connection-oriented delivery, while UDP offers connectionless, low-latency transmission. HTTP/HTTPS powers the web, and DNS translates domain names to IP addresses.
计算机网络可以用 OSI 七层模型或更简单的 TCP/IP 四层模型（应用层、传输层、互联网层、网络接入层）来建模。协议定义了通信规则：IP 处理逻辑寻址和路由，TCP 提供可靠的、面向连接的传输，而 UDP 提供无连接的低延迟传输。HTTP/HTTPS 驱动万维网，DNS 将域名转换为 IP 地址。
IP addressing (IPv4 and IPv6), subnet masking, and routing are central to internetworking. Network security concepts include firewalls (packet filtering, stateful inspection), encryption protocols (TLS/SSL), and virtual private networks (VPNs). Understanding the client–server and peer-to-peer models, along with socket programming, provides a practical grounding.
IP 寻址（IPv4 和 IPv6）、子网掩码和路由是网络互联的核心。网络安全概念包括防火墙（包过滤、状态检测）、加密协议（TLS/SSL）以及虚拟专用网络（VPN）。理解客户端–服务器和对等网络模型，以及套接字编程，提供了实践基础。
8. Database Systems | 数据库系统
A relational database organises data into tables (relations) with rows (tuples) and columns (attributes). Primary keys uniquely identify rows, and foreign keys enforce relationships between tables. Structured Query Language (SQL) is used to define, manipulate, and query data: SELECT, INSERT, UPDATE, DELETE, and JOIN operations combine related tables.
关系数据库将数据组织为表（关系），包含行（元组）和列（属性）。主键唯一标识行，外键强制表之间的关系。结构化查询语言（SQL）用于定义、操作和查询数据：SELECT、INSERT、UPDATE、DELETE 以及 JOIN 操作连接相关表。
Normalisation reduces data redundancy and prevents update anomalies. The progression from 1NF (atomic values, no repeating groups) to 2NF (remove partial dependencies) and 3NF (remove transitive dependencies) builds a well-structured schema. Entity-relationship diagrams (ERDs) model the database logically. Transaction management ensures Atomicity, Consistency, Isolation, and Durability (ACID) to maintain data integrity even in concurrent environments.
规范化可减少数据冗余并防止更新异常。从第一范式（原子值，无重复组）到第二范式（消除部分依赖）再到第三范式（消除传递依赖）的进程构建了结构良好的模式。实体关系图（ERD）对数据库进行逻辑建模。事务管理确保原子性、一致性、隔离性和持久性（ACID），即使在并发环境中也能维护数据完整性。
9. Systems Development Life Cycle | 系统开发生命周期
The Systems Development Life Cycle (SDLC) provides a framework for creating information systems. Common models include the Waterfall model (linear phases: feasibility, analysis, design, implementation, testing, maintenance) and Agile methodologies (iterative, incremental, with continuous user feedback). Agile frameworks like Scrum use sprints, daily stand-ups, and retrospectives to adapt to changing requirements.
系统开发生命周期（SDLC）为创建信息系统提供了一个框架。常见模型包括瀑布模型（线性阶段：可行性分析、分析、设计、实施、测试、维护）和敏捷方法（迭代式、增量式，持续获取用户反馈）。Scrum 等敏捷框架使用冲刺、每日站会和回顾会议来适应需求变更。
During analysis, tools such as data flow diagrams (DFDs) and use case diagrams (UML) capture system requirements. Design phases produce system architecture, user interface mock-ups, and detailed module specifications. Testing encompasses unit testing, integration testing, system testing, and user acceptance testing (UAT). Post-implementation, maintenance can be corrective, adaptive, or perfective. Evaluation against success criteria is vital for project closure.
在分析阶段，数据流图（DFD）和用例图（UML）等工具用于捕获系统需求。设计阶段产生系统架构、用户界面模型和详细的模块规格。测试涵盖单元测试、集成测试、系统测试和用户验收测试（UAT）。实施后，维护可以是纠正性、适应性或完善性的。对照成功标准进行评估对项目收尾至关重要。
10. Information Security and Ethics | 信息安全与道德
Information security protects confidentiality, integrity, and availability (the CIA triad). Threats include malware (viruses, worms, ransomware), phishing, denial-of-service attacks, and SQL injection. Defensive measures encompass firewalls, anti-malware software, intrusion detection systems, access controls (passwords, biometrics, multi-factor authentication), and regular security updates. Encryption using symmetric keys (e.g., AES) and asymmetric keys (e.g., RSA) secures data at rest and in transit; digital signatures provide authentication and non-repudiation.
信息安全旨在保护机密性、完整性和可用性（CIA 三元组）。威胁包括恶意软件（病毒、蠕虫、勒索软件）、网络钓鱼、拒绝服务攻击和 SQL 注入。防御措施包括防火墙、反恶意软件、入侵检测系统、访问控制（密码、生物识别、多因素认证）以及定期安全更新。使用对称密钥（如 AES）和非对称密钥（如 RSA）的加密可保护静止和传输中的数据；数字签名提供身份验证和不可否认性。
Ethical and legal considerations shape the responsible use of computing. This includes compliance with data protection legislation (e.g., the UK GDPR), respecting intellectual property and software licences, and considering the environmental impact of electronic waste. Moral dilemmas arise with artificial intelligence, surveillance, and algorithmic bias, requiring professional codes of conduct and informed public debate.
伦理和法律考量塑造了负责任的计算应用。这包括遵守数据保护法规（如英国 GDPR）、尊重知识产权和软件许可证，并考虑电子垃圾对环境的影响。人工智能、监控和算法偏见引发了道德困境，需要专业行为准则和知情的公众讨论。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply