📚 Year 11 OCR Computer Science Mock Exam Walkthrough | Year 11 OCR 计算机：单元测试模拟卷解析
Mock exams are one of the most effective ways to prepare for the real OCR GCSE Computer Science papers. This walkthrough takes you through a full Unit 1 (Computer Systems) mock paper, explaining the reasoning behind each answer and highlighting common pitfalls. Whether you're revising for an end‑of‑topic test or gearing up for the summer exams, this guided review will consolidate your knowledge and boost your confidence.
模拟考试是为真正 OCR GCSE 计算机科学考试做准备的最有效方法之一。本文带你完整走过一份单元一（计算机系统）模拟卷，解释每道题背后的推理，并指出常见失分点。无论你是在为章节测试复习，还是在为夏季大考做准备，这份带解析的回顾都能巩固你的知识、提升你的信心。
1. System Architecture: CPU and Performance | 系统架构：CPU 与性能
etic Logic Unit. The Control Unit fetches, decodes and coordinates the execution of instructions, while the ALU carries out all arithmetic (+ − × ÷) and logical (AND, OR, NOT) operations.
模拟卷的第一部分聚焦中央处理器。第 1 题要求描述控制单元和算术逻辑单元的作用。控制单元负责取指、译码并协调指令执行，而 ALU 执行所有算术（+ − × ÷）和逻辑（AND、OR、NOT）操作。
A tricky extension this year required explaining how clock speed, cache size and number of cores affect performance. A higher clock speed means more cycles per second, so instructions are processed faster. A larger cache stores more frequently accessed instructions close to the CPU, reducing the need to fetch from slower RAM. Multiple cores allow parallel processing of instructions, but the software must be designed to take advantage of them.
今年一道有难度的扩展题要求解释时钟频率、缓存大小和核心数如何影响性能。较高的时钟频率意味着每秒更多周期，指令处理更快。较大的缓存能存储更多常用指令靠近 CPU，减少从较慢 RAM 取指次数。多核支持指令并行处理，但软件必须设计成能利用多核优势。
2. Memory and Storage Hierarchy | 内存与存储层次结构
Question 3 compares RAM and ROM. RAM is volatile, read/write memory that holds the operating system, applications and data currently in use. ROM is non‑volatile, read‑only memory typically used to store the boot program (BIOS). Students often lose marks by saying ROM holds data that never changes; the mark scheme wants 'instructions that are not expected to change, like the bootloader'.
第 3 题比较 RAM 和 ROM。RAM 是易失性、可读写的存储器，保存当前正在使用的操作系统、应用和数据。ROM 是非易失性、只读存储器，通常用于存储启动程序（BIOS）。学生常因说 ROM 保存“永不改变的数据”而丢分；标准答案要求是“预计不会改变的指令，如引导加载程序”。
Virtual memory was another hot topic. When RAM is full, the OS moves less frequently used pages to a designated area on secondary storage. This allows more programs to run simultaneously, but accessing virtual memory is significantly slower, and excessive paging (thrashing) can cripple performance. The mock asked candidates to identify symptoms and solutions for a system thrashing.
虚拟内存是另一个热点话题。当 RAM 满时，操作系统会将不常用的页移到辅助存储上的指定区域。这允许同时运行更多程序，但访问虚拟内存明显更慢，过度分页（“抖动”）会严重拖累性能。模拟卷要求考生识别系统出现抖动时的症状和解决方案。
| Scenario | Likely Problem | Solution |
|---|---|---|
| Disk activity LED constantly on, performance very slow | Thrashing – excessive swapping | Add more RAM |
场景
磁盘活动灯常亮，性能极慢 – 抖动 – 过度的交换 – 增加 RAM
3. Wired and Wireless Networks | 有线与无线网络
Networking questions tested understanding of topologies and protocols. A star topology was diagrammed, and candidates had to give one advantage over a bus network. In a star, a single cable or device failure doesn't bring down the whole network, whereas in a bus, a break in the backbone isolates all devices on one side.
网络题测试对拓扑和协议的理解。试卷上画了一个星形拓扑图，考生需给出相比总线拓扑的一个优点。在星形中，单根线缆或设备故障不会导致整个网络瘫痪，而在总线拓扑中，主干线断开会隔离一侧的所有设备。
Protocol questions asked for the role of TCP/IP in the Internet layer and transport layer. TCP provides error‑free, ordered delivery of data; IP handles addressing and routing. The mock also explored Wi‑Fi frequency bands (2.4 GHz vs 5 GHz). 2.4 GHz provides better range and wall penetration but suffers more from interference; 5 GHz offers higher speeds and less congestion but shorter range.
协议题要求说明 TCP/IP 在 Internet 层和传输层的作用。TCP 提供无差错、有序的数据传输；IP 处理寻址与路由。模拟卷还探讨了 Wi‑Fi 频段（2.4 GHz 与 5 GHz）。2.4 GHz 提供更好的覆盖和穿墙能力，但更易受干扰；5 GHz 提供更高速度和更少拥塞，但覆盖距离较短。
4. Data Representation: From Bits to Words | 数据表示：从位到字
A 6‑mark question required conversion between denary, binary and hexadecimal. Candidates were given the denary number 170 and asked to show it as binary (10101010) and hex (AA). Marking tip: always show your working division by 2 or 16, even if the question doesn't demand it – it confirms your understanding and can pick up method marks.
一道 6 分题要求进行十进制、二进制和十六进制之间的转换。考生拿到十进制数 170，要求表示为二进制（10101010）和十六进制（AA）。批改提示：即便题目不要求，也务必展示除以 2 或 16 的计算过程——这能证实你的理解，并可能拿到步骤分。
Character encoding followed: how does the computer store the word 'OCR' in 8‑bit ASCII? ked how Unicode differs from ASCII. ASCII uses 7 or 8 bits, representing 128 or 256 characters; Unicode uses up to 32 bits, enabling representation of characters from virtually all writing systems.
随后是字符编码：计算机如何用 8‑bit ASCII 存储单词“OCR”？O = 79 (01001111)，C = 67 (01000011)，R = 82 (01010010)。一道扩展题问 Unicode 与 ASCII 有何不同。ASCII 使用 7 或 8 位，表示 128 或 256 个字符；Unicode 最多使用 32 位，几乎能表示所有书写系统的字符。
Image and sound representation appeared as a final calculation: file size of a 30‑ e 44.1 kHz, bit depth 16, stereo). Size = 44100 × 16 × 2 × 30 = 42,336,000 bits ≈ 5.04 MB.
图像与声音表示作为最后一道计算题出现：一段 30 秒无压缩录音的文件大小（采样率 44.1 kHz，位深度 16，立体声）。大小 = 44100 × 16 × 2 × 30 = 42,336,000 比特 ≈ 5.04 MB。
5. Logic Gates and Truth Tables | 逻辑门与真值表
The electronics section asked for the truth table of a half‑adder. Inputs A and B produce Sum (A XOR B) and Carry (A AND B). Many candidates confuse half‑adder with full‑adder; a full adder also has a Carry In input. Make sure you can draw and label the logic circuit symbols for AND, OR, NOT, XOR gates as per OCR's preferred shapes.
电子学部分要求写出半加器的真值表。输入 A 和 B 产生 Sum（A XOR B）和 Carry（A AND B）。许多考生混淆半加器和全加器；全加器还有一个 Carry In 输入。务必能按 OCR 推荐的图形画出并标注 AND、OR、NOT、XOR 门的逻辑电路符号。
| A | B | Sum | Carry |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
Boolean simplification was a surprise for some: simplify A ⊕ B when A = 1, B = 1 → 0. Understanding that XOR gives 1 when inputs differ is key.
布尔简化让一些人意外：当 A = 1, B = 1 时，化简 A ⊕ B → 0。理解异或门在输入不同时输出 1 是关键。
6. Algorithms: Flowcharts and Pseudocode | 算法：流程图与伪代码
e common error was failing to update the loop counter or misreading the decision diamond ('Is guess = secret?'). Practice dry‑running algorithms with a table of variable states; it is a high‑marks skill.
给出一个猜数游戏的流程图，要求考生追踪执行过程。常见错误是未能更新循环计数器，或误读判断框（“猜测 = 秘密？”）。建议用变量状态表练习下手执行算法；这是一项高分技能。
A 10‑mark pseudocode question involved finding the highest value in an array. The solution requires a loop iterating through the array, comparing each element with a 'max' variable and updating it when a larger value is found. Marks were awarded for correct indentation, variable declaration and boundary condition handling (empty array).
一道 10 分的伪代码题涉及查找数组中的最大值。解法需要循环遍历数组，比较每个元素与一个“max”变量，并在发现更大值时更新。正确的缩进、变量声明以及边界条件处理（空数组）均可获得分数。
- INDENTATION: Improves readability – mandatory in Python, and OCR expects logical indentation in pseudocode.
- INDENTATION：提高可读性——在 Python 中必须，OCR 期望伪代码中有逻辑缩进。
- INITIALIZATION: Set max to first element or smallest possible value.
- INITIALIZATION：将 max 设为第一个元素或可能的最小值。
- EDGE CASE: If array is empty, output a suitable message.
- EDGE CASE：若数组为空，输出合适的信息。
7. Programming Fundamentals: Lines of Code | 编程基础：几行代码
Short code‑reading questions tested knowledge of data types (integer, real, Boolean, character, string), casting and operators. A line like result = (int)age + " years" contained a deliberate error: you cannot concatenate an integer to a string without converting it first. The fix is result = str(age) + " years".
简短的代码阅读题测试了对数据类型（整型、实型、布尔、字符、字符串）、强制转换和运算符的掌握。类似 result = (int)age + " years" 的语句故意包含错误：未先转换前，不能将整型与字符串拼接。修正为 result = str(age) + " years"。
Loop structures were examined: candidates had to explain the difference between a count‑controlled FOR loop and a condition‑controlled WHILE loop, and when each is appropriate. A FOR loop is used when the number of iterations is known in advance; a WHILE loop is used when iteration depends on a condition that may change during execution.
考查了循环结构：考生必须解释计数控制型 FOR 循环与条件控制型 WHILE 循环的区别，以及各自适用的场景。当迭代次数事先已知时使用 FOR 循环；当迭代依赖于在执行过程中可能变化的条件时使用 WHILE 循环。
8. System Security: Threats and Defences | 系统安全：威胁与防护
A scenario described a school network hit by ransomware. Candidates were asked to identify the attack type and recommend preventative measures. Ransomware encrypts files and demands payment for the decryption key. Prevention includes regular, tested backups stored offline, up‑to‑date anti‑malware, user education about phishing emails, and the principle of least privilege (users only have the access they need).
一个场景描述了学校网络遭受勒索软件攻击。考生需识别攻击类型并推荐预防措施。勒索软件加密文件，并要求支付赎金以获取解密密钥。预防措施包括定期进行并测试的离线备份、最新的反恶意软件、针对钓鱼邮件的用户教育，以及最小权限原则（用户仅拥有必需的访问权限）。
Other threats covered: SQL injection (validating/sanitising user input, using parameterised queries), denial‑of‑service (firewalls, traffic filtering) and social engineering. The mock highlighted that the strongest technical defences can be bypassed if an employee reveals their password over the phone.
涵盖的其他威胁：SQL 注入（验证/净化用户输入，使用参数化查询）、拒绝服务（防火墙、流量过滤）以及社会工程。模拟卷强调，如果员工在电话中透露密码，再强大的技术防御也会被绕过。
9. Legal, Ethical and Environmental Concerns | 法律、伦理与环境问题
New for the specification, questions asked about the Data Protection Act 2018 (UK GDPR), Computer Misuse Act 1990, and Copyright, Designs and Patents Act. Responses had to link real‑world actions to specific offences: unauthorised access to a computer system (Section 1, CMA), unauthorised modification of data (Section 3). A common mistake was confusing the DPA with the CMA – the DPA governs personal data, while the CMA criminalises hacking.
作为考纲新增内容，题目涉及《2018 年数据保护法》（英国 GDPR）、《1990 年计算机滥用法》以及《版权、设计和专利法》。回答必须将现实行为与具体犯罪联系起来：未经授权访问计算机系统（CMA 第 1 条），未经授权修改数据（第 3 条）。常见错误是混淆 DPA 与 CMA——DPA 管辖个人数据，而 CMA 将黑客行为入罪。
Environmental impacts considered the energy consumption of data centres and the disposal of e‑waste. The mock asked for two ways a school can reduce its digital carbon footprint: using cloud storage to power down local servers when not needed, and enabling sleep modes on classroom computers.
环境影响考虑了数据中心的能耗和电子垃圾的处理。模拟卷要求给出学校降低数字碳足迹的两种方法：使用云存储以便在不需要时关闭本地服务器，以及为教室计算机启用休眠模式。
10. Problem Solving and Computational Thinking in the Exam | 考试中的问题求解与计算思维
The final section of the mock paper was a long‑form problem requiring decomposition, pattern recognition and abstraction. Candidates had to design a solution to a timetable clash checker. Decomposition means breaking the problem into smaller parts (input classes, detect overlaps, output conflict). Pattern recognition identifies that checking overlap is similar to comparing time intervals. Abstraction involves ignoring non‑essential details like teacher names and focusing on start/end times.
模拟卷的最后一部分是一道长问题，要求分解、模式识别和抽象。考生需要设计一个课表冲突检查器。分解指将问题拆成较小部分（输入课程、检测重叠、输出冲突）。模式识别发现冲突检查类似于比较时间区间。抽象则忽略教师姓名等不重要的细节，聚焦于开始/结束时间。
Marking feedback showed that many students lost marks by jumping straight to code without first writing a high‑level plan. OCR examiners reward a structured approach: define inputs, outputs, process and test plan. Even if your code is incomplete, a clear plan demonstrates computational thinking and secures significant marks.
阅卷反馈显示，许多学生因直接写代码而跳过了先写高层计划的步骤，从而失分。OCR 考官奖励结构化方法：定义输入、输出、处理流程和测试计划。即使代码未完成，清晰的计划也能展示计算思维，从而确保大量分数。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图