Year 8 CAIE Computing Past Papers: In-Depth Analysis | 历年真题深度解析

📚 Year 8 CAIE Computing Past Papers: In-Depth Analysis | 历年真题深度解析

In Year 8 CAIE Computing, past paper questions are the most reliable tools to build confidence and master exam technique. This deep-dive guide breaks down typical questions from recent sessions, revealing the recurring themes, common pitfalls, and the step-by-step reasoning needed to secure top marks. By working through these examples, you will learn how examiners think and how to structure your answers effectively.

在 Year 8 CAIE 计算机课程中，历年真题是建立信心和掌握考试技巧的最可靠工具。本深度解析指南拆解了近年试卷中的典型题目，揭示了反复出现的主题、常见陷阱以及获取高分所需的逐步推理。通过演练这些例子，你将学会考官如何思考，以及如何有效地组织你的答案。

1. Understanding Logic Gates | 理解逻辑门

A common past paper question asks: ‘Which logic gate gives an output of 1 only when both inputs are 1?’ The answer is an AND gate. You must also be able to complete truth tables and recognise the shapes of gates. The AND gate is drawn as a D-shaped symbol, while the OR gate is a curved shape pointing right.

一个常见的真题提问是：’哪个逻辑门只有在两个输入都为 1 时才输出 1？’ 答案是 AND 门。你还必须能够完成真值表并识别门的形状。AND 门画作 D 形符号，而 OR 门是一个指向右侧的弧形。

Input A	Input B	AND Output	OR Output
0	0	0	0
0	1	0	1
1	0	0	1
1	1	1	1

Remember the NOT gate simply inverts the input: 0 becomes 1, 1 becomes 0. A tricky question might combine gates – always trace signals from left to right and annotate each intermediate output.

记住 NOT 门只是将输入反转：0 变成 1，1 变成 0。一个棘手的问题可能会组合多个门 —— 始终从左到右追踪信号，并标注每个中间输出。

2. Binary-to-Denary Conversion | 二进制转十进制

A past paper staple asks you to convert a binary number, such as 1011₂, into denary. The correct method is to write out the place values (8, 4, 2, 1) and add the values where a 1 appears. So 1011₂ = 8 + 0 + 2 + 1 = 11.

真题中常见的要求是将二进制数（如 1011₂）转换为十进制。正确的方法是写出位值 (8, 4, 2, 1)，并将对应位为 1 的值相加。因此 1011₂ = 8 + 0 + 2 + 1 = 11。

Conversely, to convert 14 into binary, repeatedly divide by 2 and read the remainders upwards: 14 ÷ 2 = 7 remainder 0; 7 ÷ 2 = 3 remainder 1; 3 ÷ 2 = 1 remainder 1; 1 ÷ 2 = 0 remainder 1. Reading from bottom to top gives 1110₂. A common mistake is forgetting to check the final answer by adding the place values again.

反过来，要将 14 转换为二进制，反复除以 2 并向上读取余数：14 ÷ 2 = 7 余 0；7 ÷ 2 = 3 余 1；3 ÷ 2 = 1 余 1；1 ÷ 2 = 0 余 1。从下往上读得到 1110₂。一个常见错误是忘记通过重新相加位值来检查最终答案。

3. Flowchart Tracing and Symbols | 流程图跟踪与符号

Many papers present a flowchart with a loop, asking for the final output value. For example, start with x = 2, while x < 10, x = x + 3, output x. Trace the loop: x becomes 5 (output 5), then 8 (output 8), then 11 (output 11, stops). So the outputs are 5, 8, 11. The oval terminator marks start/end, the rectangle a process, and the diamond a decision.

许多试卷会给出一个带循环的流程图，要求写出最终输出值。例如，从 x = 2 开始，当 x < 10 时，x = x + 3，输出 x。跟踪循环：x 变为 5（输出 5），然后 8（输出 8），然后 11（输出 11，停止）。所以输出是 5, 8, 11。椭圆形终止符表示开始/结束，矩形表示处理步骤，菱形表示判断。

Always use a trace table with columns for each variable to avoid losing track during iterations.

务必使用带有各变量列的跟踪表，以免在迭代过程中失去线索。
A common trap is misunderstanding the order of the steps: the output may occur before the condition is checked again.

一个常见的陷阱是误解步骤的顺序：输出可能发生在再次检查条件之前。

4. Writing and Interpreting Python Snippets | 编写与解读 Python 代码片段

Year 8 questions often ask you to write a few lines of Python, such as printing a message or using a variable. For example: ‘Write code to ask the user for their age and print it.’ The expected answer is:

Year 8 的题目经常要求你写几行 Python，比如打印一条消息或使用变量。例如：’编写代码询问用户的年龄并打印出来。’ 预期的答案是：

age = input(‘Enter your age: ‘)
print(‘You are’, age, ‘years old’)

Examiners also give snippets and ask for the output. In for i in range(3): print(i), remember that range(3) gives 0, 1, 2 – not 3. This zero-indexing concept is tested frequently.

考官也会给出一段代码让你说出输出。在 for i in range(3): print(i) 中，记住 range(3) 会生成 0, 1, 2 —— 而不是 3。这种零索引概念经常被考查。

5. Input, Processing, and Output Model | 输入、处理与输出模型

Questions often present a real-world scenario, like a barcode scanner at a supermarket, and ask you to identify the input, process, and output. The barcode scanner is the input device, the CPU matches the barcode to a database, and the receipt/printer is the output. Understanding this model helps analyse any system.

题目常常给出一个现实场景，比如超市的条形码扫描器，要求你识别输入、处理和输出。条形码扫描器是输入设备，CPU 将条形码与数据库匹配，收据/打印机是输出。理解这个模型有助于分析任何系统。

A tricky variation asks: ‘Is a touchscreen an input or output device?’ A touchscreen is both – it detects touch (input) and displays information (output). Giving a clear, short justification earns full marks.

一个棘手的变化题会问：’触摸屏是输入设备还是输出设备？’ 触摸屏既是输入也是输出设备——它检测触摸（输入）并显示信息（输出）。给出清晰简洁的理由可获得满分。

6. File Sizes and Data Units | 文件大小与数据单位

Conversion between bits, bytes, kilobytes, and megabytes appears repeatedly. Learn these relationships: 1 byte = 8 bits, 1 KB = 1024 bytes, 1 MB = 1024 KB. A sample question: ‘How many bytes are in 2 KB?’ 2 × 1024 = 2048 bytes. Always show your working; even if the final answer is wrong, a correct method can pick up marks.

位、字节、千字节和兆字节之间的转换反复出现。记住这些关系：1 字节 = 8 位, 1 KB = 1024 字节, 1 MB = 1024 KB。一个样题：’2 KB 里有多少字节？’ 2 × 1024 = 2048 字节。务必展示你的步骤；即使最终答案错了，正确的方法也能得分。

Don’t confuse KB (kilobyte, 1024 bytes) with kb (kilobit, 1000 bits). Past papers deliberately use both to test attention to detail. Look for capitalisation – KB for bytes, kb for bits.

不要将 KB（千字节，1024 字节）与 kb（千位，1000 位）混淆。历年真题会故意混用两者，以考查对细节的关注。注意大小写——KB 表示字节，kb 表示位。

7. LAN vs WAN: Spot the Difference | 局域网与广域网：找出区别

A typical comparison question gives two definitions and asks you to match them. A LAN (Local Area Network) covers a small geographical area, like a school or office, and uses cabling or Wi-Fi within the building. A WAN (Wide Area Network) connects multiple LANs over a city, country, or continent, often using leased telephone lines or satellites.

一个典型的比较题目给出两个定义并要求你匹配。LAN（局域网）覆盖较小的地理区域，如学校或办公室，并在建筑内使用电缆或 Wi-Fi。WAN（广域网）连接城市、国家或大洲内的多个局域网，通常使用租用电话线或卫星。

Key phrase: ‘small area’ vs ‘large area’. Use these exact terms in your answer.

关键词：’小范围’ 与 ‘大范围’。在答案中使用这些准确的术语。
The internet is the largest WAN; your home router creates a small LAN.

互联网是最大的广域网；你的家用路由器创建了一个小的局域网。

8. Online Safety and Phishing Emails | 网络安全与钓鱼邮件

Exam questions present a suspicious email and ask you to identify three signs of phishing. Signs include: generic greeting (‘Dear Customer’), urgent requests (‘Your account will be closed!’), suspicious links (hover shows a strange address), poor grammar, and requests for personal data. Always recommend checking the sender’s address and not clicking links.

考试中会给出一封可疑邮件，要求你识别三个钓鱼邮件的迹象。迹象包括：通用问候语（’尊敬的客户’）、紧急请求（’您的帐户将被关闭！’）、可疑链接（悬停显示怪异地址）、语法错误以及索要个人数据。一定要建议检查发件人地址，且不要点击链接。

A well-structured answer names the sign, gives a quote from the email, and explains why it’s dangerous. For example: ‘The link says “click here to verify” – this could install malware.’

一个结构良好的答案会指出迹象，引用邮件中的原文，并解释为何危险。例如：’链接说”点击此处验证” —— 这可能会安装恶意软件。’

9. Bubble Sort Walkthrough | 冒泡排序逐步演练

Sorting algorithms are tested with a small list, e.g., [5, 3, 8, 1]. The question may ask you to show the list after the first pass of a bubble sort. Compare adjacent items and swap if out of order: (5,3) swap → [3,5,8,1]; (5,8) no swap; (8,1) swap → [3,5,1,8]. The largest number ‘bubbles’ to the end. A full bubble sort repeats passes until no swaps occur.

排序算法会用一个短列表进行考查，例如 [5, 3, 8, 1]。题目可能要求展示冒泡排序第一遍后的列表。比较相邻元素，若顺序错误则交换：(5,3) 交换 → [3,5,8,1]；(5,8) 不交换；(8,1) 交换 → [3,5,1,8]。最大的数 ‘冒泡’ 到最后。完整的冒泡排序会重复多遍，直到没有交换发生。

Always draw a line under the already-sorted elements in subsequent passes. This visual clue prevents unnecessary comparisons and earns marks for neat presentation.

在后续的遍历中，一定要在已排好序的元素下面画一条线。这个视觉提示可以防止不必要的比较，并因呈现整洁而得分。

10. Decomposition in Computational Thinking | 计算思维中的分解

An open-ended question might ask: ‘Describe how you would decompose the task of making a cup of tea.’ Decomposition means breaking a large problem into smaller, manageable parts. For tea: fill kettle, boil water, place tea bag in cup, pour water, wait, add milk/sugar, stir, remove tea bag. Each step can be further broken down.

一个开放性问题可能会问：’描述你将如何分解制作一杯茶的任务。’ 分解意味着将一个大问题拆分成更小、可管理的部分。对于茶：给水壶装水，烧水，将茶包放入杯中，倒水，等待，加奶/糖，搅拌，取出茶包。每个步骤还可以进一步拆分。

Examiners look for logical order and enough detail. Avoid vague statements like ‘do everything’; instead write a clear sequence that could be given to a robot.

考官看的是逻辑顺序和足够的细节。避免像 ‘做完所有事’ 这样模糊的表述；相反，要写出清晰的序列，可以交给机器人执行。

11. Syntax Errors vs. Logic Errors | 语法错误与逻辑错误

Given a code snippet, you may be asked to identify whether an error is a syntax error or a logic error. A syntax error occurs when the code breaks the language rules, like missing a colon or quotation mark. A logic error is when the code runs but produces the wrong result, often caused by an incorrect formula or wrong order of statements.

给定一段代码，你可能需要识别错误是语法错误还是逻辑错误。语法错误发生在代码违反语言规则时，比如缺少冒号或引号。逻辑错误是代码能运行但产生错误的结果，通常由错误的公式或语句顺序错误造成。

Example: if age > 18 print(“Adult”) is a syntax error because the colon after 18 is missing. The corrected line is if age > 18: print(“Adult”). Whereas calculating total = price + 10 / 100 instead of total = price * 1.1 is a logic error – it adds 0.1 instead of 10%.

例如：if age > 18 print(“Adult”) 是一个语法错误，因为 18 后面缺少冒号。正确的行是 if age > 18: print(“Adult”)。而计算 total = price + 10 / 100 而不是 total = price * 1.1 则是逻辑错误——它加的是 0.1 而不是 10%。

12. Representing Text and Sound in Binary | 文本与声音的二进制表示

Questions on data representation ask how text is stored. Characters are converted to binary using a character set like ASCII. For example, ‘A’ = 65 in denary, which is 01000001 in binary. In a past paper, you might be asked to decode a short binary message given an ASCII table. Simply convert each 8-bit chunk to denary and look it up.

关于数据表示的题目会问文本是如何存储的。字符通过像 ASCII 这样的字符集转换为二进制。例如，’A’ = 十进制 65，二进制为 01000001。在真题中，你可能会被要求根据 ASCII 表解码一条简短的二进制消息。只需将每个 8 位块转换为十进制，然后查表即可。

Sound is represented by sampling the analogue wave at regular intervals and storing the amplitude as binary values. Higher sample rate means better quality but larger file size. A typical exam question asks you to explain the trade-off.

声音是通过定期对模拟波进行采样，并将振幅存储为二进制值来表示的。采样率越高，质量越好，但文件也越大。典型的考题会让你解释这种权衡。

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

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

Year 8 CAIE Computing Past Papers: In-Depth Analysis | 历年真题深度解析