📚 A-Level Computer Science: Key Comparisons | A-Level 计算机：核心概念对比
In A-Level Computer Science, understanding the distinctions between fundamental concepts is critical for both exam performance and real-world problem solving. This article compares some of the most frequently examined pairs, highlighting their definitions, use cases, and trade-offs.
在 A-Level 计算机科学中，理解基本概念之间的区别对考试表现和实际问题解决都至关重要。本文比较了一些最常见的考点配对，突出它们的定义、应用场景以及利弊权衡。
1. Compiler vs Interpreter | 编译器与解释器的对比
A compiler translates the entire source code into machine code before execution, producing a standalone executable. An interpreter translates and executes source code line by line without generating an intermediate object file.
编译器在执行前将整个源代码翻译成机器代码，生成可独立运行的可执行文件。解释器逐行翻译并执行源代码，不会生成中间目标文件。
| Aspect | Compiler | Interpreter |
|---|---|---|
| Translation | Entire code at once | Line by line |
| 翻译方式 | 一次性翻译全部代码 | 逐行翻译 |
| Execution speed | Fast (already compiled) | Slower (translation during run) |
| 执行速度 | 快（已编译好） | 较慢（运行时翻译） |
| Error reporting | After full compilation | Stops at first error |
| 错误报告 | 完全编译后报告 | 遇到第一个错误即停止 |
| Output | Object code (.exe, etc.) | No object code |
| 输出 | 目标代码（.exe等） | 无目标代码 |
| Examples | C, C++, Rust | Python, JavaScript, PHP |
| 典型语言 | C、C++、Rust | Python、JavaScript、PHP |
2. TCP vs UDP | 传输控制协议与用户数据报协议的对比
TCP (Transmission Control Protocol) provides reliable, connection-oriented communication with error checking and flow control. UDP (User Datagram Protocol) offers connectionless, faster but unreliable delivery without guaranteed ordering.
TCP（传输控制协议）提供面向连接的可靠通信，带有错误检查和流量控制。UDP（用户数据报协议）提供无连接的更快速但不可靠的传输，不保证顺序。
| Feature | TCP | UDP |
|---|---|---|
| Connection type | Connection-oriented | Connectionless |
| 连接类型 | 面向连接 | 无连接 |
| Reliability | Guaranteed delivery, retransmission | No guarantee, packets may be lost |
| 可靠性 | 保证送达，重传机制 | 无保证，可能丢包 |
| Ordering | Maintains sequence | No inherent ordering |
| 顺序 | 保持顺序 | 无固有顺序 |
| Overhead | Higher (handshake, ACK) | Lower (minimal header) |
| 开销 | 较高（握手、确认） | 较低（最小头部） |
| Use cases | HTTP, email, file transfer | VoIP, live streaming, DNS |
| 应用场景 | HTTP、电子邮件、文件传输 | VoIP、直播、DNS |
3. RISC vs CISC | 精简指令集与复杂指令集的对比
RISC (Reduced Instruction Set Computer) uses a small, highly optimised set of simple instructions that execute in one clock cycle. CISC (Complex Instruction Set Computer) employs a rich set of complex instructions, some requiring multiple cycles to complete.
RISC（精简指令集计算机）采用一组小而高度优化的简单指令，每条指令在一个时钟周期内执行。CISC（复杂指令集计算机）使用丰富的复杂指令集，部分指令需要多个周期才能完成。
| Property | RISC | CISC |
|---|---|---|
| Instruction set | Small, simple | Large, complex |
| 指令集 | 小，简单 | 大，复杂 |
| Instruction length | Fixed | Variable |
| 指令长度 | 固定 | 可变 |
| Execution time | One cycle per instruction | Multiple cycles possible |
| 执行时间 | 每指令一个周期 | 可能多个周期 |
| Hardware emphasis | More registers, pipelining | Microcode control |
| 硬件重点 | 多寄存器、流水线 | 微码控制 |
| Examples | ARM, MIPS, RISC-V | x86, Intel x64 |
| 典型架构 | ARM、MIPS、RISC-V | x86、Intel x64 |
4. Array vs Linked List | 数组与链表的对比
An array stores elements in contiguous memory locations, allowing fast indexed access. A linked list stores nodes scattered in memory, with each node pointing to the next, enabling efficient insertion and deletion.
数组将元素存储在连续的内存空间中，支持基于索引的快速访问。链表将节点分散存储在内存中，每个节点指向下一个节点，方便高效插入和删除。
| Characteristic | Array | Linked List |
|---|---|---|
| Memory layout | Contiguous | Non-contiguous (nodes) |
| 内存布局 | 连续 | 非连续（节点） |
| Access time (random) | O(1) via index | O(n) traversal |
| 随机访问时间 | O(1) 通过索引 | O(n) 需要遍历 |
| Insertion/deletion | Slower, shifts elements | Fast, reassign pointers |
| 插入/删除 | 较慢，需移动元素 | 快速，更改指针 |
| Size flexibility | Fixed (static) or dynamic with overhead | Dynamic, grows easily |
| 大小灵活性 | 固定（静态）或动态但有开销 | 动态，易扩展 |
| Memory overhead | None (just data) | Extra pointer per node |
| 内存开销 | 无（仅数据） | 每个节点额外指针 |
5. Stack vs Queue | 栈与队列的对比
A stack follows LIFO (Last In First Out) principle: the last element added is the first removed. A queue follows FIFO (First In First Out): elements are removed in the order they were added.
栈遵循 LIFO（后进先出）原则：最后加入的元素最先移除。队列遵循 FIFO（先进先出）原则：元素按加入顺序移除。
| Feature | Stack | Queue |
|---|---|---|
| Ordering | LIFO | FIFO |
| 顺序 | 后进先出 | 先进先出 |
| Main operations | Push (add), Pop (remove top) | Enqueue (add), Dequeue (remove front) |
| 主要操作 | 压入（push），弹出（pop） | 入队（enqueue），出队（dequeue） |
| Access point | One end (top) | Two ends (front and rear) |
| 访问点 | 一端（栈顶） | 两端（队首和队尾） |
| Real-world analogy | Stack of plates | Queue at a checkout |
| 现实类比 | 一摞盘子 | 收银台排队 |
| Applications | Function call stack, undo | Print spooler, task scheduling |
| 应用 | 函数调用栈、撤销操作 | 打印队列、任务调度 |
6. RAM vs ROM | 随机存取存储器与只读存储器的对比
RAM (Random Access Memory) is volatile read-write memory used for active processes and data. ROM (Read-Only Memory) is non-volatile memory that retains its contents even when power is off and typically stores firmware.
RAM（随机存取存储器）是易失性读写存储器，用于活动进程和数据。ROM（只读存储器）是非易失性存储器，断电后仍保留内容，通常存储固件。
| Aspect | RAM | ROM |
|---|---|---|
| Volatility | Volatile (loses data without power) | Non-volatile |
| 易失性 | 易失（断电后数据丢失） | 非易失 |
| Read/Write | Read and write freely | Primarily read; writing is limited/slow |
| 读写特性 | 可自由读写 | 主要只读，写入受限/慢 |
| Speed | Faster | Slower than modern RAM |
| 速度 | 更快 | 比现代RAM慢 |
| Typical content | OS, running programs, data | BIOS/UEFI, bootloader, embedded instructions |
| 典型内容 | 操作系统、运行程序、数据 | BIOS/UEFI、引导程序、嵌入式指令 |
| Types | SRAM, DRAM | PROM, EPROM, EEPROM |
| 类型 | SRAM、DRAM | PROM、EPROM、EEPROM |
7. Relational vs Non-relational Databases | 关系型与非关系型数据库的对比
Relational databases organise data into tables with predefined schemas and support SQL for querying. Non-relational (NoSQL) databases store data in flexible formats such as documents, key-value pairs, or graphs and often sacrifice immediate consistency for scalability.
关系型数据库将数据组织到具有预定义模式的表中，并支持SQL查询。非关系型（NoSQL）数据库以灵活的格式（如文档、键值对或图）存储数据，通常为了可扩展性而牺牲即时一致性。
| Property | Relational (SQL) | Non-relational (NoSQL) |
|---|---|---|
| Data model | Tables with rows and columns | Documents, key-value, column, graph |
| 数据模型 | 包含行和列的表 | 文档、键值、列族、图 |
| Schema | Fixed, must be defined | Dynamic, schema-less |
| 模式 | 固定，需预先定义 | 动态，无模式 |
| Query language | SQL | Varies (MongoDB query, Cassandra CQL) |
| 查询语言 | SQL | 多种（MongoDB查询、Cassandra CQL） |
| Consistency model | ACID (strong consistency) | Often BASE (eventual consistency) |
| 一致性模型 | ACID（强一致性） | 常为BASE（最终一致性） |
| Scalability | Vertically, harder to scale horizontally | Horizontally, designed for scaling |
| 可扩展性 | 垂直扩展为主，水平扩展较难 | 水平扩展，天然适合 |
8. Synchronous vs Asynchronous Transmission | 同步传输与异步传输的对比
In synchronous transmission, data is sent as a continuous stream with a shared clock signal, allowing high throughput. Asynchronous transmission sends data one byte at a time, using start and stop bits to frame each unit, which adds overhead but simplifies sender-receiver coordination.
在同步传输中，数据以连续流的形式发送，并共享时钟信号，实现高吞吐量。异步传输一次发送一个字节，使用起始位和停止位来界定每个单元，增加了开销但简化了发送方与接收方的协调。
