Year 12 CIE Computer Science: Unit Test Mock Exam Walkthrough | Year 12 CIE 计算机：单元测试模拟卷解析

📚 Year 12 CIE Computer Science: Unit Test Mock Exam Walkthrough | Year 12 CIE 计算机：单元测试模拟卷解析

This article provides a detailed walkthrough of a typical Year 12 CIE Computer Science unit test, covering core topics such as data representation, logic gates, networking, processor architecture, programming fundamentals, and system software. Each question is broken down step by step with clear explanations to help you refine your exam technique and deepen your understanding of key concepts.

本文详尽解析了一套典型的 Year 12 CIE 计算机单元测试，涵盖数据表示、逻辑门、网络、处理器架构、编程基础与系统软件等核心主题。每道题目都逐层分解，并附上清晰的解释，帮助大家完善应试技巧，加深对关键概念的理解。

1. Mock Exam Overview | 模拟卷概览

The simulated unit test comprises ten questions drawn from the AS-Level syllabus, targeting fundamental knowledge retrieval, application, and analytical skills. It mirrors the structure of a typical Cambridge assessment, mixing short-answer items with slightly extended responses. A thorough review of these questions will reinforce your ability to manage time and produce accurate, concise answers under exam conditions.

本套模拟卷由十道题目组成，选自 AS 阶段考纲，兼顾基础知识再现、应用与分析能力。试卷结构模拟典型剑桥评估，混合了简答题与略需展开的题型。全面复习这些题目将强化你在考试环境下管理时间、写出准确简洁答案的能力。

2. Question 1: Binary to Hexadecimal Conversion | 二进制与十六进制转换

Question: Convert the 8-bit binary number 10110110 into its hexadecimal equivalent. Show the grouping clearly.

题目：将 8 位二进制数 10110110 转换为对应的十六进制值，并清晰展示分组过程。

Solution: Split the binary digits into two nibbles (4-bit groups): 1011 and 0110. Evaluate each nibble independently. 1011 in binary equals 1×8 + 0×4 + 1×2 + 1×1 = 11, which corresponds to the hex digit B. 0110 equals 0×8 + 1×4 + 1×2 + 0×1 = 6, giving the hex digit 6. Therefore, the hexadecimal representation is B6.

解答：将二进制位分成两个半字节（4 位一组）：1011 和 0110。分别计算每组的十进制值。1011 对应 1×8 + 0×4 + 1×2 + 1×1 = 11，即十六进制数字 B。0110 对应 0×8 + 1×4 + 1×2 + 0×1 = 6，即数字 6。因此，十六进制表示为 B6。

Key exam tip: Always check that you are grouping from the right in multi-byte conversions, and remember that 10–15 map to A–F. A common mistake is misreading the nibble order when dealing with longer binary strings.

关键考试贴士：进行多字节转换时，务必从右开始分组，并记住 10–15 对应 A–F。常见错误是处理较长二进制串时弄错了半字节的排列顺序。

3. Question 2: Logic Gates and Truth Table | 逻辑门与真值表

Question: For the Boolean expression X = (A AND B) OR (NOT C), draw the logic circuit and construct the corresponding truth table.

题目：对于布尔表达式 X = (A AND B) OR (NOT C)，画出逻辑电路并构建相应的真值表。

Circuit description: The circuit requires an AND gate with inputs A and B, a NOT gate with input C, and an OR gate that takes the output of the AND gate and the output of the NOT gate. The final output is X. Although a diagram cannot be reproduced here, you should label inputs A, B, C on the left, then place an AND gate symbol, a NOT gate (triangle with small circle), and merge their outputs into an OR gate pointing to X.

电路描述：电路需要一个与门接收输入 A、B，一个非门接收输入 C，以及一个或门接收与门输出和非门输出。最终输出为 X。虽然此处无法绘制实际图形，考试时应在左侧标注输入 A、B、C，然后放置与门符号、非门（三角形加小圈）符号，并将它们的输出汇入或门，最终指向 X。

A	B	C	NOT C	A AND B	X
0	0	0	1	0	1
0	0	1	0	0	0
0	1	0	1	0	1
0	1	1	0	0	0
1	0	0	1	0	1
1	0	1	0	0	0
1	1	0	1	1	1
1	1	1	0	1	1

The truth table confirms that X is 1 when C is 0, regardless of A and B, and also when both A and B are 1 even if C is 1. Always double-check intermediate columns like NOT C to avoid trivial errors that could cost marks.

真值表确认了当 C 为 0 时无论 A、B 为何值 X 都为 1，此外当 A 和 B 均为 1 时即使 C 为 1 X 也为 1。始终仔细检查中间列（如 NOT C），避免因小失误而失分。

4. Question 3: Network Topologies | 网络拓扑

Question: Compare the star and bus network topologies. State two advantages and two disadvantages of each topology.

题目：比较星型和总线型网络拓扑。分别列出每种拓扑的两个优点和两个缺点。

Star topology: Each node connects to a central switch or hub. Advantages – if one cable fails, only the attached node is affected; troubleshooting is straightforward. Disadvantages – if the central device fails, the whole network goes down; requires more cabling than bus.

星型拓扑：每个节点连接到中央交换机或集线器。优点 – 一条电缆故障仅影响所连节点；故障排除简便。缺点 – 中央设备故障会导致全网瘫痪；所需电缆比总线型更多。

Bus topology: All nodes share a single backbone cable. Advantages – cheaper to install because less cabling is needed; simple to add new nodes. Disadvantages – if the backbone breaks, the entire network can fail; performance degrades with heavy traffic due to collisions.

总线型拓扑：所有节点共享一根主干电缆。优点 – 安装成本较低，因为需要更少的电缆；添加新节点简单。缺点 – 主干断裂会导致全网故障；因冲突问题，高负载时性能下降严重。

5. Question 4: Processor Architecture | 处理器架构

Question: Describe the fetch–decode–execute cycle performed by a Von Neumann processor. Name three registers that are directly involved in this cycle.

题目：描述冯·诺依曼架构处理器执行的取指–译码–执行周期。指出直接参与该周期的三个寄存器。

The fetch stage: The Program Counter (PC) holds the address of the next instruction. This address is sent to the Memory Address Register (MAR), and a read signal is issued. The instruction stored at that address is placed into the Memory Data Register (MDR) and then copied to the Current Instruction Register (CIR). The PC is incremented to point to the next instruction.

取指阶段：程序计数器 (PC) 存放下一条指令的地址。该地址被送入存储器地址寄存器 (MAR)，并发出读信号。存储在该地址处的指令被放入存储器数据寄存器 (MDR)，然后复制到当前指令寄存器 (CIR)。随后 PC 递增以指向下一条指令。

The decode stage: The Control Unit interprets the bit pattern in the CIR, identifying the opcode and operand(s). The execute stage: The processor carries out the required operation, which may involve the ALU, memory access, or I/O. Key registers directly involved are PC, MAR, MDR, CIR, and Accumulator. You could name any three, e.g., PC, MAR, and CIR.

译码阶段：控制单元解释 CIR 中的位模式，识别操作码与操作数。执行阶段：处理器执行所需操作，可能涉及 ALU、存储器访问或 I/O。直接参与的关键寄存器包括 PC、MAR、MDR、CIR 和累加器。答题时可任选三个，例如 PC、MAR 和 CIR。

6. Question 5: Data Structures and Arrays | 数据结构与数组

Question: Define a record data structure and explain how it differs from a 1D array. Provide a short pseudocode example that declares a record named Student with fields Name, ID, and Grade.

题目：定义记录数据结构，并解释它与一维数组的区别。用简短的伪代码声明一个名为 Student 的记录，包含字段 Name、ID 和 Grade。

A record is a composite data type that groups multiple fields of possibly different data types under a single identifier. In contrast, a 1D array is a collection of elements that must all be of the same data type. A record allows mixed types, making it ideal for representing entities with differing attributes.

记录是一种复合数据类型，它将多个可能类型不同的字段组合在一个标识符下。相反，一维数组是必须由相同数据类型元素组成的集合。记录允许混合类型，因此非常适合表示具有不同属性的实体。

Pseudocode example:

TYPE Student
DECLARE Name : STRING
DECLARE ID : INTEGER
DECLARE Grade : CHAR
ENDTYPE

伪代码示例：

TYPE Student
DECLARE Name : STRING
DECLARE ID : INTEGER
DECLARE Grade : CHAR
ENDTYPE

7. Question 6: Programming Fundamentals and Iteration | 编程基础与迭代

Question: Using pseudocode, write a procedure that outputs the first n terms of the Fibonacci sequence. The sequence begins with 0 and 1, and each subsequent term is the sum of the two preceding terms.

题目：使用伪代码编写一个过程，输出斐波那契数列的前 n 项。数列以 0 和 1 开始，后续每一项都是前两项之和。

Solution approach: Use a loop from 1 to n. For the first term output 0, then 1, and then compute next terms. A more elegant solution initialises two variables a = 0, b = 1, and uses a counter. Example pseudocode:

解题思路：使用从 1 到 n 的循环，先输出 0 和 1，然后计算后续项。更简洁的方案是初始化两个变量 a=0、b=1，并使用计数器。示例伪代码：

PROCEDURE Fibonacci(n)
DECLARE a, b, next, count : INTEGER
a ← 0
b ← 1
FOR count ← 1 TO n
OUTPUT a
next ← a + b
a ← b
b ← next
NEXT count
ENDPROCEDURE

Examiners look for correct initialisation, proper loop boundaries, and the logical shift of values. Ensure that your pseudocode is well-structured and not language-specific.

考官看重正确的初始化、合适的循环边界以及值的逻辑位移。确保伪代码结构清晰，且不依赖于特定编程语言。

8. Question 7: System Software and Operating System Functions | 系统软件与操作系统功能

Question: List four essential functions of an operating system and briefly describe what each one does.

题目：列出操作系统的四个基本功能，并简要描述每个功能的作用。

Memory management: Allocates and deallocates RAM for processes, and manages virtual memory when physical memory is full.
Processor scheduling: Decides which process gets CPU time and in what order, enabling multitasking.
File management: Organises and controls access to files on storage devices, maintaining directory structures and permissions.
I/O management: Coordinates communication between the computer and peripheral devices through device drivers.

中文配对：

内存管理：为进程分配和回收 RAM，并在物理内存不足时管理虚拟内存。
处理器调度：决定哪个进程获得 CPU 时间及执行顺序，实现多任务处理。
文件管理：组织并控制对存储设备上文件的访问，维护目录结构与权限。
I/O 管理：通过设备驱动程序协调计算机与外围设备间的通信。

9. Question 8: Packet Switching and Protocols | 分组交换与协议

Question: Explain how packet switching works when sending a large file over a network. State why it is more efficient than circuit switching for bursty data. Also, identify the protocol layer responsible for routing packets.

题目：解释通过网络发送大文件时分组交换的工作原理。说明为什么对于突发性数据它比电路交换更高效。此外，指出负责路由数据包的协议层。

In packet switching, the file is broken into small packets, each containing a header with source and destination addresses and a sequence number. Packets travel independently via the most efficient routes available at the time. At the destination, they are reassembled into the original order using the sequence numbers. This approach is efficient for bursty data because network resources are shared dynamically; idle time is not wasted. Routing is handled by the Network layer (Layer 3) of the TCP/IP model, with IP being the key protocol.

在分组交换中，文件被切分成小的数据包，每个包包含带有源地址、目的地址以及序号的头部。数据包根据当前可用的最高效路径独立传输。到达目的地后，利用序号将它们按原始顺序重组。对于突发性数据这非常高效，因为网络资源动态共享，不会浪费空闲时间。路由功能由 TCP/IP 模型的网络层（第 3 层）处理，IP 是其中的关键协议。

10. Question 9: Security and Ethical Issues | 安全与伦理问题

Question: Describe how a firewall helps protect a network, and discuss two ethical concerns related to the increasing use of personal data by online platforms.

题目：描述防火墙如何帮助保护网络安全，并讨论与在线平台日益使用个人数据相关的两个伦理问题。

A firewall monitors incoming and outgoing network traffic and applies a set of security rules to block potentially harmful packets. It can be hardware-based, software-based, or a combination of both, and it is often placed between an internal network and the internet to prevent unauthorised access.

防火墙监控进出网络的流量，并应用一系列安全规则来阻止潜在有害的数据包。它可以是基于硬件的、基于软件的或两者的组合，通常部署在内部网络与互联网之间，以防止未授权访问。

Ethical concerns: First, informed consent – users often are not fully aware of how their data is being collected and used. Second, algorithmic bias – personal data can be used to make automated decisions that discriminate against certain groups. Both issues challenge privacy and fairness.

伦理问题：第一，知情同意——用户通常不完全清楚自己的数据如何被收集和使用。第二，算法偏见——个人数据可能被用于自动决策，导致对某些群体的歧视。这两个问题都挑战了隐私与公平性。

11. Question 10: Error Detection | 差错检测

Question: A byte 10110011 is sent using even parity. What is the parity bit? Subsequently, explain how a checksum can detect errors in a block of data.

题目：使用偶校验发送字节 10110011，校验位应为何值？随后解释校验和如何检测数据块中的差错。

Even parity requires that the total number of 1s, including the parity bit, be even. The byte 10110011 contains five 1s (an odd number). Therefore, the parity bit must be set to 1, making the total count of 1s equal to 6 (even).

偶校验要求包括校验位在内的 1 的总数为偶数。字节 10110011 含有五个 1（奇数），因此校验位必须设为 1，使 1 的总数变为 6（偶数）。

A checksum is an algorithm that sums up the data bytes in a block. The sender computes a checksum value and appends it to the data. The receiver repeats the calculation and compares the result. If the two checksums do not match, an error is flagged. While checksums are good at detecting accidental alterations, they are not reliable against intentional tampering.

校验和是一种将数据块中各字节相加的算法。发送方计算校验和值并将其附加到数据后。接收方重新计算并比较结果。若两次校验和不一致，则标示出现差错。校验和能够较好地检测意外更改，但对于蓄意篡改则不可靠。

12. Summary and Exam Tips | 总结与备考建议

This mock exam walkthrough demonstrates that solid understanding of core concepts, combined with disciplined presentation, is essential. Always underline keywords in questions, show working for conversions, label truth table columns clearly, and use standard pseudocode syntax. Practise past papers regularly and review common pitfalls such as confusing network layers or misidentifying register stages. Good luck with your revision!

本模拟卷解析表明，扎实掌握核心概念并保持严谨的表达至关重要。务必在题目中划出关键词，转换题展示步骤，清晰标注真值表列名，使用标准的伪代码语法。定期练习历年真题，回顾常犯错误，例如混淆网络层次或错误识别寄存器阶段。祝备考顺利！

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Year 12 CIE Computer Science: Unit Test Mock Exam Walkthrough | Year 12 CIE 计算机：单元测试模拟卷解析