Deep Dive into CAIE IGCSE Computer Science Past Papers | CAIE IGCSE 计算机科学历年真题深度解析

📚 Deep Dive into CAIE IGCSE Computer Science Past Papers | CAIE IGCSE 计算机科学历年真题深度解析

Mastering CAIE IGCSE Computer Science requires more than just memorising textbook facts; it demands a deep familiarity with exam structure, question styles, and the subtle ways marks are allocated. This article provides a comprehensive breakdown of what past papers reveal, equipping Year 11 learners with the analytical tools to excel in both Paper 1 Theory and Paper 2 Programming and Problem-solving.

要想征服 CAIE IGCSE 计算机科学，光靠死记硬背课本知识远远不够；你必须深度熟悉考试结构、题目风格，以及评分的细微门道。本文将对历年真题进行全面拆解，为 Year 11 的同学提供分析工具，帮助你在卷一理论与卷二编程及问题解决中双双夺分。

1. Exam Structure and Assessment Objectives | 考试结构与评估目标

The CAIE IGCSE Computer Science examination (0478/0984) is built around two compulsory papers, each lasting 1 hour 45 minutes. Paper 1 (Theory) carries 75 marks, while Paper 2 (Problem-solving and Programming) carries 50 marks, and each contributes 50 % to the final grade. Understanding the weightings helps students prioritise their revision.

CAIE IGCSE 计算机科学考试（0478/0984）由两份必考试卷组成，每份时长 1 小时 45 分钟。卷一（理论）占 75 分，卷二（问题解决与编程）占 50 分，各占总成绩的 50 %。清楚各卷权重有助于学生合理分配复习精力。

Paper 1 assesses three assessment objectives: knowledge with understanding, application, and analysis. Around 40 % of the marks test straightforward recall, while the remainder requires you to apply concepts to unfamiliar scenarios. Past papers show that questions on data representation, hardware, software, networks, and the social impact of computing appear in almost every session.

卷一的评估目标有三项：理解记忆、应用以及分析。约 40 % 的分数考查直接的记忆内容，其余则需要将概念迁移到新情境中。历年真题显示，数据表示、硬件、软件、网络以及计算的社会影响几乎在每个考季都会出现。

Paper 2 is entirely scenario-driven. It requires you to read and write pseudocode, interpret flowcharts, and design algorithms to solve problems. Marks are awarded not only for correct results but also for the clarity, logic, and efficiency of the solution. A careful study of mark schemes reveals that partial marks are often given for correct structure even when a final answer is wrong.

卷二全程以情景题呈现。它要求你阅读和编写伪代码、解读流程图，并设计算法来解决问题。得分不仅看最终结果，还考量解题思路的清晰度、逻辑性和效率。仔细研究评分方案会发现，即使最终答案有误，只要结构正确，常常也能拿到部分分数。

2. Paper 1 Theory: Recurring Core Themes | 卷一理论：反复出现的核心主题

Every past Paper 1 features topics that CAIE considers fundamental. Number systems – binary, denary, and hexadecimal – regularly supply straightforward marks in the early part of the paper. Questions often ask you to convert between bases, perform binary addition, and explain why computers use binary. The ability to handle both unsigned and two’s complement representations is expected.

每一份往年的卷一都会出现 CAIE 视为根基的主题。数制系统——二进制、十进制和十六进制——常在试卷前半部分提供容易拿到的基础分。题目通常要求你进行进制转换、完成二进制加法，并解释计算机采用二进制的原因。无符号表示与补码表示的操作能力都是必备的。

Computer architecture and the fetch‑decode‑execute cycle appear almost annually. You must be able to label a diagram of the CPU, describe the functions of registers (MAR, MDR, PC, CIR, Accumulator), and explain how buses carry data, addresses, and control signals. Questions have evolved from simple labelling to requiring a step‑by‑step narration of the cycle with reference to specific components.

计算机体系结构以及取指‑译码‑执行周期几乎年年必考。你必须能够标注 CPU 示意图，描述寄存器（MAR、MDR、PC、CIR、累加器）的功能，并说明总线如何传送数据、地址和控制信号。题目已从简单的标注升级为要求你结合具体部件逐步叙述整个周期的过程。

Input and output devices, storage media, and memory types (RAM, ROM, cache, SSD, HDD) regularly appear in data‑handling contexts. Questions often ask you to justify the choice of a particular device for a given scenario, rewarding those who can link characteristics such as speed, portability, and capacity to a real‑world need.

输入输出设备、存储介质以及存储器类型（RAM、ROM、高速缓存、固态硬盘、机械硬盘）经常以数据处理场景出现。题目往往要求你针对特定情景为设备选择提出合理依据，善于将速度、便携性、容量等特性与现实需求关联起来的答案最容易得分。

3. Paper 2 Programming and Algorithm Design | 卷二编程与算法设计

Paper 2 is deliberately designed to move beyond mechanical code writing and test computational thinking. Tasks frequently involve loops, conditional statements, array manipulation, and basic file handling. The official CAIE pseudocode guide defines a limited set of structures (FOR, WHILE, REPEAT…UNTIL, IF…THEN…ELSE, CASE OF) and functions, all of which appear consistently in past papers.

卷二刻意超越了机械的代码书写，重在考查计算思维。考题频繁涉及循环、条件语句、数组操作以及基础文件处理。官方 CAIE 伪代码指南限定了一组结构（FOR、WHILE、REPEAT…UNTIL、IF…THEN…ELSE、CASE OF）和函数，这些在历年真题中一以贯之地出现。

One signature question type provides incomplete pseudocode or a flowchart and asks you to fill the gaps. Here, you need to trace the logic, identify the purpose of each variable, and understand the overall goal of the algorithm. Another common task requires you to write a complete algorithm from a written specification, often involving totalling, counting, searching, or sorting data stored in arrays.

一类标志性题目是提供不完整的伪代码或流程图，要求你补全空缺。此时你需要追踪逻辑、辨析每个变量的作用，并理解算法的整体目标。另一常见任务是让你根据文字说明编写完整算法，通常涉及对存储在数组中的数据进行累加、计数、查找或排序。

Trace tables are a powerful tool not only for your own debugging but also for answering exam questions. You may be asked to complete a trace table by hand, recording the values of variables after each iteration. This tests your ability to mentally execute an algorithm, a skill that is rewarded highly if the table is presented neatly and accurately.

跟踪表不仅是调试时的利器，也是应对考试题目的有力工具。你可能需要手工填写跟踪表，记录每次迭代后各变量的值。这考查的是在头脑中执行算法的能力；如果表格填写整洁、准确，得分通常相当可观。

4. High‑frequency Algorithms: Sorting and Searching | 高频算法：排序与搜索

CAIE past papers repeatedly examine linear search, binary search, bubble sort, and, less frequently, insertion sort. You must know not just how to write these algorithms but also how they compare in terms of efficiency. For instance, questions often ask you to state the maximum number of comparisons in a binary search on an array of n elements. Understanding that binary search halves the search space each time leads to the answer log₂n.

CAIE 历年真题反复考查线性查找、二分查找、冒泡排序，偶尔也涉及插入排序。你不仅要会写这些算法，还必须懂得从效率角度进行比较。例如，题目常会问对于 n 个元素的数组，二分查找最多需要多少次比较。理解二分查找每次将搜索空间减半，就能得出答案是 log₂n。

Bubble sort appears most frequently in the context of completion or tracing. Past papers show that examiners expect you to understand why a single pass places the largest element at the end and how a boolean ‘swapped’ flag can be used to make the algorithm more efficient. Writing a bubble sort that processes an array from index 0 to length‑1 is a skill that should be practised until it becomes automatic.

冒泡排序最常出现在补全代码或跟踪执行的题型中。真题显示，考官期望你理解为何一趟排序能将最大元素移至末尾，以及如何使用布尔型 “swapped” 标记来提高算法效率。编写一个从索引 0 至 length‑1 处理数组的冒泡排序，这项技能应反复练习直至驾轻就熟。

Searching algorithms are often embedded in larger problem‑solving contexts, such as finding a specific student record or checking whether a product code exists. The choice between linear and binary search hinges on whether the data is sorted. When a question specifies “sorted array”, you are expected to choose binary search and explain its advantage in speed.

搜索算法往往嵌入更广泛的问题解决情境中，比如查找特定的学生记录或检查某个产品代码是否存在。选择线性查找还是二分查找，关键取决于数据是否已排序。一旦题目写明 “已排序数组”，你就应该选用二分查找并说明其在速度上的优势。

5. Data Representation: Binary, Hexadecimal, and More | 数据表示：二进制、十六进制等

Data representation questions in past papers often follow a predictable pattern: conversion, arithmetic, and interpretation. A typical exercise might ask you to convert the denary number 200 into an 8‑bit binary number, then express the same value in hexadecimal. Centring such practice around the 8‑bit and 16‑bit boundaries familiarises you with the most common exam settings.

历年真题中的数据表示题常依循一个可预测的模式：转换、运算和解释。典型的练习题可能是将十进制数 200 转换为 8 位二进制数，再用十六进制表示同一数值。围绕 8 位和 16 位边界反复练习，能使你熟悉最常见的题目设置。

200₁₀ = 11001000₂ = C8₁₆

Hexadecimal is not just tested in isolation; it is linked to colour codes in HTML, MAC addresses, and memory dumps. When you see a sequence like 4C 69 73 61, you should recognise that each pair represents a byte, and being able to interpret it as ASCII text can earn quick marks.

十六进制不仅是孤立考查的内容，它还与 HTML 颜色代码、MAC 地址以及内存转储相关联。看到 4C 69 73 61 这样的序列时，你应该意识到每一对代表一个字节，能将其解读为 ASCII 文本就能快速得分。

Binary addition and overflow are common in Paper 1. You may be presented with two 8‑bit numbers and asked to add them, detecting whether an overflow occurs. Recognising that in an 8‑bit register, a result like 100000001₂ signals overflow because it needs 9 bits, is a classic mark‑winning point.

二进制加法与溢出是卷一常考内容。题目可能给出两个 8 位二进制数，要求你相加并判断是否发生溢出。明白在 8 位寄存器中，类似 100000001₂ 的结果需要 9 位来表示，这就意味着溢出，乃是经典的得分点。

6. Logic Gates and Boolean Expressions | 逻辑门与布尔表达式

Logic gate questions have grown increasingly analytical. Early questions focused on drawing standard symbols and completing truth tables for AND, OR, NOT, NAND, NOR, and XOR gates. Recent papers, however, frequently combine gates into simple circuits and ask you to complete a truth table or write the Boolean expression for the output Q.

逻辑门考题的分析性日益增强。早年的题目集中于画出标准符号并完成 AND、OR、NOT、NAND、NOR、XOR 门的真值表。然而，近几年的试卷常将多个门组合成简单电路，要求你完成真值表或写出输出 Q 的布尔表达式。

A	B	A∧B (AND)	A∨B (OR)	¬A (NOT)
0	0	0	0	1
0	1	0	1	1
1	0	0	1	0
1	1	1	1	0

When dealing with combination circuits, a systematic approach is to label intermediate outputs and construct a truth table column by column. For example, the circuit for Q = (A∧B)∨(¬A∧B) simplifies immediately to B, and students who notice such identities save valuable time in the exam.

处理组合逻辑电路时，系统性的方法是标注中间输出，并逐列构建真值表。例如，电路 Q = (A∧B)∨(¬A∧B) 实际上直接简化为 B，能察觉到此类恒等式的同学将在考试中节省宝贵的时间。

Boolean algebra simplification rarely appears as a stand‑alone question but is extremely useful for checking circuit designs. Knowing De Morgan’s laws and the distributive, associative, and absorption laws allows you to verify whether a proposed solution could be made simpler or whether two expressions are equivalent.

布尔代数化简很少作为独立题目出现，但在验证电路设计时极其有用。掌握德摩根定律以及分配律、结合律和吸收律，你就能判断所提出的方案能否变得更简洁，或两个表达式是否等价。

7. Databases and SQL Queries | 数据库与 SQL 查询

Database topics appear regularly in Paper 1, usually focused on flat‑file versus relational databases, primary and foreign keys, and the design of simple queries. You need to be comfortable with SQL statements using SELECT, FROM, WHERE, ORDER BY, and aggregate functions like COUNT, SUM, and AVG. Past papers show that most queries are based on a small set of tables provided in the question.

数据库主题在卷一中定期出现，通常聚焦于平面文件数据库与关系数据库的对比、主键与外键，以及简单查询的设计。你需要熟练运用 SELECT、FROM、WHERE、ORDER BY 以及 COUNT、SUM、AVG 等聚合函数的 SQL 语句。真题显示，大多数查询都基于题目所提供的少量表格。

SELECT Name, Grade FROM Students WHERE Grade > 70 ORDER BY Name ASC;

A subtle point that examiners test is the difference between WHERE and HAVING. WHERE filters individual records before any aggregation, while HAVING filters groups after a GROUP BY clause. Recognising when to use GROUP BY alongside an aggregate function can be the deciding factor in correctly answering a 3‑ or 4‑mark question.

考官常考的一个细致区别是 WHERE 与 HAVING 的差异：WHERE 是在任何聚合之前筛选单条记录，而 HAVING 是在 GROUP BY 分组之后对组进行过滤。准确辨识何时联合使用 GROUP BY 与聚合函数，往往是能否答好一道 3 分或 4 分题的决定因素。

8. Computer Architecture: CPU, Memory, and Storage | 计算机体系结构：CPU、内存与存储

The fetch‑decode‑execute cycle is a favourite topic for extended‑response questions. You may be required to list the steps in chronological order: the address from the PC is placed on the address bus, the instruction is fetched into the MDR, it is copied to the CIR, the PC is incremented, and the instruction is executed. Linking each step with the relevant register and bus secures full marks.

取指‑译码‑执行周期是扩展作答题偏爱的主题。你可能需要按时间顺序列出步骤：PC 中的地址被放到地址总线上，指令被取入 MDR，复制到 CIR，PC 递增，然后执行指令。将每一步与相关的寄存器和总线联系起来，才能拿到满分。

Questions on memory hierarchy increasingly expect you to discuss why a computer uses a combination of RAM, ROM, cache, and virtual memory. You should be able to contrast volatile and non‑volatile storage, explain how cache improves CPU performance by storing frequently accessed instructions, and describe the role of virtual memory when RAM is full.

关于存储器层次的题目越来越倾向于要求你讨论计算机为何

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

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

Deep Dive into CAIE IGCSE Computer Science Past Papers | CAIE IGCSE 计算机科学历年真题深度解析