📚 IGCSE Computer Science: Past Paper Analysis | IGCSE 计算机：历年真题解析
Past papers are the most powerful tool for mastering IGCSE Computer Science. By examining real exam questions, learners can spot recurring patterns, understand how mark schemes work, and avoid common mistakes. This article analyses high-frequency topics, provides step-by-step solutions, and offers bilingual commentary to help you revise efficiently.
历年真题是掌握 IGCSE 计算机科学最有力的工具。通过研究真实考题，学生可以发现反复出现的模式，理解评分方案如何运作，并避免常见错误。本文分析高频主题，提供逐步解析，并配以双语点评，帮助你高效复习。
1. Number Systems and Binary Conversions | 数制与二进制转换
A typical question asks you to convert a denary number such as 173 into an 8‑ the result to exactly 8 bits or by reading remainders in the wrong order. Use the division‑by‑ ; 5 ÷ 2 = 2 r1; 2 ÷ 2 = 1 r0; 1 ÷ 2 = 0 r1. Read upwards: 10101101. Because it is already 8 bits, no extra zeros are needed.
典型题目要求你将十进制数（例如 173）转换为 8 位二进制数。许多学生因忘记将结果补齐为 8 位或读错余数顺序而丢分。使用除 2 取余法，直到商为 0，然后从下往上书写余数。173 的计算：173 ÷ 2 = 86 余 1；86 ÷ 2 = 43 余 0；43 ÷ 2 = 21 余 1；21 ÷ 2 = 10 余 1；10 ÷ 2 = 5 余 0；5 ÷ 2 = 2 余 1；2 ÷ 2 = 1 余 0；1 ÷ 2 = 0 余 1。从下往上读：10101101。因其正好 8 位，无需补零。
ned for showing the nibble grouping. When the reverse is required, e.g., 5C₁₆ to binary, write each hex digit as a 4‑bit group: 5 → 0101, C → 1100, so 01011100₂.
十六进制转换也经常出现。将 1101 1010₂ 转为十六进制时，先拆分为半字节：1101₂ = D，1010₂ = A，得到 DA₁₆。评分常会给“显示半字节分组”的步骤分。反向转换时，例如 5C₁₆ 转二进制，把每个十六进制数字写成 4 位二进制：5 → 0101，C → 1100，因此结果为 01011100₂。
2. Data Storage and File Sizes | 数据存储与文件大小
stead of 1024. Exam boards expect: 1 KiB = 2¹⁰ bytes = 1024 bytes; 1 MiB = 2²⁰ bytes; 1 GiB = 2³⁰ bytes. When calculating the size of a sound file, use the formula: size = sample rate × sample resolution × duration in seconds. For a stereo track, remember to multiply by 2.
历年真题常考位、字节、千比字节、兆比字节、吉比字节之间的关系。常见的错误是使用 1000 的幂而不是 1024。考试局期望的换算为：1 KiB = 2¹⁰ 字节 = 1024 字节；1 MiB = 2²⁰ 字节；1 GiB = 2³⁰ 字节。计算声音文件大小时，使用公式：大小 = 采样率 × 采样分辨率 × 持续时间（秒）。如果是立体声，别忘了乘以 2。
× colour depth in bits, then convert to bytes by dividing by 8. A 1024 × 768 image with 24‑ . Show every step in your answer to secure method marks even if an arithmetic slip occurs.
图像文件大小也是热门考点：宽度 × 高度 × 颜色深度（位），然后除以 8 转换为字节。一幅 1024 × 768、24 位色的图像，计算得 1024 × 768 × 24 = 18 874 368 位 = 2 359 296 字节 ≈ 2.25 MiB。每一步都要展示在答案中，这样即使发生计算错误也能获得方法分。
3. Logic Gates and Truth Tables | 逻辑门与真值表
Questions on logic circuits usually provide a diagram containing AND, OR, NOT, NAND, or NOR gates and ask you to complete a truth table or write a logic expression. Start by labelling intermediate outputs, then work column by column. For a circuit with inputs A and B feeding an AND gate whose output is connected to a NOT gate, the final output is ¬(A ∧ B), which is a NAND operation. Many marks are lost when students confuse ∧ with ∨. Always double‑check the gate symbols.
逻辑电路题通常会给出包含 AND、OR、NOT、NAND 或 NOR 门的电路图，要求完成真值表或写出逻辑表达式。先标出中间输出，然后逐列求解。对于输入 A 和 B 经过一个 AND 门，其输出连接到 NOT 门的电路，最终输出为 ¬(A ∧ B)，即 NAND 运算。许多学生因混淆 ∧ 和 ∨ 而丢分。务必反复确认门符号。
Creating a truth table for a three‑ column. If the question asks you to draw a circuit from a given expression such as Q = (A ∨ B) ∧ ¬ te for C, then an AND gate combining them. Practice drawing neat, correctly shaped symbols – examiners penalise ambiguous sketches.
为三输入系统（A、B、C）创建真值表时，可以系统地列出从 000 到 111 的二进制值。先写出每个中间门的输出，再写最终输出列。如果题目要求根据给定表达式 Q = (A ∨ B) ∧ ¬C 画出电路图，应分步构建：用 OR 门处理 A 和 B，NOT 门处理 C，然后用 AND 门将两者结合。练习画出整齐且形状正确的符号——考官会对含糊不清的草图扣分。
4. Computer Architecture and the Fetch–Decode–Execute Cycle | 计算机体系结构与取指–译码–执行周期
The CPU's fetch–decode–execute cycle is a guaranteed topic. You must be able to describe the role of the program counter (PC), memory address register (MAR), memory data register (MDR), current instruction register (CIR), and the accumulator. A typical 4‑mark question: "Describe the fetch stage." Answer: The PC holds the address of the next instruction; this address is copied to the MAR and sent via the address bus to main memory; the control unit sends a read signal; the instruction at that address is placed on the data bus and loaded into the MDR; finally, the instruction is copied to the CIR. The PC is incremented.
CPU 的取指–译码–执行周期是必考主题。你必须能描述程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）、当前指令寄存器（CIR）和累加器的角色。典型 4 分题：“描述取指阶段。”答案：PC 存放下一条指令的地址；该地址被复制到 MAR 并通过地址总线送往主存；控制单元发送读信号；该地址的指令被放到数据总线上并加载到 MDR；最后，指令被复制到 CIR。PC 递增。
Exam questions often link architecture to embedded systems and von Neumann design. The von Neumann architecture stores both instructions and data in the same memory, which is simpler but can suffer from the von Neumann bottleneck. Contrast this with Harvard architecture sometimes mentioned in extended questions. Knowing the function of the ALU, CU, and buses (address, data, control) strengthens your answers.
考试题常将体系结构与嵌入式系统及冯·诺依曼设计联系起来。冯·诺依曼体系结构将指令和数据存储在同一内存中，设计更简单但可能遇到冯·诺依曼瓶颈。可与 Harvard 体系结构进行对比，后者有时会出现在扩展题中。理解 ALU、CU 以及总线（地址、数据、控制）的功能能让你的答案更扎实。
5. Input and Output Devices | 输入与输出设备
Application‑based questions require you to justify the choice of an input or output device for a given scenario. For instance, a weather station in a remote location might use temperature, humidity, and wind speed sensors as inputs, and a radio transmitter or satellite link for output. Simply naming a device is not enough; you must explain why it is suitable, referring to the environment, accuracy, speed, or cost.
基于应用场景的题目要求你为特定情况选择输入或输出设备并说明理由。例如，一个偏远地区的气象站可能使用温度、湿度和风速传感器作为输入，并使用无线电发射器或卫星链路作为输出。仅说出设备名称是不够的；你必须解释其为何适合，涉及环境、精度、速度或成本等因素。
Touchscreens, QR code scanners, and 3D printers appear in modern contexts. When discussing a 3D printer as an output device, link it to rapid prototyping, precision, and the ability to create complex shapes that traditional manufacturing cannot. Use technical vocabulary like actuator, resolution, or haptic feedback where appropriate. Marks are given for making direct connections between device characteristics and the scenario.
触摸屏、二维码扫描仪和 3D 打印机常在现代场景中出现。在将 3D 打印机作为输出设备讨论时，可联系到快速原型制作、高精度以及能够制造传统生产无法实现的复杂形状等优势。适当使用执行器、分辨率或触觉反馈等专业词汇。将设备特性与场景直接关联才能得分。
6. Network Hardware and Topologies | 网络硬件与拓扑结构
Questions on networks often ask you to draw or label a star topology and explain its advantages over a bus or mesh. In a star, each node connects to a central switch or hub; if one cable fails, only that node is affected, making it robust. A bus topology has a single backbone cable, so a break can disable the entire network, but it requires less cable. Past papers also examine the roles of routers, switches, and network interface cards (NICs).
网络题常要求画出或标注星形拓扑，并解释其相较于总线或网状拓扑的优势。在星形结构中，每个节点连接到中央交换机或集线器；如果一条电缆故障，仅该节点受影响，因此很可靠。总线拓扑只有一条主干电缆，一处断裂可能导致整个网络瘫痪，但所需电缆更少。历年真题也考查路由器、交换机和网络接口卡（NIC）的作用。
IP and MAC addressing is a frequent source of confusion. Know the format of IPv4 (four octets, each 0–255) and that MAC addresses are 48‑bit hex identifiers unique to a device’s NIC. When explaining packet switching, describe how data is broken into packets with header (destination address, sequence number) and payload, then reassembled at the destination. Include the role of routers in forwarding packets along the best path.
IP 与 MAC 地址是常见的混淆点。要了解 IPv4 的格式（四个八位位组，每个取值范围 0–255），以及 MAC 地址是设备 NIC 唯一的 48 位十六进制标识符。在解释分组交换时，描述数据如何被分割成带有头部（目标地址、序列号）和有效载荷的数据包，然后在目标端重新组装。要提到路由器在沿最佳路径转发数据包中的作用。
7. Cybersecurity Threats and Prevention | 网络安全威胁与防护
Threats such as malware, phishing, brute‑force attacks, and denial‑of‑service are examined almost every session. You need to describe how each threat works and, crucially, how it can be prevented or mitigated. For phishing, explain that it uses deceptive emails or websites to trick users into revealing credentials; prevention includes user education, spam filters, and multi‑factor authentication. For brute‑force, mention strong password policies and account lockout after several failed attempts.
恶意软件、钓鱼攻击、暴力破解和拒绝服务等威胁几乎每场考试都会出现。你需要描述每种威胁的工作原理，以及关键的是如何预防或缓解。对于钓鱼攻击，要说明其利用欺骗性邮件或网站诱骗用户泄露凭据；防护措施包括用户教育、垃圾邮件过滤器和多因素认证。对于暴力破解，要提及强密码策略和多次失败后账户锁定。
Encryption is a core protective measure. Symmetric encryption uses a single key, so it is fast but requires secure key exchange. Asymmetric encryption uses a public/private key pair, solving the key distribution problem but being computationally heavier. When asked about SSL/TLS, mention certificates, the handshake process, and how it ensures confidentiality and integrity of data in transit. Data integrity can also be ensured by hashing and digital signatures.
加密是一项核心保护措施。对称加密使用单一密钥，速度快但需要安全的密钥交换。非对称加密使用公钥/私钥对，解决了密钥分发问题，但计算开销更大。在被问到 SSL/TLS 时，要提及证书、握手过程，以及它如何确保传输中数据的机密性和完整性。数据完整性也可以通过哈希和数字签名来保证。
8. Algorithm Design and Pseudocode | 算法设计与伪代码
Past papers consistently include a question where you must write pseudocode or interpret a given algorithm. Common tasks involve loops (FOR, WHILE, REPEAT…UNTIL), conditional statements (IF…THEN…ELSE…ENDIF), and array manipulation. Practice tracing an algorithm with a dry run table to determine output values. Many students lose marks by not following the exact pseudocode syntax shown in the syllabus, or by forgetting to initialise variables.
历年真题始终包含一道要求编写伪代码或解释给定算法的题目。常见任务涉及循环（FOR、WHILE、REPEAT…UNTIL）、条件语句（IF…THEN…ELSE…ENDIF）以及数组操作。练习使用干运行表跟踪算法以确定输出值。许多学生因未遵循课程大纲中展示的精确伪代码语法，或忘记初始化变量而丢分。
Searching and sorting algorithms are high‑yield topics. Linear search checks each element sequentially; binary search requires a sorted array and repeatedly divides the search interval in half. Know the worst‑case performances: O(n) for linear, O(log n) for binary. Bubble sort works by repeatedly swapping adjacent elements if they are in the wrong order; it is simple but inefficient for large datasets. You may be asked to explain why a particular algorithm is suitable for a given situation.
搜索和排序算法是高分值主题。线性搜索依次检查每个元素；二分搜索要求数组已排序，并反复将搜索区间减半。要了解最坏情况下的性能：线性搜索为 O(n)，二分搜索为 O(log n)。冒泡排序通过重复交换顺序错误的相邻元素来工作；它简单但对于大数据集效率较低。你可能需要解释为什么某种算法在特定情况下适用。
9. Programming Concepts and Trace Tables | 编程概念与跟踪表
Trace tables are a systematic way to record the changing values of variables as a program executes. Exam questions provide a piece of code (often in pseudocode or Python) and ask you to complete a trace table for a given number of iterations. Common pitfalls include missing an update to a counter or misreading a loop condition. Always check whether the condition is evaluated before or after the loop body (pretest vs posttest loops).
跟踪表是记录程序执行过程中变量值变化的系统方法。考试题会提供一段代码（通常是伪代码或 Python），要求你对给定次数的迭代完成跟踪表。常见误区包括漏掉某个计数器的更新或误读循环条件。务必确认条件是先于循环体评估还是之后（前测循环与后测循环）。
Beyond trace tables, understand variable scope (local vs global), data types (integer, real, Boolean, char, string), and the concept of parameter passing (by value vs by reference). When writing code to solve a problem, plan your solution with a flowchart or pseudocode first. Examiners credit well‑structured code with meaningful variable names and comments.
除了跟踪表，还要理解变量作用域（局部 vs 全局）、数据类型（整型、实型、布尔、字符、字符串）以及参数传递概念（传值 vs 传引用）。在编写代码解决问题时，先用流程图或伪代码规划方案。考官赞赏结构清晰、变量名有意义且包含注释的代码。
10. Databases and SQL | 数据库与 SQL
IGCSE database questions revolve around flat‑file vs relational databases, primary keys, foreign keys, and writing simple SQL queries. A typical question gives a table structure and asks you to write an SQL statement to select, update, insert, or delete data. The most common SQL commands tested are SELECT, FROM, WHERE, ORDER BY, INSERT INTO, UPDATE, and DELETE. You must know how to use logical operators (AND, OR, NOT) and wildcards (LIKE %).
IGCSE 数据库题目围绕平面文件数据库与关系数据库、主键、外键以及编写简单 SQL 查询展开。典型题目会给出一个表结构，并要求你写出 SQL 语句来查询、更新、插入或删除数据。最常考的 SQL 命令是 SELECT、FROM、WHERE、ORDER BY、INSERT INTO、UPDATE 和 DELETE。你必须知道如何使用逻辑运算符（AND、OR、NOT）和通配符（LIKE %）。
Data validation is another angle. Questions may ask you to suggest validation rules for a field: range check, type check, presence check, format check, or lookup check. For example, a date‑of‑birth field might use a range check to ensure the date is in the past, and a format check to enforce DD/MM/YYYY. Be precise in your descriptions, as vague answers such as "check the data is correct" receive no marks.
数据验证是另一个角度。题目可能要求你为某个字段建议验证规则：范围检查、类型检查、存在检查、格式检查或查找检查。例如，出生日期字段可使用范围检查确保日期在过去，以及格式检查强执行 DD/MM/YYYY。描述要精确，因为“检查数据是否正确”这类模糊答案不会得分。
11. Ethical, Legal, and Environmental Issues | 伦理、法律与环境问题
Higher‑scoring questions often require a discussion of the ethical, legal, and environmental impacts of computing technologies. Topics include data privacy (e.g., GDPR), artificial intelligence and job displacement, e‑waste disposal, and the digital divide. To gain full marks, you must present balanced arguments – not just listing advantages or disadvantages, but considering different stakeholders and giving reasoned conclusions.
分值较高的题目常要求讨论计算技术的伦理、法律和环境影响。主题包括数据隐私（如 GDPR）、人工智能与工作岗位流失、电子废物处理以及数字鸿沟。要获得满分，你必须提出平衡的论点——不只是罗列优点或缺点，而是要考量不同利益相关方并给出理性的结论。
When addressing a scenario such as a company using customer data for targeted advertising, discuss consent, anonymisation, the right to be forgotten, and potential misuse if data is hacked. Link to specific legislation where appropriate (Data Protection Act, Computer Misuse Act, Copyright Designs and Patents Act). Environmental questions might require you to mention the carbon footprint of data centres, energy‑efficient coding practices, and recycling of hardware. Using precise terminology shows mastery.
在处理如某公司使用客户数据进行定向广告的情境时，应讨论同意、匿名化、被遗忘权以及数据被黑客攻击后可能被滥用的问题。适当联系具体立法（数据保护法、计算机滥用法、版权设计与专利法）。环境类问题可能要求你提及数据中心的碳足迹、节能编程实践以及硬件回收。使用精确术语能体现扎实的掌握。
12. Exam Technique and Common Pitfalls | 应试技巧与常见误区
Beyond content knowledge, success in IGCSE Computer Science depends on exam technique. Always read the command word: "state" requires a brief answer, "describe" needs detail, and "explain" demands reasons. Allocate time proportionally to marks – spending 15 minutes on a 4‑mark question can cost you the paper. In longer‑answer questions, use the bullet point structure to ensure you cover every aspect requested.
除内容知识外，IGCSE 计算机科学的成功还取决于应试技巧。务必阅读指令词："state" 要求简短回答，"describe" 需要细节，"explain" 要求说明原因。按分值分配时间——在 4 分题上花 15 分钟可能会让你牺牲整张卷子的成绩。在长答题中，使用要点式结构以确保覆盖所有要求方面。
Pitfalls include writing overly long introductions instead of giving direct facts, neglecting to convert units when comparing file sizes, and not practising drawing clean logic circuits. Also, many students leave blank questions, but an attempted answer with some relevant keywords can gain partial marks. Finally, complete at least three full past papers under timed conditions, then self‑mark with the official mark scheme – this gap analysis is the fastest path to improvement.
常见误区包括撰写冗长的引言而非直接给出事实，比较文件大小时忘记转换单位，以及不练习绘制整洁的逻辑电路。此外，许多学生留空题，但其实只要写出包含相关关键词的答案就能获得部分分数。最后，在限时条件下完成至少三套完整真题，然后对照官方评分方案自我批改——这种差距分析是提分最快的方法。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图