📚 Key Concepts Comparison in WJEC A-Level Computer Science | WJEC A-Level 计算机知识点对比
In WJEC A-Level Computer Science, understanding the subtle differences between related concepts is essential for exam success. This article compares ten fundamental pairs that students often confuse, from programming paradigms to data structures and network protocols. Each comparison highlights core definitions, key differences, and typical use cases.
在 WJEC A-Level 计算机科学中，理解相关概念之间的细微差别是考试成功的关键。本文比较了学生经常混淆的十组基础知识点，从编程范式到数据结构和网络协议。每组对比都突出了核心定义、关键区别和典型应用场景。
1. Compiler vs Interpreter | 编译器与解释器
A compiler translates the entire source code into machine code before execution, producing a standalone executable file. Programs compiled once can run multiple times without re-compilation, and execution is generally faster.
编译器在执行前将整个源代码翻译为机器码，生成独立的可执行文件。编译一次后程序可多次运行，无需重新编译，且执行速度通常更快。
An interpreter translates and executes source code line by line at runtime, without generating a separate executable. This allows for easier debugging and platform independence, but execution is slower because translation occurs simultaneously.
解释器在运行时逐行翻译并执行源代码，不生成单独的可执行文件。这样便于调试和跨平台，但由于翻译同步进行，执行速度较慢。
Key difference: compilers produce a finished executable before any execution; interpreters perform translation during execution. Examples: C uses a compiler; Python typically uses an interpreter.
关键区别：编译器在任何执行之前生成最终的可执行文件；解释器在执行过程中进行翻译。例子：C 使用编译器；Python 通常使用解释器。
2. Stack vs Queue | 栈与队列
A stack is a Last-In-First-Out (LIFO) data structure. Elements are added and removed from the same end, called the top. Operations: push (add) and pop (remove). Used in function call management and undo mechanisms.
栈是一种后进先出的数据结构。元素在同一端（称为栈顶）添加和移除。操作：push（压入）和 pop（弹出）。用于函数调用管理和撤销机制。
A queue is a First-In-First-Out (FIFO) data structure. Elements are added at the rear and removed from the front. Operations: enqueue and dequeue. Used in print spooling and breadth-first search.
队列是一种先进先出的数据结构。元素在队尾添加，从队首移除。操作：入队和出队。用于打印缓冲区和广度优先搜索。
The core contrast lies in the order of removal: stack removes the most recently added item, while queue removes the least recently added.
核心对比在于移除顺序：栈移除最近添加的项，队列移除最早添加的项。
3. TCP vs UDP | 传输控制协议与用户数据报协议
TCP (Transmission Control Protocol) is connection-oriented. It establishes a reliable connection via a three-way handshake, guarantees delivery through acknowledgements, and maintains packet order. Ideal for web browsing, email, and file transfers.
TCP（传输控制协议）是面向连接的。它通过三次握手建立可靠连接，通过确认机制保证投递，并维持数据包顺序。适用于网页浏览、电子邮件和文件传输。
UDP (User Datagram Protocol) is connectionless. It sends datagrams without prior handshaking, offers no delivery guarantees, and does not order packets. This reduces latency and overhead, making it suitable for live streaming and VoIP.
UDP（用户数据报协议）是无连接的。它无握手直接发送数据报，不保证投递，也不排序数据包。这降低了延迟和开销，适合直播和 VoIP。
TCP provides reliability at the cost of speed; UDP sacrifices reliability for speed. Choice depends on application requirements.
TCP 以速度为代价提供可靠性；UDP 牺牲可靠性换取速度。选择取决于应用需求。
4. Lossy vs Lossless Compression | 有损压缩与无损压缩
Lossless compression reduces file size without discarding any data, allowing the original file to be perfectly reconstructed. Algorithms like run-length encoding and Huffman coding exploit statistical redundancy. Used for text, executable files, and PNG images.
无损压缩在不丢弃任何数据的情况下减小文件大小，使原始文件可以完美重建。游程编码和霍夫曼编码等算法利用统计冗余。用于文本、可执行文件和 PNG 图像。
Lossy compression permanently eliminates less perceptible information to achieve higher compression ratios. The original data cannot be fully recovered. Commonly applied to JPEG images, MP3 audio, and MPEG video, where slight quality loss is acceptable.
有损压缩永久性地去除难以察觉的信息，以获得更高的压缩比。原始数据无法完全恢复。常用于 JPEG 图片、MP3 音频和 MPEG 视频，这些应用可以接受轻微的质量损失。
Distinction: lossless preserves integrity; lossy trades quality for space. Both are important: lossless where accuracy matters, lossy where bandwidth or storage is limited.
区别：无损保持完整性；有损用质量换取空间。两者都很重要：注重准确度时用无损，带宽或存储受限时用有损。
5. ROM vs RAM | 只读存储器与随机存取存储器
ROM (Read-Only Memory) is non-volatile, retaining its contents when power is off. It typically stores firmware or bootstrap instructions. Data is written during manufacture or via special processes, and is usually permanent.
ROM（只读存储器）是非易失性的，断电后保留内容。通常存储固件或引导指令。数据在制造时写入或通过特殊过程写入，通常是永久的。
RAM (Random Access Memory) is volatile, losing all data when power is disconnected. It allows both read and write operations at high speed, serving as temporary workspace for the CPU. Programs and active data are loaded here.
RAM（随机存取存储器）是易失性的，断电后丢失所有数据。它支持高速读写操作，作为 CPU 的临时工作空间。程序和活动数据加载于此。
The fundamental difference is volatility: ROM holds permanent instructions, RAM provides fast, temporary storage. A computer needs both: ROM for boot, RAM for operation.
根本区别在于易失性：ROM 存有永久指令，RAM 提供快速临时存储。计算机需要二者：ROM 用于启动，RAM 用于运行。
6. Primary Storage vs Secondary Storage | 主存储器与辅助存储器
Primary storage (main memory) is directly accessible by the CPU. It includes RAM and cache, offers extremely fast data access, and is volatile. It holds data and instructions currently in use. Capacity is typically smaller and cost per byte is higher.
主存储器（内存）可由 CPU 直接访问。它包括 RAM 和高速缓存，提供极快的数据访问，且是易失性的。它保存当前使用的数据和指令。容量通常较小，每字节成本较高。
Secondary storage is non-volatile, used for long-term data retention. Examples: HDD, SSD, optical discs. Access speeds are slower than primary storage, but capacities are much larger and cost per byte is lower. It stores files, applications, and the operating system when not in active use.
辅助存储器是非易失性的，用于长期数据保存。例如：HDD、SSD、光盘。访问速度比主存慢，但容量大得多，每字节成本更低。它存储未活跃使用的文件、应用程序和操作系统。
Key contrast: primary is fast, volatile, and expensive; secondary is slower, persistent, and economical. The memory hierarchy exploits both to balance performance and cost.
关键对比：主存快速、易失且昂贵；辅存较慢、持久且经济。存储层次结构利用两者来平衡性能和成本。
7. LAN vs WAN | 局域网与广域网
A LAN (Local Area Network) covers a small geographical area, such as a single building or campus. It is typically owned and managed by one organization, offers high data transfer rates (e.g., 1 Gbps), and uses technologies like Ethernet and Wi-Fi.
LAN（局域网）覆盖较小的地理范围，如单一建筑或园区。它通常由一个组织拥有和管理，提供高数据传输速率（如 1 Gbps），使用以太网和 Wi-Fi 等技术。
A WAN (Wide Area Network) spans large geographical distances, connecting multiple LANs across cities or countries. It often uses leased telecommunication lines or satellite links, with lower transmission speeds relative to LAN. The internet is the largest WAN.
WAN（广域网）跨越大的地理距离，连接多个城市的 LAN。通常使用租用电信线路或卫星链路，相对 LAN 传输速度较低。互联网是最大的 WAN。
Main differences: scale, ownership, speed, and underlying infrastructure. LANs are private and fast; WANs are distributed and rely on third-party infrastructure.
主要区别：规模、所有权、速度和基础设施。LAN 私有且快速；WAN 分布式且依赖第三方基础设施。
8. Procedural vs Object-Oriented Programming | 过程式与面向对象编程
Procedural programming decomposes a problem into a series of functions (procedures) that operate on data. The data is separate from the functions, and the program flows through sequential calls. Languages like C and Pascal follow this paradigm. It is straightforward for small to medium projects.
过程式编程将问题分解为一系列操作数据的函数（过程）。数据与函数分离，程序通过顺序调用流动。C 和 Pascal 等语言遵循此范式。它适合中小型项目，简单直接。
Object-oriented programming (OOP) models a problem as interacting objects, each encapsulating data (attributes) and methods (behaviours). Core concepts include classes, inheritance, polymorphism, and encapsulation. Languages like Java and C++ are OOP. It enhances modularity and code reuse for large, complex systems.
面向对象编程将问题建模为交互的对象，每个对象封装数据（属性）和方法（行为）。核心概念包括类、继承、多态和封装。Java 和 C++ 是 OOP 语言。它增强大型复杂系统的模块化和代码重用。
Contrast: procedural focuses on functions and sequence; OOP focuses on objects and relationships. Both are valid, and many modern languages support both paradigms.
对比：过程式关注函数和顺序；面向对象关注对象和关系。两者都有效，很多现代语言同时支持两种范式。
9. Bus Topology vs Star Topology | 总线拓扑与星型拓扑
In a bus topology, all devices share a single communication line (the bus). Data sent by one node travels in both directions to all others. It is cheap and easy to install but a cable break disables the whole network, and performance degrades with heavy traffic due to collisions.
在总线拓扑中，所有设备共享一条通信线路（总线）。一个节点发出的数据双向传输给所有其他节点。成本低、安装简单，但一处线缆断裂会使整个网络瘫痪，且重负载时因冲突导致性能下降。
In a star topology, each node is connected to a central switch or hub. The central device manages communication, so a cable fault affects only the attached node. It offers better performance and easier troubleshooting but needs more cabling and the central device is a single point of failure.
在星型拓扑中，每个节点连接到中央交换机或集线器。中央设备管理通信，因此线缆故障只影响所连节点。性能更好，故障排查更容易，但需要更多线缆，且中央设备是单点故障。
Comparison: bus topology uses a shared backbone, star uses dedicated links. Star is more robust and commonly used in modern Ethernet networks; bus is mostly historical.
比较：总线拓扑使用共享骨干，星型使用专用链路。星型更健壮，广泛用于现代以太网；总线拓扑多属历史遗迹。
10. Fetch-Decode-Execute Cycle vs Interrupt Cycle | 取指-解码-执行周期与中断周期
The fetch-decode-execute cycle is the fundamental process by which a CPU processes instructions. It fetches an instruction from memory, decodes it to determine the operation, and executes it using the ALU or other components. This loop repeats continuously for sequential program flow.
取指-解码-执行周期是 CPU 处理指令的基本过程。它从内存取指令，解码以确定操作，并使用 ALU 或其他部件执行。该循环持续重复，实现顺序程序流。
An interrupt cycle temporarily suspends the main cycle to handle an asynchronous event (e.g., I/O completion, timer, error). When an interrupt is raised, the CPU saves its current state, executes the corresponding interrupt service routine, then resumes the original cycle. This enables responsive multitasking.
中断周期临时挂起主周期以处理异步事件（如 I/O 完成、定时器、错误）。当中断产生时，CPU 保存当前状态，执行相应的中断服务程序，然后恢复原周期。这实现了响应式多任务。
Key difference: the fetch-decode-execute cycle handles normal sequential instructions; the interrupt cycle handles exceptional asynchronous events, temporarily diverting the CPU. Together they form the basis of modern processor operation.
关键区别：取指-解码-执行周期处理常规顺序指令；中断周期处理异常的异步事件，临时转移 CPU 控制权。二者共同构成现代处理器操作的基础。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导