📚 CCEA Year 12 Computer Science Unit Test Mock Paper Walkthrough | CCEA 12年级计算机科学单元测试模拟卷解析
This article provides a detailed walkthrough of a CCEA-style Year 12 Computer Science unit test, covering fundamental concepts from programming, data representation, and systems development. Each question is analysed with step-by-step reasoning, model answers, and revision tips to help you secure top marks.
本文详细解析了一份 CCEA 风格的 12 年级计算机科学单元测试模拟卷，涵盖编程基础、数据表示和系统开发等核心概念。每题都配有逐步推理、模型答案和复习提示，帮助你在考试中拿到高分。
1. Paper Structure and Assessment Objectives | 试卷结构与评估目标
CCEA Year 12 unit tests typically consist of three sections: Section A (short multi-part questions), Section B (programming scenario), and Section C (extended writing on systems development). Marks are allocated across Assessment Objective AO1 (knowledge), AO2 (application), and AO3 (evaluation). Understanding the distribution helps you manage your time and focus during revision.
CCEA 12 年级单元测试通常包含三个部分：A 部分（多小题简答题）、B 部分（编程情境题）和 C 部分（系统开发的扩展写作）。分数按照评估目标 AO1（知识）、AO2（应用）和 AO3（评价）分配。了解分值分布有助于你在复习时合理分配时间和精力。
The mock paper under review carries a total of 60 marks, to be completed in 1 hour. It begins with straightforward factual recall and progresses to higher-order design and evaluation tasks. For effective exam technique, always read the stem carefully, note the command words (state, explain, describe, evaluate), and check the mark allocation to gauge the depth required.
本模拟卷满分 60 分，考试时间 1 小时。题目从直接的知识回忆逐步过渡到高阶的设计与评价任务。为掌握有效的应试技巧，务必仔细阅读题干，识别指令词（陈述、解释、描述、评价），并根据分值判断所需回答的深入程度。
2. Section A Q1: Binary Addition and Overflow | A部分第1题：二进制加法与溢出
Question: Perform the following 8-bit binary addition: 01101011 + 01011100. State the result in binary, and determine whether an overflow has occurred. Justify your answer.
题目： 完成以下 8 位二进制加法：01101011 + 01011100。用二进制写出结果，并判断是否发生了溢出。请说明理由。
We align the two bytes and add from the least significant bit. 01101011 (107 in decimal) + 01011100 (92 in decimal) = 11000111. The sum is 11000111, which is a valid 8-bit result. However, overflow in signed two's complement addition occurs when two numbers with the same sign produce a result with a different sign. Both operands start with 0 (positive), but the result starts with 1 (negative). Therefore overflow has occurred because the true sum, 199, lies outside the range of a signed 8-bit integer (-128 to +127).
我们对齐两个字节，从最低有效位开始相加。01101011（十进制 107）+ 01011100（十进制 92）= 11000111。结果是 11000111，仍为 8 位。但在带符号二进制补码加法中，如果两个同号数相加得到异号的结果，就发生了溢出。两个操作数都以 0 开头（正数），而结果以 1 开头（负数）。因此溢出了，因为实际和 199 超出了 8 位带符号整数的范围（-128 到 +127）。
Marks for this type of question are often split: 2 for the correct binary sum, 1 for stating that overflow occurred, and 1 for a clear justification referring to sign bits or range. Always show your working, even if the addition seems trivial.
此类题目的分值通常分配为：正确的二进制和得 2 分，指出溢出得 1 分，结合符号位或范围进行清晰解释得 1 分。即使加法看起来很简单，也要展示计算过程。
3. Section A Q2: Logic Gates and Truth Tables | A部分第2题：逻辑门与真值表
Question: Construct the truth table for the Boolean expression Q = (A AND B) OR (NOT C). Include all possible input combinations for A, B, and C. Then suggest a real-world application for this logic circuit.
题目： 为布尔表达式 Q = (A AND B) OR (NOT C) 构建真值表，包含 A、B、C 的所有可能输入组合。并给出该逻辑电路的一个实际应用。
. We evaluate the AND, the NOT, and finally the OR. A quick check shows that Q is 1 whenever both A and B are 1, or whenever C is 0. This logic is reminiscent of a security system that triggers an alert if two specific sensors are active simultaneously or if a tamper switch becomes inactive.
三个输入共有 2³ = 8 行。我们依次计算 AND、NOT 和最终的 OR。快速分析发现，只要 A 和 B 同时为 1，或者 C 为 0，Q 就为 1。这个逻辑类似于报警系统：当两个特定传感器同时激活，或者某个防拆开关断开（变为无效状态）时触发警报。
| 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 |
A common mistake is forgetting to invert C correctly or misplacing the OR priority. Use brackets in your working to avoid confusion. For the application, examiners look for plausible, clearly described scenarios. Mentioning a burglar alarm with door sensors and a master switch is perfectly acceptable.
常见错误包括未能正确对 C 取反，或者搞错了 OR 的优先级。答题时使用括号可以避免混淆。对于实际应用，考官希望看到合理且描述清晰的场景。提到带有门磁传感器和主开关的防盗报警器就完全可以接受。
4. Section A Q3: Data Compression Techniques | A部分第3题：数据压缩技术
Question: Using the string "AAAAABBBCCCDDDEEEEF", illustrate how Run-Length Encoding (RLE) works. Then explain one scenario where lossy compression would be preferable to lossless compression, relating your answer to a specific media type.
题目： 以字符串 "AAAAABBBCCCDDDEEEEF" 为例，说明行程长度编码（RLE）的原理。然后解释一种有损压缩比无损压缩更适用的场景，并联系具体的媒体类型。
RLE replaces consecutive identical characters with a count-character pair. Our string becomes: 5A3B3C3D4E1F. This is particularly effective on data with long runs of repeated values, such as simple graphic icons or sensor logs. Lossy compression, on the other hand, permanently removes some information to achieve much higher compression ratios. It is routinely used for streaming high-definition video on services like Netflix because the human eye cannot perceive minor colour variations or high-frequency details, and the bandwidth saving is enormous.
RLE 将连续重复的字符替换为计数-字符对。我们的字符串变为：5A3B3C3D4E1F。这种方法对含有大量重复值的数据特别有效，例如简单的图形图标或传感器日志。而有损压缩会永久性删除部分信息，以获得高得多的压缩比。它常用于 Netflix 等高清视频流服务，因为人眼无法察觉细微的色彩变化或高频细节，同时节省的带宽非常可观。
When discussing compression, always link "lossy" to specific perceptual limits (sight, hearing). For instance, MP3 audio discards sounds outside typical human hearing range. A good answer demonstrates understanding of the trade-off between file size and fidelity.
讨论压缩时，务必将“有损”与具体的感知局限（视觉、听觉）联系起来。例如，MP3 音频会丢弃人耳听觉范围之外的声音。一份好的答案应当体现出对文件大小与保真度之间权衡的理解。
5. Section B Scenario: Student Grade Calculator | B部分情境题：学生成绩计算器
Scenario: es: 80+ = A, 70-79 = B, 60-69 = C, 50-59 = D, below 50 = F. The program must validate each input to ensure it is within range, and loop until the user chooses to quit.
情境： 某老师需要一个程序，输入学生三次测验的分数（0-100），输出平均分和等级，规则如下：80 及以上为 A，70-79 为 B，60-69 为 C，50-59 为 D，低于 50 为 F。程序必须验证每个输入确保其在范围内，并循环直到用户选择退出。
This scenario tests your ability to decompose a problem, use selection (if-elif-else) for grading, handle input validation, and implement a loop structure. In CCEA exams, you can present the solution as pseudocode, a flowchart, or Python code – whichever you are strongest in. The key is to demonstrate a clean, logical structure.
这个情境题考查你分解问题、使用选择结构（if-elif-else）评定等级、处理输入验证以及实现循环结构的能力。在 CCEA 考试中，你可以用伪代码、流程图或 Python 代码展示答案——选择你最擅长的即可。关键是展示清晰、有逻辑的结构。
A strong solution begins with a WHILE True loop, inside which three marks are collected via a FOR loop or individually with validation. After calculating the average, a chain of IF statements assigns the grade. The program then asks whether to continue. Using meaningful variable names and commenting on the logic (e.g., "Validate input: ensure mark is between 0 and 100") is essential for full marks.
一个优秀的解决方案以一个 WHILE True 循环开始，在内部通过 FOR 循环或逐个收集三个分数并进行验证。计算平均分后，通过一串 IF 语句分配等级。然后程序询问是否继续。使用有意义的变量名，并对逻辑加以注释（例如，“验证输入：确保分数在 0 到 100 之间”），对于获得满分至关重要。
6. Section B Q1: Pseudocode Implementation | B部分第1题：伪代码实现
Question: Write pseudocode for the grade calculator described above, ensuring that it validates each mark and continues prompting until valid data is entered.
题目： 为上述成绩计算器编写伪代码，确保验证每个分数，并持续提示直到输入有效数据。
Here is a model answer in clear, exam-appropriate pseudocode:
SET continue ← TRUE WHILE continue = TRUE FOR i ← 1 TO 3 OUTPUT "Enter mark ", i, ": " INPUT mark WHILE mark < 0 OR mark > 100 OUTPUT "Invalid. Re-enter: " INPUT mark ENDWHILE STORE mark in marks[i] ENDFOR total ← marks[1] + marks[2] + marks[3] average ← total / 3 IF average >= 80 THEN grade ← "A" ELSE IF average >= 70 THEN grade ← "B" ELSE IF average >= 60 THEN grade ← "C" ELSE IF average >= 50 THEN grade ← "D" ELSE grade ← "F" ENDIF OUTPUT "Average: ", average, ", Grade: ", grade OUTPUT "Another student? (Y/N)" INPUT choice IF choice != 'Y' AND choice != 'y' THEN continue ← FALSE ENDIF ENDWHILE
This structure uses a post-test loop continuation pattern, which is safe and readable. The inner validation loop guarantees robust input handling. Notice that we avoid ambiguous constructs; every variable is explicitly initialized and used.
这种结构采用后测循环的继续模式，安全且可读。内层验证循环保证了稳健的输入处理。注意我们避免了模糊的构造；每个变量都显式初始化和使用。
A common pitfall is forgetting to convert string input to numeric type – in pseudocode we assume implicit conversion, but in real code you must cast. Also, ensure your grade boundaries are mutually exclusive and inclusive of the endpoints.
一个常见陷阱是忘记将字符串输入转换为数值类型——在伪代码中我们假定隐式转换，但在实际代码中必须强制类型转换。另外，要确保等级边界互斥，且包含端点。
7. Section B Q2: Testing and Boundary Cases | B部分第2题：测试与边界情况
Question: Describe a suitable test plan for the grade calculator, identifying three boundary test cases and explaining why they are important.
题目： 为成绩计算器设计一个合适的测试计划，识别三个边界测试用例，并解释其重要性。
Boundary testing focuses on the edges of equivalence partitions. For the grade boundaries, crucial test cases include: (a) three marks that give an average exactly at the boundary, e.g., 79, 80, 81 to test B/A boundary; (b) invalid extremes like -1 and 101 to check validation; and (c) a minimum valid average of 0 and a maximum of 100. Testing these ensures the logic does not suffer off-by-one errors and that validation correctly rejects out-of-range data.
边界测试关注等价划分的边缘。对于等级边界，关键测试用例包括：(a) 三个分数使平均分恰好处于边界，例如 79, 80, 81 以测试 B/A 边界；(b) 非法极值如 -1 和 101，检查验证功能；(c) 平均分最小有效值 0 和最大值 100。测试这些边界可以确保程序逻辑不会出现差一错误，并且验证功能能正确拒绝越界数据。
| Test ID | Marks Input | Expected Outcome | Purpose |
|---|---|---|---|
| 1 | 0, 50, 100 | Average 50, Grade D | Test minimum and maximum together with edge of D boundary |
| 2 | -1 (as first input) | Rejected, prompt re-enter | Validation of lower bound |
| 3 | 79, 79, 79 | Average 79, Grade B (not A) | Check B/A transition |
When you write a test plan, always state the input, expected output, and the reason for choosing that case. This demonstrates an analytical approach to quality assurance, which is highly valued in CCEA mark schemes.
编写测试计划时，务必说明输入、预期输出和选择该用例的理由。这展示了你对质量保证的分析方法，在 CCEA 评分方案中备受重视。
8. Section C: The Software Development Life Cycle | C部分：软件开发生命周期
Question: Discuss the stages of the software development life cycle (SDLC) and evaluate the importance of the analysis stage in reducing overall project costs. Use the student grade calculator as a context to illustrate your points.
题目： 讨论软件开发生命周期（SDLC）的各个阶段，并评价分析阶段在降低整体项目成本方面的重要性。请以学生成绩计算器为例说明你的观点。
The SDLC typically includes: feasibility study, analysis, design, implementation, testing, installation, and maintenance. The analysis stage involves gathering detailed requirements from stakeholders, documenting functional and non-functional requirements, and creating agreed-upon specifications. In the grade calculator context, thorough analysis would uncover needs like data validation, the exact grading scale, whether saving records is required, and any future expansion (e.g., handling multiple classes). Missing these details early on can lead to costly rework during implementation or even after deployment. Research shows that the cost of fixing an error after release is up to 100 times more than during analysis.
SDLC 通常包括：可行性研究、分析、设计、实现、测试、安装和维护。分析阶段包括从利益相关者处收集详细需求，记录功能与非功能需求，并制定经各方认可的需求规格说明。在成绩计算器的情境中，深入的分析会揭示如下需求：数据验证、确切的等级划分规则、是否需要保存记录，以及任何未来扩展（例如处理多个班级）。早期遗漏这些细节可能导致实现阶段甚至部署后进行代价高昂的返工。研究表明，在发布后修正一个错误的成本可能是分析阶段的百倍之多。
To gain high marks, you must move beyond simply listing stages and provide a coherent evaluation. Contrast the waterfall model, where analysis is a distinct upfront phase, with iterative models where requirements evolve. Emphasize that for a small, well-understood system like the grade calculator, a brief but structured analysis can prevent scope creep and technical debt.
要获得高分，你不能止于罗列各个阶段，必须给出连贯的评价。可以将瀑布模型（分析是前期的一个独立阶段）与需求不断演化的迭代模型进行对比。强调对于像成绩计算器这样小而明确的系统，简短但结构化的分析可以防止范围蔓延和技术债务。
9. Section C: Algorithm Efficiency and Linear Search | C部分：算法效率与线性查找
Question: The grade calculator might need to search for a particular student's record in an unsorted list. Explain how linear search works, state its best and worst-case time complexities, and suggest a situation where its simplicity outweighs its inefficiency.
题目： 成绩计算器可能需要在未排序的列表中查找某个学生的记录。解释线性查找的工作原理，说明其最佳和最坏情况时间复杂度，并给出一种其简便性胜过效率不足的场景。
Linear search inspects each element in sequence from the beginning until a match is found or the list ends. In the best case, the target is at the first position (O(1)). In the worst case, the target is at the end or absent, requiring n comparisons for a list of size n (O(n)). Despite being slower than binary search on sorted data, linear search requires no sorting and is trivial to implement. For a classroom set of 30 records, the difference in actual execution time is negligible, so the added complexity of maintaining a sorted list is not justified.
线性查找从列表开头开始逐个检查每个元素，直到找到匹配项或列表结束。最佳情况是目标位于第一个位置（O(1)）。最坏情况是目标位于末尾或不存在，对于大小为 n 的列表需要 n 次比较（O(n)）。虽然对于已排序数据，它比二分查找慢，但线性查找不需要排序，且实现极为简单。对于包含 30 条记录的班级数据，实际执行时间的差异可以忽略不计，因此不值得引入维护有序列表的额外复杂度。
This question assesses your ability to connect theoretical complexity analysis to practical decision-making. Always relate big-O notation to the problem scale and justify your engineering choice.
这道题旨在考查你将理论复杂度分析与实际决策相结合的能力。务必将大 O 记号与问题规模联系起来，并论证你的工程选择。
10. Database Design: Normalisation and Entity-Relationships | 数据库设计：规范化与实体关系
Question: A teacher decides to expand the grade calculator into a database system storing students, courses, and enrolments. Describe the three levels of normalisation (1NF, 2NF, 3NF) and explain why this design benefits from being in at least 3NF.
题目： 一位教师决定将成绩计算器扩展为数据库系统，存储学生、课程和选课信息。描述三种范式（1NF、2NF、3NF），并解释为什么这种设计至少需要达到 3NF。
1NF enforces atomicity: no repeating groups, each cell holds a single value. 2NF removes partial dependencies: non-key attributes must depend on the whole primary key, not just part of it. 3NF eliminates transitive dependencies: non-key attributes should not depend on other non-key attributes. In a student-course-enrolment database, we might have a table ENROLMENT(StudentID, CourseID, StudentName, CourseTitle). Here StudentName depends only on StudentID, not on the full composite key (StudentID, CourseID) – a partial dependency – so we would decompose into STUDENT, COURSE, and ENROLMENT tables. Confining each piece of information to one place avoids update anomalies (e.g., changing a course title in one row only) and ensures data integrity.
1NF 要求原子性：不允许重复组，每个单元格存放单一值。2NF 消除了部分依赖：非键属性必须依赖于整个主键，而非主键的一部分。3NF 消除了传递依赖：非键属性不应依赖于其他非键属性。在学生-课程-选课数据库中，我们可能会有一个选课表 ENROLMENT（学生ID，课程ID，学生姓名，课程名称）。其中学生姓名只依赖于学生ID，而不依赖于整个复合主键（学生ID，课程ID）——这构成部分依赖——所以我们会将其分解为学生（STUDENT）、课程（COURSE）和选课（ENROLMENT）三个表。将每条信息限制在唯一的地方可以避免更新异常（例如只修改了某一行的课程名称），并确保数据完整性。
When answering normalisation questions, always use concrete examples from the given scenario. Show the transition from unnormalised to normalised forms with sample records, and explicitly state which dependencies guide the decomposition.
回答规范化问题时，务必使用给定情境中的具体例子。用示例记录展示从未规范化到规范化的转换，并明确指出是哪些依赖关系指导了分解。
11. Cybersecurity and SQL Injection Prevention | 网络安全与SQL注入防范
Question: The teacher's database system uses SQL to retrieve student records. Explain what an SQL injection attack is and describe two defensive measures that should be implemented in the application code.
题目： 教师的数据库系统使用 SQL 检索学生记录。解释什么是 SQL 注入攻击，并描述两项应在应用程序代码中实施的防御措施。
SQL injection occurs when an attacker manipulates user input to alter the structure of an SQL query, gaining unauthorized access or damaging the database. For example, entering ' OR '1'='1 in a name field could expose all records. The first defence is using parameterized queries (prepared statements), where user input is treated strictly as data, not executable code. The second is rigorous input validation and sanitization – rejecting characters like ' ; -- unless explicitly required, and enforcing expected data patterns (e.g., a name must be alphabetic). Together, these significantly reduce the attack surface.
SQL 注入攻击是指攻击者操纵用户输入来改变 SQL 查询的结构，从而获得未经授权的访问或破坏数据库。例如，在姓名字段中输入 ' OR '1'='1 可能泄露所有记录。第一项防御是使用参数化查询（预处理语句），将用户输入严格视为数据，而非可执行代码。第二项是严格的输入验证和净化——拒绝诸如 ' ; -- 之类的字符（除非必须），并强制预期的数据模式（例如姓名必须为字母）。两者结合能显著缩小攻击面。
CCEA expects you to go beyond simply defining the attack; demonstrate how the measures work in code context. Mentioning concepts like least privilege (database user permissions) and regular expression validation can also earn credit. Always relate security to the scenario – in this case, protecting student data is legally and ethically imperative under GDPR.
CCEA 期望你不仅定义攻击，还要在代码上下文中展示措施如何运作。提及最小权限原则（数据库用户权限）和正则表达式验证也能得分。务必将安全性与情境联系起来——在此案例中，根据 GDPR，保护学生数据既是法律义务也是道德要求。
12. Final Revision Tips and Mark Maximisation Strategy | 终极复习技巧与高分策略
Success in the CCEA unit test hinges on three things: mastering the specification's core knowledge, practising past-paper style questions under timed conditions, and using precise technical vocabulary. Always read the mark scheme for your specific year – it reveals what examiners reward, such as labelled diagrams in system design questions, or annotated pseudocode with clear logic flow.
在 CCEA 单元测试中取得成功取决于三点：掌握考纲的核心知识、在限时条件下练习往年真题风格的题目，以及使用精确的技术词汇。务必阅读你所在年份的评分标准——它会揭示考官着重奖励的内容，例如系统设计题中带标注的图表，或带有清晰逻辑流程的注释伪代码。
For programming tasks, write clean, modular solutions. For extended writing, structure your answer: state your point, provide evidence or an example, and then explain the impact or relation. Time management is essential – allocate roughly 1 minute per mark. Leave the last 5 minutes to check for careless mistakes in binary arithmetic or truth table completions.
对于编程任务，编写干净、模块化的解决方案。对于扩展写作，结构要清晰：陈述观点，提供证据或示例，然后解释影响或关联。时间管理至关重要——大约按照每分钟 1 分的速度分配。留出最后 5 分钟检查二进制运算或真值表填写中的粗心错误。
Finally, maintain a personal glossary of key terms: abstraction, decomposition, algorithm, data integrity, normalisation, latency, topology, etc. Being able to define these accurately and apply them in context is a hallmark of a top-grade candidate.
最后，维护一份个人关键术语词汇表：抽象、分解、算法、数据完整性、规范化、延迟、拓扑等。能够准确定义这些术语并在语境中加以运用，是高分考生的标志。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图