Year 12 CCEA Computer Science: Unit Test Mock Paper Analysis | Year 12 CCEA 计算机：单元测试模拟卷解析

📚 Year 12 CCEA Computer Science: Unit Test Mock Paper Analysis | Year 12 CCEA 计算机：单元测试模拟卷解析

This article provides a detailed walkthrough of a mock unit test for Year 12 CCEA Computer Science, breaking down key questions and model answers to reinforce essential concepts. We cover data representation, Boolean logic, programming fundamentals, algorithm tracing, and computer hardware, mirroring the style and rigour of real CCEA assessments.

本文为 Year 12 CCEA 计算机单元测试模拟卷提供详细解析，拆解典型题目与标准答案，巩固核心概念。内容涵盖数据表示、布尔逻辑、编程基础、算法追踪和计算机硬件，贴近真实 CCEA 考试的题型与难度。

1. Binary, Denary and Hexadecimal Conversions | 二进制、十进制与十六进制转换

A typical question asks: ‘Convert the denary number 219 into an 8‑bit binary number and then into its hexadecimal equivalent.’ First, find the binary: 219 – 128 = 91, so bit 7 is 1. 91 – 64 = 27, bit 6 is 1. 27 – 16 = 11, bit 4 is 1. 11 – 8 = 3, bit 3 is 1. 3 – 2 = 1, bit 1 is 1. 1 – 1 = 0, bit 0 is 1. This gives 11011011₂. For hexadecimal, split into nibbles: 1101 (D) and 1011 (B), so the answer is DB₁₆.

典型题目：”将十进制数 219 转换为 8 位二进制，再转换为十六进制。” 先求二进制：219 – 128 = 91，第 7 位为 1。91 – 64 = 27，第 6 位为 1。27 – 16 = 11，第 4 位为 1。11 – 8 = 3，第 3 位为 1。3 – 2 = 1，第 1 位为 1。1 – 1 = 0，第 0 位为 1，得到 11011011₂。分割为半字节：1101 (D) 和 1011 (B)，答案为 DB₁₆。

2. Two’s Complement Representation | 补码表示

To express –45 in 8‑bit two’s complement: write 45 in binary as 00101101₂. Invert all bits to get 11010010₂, then add 1, yielding 11010011₂. The most significant bit is the sign bit; 1 confirms a negative number. To verify, convert back: invert and add 1 to get 00101101₂, which is 45.

用 8 位补码表示 –45：先写出 45 的二进制 00101101₂，全部取反得到 11010010₂，再加 1，得到 11010011₂。最高位为符号位，1 表示负数。验证时取反加 1 得到 00101101₂，即 45。

3. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路

A common question provides a truth table for A AND (B OR NOT C). Fill in the output column by evaluating each row. For example, when A=1, B=0, C=1: B OR NOT C = 0 OR 0 = 0, so A AND 0 = 0. From the completed truth table, the circuit can be drawn: a NOT gate for C, an OR gate combining B and NOT C, and an AND gate taking A and the OR output.

常见题目给定 A AND (B OR NOT C) 的真值表。逐行求值。例如 A=1, B=0, C=1：B OR NOT C = 0 OR 0 = 0，A AND 0 = 0。根据完整真值表可绘出电路：C 接非门，B 与 NOT C 接或门，A 和或门输出接与门。

4. Trace Table for a Loop Algorithm | 循环算法的追踪表

Consider this pseudocode:

考虑以下伪代码：

total ← 0
FOR count ← 1 TO 4
    total ← total + count * 2
ENDFOR
OUTPUT total

Build a trace table: count=1, total=0+2=2; count=2, total=2+4=6; count=3, total=6+6=12; count=4, total=12+8=20. The final output is 20. Students often miss that the loop runs exactly 4 times and that the multiplication is performed before addition.

建立追踪表：count=1，total=0+2=2；count=2，total=2+4=6；count=3，total=6+6=12；count=4，total=12+8=20。最终输出 20。学生常忽视循环精确运行 4 次，且乘法优先于加法。

5. Arrays and Indexing | 数组与索引

Given the array scores = [12, 7, 19, 3, 15], what does scores[3] – scores[1] evaluate to? Note that many pseudocode languages use zero‑based indexing, but CCEA often uses 1‑based in exam contexts. With 1‑based indexing, scores[3] is 19 and scores[1] is 12, giving 7. Always check the indexing convention stated in the question.

给定数组 scores = [12, 7, 19, 3, 15]，scores[3] – scores[1] 的结果是多少？许多伪代码使用 0 基索引，但 CCEA 考题常采用 1 基索引。按 1 基索引，scores[3] = 19，scores[1] = 12，结果为 7。务必依据题目声明的索引惯例。

6. Validation and Verification | 数据验证与校验

Explain the difference between validation and verification using a data entry form for email addresses. Validation checks whether the data is sensible and reasonable, such as ensuring an email contains an ‘@’ symbol and a domain. Verification checks that the data entered matches the original source, for example asking the user to type the email twice and comparing both entries. Both are essential to reduce errors in information systems.

解释验证 (validation) 与校验 (verification) 的区别，以电子邮件地址的数据输入表单为例。验证是检查数据是否合理，例如确保邮箱包含 ‘@’ 符号和域名。校验是确认输入数据与原始来源一致，例如让用户输入两次邮箱并比较。两者对减少信息系统错误至关重要。

7. File Sizes and Compression | 文件大小与压缩

Calculate the uncompressed file size of a 30‑second sound recording with a sample rate of 44.1 kHz, 16‑bit sample resolution, and stereo (2 channels). File size = sample rate × resolution × channels × duration = 44100 × 16 × 2 × 30 = 42,336,000 bits, which is 5,292,000 bytes (approx 5.05 MB). Lossy compression, such as MP3, can reduce this drastically by discarding less audible frequencies, while lossless compression preserves all original data.

计算一段 30 秒录音的未压缩文件大小：采样率 44.1 kHz，16 位分辨率，立体声（2 声道）。文件大小 = 采样率 × 分辨率 × 声道数 × 时长 = 44100 × 16 × 2 × 30 = 42,336,000 位，即 5,292,000 字节（约 5.05 MB）。有损压缩（如 MP3）通过丢弃较不敏感的频率来大幅缩小体积，无损压缩则保留全部原始数据。

8. Ethernet and Network Protocols | 以太网与网络协议

Describe the role of the CSMA/CD protocol in Ethernet networks. CSMA/CD (Carrier Sense Multiple Access with Collision Detection) governs how devices share a common transmission medium. A device listens to the channel before transmitting; if no carrier is sensed, it sends its frame. While transmitting, it monitors for collisions. If a collision is detected, a jam signal is sent, and both devices wait a random backoff time before retransmitting. This protocol is vital in half‑duplex Ethernet but less used in modern full‑duplex switched networks.

描述 CSMA/CD 协议在以太网中的作用。CSMA/CD（载波侦听多路访问/冲突检测）规范设备共享传输介质的方式。设备发送前先监听信道；若无载波信号，则发送帧。发送同时监测碰撞；一旦检测到碰撞，发出阻塞信号，双方随机等待后重传。该协议在半双工以太网中至关重要，但在现代全双工交换网络中已较少使用。

9. Von Neumann Architecture and Registers | 冯·诺依曼架构与寄存器

Label the key registers in a Von Neumann CPU: Program Counter (PC) holds the address of the next instruction; Memory Address Register (MAR) holds the address being accessed; Memory Data Register (MDR) holds the data read or written; Current Instruction Register (CIR) holds the instruction currently being executed; and the Accumulator (ACC) stores intermediate results. The fetch‑decode‑execute cycle moves data between these registers and main memory via buses.

标注冯·诺依曼 CPU 的关键寄存器：程序计数器 (PC) 存放下一条指令地址；内存地址寄存器 (MAR) 存放正在访问的地址；内存数据寄存器 (MDR) 存放读/写的数据；当前指令寄存器 (CIR) 存放正在执行的指令；累加器 (ACC) 存放中间结果。取指‑译码‑执行周期通过总线在这些寄存器与主存之间搬移数据。

10. High‑level vs Low‑level Languages | 高级语言与低级语言

Compare the advantages of high‑level languages (HLLs) like Python with low‑level assembly language. HLLs are portable across different hardware, easier to write and debug, and provide built‑in libraries for complex tasks. Assembly language is machine‑specific, harder to learn, but offers precise control over hardware and can produce faster, more memory‑efficient executables. In CCEA exams, justify when each type is more suitable, such as using embedded systems or rapid application development.

比较 Python 等高级语言与低级汇编语言的优势。高级语言跨硬件平台可移植，易于编写和调试，并提供了内置库完成复杂任务。汇编语言与机器相关，学习难度大，但可实现硬件的精细控制，生成更快、更节省内存的可执行程序。CCEA 考试中要能判断各种场景下的适用性，例如嵌入式系统或快速应用开发。

11. Arrays, Records and Data Structures | 数组、记录与数据结构

Define a record suitable for storing a student’s name (string), age (integer) and average grade (real). In pseudocode: type Student = record name : STRING, age : INTEGER, grade : REAL endrecord. Then declare var pupil : Student. Access fields using dot notation, e.g., pupil.name ← ‘Maeve’. Arrays of records can store multiple students, enabling efficient data handling. Contrast this with a 2D array, which forces all fields to be of the same data type.

定义一个适合存储学生姓名（字符串）、年龄（整数）和平均成绩（实数）的记录。伪代码：type Student = record name : STRING, age : INTEGER, grade : REAL endrecord。然后声明 var pupil : Student。使用点记号访问字段，如 pupil.name ← ‘Maeve’。记录数组可存储多个学生，高效处理数据。这与二维数组对比，二维数组强制所有字段为同一数据类型。

12. Programming Constructs: Sequence, Selection, Iteration | 编程结构：顺序、选择、迭代

Identify the three fundamental programming constructs. Sequence executes instructions in the order they are written. Selection, such as IF … THEN … ELSE, allows decision‑making based on a condition. Iteration repeats a block of code; CCEA expects knowledge of definite (FOR loops) and indefinite (WHILE loops) iteration. A robust answer would give a small example of each and note that all algorithms can be expressed using only these three constructs.

识别三种基本编程结构。顺序按书写顺序执行指令。选择如 IF … THEN … ELSE 可根据条件做出判断。迭代重复执行代码块；CCEA 期待掌握确定循环（FOR）和不确定循环（WHILE）。稳健的回答会举例说明，并指出所有算法都可用这三种结构表达。

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

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

Year 12 CCEA Computer Science: Unit Test Mock Paper Analysis | Year 12 CCEA 计算机：单元测试模拟卷解析