Pre-U CCEA Computer Science: Core Concepts Review | Pre-U CCEA 计算机：核心知识点梳理

📚 Pre-U CCEA Computer Science: Core Concepts Review | Pre-U CCEA 计算机：核心知识点梳理

This comprehensive guide distils the essential topics required for Pre‑U CCEA Computer Science. Across eight focused sections you will revisit the principles of data representation, the inner workings of computer architecture, the role of operating systems, core programming paradigms, algorithm design, networking fundamentals, database theory and the software development lifecycle. Each concept is explained in concise English–Chinese pairs, making the material accessible for both revision and deep learning.

本指南精炼了 Pre‑U CCEA 计算机科学的核心必考主题。通过八个模块，你将重新审视数据表示原理、计算机体系结构内部机制、操作系统的作用、核心程序设计范式、算法设计、网络基础、数据库理论以及软件开发生命周期。每个概念均以英中对照的简明段落呈现，既可高效复习，也便于深度学习。

1. Data Representation and Number Bases | 数据表示与数制

Computers store all data as binary sequences. Understanding how integers, floating‑point numbers, characters and images are encoded is fundamental to grasping memory usage and arithmetic operations.

计算机将所有数据存储为二进制序列。理解整数、浮点数、字符和图像的编码方式，是掌握内存使用和算术运算的基础。

Binary, hexadecimal and denary conversions allow programmers to read memory dumps and debug efficiently. Binary uses base 2 (digits 0 and 1), hexadecimal uses base 16 (0–9, A–F). Converting between these bases is a routine skill for interpreting addresses and colour codes.

二进制、十六进制与十进制的转换使程序员能够阅读内存转储并高效调试。二进制使用基2（数字0和1），十六进制使用基16（0–9、A–F）。在这些进制之间进行转换是解释地址和颜色代码的常规技能。

Negative integers are commonly stored using two’s complement. In an 8‑bit system, the most‑significant bit indicates the sign. For example, the two’s complement of 5 in 8 bits is 11111011₂, representing −5. Arithmetic works seamlessly without special subtraction circuits.

负整数通常使用二进制补码存储。在8位系统中，最高位表示符号。例如，5的8位补码为11111011₂，表示−5。算术运算无需特殊减法电路即可无缝进行。

Floating‑point representation follows a mantissa‑exponent model. A binary number is expressed as M × 2ᴱ, where normalisation avoids ambiguous representations. Precision and range are traded off through the bit allocation for mantissa and exponent, directly affecting rounding errors in calculation.

浮点数表示遵循尾数‑指数模型。二进制数表示为 M × 2ᴱ，规范化可避免多义表示。通过分配给尾数和指数的比特位数，精度和范围得以权衡，直接影响计算中的舍入误差。

Characters are encoded via standards such as ASCII and Unicode. ASCII uses 7 bits (128 characters), while Unicode’s UTF‑8 can encode over a million characters, supporting global scripts and emojis. This extends the representable symbol set far beyond the Latin alphabet.

字符通过ASCII和Unicode等标准编码。ASCII使用7位（128个字符），而Unicode的UTF‑8可编码超过一百万字符，支持全球文字和表情符号。这极大地扩展了可表示的符号集，远超拉丁字母。

Bitmap images are stored as grids of pixels, each assigned a colour value. Resolution (pixel dimensions) and colour depth (bits per pixel) determine file size and visual quality. Vector graphics instead use geometric primitives, scaling without pixelation.

位图图像存储为像素网格，每个像素分配一个颜色值。分辨率（像素尺寸）和色彩深度（每像素位数）决定文件大小和视觉质量。矢量图形则使用几何图元，缩放时不产生像素化。

2. Computer Architecture and the CPU | 计算机体系结构与中央处理器

The Von Neumann architecture underpins nearly every modern computer. It stores both instructions and data in a shared memory, accessed via buses. The CPU fetches, decodes and executes instructions in a continuous cycle, its speed governed by clock frequency and micro‑architectural features.

冯·诺依曼体系结构是几乎所有现代计算机的基础。它将指令和数据存储于共享内存中，通过总线访问。CPU以“取指‑译码‑执行”的循环连续运行，其速度取决于时钟频率和微架构特性。

The CPU components include the Control Unit (CU), Arithmetic Logic Unit (ALU) and registers. The CU orchestrates the fetch–decode–execute cycle, the ALU performs arithmetic and logic operations, while registers provide ultra‑fast temporary storage for the currently processed data and instruction addresses.

CPU的组成包括控制单元（CU）、算术逻辑单元（ALU）和寄存器。CU协调取指‑译码‑执行循环，ALU执行算术和逻辑操作，寄存器为当前处理的数据和指令地址提供超高速临时存储。

Key registers include the Program Counter (holds the address of the next instruction), Memory Address Register, Memory Data Register, Instruction Register and Accumulator. Their interplay during the machine cycle is critical for understanding pipelining and interrupt handling.

关键寄存器包括程序计数器（存放下一条指令地址）、内存地址寄存器、内存数据寄存器、指令寄存器和累加器。它们在机器周期内的相互作用，对理解流水线和中断处理至关重要。

The buses (data, address and control) connect CPU, memory and I/O devices. The address bus width determines the maximum addressable memory; the data bus width affects how much data can be moved per cycle.

总线（数据总线、地址总线和控制总线）连接CPU、内存和I/O设备。地址总线宽度决定最大可寻址内存；数据总线宽度决定每个周期可传输的数据量。

Modern CPUs use pipelining to overlap the execution of multiple instructions, improving throughput. Hazards (data, structural, control) can stall the pipeline, requiring forwarding, stalling or branch prediction techniques.

现代CPU使用流水线技术重叠执行多条指令，提高吞吐量。冒险（数据冒险、结构冒险、控制冒险）可能使流水线停顿，需要前递、停顿或分支预测技术来解决。

CISC vs. RISC distinguishes complex instruction‑set computers from reduced instruction‑set designs. CISC offers rich address modes and variable‑length instructions (x86), while RISC favours simple, fixed‑length instructions, enabling efficient pipelining and compilation (ARM).

CISC与RISC区分了复杂指令集计算机与精简指令集设计。CISC提供丰富的寻址模式和变长指令（x86），而RISC采用简单的定长指令，利于高效流水线和编译（ARM）。

3. Operating Systems and Resource Management | 操作系统与资源管理

An operating system (OS) acts as an intermediary between users and hardware. It manages processes, memory, file systems and I/O, while providing a user interface and protecting system integrity.

操作系统（OS）充当用户与硬件之间的中介。它管理进程、内存、文件系统和I/O，同时提供用户界面并保护系统完整性。

Process management involves creating, scheduling and terminating processes. The OS uses a Process Control Block (PCB) to store process state, program counter and register contents. Scheduling algorithms (Round Robin, Priority, Shortest Job First) determine which process runs next, aiming to maximise CPU utilisation and minimise response time.

进程管理涉及进程的创建、调度和终止。操作系统使用进程控制块（PCB）存储进程状态、程序计数器和寄存器内容。调度算法（轮转调度、优先级调度、短作业优先）决定下一个运行的进程，旨在最大化CPU利用率并最小化响应时间。

Memory management uses techniques like paging and segmentation. Paging divides physical memory into fixed‑size frames and logical memory into pages; a page table maps virtual to physical addresses, enabling virtual memory and protection. Segmentation reflects the programmer’s view of program structure.

内存管理使用分页和分段等技术。分页将物理内存划分为固定大小的帧，将逻辑内存划分为页；页表建立虚拟地址到物理地址的映射，从而支持虚拟内存和保护。分段反映程序员对程序结构的视图。

Virtual memory allows execution of programs larger than physical RAM by swapping pages to and from disk. When a required page is not in memory, a page fault occurs, triggering a swap. Thrashing happens when the system spends more time swapping than executing.

虚拟内存通过将页面换入换出磁盘，允许执行大于物理RAM的程序。当所需页面不在内存中时，发生缺页错误，触发交换。如果系统花费在交换上的时间多于执行时间，则发生“抖动”。

The file system organises data into files and directories, using allocation methods like contiguous, linked and indexed. Free‑space management (bit vector, linked list) ensures efficient storage. Permissions protect files under a multi‑user model.

文件系统将数据组织为文件和目录，使用连续分配、链接分配和索引分配等方法。空闲空间管理（位向量、链表）确保高效存储。权限设置在多用户模型下保护文件。

Device drivers are software modules that enable the OS to communicate with hardware. They abstract hardware specifics, allowing the kernel to treat different devices uniformly. Interrupt‑driven I/O and Direct Memory Access (DMA) reduce CPU involvement, boosting overall performance.

设备驱动程序是使OS与硬件通信的软件模块。它们抽象硬件细节，使内核能够统一处理不同设备。中断驱动I/O和直接内存访问（DMA）降低了CPU参与度，提高了整体性能。

4. Programming Paradigms and Constructs | 程序设计范式与构造

Programming languages support several paradigms: imperative, object‑oriented, functional and declarative. The CCEA Pre‑U syllabus emphasises the ability to design, write and trace code across these styles, using appropriate data structures and control flow.

程序设计语言支持多种范式：命令式、面向对象、函数式和声明式。CCEA Pre‑U大纲强调能够跨这些风格设计、编写和跟踪代码，并使用适当的数据结构和控制流。

In the imperative paradigm, programs consist of sequences of statements that change program state. Common constructs include sequence, selection (if‑else, switch) and iteration (for, while, do‑while). Tracing a program by hand using a variable table is a cornerstone of debugging and exam technique.

在命令式范式中，程序由一系列改变程序状态的语句组成。常用结构包括顺序、选择（if‑else、switch）和迭代（for、while、do‑while）。通过变量表手工跟踪程序是调试和考试技巧的基石。

Object‑oriented programming (OOP) models entities as objects encapsulating data (attributes) and behaviour (methods). Core OOP principles include encapsulation, inheritance, polymorphism and abstraction. Classes define blueprints, and objects are instances. Polymorphism allows a single interface to control access to a general class of actions.

面向对象编程（OOP）将实体建模为封装数据（属性）和行为（方法）的对象。OOP核心原则包括封装、继承、多态和抽象。类定义蓝图，对象为实例。多态允许单一接口控制对一类通用操作的访问。

Recursion is a technique where a function calls itself to solve a smaller instance of the same problem. A recursive solution must have a base case to avoid infinite recursion. Classic examples include factorial n! = n × (n−1)! and the Towers of Hanoi.

递归是一种函数调用自身以求解同一问题的较小实例的技术。递归解答必须包含基线条件以避免无限递归。经典例子包括阶乘 n! = n × (n−1)! 和汉诺塔问题。

Data structures such as arrays (static, dynamic), lists, stacks, queues, trees and hash tables are fundamental. Each structure offers different trade‑offs in insertion, deletion and access time. For example, a stack follows Last‑In‑First‑Out (LIFO) and supports push and pop operations; a queue uses First‑In‑First‑Out (FIFO).

数据结构如数组（静态、动态）、列表、栈、队列、树和哈希表是基础。每种结构在插入、删除和访问时间方面提供不同的权衡。例如，栈遵循后进先出（LIFO）并支持压入和弹出操作；队列采用先进先出（FIFO）。

In functional programming, functions are first‑class citizens: they can be passed as arguments, returned from other functions and assigned to variables. Pure functions avoid side effects, making programs easier to reason about and test. Higher‑order functions like map, filter and reduce operate on lists declaratively.

在函数式编程中，函数是一等公民：它们可以作为参数传递、从其他函数返回并赋值给变量。纯函数避免副作用，使程序更易于推理和测试。高阶函数如map、filter和reduce以声明式方式操作列表。

5. Algorithms, Efficiency and Problem Solving | 算法、效率与问题求解

An algorithm is a step‑by‑step procedure to solve a problem. Evaluating algorithm efficiency involves analysing time and space complexity, typically expressed using Big‑O notation, which describes the upper bound of growth as input size increases.

算法是解决问题的逐步步骤。评估算法效率需要分析时间和空间复杂度，通常用大O符号表示，描述输入规模增加时增长的上界。

Common sorting algorithms include Bubble Sort (O(n²)), Insertion Sort (O(n²) worst case, O(n) best), Merge Sort (O(n log n)) and Quick Sort (average O(n log n), worst O(n²) if pivot choice is poor). Understanding their stability, in‑place nature and adaptive behaviour is essential.

常见排序算法包括冒泡排序（O(n²)）、插入排序（最坏O(n²)，最好O(n)）、归并排序（O(n log n)）和快速排序（平均O(n log n)，枢轴选择不佳时最坏O(n²)）。理解它们的稳定性、原地特性和自适应性至关重要。

Searching algorithms range from Linear Search (O(n)) to Binary Search (O(log n) on sorted data). Binary search repeatedly halves the search space; it cannot be applied to an unsorted array. Hash‑based search achieves near O(1) average lookup by mapping keys to indices via a hash function.

搜索算法从线性搜索（O(n)）到二分搜索（在已排序数据上O(log n)）。二分搜索不断将搜索空间减半；它不能应用于未排序数组。基于哈希的搜索通过哈希函数将键映射到索引，实现接近O(1)的平均查找时间。

Problem‑solving strategies include divide and conquer, dynamic programming and backtracking. Divide and conquer breaks a problem into independent sub‑problems (e.g., merge sort). Dynamic programming stores solutions to overlapping sub‑problems to avoid recomputation (e.g., Fibonacci with memoisation). Backtracking explores all possibilities but prunes infeasible branches (e.g., n‑Queens).

问题求解策略包括分治法、动态规划和回溯法。分治法将问题分解为独立的子问题（如归并排序）。动态规划存储重叠子问题的解以避免重复计算（如带记忆化的斐波那契）。回溯法探索所有可能性但剪除不可行的分支（如n皇后问题）。

Graph and tree traversals are crucial for networking, AI and data organisation. Depth‑First Search (DFS) uses a stack (recursion), while Breadth‑First Search (BFS) uses a queue. Both have O(V + E) complexity. Tree traversals include pre‑order, in‑order and post‑order, each suited to different tasks like expression evaluation.

图和树的遍历对网络、人工智能和数据组织至关重要。深度优先搜索（DFS）使用栈（递归），广度优先搜索（BFS）使用队列。两者复杂度均为O(V + E)。树的遍历包括先序、中序和后序，各自适用于表达式求值等不同任务。

Correctness can be argued through loop invariants and induction. A loop invariant is a property that holds before and after each iteration, proving the algorithm’s logic. Formal verification, although not always required, helps produce robust code, especially in safety‑critical systems.

正确性可通过循环不变式和归纳法来证明。循环不变式是在每次迭代前后都成立的性质，用以证明算法逻辑。形式化验证虽然并非总是必需，但有助于编写健壮代码，尤其在安全攸关的系统中。

6. Networking and Data Communication | 网络与数据通信

Computer networks enable resource sharing and communication. The layered protocol model—such as TCP/IP or OSI—standardises how data is packetised, addressed, transmitted and reassembled across diverse hardware and software.

计算机网络实现资源共享和通信。分层协议模型——如TCP/IP或OSI——标准化了数据如何被分包、编址、传输和在不同硬件与软件之间重组。

The TCP/IP stack consists of four layers: Application (HTTP, SMTP, FTP), Transport (TCP, UDP), Internet (IP) and Network Access (Ethernet, Wi‑Fi). Each layer adds headers. TCP offers reliable, connection‑oriented delivery with flow control and error recovery, while UDP is connectionless and faster, suitable for streaming.

TCP/IP协议栈由四层组成：应用层（HTTP、SMTP、FTP）、传输层（TCP、UDP）、网络层（IP）和网络访问层（以太网、Wi‑Fi）。每一层添加报头。TCP提供可靠的、面向连接的传输，具有流量控制和差错恢复；UDP是无连接的，速度更快，适用于流媒体。

IP addressing (IPv4: 32 bits, e.g., 192.168.1.1; IPv6: 128 bits) identifies host and network. Subnet masks separate the network and host portions. Routers use routing tables to forward packets to their destination, employing protocols like OSPF or BGP.

IP寻址（IPv4：32位，如192.168.1.1；IPv6：128位）标识主机和网络。子网掩码区分网络地址和主机地址部分。路由器使用路由表将数据包转发到目的地，采用OSPF或BGP等协议。

DNS (Domain Name System) resolves human‑readable names to IP addresses. It operates as a distributed, hierarchical database. Recursive and iterative queries traverse name servers until the authoritative answer is found. Caching improves performance and reduces upstream load.

DNS（域名系统）将人类可读的名称解析为IP地址。它作为一个分布式、分级数据库运行。递归查询和迭代查询遍历名称服务器，直到找到权威答案。缓存提高性能并减少上游负载。

Network topologies (bus, star, ring, mesh) affect reliability and cost. Star topologies are common in LANs; each node connects to a central switch. Mesh topologies offer redundancy by connecting each node to multiple nodes. Wireless standards (IEEE 802.11) use CSMA/CA to manage access.

网络拓扑（总线、星形、环形、网状）影响可靠性和成本。星形拓扑常用于局域网，每个节点连接到中央交换机。网状拓扑通过将每个节点连接到多个节点提供冗余。无线标准（IEEE 802.11）使用CSMA/CA管理访问。

Common threats include malware, phishing, DoS/DDoS attacks and man‑in‑the‑middle. Defences employ firewalls, encryption (symmetric like AES, asymmetric like RSA), digital certificates and intrusion detection systems. A secure network design applies defence in depth.

常见威胁包括恶意软件、钓鱼、DoS/DDoS攻击和中间人攻击。防御措施采用防火墙、加密（对称如AES，非对称如RSA）、数字证书和入侵检测系统。安全的网络设计运用纵深防御策略。

7. Database Systems and SQL | 数据库系统与SQL

A database is an organised collection of structured data. Relational databases remain dominant, storing data in tables linked by keys. The ACID properties—Atomicity, Consistency, Isolation, Durability—guarantee reliable transaction processing.

数据库是有组织的结构化数据集合。关系数据库仍占主导地位，将数据存储在通过键链接的表中。ACID属性——原子性、一致性、隔离性、持久性——保证可靠的事务处理。

Entity‑Relationship modelling diagrams entities as rectangles, attributes as ovals and relationships as diamonds. Cardinality (one‑to‑one, one‑to‑many, many‑to‑many) defines the nature of the relationships. Normalisation (1NF, 2NF, 3NF) eliminates redundancy and update anomalies by systematically decomposing tables.

实体‑关系建模将实体表示为矩形，属性表示为椭圆，关系表示为菱形。基数（一对一、一对多、多对多）定义了关系的性质。规范化（1NF、2NF、3NF）通过系统地分解表来消除冗余和更新异常。

Structured Query Language (SQL) is the standard language for querying and managing relational databases. Key command types include DDL (CREATE, ALTER, DROP), DML (SELECT, INSERT, UPDATE, DELETE) and DCL (GRANT, REVOKE).

结构化查询语言（SQL）是查询和管理关系数据库的标准语言。主要命令类别包括DDL（CREATE、ALTER、DROP）、DML（SELECT、INSERT、UPDATE、DELETE）和DCL（GRANT、REVOKE）。

A basic SELECT query retrieves columns from one or more tables, with optional WHERE, GROUP BY, HAVING and ORDER BY clauses. Joins (INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN) combine rows from multiple tables based on a related column. Aggregate functions (COUNT, SUM, AVG, MAX, MIN) operate on groups.

基本的SELECT查询从一个或多个表中检索列，可包含WHERE、GROUP BY、HAVING和ORDER BY子句。连接（INNER JOIN、LEFT JOIN、RIGHT JOIN、FULL JOIN）根据相关列合并多张表的行。聚合函数（COUNT、SUM、AVG、MAX、MIN）操作于分组上。

Indexing speeds up data retrieval at the cost of slower writes and additional storage. A clustered index determines the physical order of rows (typically the primary key); non‑clustered indexes are separate structures pointing to rows. Query optimisation relies heavily on index selection.

索引可加快数据检索速度，但会减慢写入速度并增加额外存储。聚集索引决定行的物理顺序（通常为主键）；非聚集索引是指向行的独立结构。查询优化在很大程度上依赖于索引选择。

Big data and NoSQL databases challenge the traditional relational model. Key‑value stores, document databases and graph databases offer horizontal scalability and handle unstructured or semi‑structured data. Understanding the CAP theorem (Consistency, Availability, Partition tolerance) clarifies their trade‑offs.

大数据和NoSQL数据库对传统关系模型形成挑战。键值存储、文档数据库和图数据库提供水平可扩展性，并处理非结构化或半结构化数据。理解CAP定理（一致性、可用性、分区容错性）可明晰它们的权衡取舍。

8. Software Development Lifecycle and Methodologies | 软件开发生命周期与方法论

Software engineering applies disciplined processes to design, develop and maintain software. Understanding the stages of the Software Development Lifecycle (SDLC) and the pros and cons of various methodologies helps teams deliver reliable products on time.

软件工程应用规范化的流程来设计、开发和维护软件。理解软件开发生命周期（SDLC）各阶段及各种方法的优缺点，有助于团队按时交付可靠的产品。

The SDLC phases typically include: feasibility study, requirements analysis, design, implementation (coding), testing, deployment and maintenance. Each phase produces documentation that feeds the next, ensuring traceability and stakeholder agreement.

SDLC各阶段通常包括：可行性研究、需求分析、设计、实现（编码）、测试、部署和维护。每个阶段产生的文档作为下一阶段的输入，确保可追溯性和利益相关方的认可。

The Waterfall model is a linear sequential approach. It is simple and easy to manage but inflexible: once a phase is completed, going back is difficult. It suits projects with well‑understood, stable requirements.

瀑布模型是一种线性顺序方法。它简单易管理，但缺乏灵活性：一个阶段完成后，难以返回。适用于需求明确且稳定的项目。

Agile methodologies (Scrum, Kanban, XP) emphasise iterative development, customer collaboration and responsiveness to change. Work is divided into short cycles (sprints). Daily stand‑ups, sprint reviews and retrospectives keep the team aligned and continuously improving.

敏捷方法（Scrum、看板、极限编程）强调迭代开发、客户协作和快速响应变化。工作被划分为短周期（冲刺）。每日站会、冲刺评审和回顾会让团队保持一致并持续改进。

Testing levels include unit testing (individual components), integration testing (interfaces between modules), system testing (complete system) and acceptance testing (user‑driven). Black‑box testing checks functionality without seeing code; white‑box testing examines internal logic. Test strategies like boundary value analysis and equivalence partitioning systematically reduce test cases.

测试层级包括单元测试（独立组件）、集成测试（模块间接口）、系统测试（完整系统）和验收测试（用户驱动）。黑盒测试在不查看代码的情况下检查功能；白盒测试检查内部逻辑。边界值分析和等价类划分等测试策略可系统减少测试用例。

Version control systems like Git track changes, enable collaboration and allow rollback. Concepts such as commits, branches and merges form the backbone of modern DevOps. Continuous Integration / Continuous Deployment (CI/CD) pipelines automate building, testing and releasing software, increasing delivery velocity and quality.

版本控制系统如Git可追踪变更、支持协作并允许回滚。提交、分支和合并等概念构成现代DevOps的支柱。持续集成/持续部署（CI/CD）管道自动执行构建、测试和发布软件，提高交付速度与质量。

Computational thinking underpins all phases: abstraction, decomposition, pattern recognition and algorithm design. This mindset empowers students to approach any computing problem systematically, whether writing a small script or architecting a large system.

计算思维贯穿所有阶段：抽象、分解、模式识别和算法设计。这种思维模式使学生能够系统性地处理任何计算问题，无论是编写小脚本还是设计大型系统。

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

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

Pre-U CCEA Computer Science: Core Concepts Review | Pre-U CCEA 计算机：核心知识点梳理