📚 Common Misconceptions and Corrections for Year 13 WJEC Computer Science | WJEC 计算机科学常见误区与纠正方法
Misunderstandings in computer science can easily derail exam performance, especially when concepts sound similar or rely on subtle distinctions. This article highlights the most frequent misconceptions encountered by Year 13 WJEC students and provides clear corrections, helping you refine your understanding and avoid losing marks on predictable pitfalls.
计算机科学中的误解很容易影响考试成绩，尤其是当概念听起来相似或依赖于细微差别时。本文重点介绍 Year 13 WJEC 学生最常见的误区，并提供清晰的纠正方法，帮助您深化理解，避免在可预见的错误上失分。
1. Computer Science Is Just Programming | 计算机科学仅仅是编程
Many students believe that computer science revolves entirely around writing code. While programming is a vital tool, the subject also encompasses theoretical foundations such as computational thinking, data structures, algorithms, hardware architecture, networking, and the ethical implications of technology. WJEC exams require you to explain concepts, design algorithms in pseudocode, and evaluate systems, not just produce working programs.
许多学生认为计算机科学完全围绕编写代码。尽管编程是重要工具，但该学科还包括计算思维、数据结构、算法、硬件体系结构、网络以及技术的伦理影响等理论基础。WJEC 考试要求您解释概念、用伪代码设计算法并评估系统，而不仅仅是生成可运行的程序。
2. Compilation and Interpretation Are Interchangeable | 编译和解释可以互换
A common error is treating a compiler and an interpreter as the same thing. A compiler translates the entire source code into machine code before execution, producing a standalone executable file. An interpreter translates and executes code line by line, without creating an independent executable. This distinction affects error reporting, execution speed, and the way code is distributed.
一个常见错误是将编译器和解释器视为一回事。编译器在执行前将整个源代码翻译成机器码，生成独立的可执行文件。解释器逐行翻译并执行代码，不产生独立的可执行文件。这一区别影响错误报告、执行速度以及代码的分发方式。
3. Big O Always Describes Exact Runtime | 大 O 表示法总是描述精确的运行时间
Students often think O(n) means an algorithm takes exactly n steps. In reality, Big O notation describes the upper bound of the growth rate, ignoring constant factors and lower-order terms. It provides a way to compare scalability as input size grows, not the precise number of operations. An O(n) algorithm might take 5n + 200 operations, but for large n, the linear growth dominates.
学生常常认为 O(n) 表示算法恰好需要 n 步。实际上，大 O 表示法描述的是增长速率的上界，忽略常数因子和低阶项。它提供了一种随着输入规模增长比较可扩展性的方式，而不是精确的操作次数。一个 O(n) 的算法可能需要 5n + 200 次操作，但对于较大的 n，线性增长占主导地位。
4. Recursion Is Always Better Than Iteration | 递归总是优于迭代
Recursion can produce elegant solutions for problems like tree traversal or factorial, but it is not automatically superior. Each recursive call adds a stack frame, which may lead to stack overflow for deep recursions. Iteration is often more memory-efficient and faster due to avoiding function call overhead. The choice depends on the problem and the constraints. WJEC questions might ask you to convert between the two.
递归可以为树遍历或阶乘等问题生成优雅的解决方案，但它并非自动优越。每次递归调用都会增加一个栈帧，对于深度递归可能导致栈溢出。迭代通常更节省内存且速度更快，因为避免了函数调用开销。选择取决于问题和约束条件。WJEC 的问题可能要求您在两者之间进行转换。
5. Normalising a Database Means Removing All Redundancy | 数据库规范化意味着消除所有冗余
Normalisation aims to reduce data redundancy and prevent update anomalies, but it does not always eliminate every duplicate value. Foreign keys, for instance, intentionally repeat values to link tables. Over-normalisation can lead to excessive joins that harm performance. The objective is to achieve a balance, typically up to third normal form (3NF) for most practical designs, where non-key attributes depend on “the key, the whole key, and nothing but the key”.
规范化的目标是减少数据冗余并防止更新异常，但不总能消除所有重复值。例如，外键有意地重复值来连接表。过度规范化可能导致过多的连接操作，损害性能。目标是在实际设计中达到平衡，通常达到第三范式 (3NF)，其中非主属性依赖于“键，整个键，且仅依赖于键”。
6. TCP and UDP Are Just Two Similar Protocols | TCP 与 UDP 仅仅是两个相似的协议
Students frequently confuse TCP and UDP, assuming they differ only in speed. TCP is connection-oriented, provides reliable delivery through acknowledgments and retransmissions, and guarantees order. UDP is connectionless, offers no delivery guarantees, and does not preserve order, making it suitable for real-time applications like video streaming or online gaming where low latency is more critical than perfect reliability. The exam expects you to justify protocol choice based on application needs.
学生经常混淆 TCP 和 UDP，认为它们只在速度上有区别。TCP 是面向连接的，通过确认和重传提供可靠交付，并保证顺序。UDP 是无连接的，不提供交付保证，也不保留顺序，使其适用于实时应用，如视频流或在线游戏，在这些场景中低延迟比完美可靠性更重要。考试要求您根据应用需求证明协议选择的合理性。
7. Binary Search Works on Any List | 二分查找适用于任何列表
A persistent misconception is that binary search can be applied to any data set to speed up searching. Binary search requires the list to be sorted in advance. Without a sorted array, the divide-and-conquer logic fails. Furthermore, the data structure must support random access; binary search on a linked list is inefficient even if the list is sorted because accessing the middle element is O(n) instead of O(1).
一个持续的误解是二分查找可以应用于任何数据集以加速搜索。二分查找要求列表提前排序。如果没有排序的数组，分治逻辑将失败。此外，数据结构必须支持随机访问；在链表上进行二分查找即使链表已排序也是低效的，因为访问中间元素需要 O(n) 而不是 O(1)。
8. Worst-Case Analysis Is the Only Meaningful Measure | 最坏情况分析是唯一有意义的衡量标准
While worst-case complexity provides an upper bound, it does not always reflect typical performance. For example, quicksort has a worst-case O(n²) but an average-case O(n log n). When presenting algorithm efficiency, WJEC expects you to discuss best, average, and worst cases where relevant, and to understand why average-case might be more useful for comparing practical implementations.
尽管最坏情况复杂度提供了上界，但它并不总是反映典型性能。例如，快速排序的最坏情况是 O(n²)，但平均情况是 O(n log n)。在展示算法效率时，WJEC 希望您讨论相关的的最佳、平均和最坏情况，并理解为什么平均情况对于比较实际实现可能更有用。
9. Two-Dimensional Arrays and One-Dimensional Arrays Are Stored Differently in Memory | 二维数组与一维数组在内存中的存储方式不同
Memory is linear; a 2D array is actually stored as a contiguous block of memory using either row-major or column-major order. A misconception is that a 2D array inherently has a different memory layout. Understanding address calculation for an element, e.g., base + (i * number_of_columns + j) * element_size for row-major, is essential for the exam. Treating 2D arrays as a completely separate entity can lead to errors in memory estimation and array representation.
内存是线性的；二维数组实际上以行为主或列为主的顺序存储为连续的内存块。一个误区是二维数组本质上具有不同的内存布局。理解元素的地址计算，例如行主序的 base + (i * 列数 + j) * 元素大小，对于考试至关重要。将二维数组视为完全独立的实体可能导致内存估算和数组表示的错误。
10. Stacks and Queues Are Fundamentally Similar | 栈和队列本质上是相似的
Both are linear data structures, but their access policies differ: stack uses LIFO (Last In, First Out) while queue uses FIFO (First In, First Out). Misapplying stack operations to a queue (or vice versa) leads to logical errors in algorithm design. For instance, backtracking in a maze uses a stack, while scheduling a printer uses a queue. The distinction is critical when tracing or implementing data structures in pseudocode.
两者都是线性数据结构，但它们的访问策略不同：栈使用 LIFO（后进先出），而队列使用 FIFO（先进先出）。错误地将栈操作应用于队列（或反之）会导致算法设计中的逻辑错误。例如，迷宫的回溯使用栈，而打印机的调度使用队列。在跟踪或用伪代码实现数据结构时，这一区别至关重要。
11. All Layers of the OSI Model Are Required for Any Transmission | 任何传输都需要 OSI 模型的所有层
Students sometimes assume every network communication traverses all seven layers of the OSI model. In practice, intermediate devices like routers operate only up to the Network layer, while switches work at the Data Link layer. Moreover, the TCP/IP model used on the internet simplifies the layers, merging some OSI layers. Understanding encapsulation and decapsulation at each hop is more exam-relevant than rigidly applying the seven-layer model.
学生有时认为每个网络通信都经过 OSI 模型的所有七层。实际上，路由器等中间设备仅操作到网络层，而交换机工作在数据链路层。此外，互联网上使用的 TCP/IP 模型简化了层次，合并了一些 OSI 层。理解每一跳的封装和解封装比死板应用七层模型更符合考试要求。
12. Two’s Complement Sign Bit Works Like a Separate Sign | 二进制补码的符号位像独立的符号位一样工作
In two’s complement representation, the most significant bit (MSB) indicates the sign (0 for positive, 1 for negative), but it is not simply a flag; the MSB carries a negative weight (e.g., -128 in an 8-bit system). This leads to misconceptions about the range of representable numbers (from -2ⁿ⁻¹ to 2ⁿ⁻¹ – 1) and overflow detection. Students often incorrectly treat the magnitude bits as the absolute value without considering the negative weighting when MSB is 1.
在二进制补码表示中，最高有效位 (MSB) 表示符号（0 为正，1 为负），但它不仅仅是一个标志；MSB 带有负权重（例如，在 8 位系统中为 -128）。这导致对可表示数字范围（从 -2ⁿ⁻¹ 到 2ⁿ⁻¹ – 1）和溢出检测的误解。学生经常错误地将数值位当作绝对值，而没有考虑 MSB 为 1 时的负权重。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导