📚 Year 12 OCR Computer Science: Common Misconceptions and Corrections | Year 12 OCR 计算机：常见误区与纠正方法
In Year 12 OCR Computer Science, students often encounter certain topics where persistent misconceptions take root. These misunderstandings can lead to avoidable marks lost in the exam. This article identifies the most common confusions and provides clear, focused corrections to help you build accurate mental models.
在 Year 12 OCR 计算机科学课程中，学生在某些主题上经常会形成根深蒂固的误解，这些误解可能导致考试中本可避免的失分。本文列举了最常见的混淆点，并提供清晰、针对性的纠正，帮助你建立准确的认知模型。
1. Bits and Bytes | 比特与字节
Many students use the terms “bit” and “byte” interchangeably, or assume that a kilobyte refers to 1000 bits. The fundamental distinction is: 1 byte = 8 bits. Storage capacity is almost always quoted in bytes (and their multiples, like KB, MB, GB), while network transmission speeds are typically measured in bits per second (bps).
许多学生将 “比特 (bit)” 和 “字节 (byte)” 混用，或误以为 1 KB 等于 1000 比特。基本区别在于：1 字节 = 8 比特。存储容量几乎总是以字节（及其倍数，如 KB、MB、GB）为单位，而网络传输速率通常以比特每秒 (bps) 来衡量。
This confusion often leads to miscalculating download times. A 1 MB file (8 Megabits) being transferred over a 1 Mbps connection will take at least 8 seconds, not 1 second. Always check the unit abbreviation: uppercase “B” signals bytes, lowercase “b” signals bits.
这种混淆经常导致下载时间的计算错误。一个 1 MB 的文件（8 兆比特）在 1 Mbps 的连接上传输至少需要 8 秒，而不是 1 秒。务必核对单位缩写：大写 “B” 表示字节，小写 “b” 表示比特。
2. Assembly Language vs Machine Code | 汇编语言与机器代码
A stubborn misconception is that assembly language is simply a human-readable version of machine code and hence the same thing. In reality, machine code is the binary pattern (e.g. 10100001) executed directly by the CPU, while assembly language uses mnemonics (e.g. MOV, ADD) and symbolic addresses. An assembler is required to translate assembly code into machine code.
一个顽固的误区是认为汇编语言只是机器代码的人类可读版本，因而二者等同。实际上，机器代码是 CPU 直接执行的二进制模式（如 10100001），而汇编语言使用助记符（如 MOV、ADD）和符号地址。必须通过汇编器将汇编代码翻译成机器代码才能运行。
While there is often a one-to-one correspondence between an assembly instruction and a machine code instruction, the representation is entirely different. Assembly is a low-level language but still needs translation; machine code is the raw instruction set.
虽然一条汇编指令通常对应一条机器代码指令，但两者的表示形式完全不同。汇编是一种低级语言，仍需翻译；机器代码才是原始的指令集。
3. Von Neumann vs Harvard Architecture | 冯·诺依曼架构与哈佛架构
Students often think the two architectures are just alternative names for the same design, or that one is strictly superior. The key difference lies in memory organisation. Von Neumann architecture uses a single shared memory space for both data and instructions, whereas Harvard architecture uses physically separate memories, allowing simultaneous access to instructions and data.
学生常认为这两种架构只是同一设计的不同名称，或者一种一定优于另一种。关键区别在于存储器组织。冯·诺依曼架构使用单一的共享存储器存放数据和指令，而哈佛架构使用物理上独立的存储器，允许同时访问指令和数据。
This distinction affects performance. In a pure Harvard design, the CPU can fetch an instruction and read data in the same clock cycle, reducing the von Neumann bottleneck. Modern processors often use a modified Harvard architecture, with separate caches for instructions and data inside the chip but a single main memory outside.
这一区别影响性能。在纯哈佛设计中，CPU 可以在同一时钟周期内取指令和读数据，从而减轻冯·诺依曼瓶颈。现代处理器常采用改进的哈佛架构，芯片内部有独立的指令缓存和数据缓存，但外部主存是单一的。
4. Two’s Complement Overflow | 二进制补码溢出
A frequent error is ignoring overflow when performing addition on two’s complement integers. An 8-bit two’s complement number has a valid range from -2⁷ (-128) to 2⁷ – 1 (127). If you add 127 (01111111) and 1 (00000001), the binary result is 10000000, which represents -128 in two’s complement, not +128. The result has wrapped around beyond the maximum representable positive value.
常见错误是在进行二进制补码加法时忽略溢出。一个 8 位二进制补码的合法范围是 -2⁷ (-128) 到 2⁷ – 1 (127)。如果把 127 (01111111) 和 1 (00000001) 相加，二进制结果是 10000000，在补码中表示 -128，而不是 +128。结果超出了最大可表示的正值，发生了回绕。
Overflow can be detected by examining the sign bits of operands and result: if two positive numbers produce a negative result, or two negative numbers produce a positive result, overflow has occurred. Do not assume that an overflow simply sets the carry flag; it sets the overflow flag (V) and can lead to logical errors in programs.
可以通过检查操作数和结果的符号位来检测溢出：若两个正数相加结果为负，或两个负数相加结果为正，则发生溢出。不要误以为溢出仅仅置位进位标志；它会置位溢出标志 (V)，并可能导致程序逻辑错误。
5. Classes and Objects in OOP | 面向对象中的类与对象
Many beginners treat “class” and “object” as synonyms. A class is a blueprint or template that defines the attributes and methods for a type of entity; an object is a specific instance of that class, created at runtime with concrete values for its attributes. You cannot call an instance method directly on a class without an object being instantiated.
许多初学者将 “类” 和 “对象” 视为同义词。类是一个蓝图或模板，定义了一类实体的属性和方法；对象是该类的具体实例，在运行时创建，其属性具有具体的值。没有实例化对象，就不能直接在类上调用实例方法。
For example, “Student” is a class, while “JaneDoe” with an age of 17 and a grade of “A” is an object. A common exam pitfall is writing pseudocode that attempts to access instance variables from the class itself rather than from an instance reference.
例如，”Student” 是一个类，而 “JaneDoe” 年龄 17 岁、成绩 “A” 是一个对象。考试中常见的陷阱是编写伪代码时试图从类本身而非实例引用访问实例变量。
6. Stacks and Queues | 栈与队列
Students regularly confuse stacks with queues, or assume they are just simple lists without distinct behaviour. The fundamental difference is the order of data retrieval: a stack operates on a Last In, First Out (LIFO) principle, while a queue operates on a First In, First Out (FIFO) principle.
学生经常混淆栈和队列，或以为它们只是没有特定行为的简单列表。根本区别在于数据取出顺序：栈采用后进先出 (LIFO) 原则，队列采用先进先出 (FIFO) 原则。
A stack is used for backtracking, function call frames, and undo mechanisms, where the most recently added item is needed first. A queue is suited for scheduling processes, print spoolers, and keyboard buffers, where the oldest request should be serviced first. In pseudocode, pushing and popping occur at the top of the stack, while enqueue and dequeue operate on the rear and front of a queue respectively.
栈用于回溯、函数调用帧和撤销机制，此时最近添加的项最先需要。队列适用于进程调度、打印缓冲和键盘缓冲区，最早进入的请求应最先得到服务。在伪代码中，压入和弹出在栈顶进行，而入队和出队分别在队列的尾部和头部操作。
7. Compilation and Interpretation | 编译与解释
A widespread oversimplification is that every high-level language is either compiled or interpreted, and that interpreted languages are always slower and less useful. In truth, a compiler translates the entire source code into machine code (or an intermediate representation) before execution, while an interpreter reads and executes the source code line by line, without producing a standalone executable.
一种普遍的过度简化是认为每种高级语言要么是编译型，要么是解释型，且解释型语言总是更慢、用处更小。实际上，编译器在执行前将整个源代码翻译为机器代码（或某种中间表示），而解释器逐行读取并执行源代码，不生成独立的可执行文件。
Many modern languages employ a hybrid approach. For example, Java source is compiled into platform-independent bytecode, which is then interpreted (or JIT-compiled) by the Java Virtual Machine. Python similarly compiles to bytecode at runtime. Therefore, the distinction is not always clean-cut, and exam questions may test your understanding of the translation process rather than a simple binary label.
许多现代语言采用混合方式。例如，Java 源代码先被编译为平台无关的字节码，然后由 Java 虚拟机解释（或即时编译）执行。Python 同样在运行时编译为字节码。因此，区分并非总是泾渭分明，试题可能考察你对翻译过程的理解，而非简单的二元标签。
8. TCP/IP and OSI Models | TCP/IP 与 OSI 模型
It is common for students to think that TCP/IP is just a simpler version of the OSI model with the same number of layers, or that OSI is the model used on the internet. The OSI (Open Systems Interconnection) model has seven layers: Application, Presentation, Session, Transport, Network, Data Link, and Physical. The TCP/IP model, which is the practical stack for the internet, is typically described with four layers: Application, Transport, Internet, and Network Interface.
学生普遍认为 TCP/IP 只是 OSI 模型的简化版且层数相同，或认为互联网正是使用 OSI 模型。OSI（开放系统互连）模型有七层：应用层、表示层、会话层、传输层、网络层、数据链路层和物理层。而 TCP/IP 模型，作为互联网的实际协议栈，通常描述为四层：应用层、传输层、互联网层和网络接口层。
The TCP/IP application layer roughly maps to the top three OSI layers, the transport layer corresponds to OSI Transport, the internet layer to OSI Network, and the network interface layer to the bottom two OSI layers. A question asking for the layer responsible for routing should be answered with the Internet (or Network) layer, depending on the model referenced.
TCP/IP 的应用层大致对应 OSI 的上三层，传输层对应 OSI 的传输层，互联网层对应 OSI 的网络层，网络接口层对应 OSI 的下两层。根据所引用的模型，关于路由功能所在的层次，应回答互联网层（或网络层）。
9. DELETE and DROP in SQL | SQL 中的 DELETE 与 DROP
A common slip is using DELETE and DROP as if they performed the same operation. DELETE is a Data Manipulation Language (DML) statement that removes rows from a table, optionally using a WHERE clause to filter specific rows. The table structure, indexes, and permissions remain intact. A DELETE operation can be rolled back if wrapped in a transaction.
常见错误是将 DELETE 与 DROP 视为执行相同操作。DELETE 是一种数据操作语言 (DML) 语句，用于删除表中的行，可以选择性地使用 WHERE 子句过滤特定行。表结构、索引和权限保持原样。若包裹在事务中，DELETE 操作可以回滚。
DROP, on the other hand, is a Data Definition Language (DDL) statement that removes an entire database object, such as a table, view, or database. Once DROP TABLE is executed, all data, structure, and associated indexes are permanently removed, and typically the operation cannot be rolled back because DDL commands often auto-commit.
而 DROP 是一种数据定义语言 (DDL) 语句，用于删除整个数据库对象，如表、视图或数据库。一旦执行 DROP TABLE，所有数据、结构和关联索引将永久删除，且通常无法回滚，因为 DDL 命令往往自动提交。
10. Data Protection Act vs Computer Misuse Act | 数据保护法与计算机滥用法
Many candidates mix up the Data Protection Act (DPA) and the Computer Misuse Act (CMA), believing both exist to combat hacking. The DPA governs how personal data should be collected, processed, and stored, giving rights to data subjects (such as the right to access their information) and imposing obligations on data controllers. Its focus is on protecting individuals’ privacy.
许多考生将数据保护法 (DPA) 与计算机滥用法 (CMA) 混为一谈，认为二者都是为了打击黑客行为。DPA 规范个人数据的收集、处理和存储方式，赋予数据主体权利（如其信息访问权），并对数据控制者施加义务，其重点是保护个人隐私。
In contrast, the Computer Misuse Act criminalises unauthorised access to computer material, unauthorised access with intent to commit further offences, and unauthorised acts with intent to impair the operation of a computer. This includes hacking, malware distribution, and denial-of-service attacks. While both laws deal with technology, the DPA concerns lawful data handling, and the CMA targets malicious activities with computer systems.
相比之下，计算机滥用法将与未经授权访问计算机材料、意图实施进一步犯罪而未经授权访问、以及意图破坏计算机运行的未经授权行为定性为刑事犯罪。这包括黑客入侵、恶意软件传播和拒绝服务攻击。尽管两部法律都与技术相关，但 DPA 针对合法数据处理，而 CMA 针对针对计算机系统的恶意活动。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导