📚 CCEA Year 9 Computer Science: Past Paper Deep Dive Analysis | CCEA 九年级计算机：历年真题深度解析
Understanding how to approach past paper questions is one of the most effective ways to prepare for your Year 9 CCEA Computer Science assessments. This deep-dive analysis breaks down the most common question types, highlights where students often lose marks, and provides clear, step-by-step strategies to help you master every topic. From number systems and logic gates to programming concepts and cybersecurity, each section is built around real exam-style questions that mirror the structure and difficulty of CCEA past papers.
理解如何应对历年真题是备考九年级 CCEA 计算机科学考试最有效的方法之一。这篇深度解析拆解了最常见的题型，指出学生容易失分的地方，并提供清晰的、分步骤的策略，帮助你掌握每一个知识点。从数制和逻辑门到编程概念与网络安全，每一节都围绕真实的考试风格题目展开，与 CCEA 历年试卷的结构和难度高度一致。
1. Binary to Denary Conversion | 二进制转十进制
Past Paper Example: Convert the binary number 10112 into denary. Show your working.
真题示例：将二进制数 10112 转换为十进制，并写出你的计算过程。
ost digit pairs with 8, the next with 4, then 2, and finally the rightmost digit pairs with 1. Multiply each digit by its place value and add the results: (1 × 8) + (0 × 4) + (1 × 2) + (1 × 1). This gives 8 + 0 + 2 + 1 = 11.
首先写出 4 位二进制数的位值：8、4、2、1。将每一位二进制数字放在对应的位值下面。最左边的数字对应 8，接下来对应 4，然后对应 2，最右边的数字对应 1。将每一位数字乘以其位值并相加：(1 × 8) + (0 × 4) + (1 × 2) + (1 × 1)，得到 8 + 0 + 2 + 1 = 11。
A very common mistake is to read the binary number from right to left but still apply the place values in the wrong order, or to forget that a 0 still contributes a place value (it simply adds 0). Always draw a quick table in your working to avoid confusion.
一个非常常见的错误是，虽然从右向左读取二进制数字，但位值顺序却弄反了，或者忘记了 0 仍然占据一个位值（只是它加的是 0）。为避免混淆，建议在计算时快速地画一个简单的表格。
Try this: Convert 11002 to denary. (Answer: 12)
试一试：将 11002 转换为十进制。（答案：12）
2. Denary to Binary Conversion | 十进制转二进制
Past Paper Example: Represent the denary number 29 as an 8-bit binary number. You must show your working.
真题示例：将十进制数 29 表示为一个 8 位二进制数。必须写出你的解题过程。
. For 29: 29 ÷ 2 = 14 remainder 1; 14 ÷ 2 = 7 remainder 0; 7 ÷ 2 = 3 remainder 1; 3 ÷ 2 = 1 remainder 1; 1 ÷ 2 = 0 remainder 1. Now read the remainders from bottom to top: 11101. Since the question asks for 8 bits, add leading zeros to make 000111012.
一种可靠的方法是除以 2 取余法。反复用 2 除这个十进制数，并记录余数，直到商为 0。对于 29：29 ÷ 2 = 14 余 1；14 ÷ 2 = 7 余 0；7 ÷ 2 = 3 余 1；3 ÷ 2 = 1 余 1；1 ÷ 2 = 0 余 1。然后从下往上读取余数：11101。由于题目要求 8 位，所以在前面补零，得到 000111012。
Alternatively, you can use the place value table. Write out 8-bit place values from 128 down to 1. Ask yourself: does 29 contain 128? No, write 0. Does it contain 64? No, write 0. Continue until 32; 29 is less than 32, so 0. For 16, 29 contains one 16, so write 1 and subtract 16, leaving 13. 13 contains one 8, write 1, subtract to get 5. Then one 4 gives 1, remainder 1. One 2? No, 0. One 1 gives 1. The result is the same: 000111012.
你也可以使用位值表格法。写出从 128 到 1 的 8 位位值。问自己：29 包含 128 吗？不包含，记 0。包含 64 吗？不包含，记 0。一直到 32，29 也小于 32，记 0。对于 16，29 包含一个 16，记 1，减去 16 后剩 13。13 包含一个 8，记 1，减去得 5。然后一个 4 记 1，剩 1。一个 2？没有，记 0。一个 1 记 1。结果相同：000111012。
Students often lose marks by forgetting to include the required number of bits. If the question says 8-bit, your final answer must show exactly eight bits; otherwise the answer is considered incomplete.
学生经常因为没有补齐所需位数而丢分。如果题目要求 8 位，你的最终答案必须恰好显示 8 位二进制数字，否则答案会被认为不完整。
3. Binary Addition | 二进制加法
Past Paper Example: Add the following two 4-bit binary numbers: 01102 and 01012. Show all carries.
真题示例：将以下两个 4 位二进制数相加：01102 与 01012。请给出所有进位的过程。
= 2, which in binary is written as 0 with a carry of 1 to the next column. Leftmost column: 0 + 0 + carry 1 = 1. The result is 10112. You can also verify in denary: 0110 is 6, 0101 is 5, 6 + 5 = 11, which is indeed 10112.
将数字按位值垂直对齐。从最右边一列开始：0 + 1 = 1，进位 0。下一列：1 + 0 = 1，进位 0。第三列：1 + 1 = 2，在二进制中写 0 并向下一列进 1。最左列：0 + 0 + 进位 1 = 1。结果为 10112。你也可以用十进制验证：0110 是 6，0101 是 5，6 + 5 = 11，确实就是 10112。
When you add numbers larger than 4 bits, an overflow can occur if the result requires more bits than the space available. In Year 9 papers, you are often told to work within a given bit length and to identify if an overflow error happens. Always check whether your final carry remains inside the fixed width.
当你将超过 4 位的数字相加时，如果结果所需的位数超出了给定空间，就会发生溢出。在九年级试卷中，题目常常会要求你在特定的位长内计算，并判断是否发生了溢出错误。始终检查你的最终进位是否落在了固定宽度之内。
4. Logic Gates and Truth Tables | 逻辑门与真值表
Past Paper Example: Complete the truth table for a two-input AND gate. Inputs: A, B. Output: Q.
真题示例：完成一个两输入与门的真值表。输入：A、B。输出：Q。
| A | B | Q (A AND B) |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
The AND gate outputs 1 only when both inputs are 1. This is a fundamental building block in digital circuits and must be memorised along with OR (output 1 when at least one input is 1) and NOT (inverts the input).
与门仅在两个输入都为 1 时输出 1。这是数字电路中最基本的构建模块，需要连同或门（至少一个输入为 1 时输出 1）以及非门（反转输入）一起熟记。
Extension Question: u could also be asked to fill in a truth table for a combined circuit. To tackle this, break the expression into smaller parts, work out intermediate columns, and combine them step by step.
提升题：画出布尔表达式 Q = (A AND B) OR (NOT C) 的逻辑电路图。你也可能被要求填写组合电路的真值表。解答这类题目时，将表达式分解为更小的部分，先计算出中间列，再一步一步组合起来。
5. Flowcharts and Algorithms | 流程图与算法思维
Past Paper Example: while count <= N: total = total + count; count = count + 1; end while; print total; stop.
真题示例：观察下面的流程图，并写出当输入为 4 时，最终打印出的 total 值是多少。流程图：开始；输入 N；total = 0；count = 1；当 count <= N 执行：total = total + count；count = count + 1；结束循环；打印 total；停止。
3 + 3 = 6, count = 4. Fourth: total = 6 + 4 = 10, count = 5. Now count (5) is not <= 4, so the loop ends and the value 10 is printed.
逐步追踪。初始 total = 0、count = 1、N = 4。第一次循环：total = 0 + 1 = 1，count 变为 2。第二次循环：total = 1 + 2 = 3，count = 3。第三次：total = 3 + 3 = 6，count = 4。第四次：total = 6 + 4 = 10，count = 5。此时 count (5) 不大于等于 4，因此循环终止，输出值 10。
n the wrong order. Always use a trace table with columns for each variable to keep your working neat.
流程图追踪是一项在考试中极容易考查的能力。常见的错误包括误读条件（例如把 >= 错看为 <=），或者按错误顺序更新变量。始终使用包含各变量列的追踪表来保持解题过程的整洁。
6. Hardware Components | 计算机硬件组件
Past Paper Example: Explain the role of the CPU in a computer system and name the three main parts of a CPU.
真题示例：解释 CPU 在计算机系统中的作用，并说出 CPU 的三个主要组成部分。
The Central Processing Unit (CPU) is the brain of the computer. It fetches instructions from memory, decodes them to understand what action is needed, and then executes those instructions. This is known as the fetch-decode-execute cycle. The three main parts are the Control Unit (CU), which directs operations; the Arithmetic Logic Unit (ALU), which performs calculations and logical comparisons; and registers (such as the Program Counter and Accumulator), which are small, fast storage locations that hold data and instructions temporarily.
中央处理器（CPU）是计算机的大脑。它从内存中取指令、解码以了解需要执行什么操作，然后执行这些指令。这就是所谓的取指-解码-执行周期。三个主要部分是指控制单元（CU），它负责指挥操作；算术逻辑单元（ALU），负责执行计算和逻辑比较；以及寄存器（如程序计数器和累加器），它们是小型、快速的存储位置，用于暂时存放数据和指令。
Another typical question asks you to identify input, output and storage devices from a list. For example: keyboard (input), monitor (output), SSD (storage). Remember that a touchscreen is both an input and an output device. Examiners also like to test the difference between primary memory (RAM, volatile) and secondary storage (hard drive, non-volatile).
另一种典型题目要求你从列表中识别出输入、输出和存储设备。例如：键盘（输入）、显示器（输出）、固态硬盘 SSD（存储）。要记住触摸屏既是一种输入设备也是一种输出设备。考官也喜欢考查主存储器（RAM，易失性）和辅助存储器（硬盘，非易失性）之间的区别。
7. Programming Basics: Variables and Conditionals | 编程基础：变量与条件语句
Past Paper Example: Examine the following code and state the output: x = 7; y = x - 2; if y > 5: print('High') else: print('Low')
真题示例：阅读以下代码并说明输出结果：x = 7；y = x - 2；if y > 5: print('High') else: print('Low')
hether y > 5. Since 5 is not greater than 5, the condition is false. Therefore the code inside the else branch runs and prints 'Low'.
首先计算变量 y 的值。由于 x 是 7，y = 7 - 2 = 5。条件判断 y > 5 是否成立。因为 5 不大于 5，条件为假。因此执行 else 分支中的代码，打印出 'Low'。
ould be comfortable with variables, arithmetic assignment, if-else decisions, and loops. Watch out for a common slip: using a single equals sign for comparison; in many languages, == checks equality, while = assigns a value. Pseudocode often uses = for assignment, so read the context carefully.
在 CCEA 九年级试卷中，编程题目可能以代码追踪、简短伪代码片段或基于块的示例（如 Scratch）的形式出现。你需要熟练掌握变量、算术赋值、if-else 判断以及循环等概念。注意一个常见错误：用单个等号进行比较；在许多语言中，== 用于检查相等性，而 = 用于赋值。伪代码中通常用 = 表示赋值，因此要仔细根据上下文来理解。
8. Cybersecurity Threats and Prevention | 网络安全威胁与防护
Past Paper Example: Describe two differences between a computer virus and a worm.
真题示例：描述计算机病毒和蠕虫的两个区别。
A virus attaches itself to a legitimate file or program and requires a user to execute that file in order to spread. For example, opening an infected email attachment can activate a virus. A worm, on the other hand, is self-replicating and does not need to attach to a host file; it can spread across networks automatically by exploiting security vulnerabilities, often without any user intervention.
病毒会附加到合法文件或程序上，并需要用户执行该文件才能传播。例如，打开受感染的电子邮件附件就可能激活病毒。而蠕虫能够自我复制，不需要依附于宿主文件；它可以利用安全漏洞自动在网络上传播，通常不需要任何用户干预。
The second difference is that viruses tend to cause damage to local files and systems, whereas worms primarily consume network bandwidth and can rapidly infect a large number of systems, leading to network slowdowns. Both are types of malware, but their propagation methods and immediate impacts differ significantly.
第二个区别是，病毒倾向于破坏本地文件和系统，而蠕虫主要消耗网络带宽，可以迅速感染大量系统，导致网络变慢。二者都属于恶意软件，但它们的传播方式和直接影响有着显著差异。
Another common question: List three methods to protect a computer from malware. Good answers include: install anti-malware software and keep it updated, avoid clicking on suspicious links or email attachments, use strong passwords and keep the operating system patched. Always explain a little detail, not just a one-word answer.
另一种常见题目：列举三种保护计算机免受恶意软件侵害的方法。好答案包括：安装反恶意软件并保持更新、避免点击可疑链接或电子邮件附件、使用强密码并保持操作系统打上补丁。在回答时，一定要稍作展开说明，而不是只给出一个词。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图