📚 Year 10 OCR Computer Science: Unit Test Mock Paper Analysis | Year 10 OCR 计算机：单元测试模拟卷解析
This article provides a detailed walkthrough of a mock unit test for Year 10 OCR Computer Science. It is designed to help students consolidate their knowledge, understand common question types, and improve exam technique. Each section breaks down a sample question, offers a model answer, and highlights key concepts you need to master.
本文为 Year 10 OCR 计算机科学单元测试模拟卷提供详细解析，旨在帮助学生巩固知识、熟悉常见题型并提升应试技巧。每个部分拆解一道样题，给出参考答案，并强调你需要掌握的核心概念。
1. Mock Paper Structure and Overview | 模拟卷结构与概述
This mock paper mimics the format of an OCR GCSE Computer Science unit test. It contains a mixture of multiple-choice, short-answer, and extended-writing questions, covering topics from systems architecture to programming fundamentals. The total time allowed is 45 minutes, and the total marks available are 40. Understanding the structure helps you manage your time effectively during the real assessment.
本模拟卷仿照 OCR GCSE 计算机科学单元测试的格式。试卷包含选择题、简答题和扩展写作题，覆盖从系统架构到编程基础的各类主题。总考试时间为 45 分钟，总分为 40 分。了解试卷结构有助于在实际评估中有效管理时间。
The paper is divided into two main sections: Section A features ten multiple-choice questions (1 mark each) that test discrete facts and quick problem-solving. Section B contains four short-answer questions (2–6 marks each) and one 8-mark extended question that expects analysis and evaluation. We will go through selected representative questions in the following sections.
试卷分为两大部分：A 部分包含十道选择题（每题 1 分），考查离散知识点和快速解题能力。B 部分包含四道简答题（每题 2–6 分）和一道 8 分的拓展题，要求进行分析与评价。我们将在以下小节中解析具有代表性的题目。
2. Question 1: Binary to Decimal Conversion | 问题 1：二进制转十进制
Question: Convert the binary number 10110110 into decimal. Show your working. (2 marks)
问题：将二进制数 10110110 转换为十进制。请展示计算过程。（2 分）
Answer: 182
答案：182
Working: Write down the place values for an 8-bit binary number, from 2⁷ (128) down to 2⁰ (1). Then multiply each bit by its place value and sum the results.
计算过程：写出 8 位二进制数的每一位位值，从 2⁷ (128) 到 2⁰ (1)。然后将每一位数字与其位值相乘，并将结果相加。
1 × 128 = 128
0 × 64 = 0
1 × 32 = 32
1 × 16 = 16
0 × 8 = 0
1 × 4 = 4
1 × 2 = 2
0 × 1 = 0
128 + 32 + 16 + 4 + 2 = 182
A common mistake is to misalign the bits with the place values or to forget that the leftmost bit is the most significant. Always start from the right-hand side with 2⁰. The examiner expects you to show the addition step clearly to gain full marks.
常见错误是将数字位与位值错位，或者忘记最左边的位是最高有效位。务必从右侧的 2⁰ 开始。考官期望你清晰展示加法步骤以获得满分。
3. Question 2: Logic Gates and Truth Tables | 问题 2：逻辑门与真值表
Question: Complete the truth table for the logic circuit: Q = (A AND B) OR (NOT C). (3 marks)
问题：完成逻辑电路真值表：Q = (A AND B) OR (NOT C)。（3 分）
The truth table should have columns for A, B, C, A AND B, NOT C, and Q. There are eight rows (2³ combinations).
真值表应包含列：A、B、C、A AND B、NOT C 和 Q。共有八行 (2³ 种组合)。
| A | B | C | A AND B | NOT C | Q |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 1 |
. The output Q is 1 whenever (A AND B) is 1, or when C is 0. Notice that the only case where Q is 0 is when C=1 and at least one of A or B is 0, destroying both paths to a 1.
关键在于逐步计算表达式。首先计算 AND 门的输出，然后对 C 进行 NOT 运算，最后用 OR 运算符组合。当 (A AND B) 为 1 时，或当 C 为 0 时，输出 Q 为 1。注意只有一种情况 Q 为 0：即 C=1 且 A 或 B 至少有一个为 0，从而堵住所有通往 1 的路径。
4. Question 3: Sorting Algorithms | 问题 3：排序算法
Question: Describe the steps of a bubble sort to arrange the list [5, 3, 8, 1] into ascending order. State the number of comparisons and swaps in each pass. (4 marks)
问题：描述使用冒泡排序将列表 [5, 3, 8, 1] 升序排列的步骤。并说明每一趟的比较次数和交换次数。（4 分）
A bubble sort works by repeatedly stepping through the list, comparing adjacent items and swapping them if they are in the wrong order. The process is repeated until no swaps are needed.
冒泡排序通过反复遍历列表，比较相邻元素，若顺序错误则交换。重复此过程直到不再需要交换。
Pass 1: . Compare 5 and 8 → no swap. Compare 8 and 1 → swap → [3,5,1,8]. Comparisons: 3, Swaps: 2.
Pass 2: . Compare 5 and 1 → swap → [3,1,5,8]. Compare 5 and 8 → no swap. Comparisons: 3, Swaps: 1.
Pass 3: [1,3,5,8]. Compare 3 and 5 → no swap. Compare 5 and 8 → no swap. Comparisons: 3, Swaps: 1.
Pass 4: Compare 1 and 3 (no swap), 3 and 5, 5 and 8. Comparisons: 3, Swaps: 0. List is sorted.
Bubble sort is not the most efficient algorithm for large lists, but it is easy to implement and useful for understanding basic sorting concepts. In the exam, you must show the state of the list after each pass and count comparisons correctly. Comparisons per pass equals n–1, with n decreasing in optimised versions.
冒泡排序对于大型列表并非最高效的算法，但它易于实现，有助于理解基本排序概念。在考试中，你必须展示每一趟后列表的状态，并正确计算比较次数。每趟比较次数等于 n–1，在优化版本中 n 逐渐减少。
5. Question 4: Network Topologies | 问题 4：网络拓扑
Question: Compare a star network topology with a mesh topology. Give one advantage and one disadvantage of each. (4 marks)
问题：比较星型拓扑和网状拓扑。各给出一个优点和一个缺点。（4 分）
In a star topology, all devices connect to a central switch or hub. In a full mesh topology, every device is directly connected to every other device. The difference lies in redundancy, cost, and fault tolerance.
在星型拓扑中，所有设备连接到一个中央交换机或集线器。在全网状拓扑中，每个设备都与其他所有设备直接相连。区别在于冗余度、成本和容错性。
- Star advantage: If one cable fails, only that device is affected; the rest of the network continues to function. 中文：星型拓扑优点：如果一条电缆故障，只有该设备受影响；网络其余部分仍可正常工作。
- Star disadvantage: The central device is a single point of failure – if it goes down, the whole network fails. 中文：星型拓扑缺点：中央设备是单点故障 – 若其失效，整个网络瘫痪。
- Mesh advantage: Extremely high fault tolerance because multiple paths exist; a failure in one link does not break communication. 中文：网状拓扑优点：极高的容错性，因为存在多条路径；一条链路故障不会中断通信。
- Mesh disadvantage: Very expensive and complicated to cable, as the number of connections grows quadratically with the number of devices. 中文：网状拓扑缺点：布线成本极高且非常复杂，因为连接数随设备数量呈平方增长。
In OCR exams, you might be asked to identify topologies from diagrams or choose a suitable topology for a given scenario, such as a school network (star) or a backbone network (partial mesh).
在 OCR 考试中，你可能需要从示意图中识别拓扑，或为给定场景（如学校网络选择星型、骨干网络选择部分网状）选择合适的拓扑。
6. Question 5: Python Programming – Variables and Data Types | 问题 5：Python 编程 – 变量与数据类型
Question: What is the output of the following Python code? (3 marks)
name = 'Ada' age = 17 score = 95.5 is_valid = True print(type(name), type(age), type(score), type(is_valid)) print(name + ' is ' + str(age) + ' years old.')
问题：以下 Python 代码的输出是什么？（3 分）
Answer:<class 'str'> <class 'int'> <class 'float'> <class 'bool'>Ada is 17 years old.
答案：<class 'str'> <class 'int'> <class 'float'> <class 'bool'>Ada is 17 years old.
This question tests basic data types and string concatenation. In Python, the type() function returns the class of the object. The variable name is a string, age is an integer, score is a float, and is_valid is a Boolean. To concatenate strings with numbers, you must cast the number to a string using str().
这道题考查基本数据类型和字符串拼接。在 Python 中，type() 函数返回对象的类。变量 name 是字符串，age 是整数，score 是浮点数，is_valid 是布尔型。要将字符串与数字拼接，必须使用 str() 将数字转换为字符串。
Common error: forgetting to convert age and getting a TypeError. Examiners want you to demonstrate awareness of strong typing and explicit conversion.
常见错误：忘记转换 age 而引发 TypeError。考官希望你能展示对强类型和显式转换的认识。
7. Question 6: Cybersecurity Threats | 问题 6：网络安全威胁
Question: Explain the difference between a brute-force attack and a denial-of-service (DoS) attack. (4 marks)
问题：解释暴力破解攻击与拒绝服务 (DoS) 攻击之间的区别。（4 分）
A brute-force attack is a trial-and-error method used to crack passwords or encryption keys by systematically trying every possible combination until the correct one is found. It targets confidentiality by gaining unauthorised access. A DoS attack, on the other hand, aims to make a service unavailable by flooding a server with bogus requests, consuming bandwidth or resources so legitimate users cannot connect.
暴力破解攻击是一种试错法，通过系统地尝试每一种可能的组合来破解密码或加密密钥，直至找到正确组合。它通过获得未授权访问来破坏机密性。而 DoS 攻击则旨在通过用虚假请求淹没服务器，耗尽带宽或资源，使得合法用户无法连接，从而使服务不可用。
Thus, the key difference lies in the objective: brute-force aims to gain access, while DoS aims to disrupt access. Defences also differ: account lockout policies and strong passwords deter brute-force, while firewalls and traffic filtering mitigate DoS.
因此，主要区别在于目标：暴力破解旨在获取访问权，而 DoS 旨在中断访问。防御措施也不同：账户锁定策略和强密码能抵御暴力破解，而防火墙和流量过滤可缓解 DoS。
In your answer, using technical language like 'exhaustive key search' and 'resource exhaustion' can earn higher marks.
在回答中使用如“穷举密钥搜索”和“资源耗尽”等技术性语言可获得更高分数。
8. Question 7: Ethical and Legal Issues | 问题 7：伦理与法律问题
Question: A company develops a mobile app that tracks users' location. Discuss one ethical concern and one legal requirement the company must consider under UK law. (4 marks)
问题：一家公司开发了一款追踪用户位置的移动应用。讨论一项公司必须考虑的伦理问题和一项根据英国法律必须满足的法律要求。（4 分）
Ethical concern: Users may not be fully aware of how their location data is used or shared, which violates the principle of informed consent. Even if legally permitted, continuous tracking can erode trust and intrude on personal privacy.
伦理问题：用户可能不完全清楚其位置数据如何被使用或共享，这违反了知情同意原则。即使法律允许，持续追踪也可能侵蚀信任并侵犯个人隐私。
Legal requirement: Under the UK General Data Protection Regulation (GDPR), the company must have a lawful basis for processing location data, obtain explicit consent, provide a clear privacy notice, and allow users to withdraw consent and request deletion of their data. Failure to comply can result in heavy fines.
法律要求：根据英国《通用数据保护条例》(GDPR)，公司必须有处理位置数据的合法依据，获取明确同意，提供清晰的隐私声明，并允许用户撤回同意和请求删除其数据。不合规可能导致巨额罚款。
This distinction between ethics and law is crucial in OCR Computer Science. Ethics relates to what is morally right, while law is about what is legally enforceable. Often they overlap, but not always.
伦理与法律之间的这种区别在 OCR 计算机科学中至关重要。伦理涉及道德上的正确性，而法律则关乎具有法律强制力的规定。它们经常重叠，但并不总是如此。
9. Question 8: Data Structures – Arrays and Lists | 问题 8：数据结构 – 数组与列表
Question: Explain the difference between a static array and a dynamic list. Give one advantage of each. (4 marks)
问题：解释静态数组与动态列表之间的区别。各给出一个优点。（4 分）
A static array has a fixed size determined at the time of creation. It stores elements of the same data type in contiguous memory locations. A dynamic list (such as a Python list) can grow or shrink during program execution and can hold mixed data types.
静态数组具有在创建时确定的固定大小，将同类型元素存储在连续的内存位置中。动态列表（如 Python 列表）可以在程序执行期间增长或收缩，并可包含混合数据类型。
- Static array advantage: Faster access to elements because memory addresses can be calculated directly using the base address and index; this enables O(1) time complexity for reads. 中文：静态数组优点：元素访问更快，因为可以直接使用基地址和索引计算内存地址；这使得读取时间复杂度为 O(1)。
- Dynamic list advantage: Flexibility – it can adjust to unknown data sizes, avoiding wasted space or overflow, and supports built-in methods for easy insertion and deletion. 中文：动态列表优点：灵活性 – 可适应未知数据规模，避免浪费空间或溢出，并支持内置方法以便于插入和删除。
In programming tasks, understanding these differences helps you choose the appropriate data structure for efficiency and memory management.
在编程任务中，理解这些差异有助于你选择合适的数据结构以实现高效的内存管理。
10. Question 9: Flowcharts and Pseudocode | 问题 9：流程图与伪代码
Question: Draw a flowchart or write pseudocode for an algorithm that inputs a number N and outputs the sum of all even numbers from 1 to N. (5 marks)
问题：绘制流程图或编写伪代码，设计一个算法：输入数字 N，输出从 1 到 N 之间所有偶数的和。（5 分）
Pseudocode solution:
BEGIN
INPUT N
sum ← 0
counter ← 2
WHILE counter ≤ N DO
sum ← sum + counter
counter ← counter + 2
ENDWHILE
OUTPUT sum
END
伪代码答案：
Explanation: The algorithm uses a while loop starting at 2, the first even number. It adds the current even number to the sum and increments by 2 to reach the next even number, stopping when the counter exceeds N. This approach avoids checking every number with an IF condition, making it more efficient.
解释：该算法使用 while 循环，从 2（第一个偶数）开始。它将当前偶数累加到 sum 中，然后增加 2 来到达下一个偶数，当计数器超过 N 时停止。这种方法无需用 IF 条件检查每个数，因而效率更高。
Alternatively, a flowchart would contain an input/output parallelogram, a process rectangle for initialisation, a decision diamond for the loop condition, and arrows showing iteration. Both representations must show initialisation clearly and have a definite end.
另一种方案是用流程图，其中应该包含输入/输出平行四边形、初始化的处理矩形、判断循环条件的菱形以及表示迭代的箭头。两种表示形式都必须清晰显示初始化过程，并有明确的结束。
11. Question 10: System Software | 问题 10：系统软件
Question: State two functions of an operating system. For each function, give an example of how it manages computer resources. (4 marks)
问题：陈述操作系统的两个功能。对每个功能，举出一个管理计算机资源的例子。（4 分）
Function 1 – Memory management: The OS allocates RAM to running processes and ensures they do not interfere with each other. For example, it uses paging or segmentation to load programs into memory and swaps unused parts to virtual memory on disk when RAM is full.
功能 1 – 内存管理：操作系统为正在运行的进程分配 RAM，并确保它们互不干扰。例如，它使用分页或分段机制将程序加载到内存中，并在 RAM 满时将不常用部分换出到磁盘上的虚拟内存。
Function 2 – Processor scheduling: The OS decides which process gets CPU time and for how long, using algorithms like round-robin. This enables multitasking, giving the illusion that multiple programs run simultaneously on a single core.
功能 2 – 处理器调度：操作系统决定哪个进程获得 CPU 时间及获得多长时间，使用轮转调度等算法。这实现了多任务处理，营造出多个程序在单核上同时运行的错觉。
Other key functions include file management (organising storage in a hierarchical structure), user interface provision, and peripheral management through device drivers. Marks are awarded for linking each function to a clear resource-management example.
其他关键功能包括文件管理（以层次结构组织存储）、提供用户界面以及通过设备驱动程序管理外围设备。将每个功能与明确的资源管理示例关联起来可得满分。
12. Exam Tips and Common Pitfalls | 考试技巧与常见误区
Before you finish, check every command word in questions: 'State' requires a short fact, 'Describe' needs more detail, and 'Explain' demands a reason or cause. 'Discuss' expects both sides of an argument. Underlining key terms can keep your answer focused.
在完成前，检查每个问题中的指令词：“State” 要求简短事实，“Describe” 需要更多细节，“Explain” 则要求给出原因或因果。“Discuss” 则期望呈现论点的两个方面。在关键术语下划线可以让你的答案紧扣主题。
Avoid common pitfalls such as missing units in calculations, writing vague descriptions without technical vocabulary, or leaving questions blank. In algorithm questions, always trace with an example to verify correctness. For ethics and law questions, keep definitions distinct and back them up with named legislation (e.g., GDPR, Computer Misuse Act).
避免常见误区，如计算中遗漏单位、描述模糊缺乏专业术语、或留空白不答。在算法题中，务必用示例进行追踪以验证正确性。对于伦理与法律题，定义要明确，并以具体法规名称为佐证（如 GDPR、《计算机滥用法》）。
Finally, practise past papers under timed conditions. This mock analysis is a tool to illuminate the kind of thinking OCR examiners reward. As you revise, aim not just to know facts, but to apply and evaluate them confidently.
最后，请在限时条件下练习历年真题。本次模拟卷解析是一盏灯，照亮 OCR 考官所青睐的思维方式。在复习时，目标不仅是知道事实，而是能自信地应用和评价它们。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图