📚 Year 11 Cambridge Computer Science: In-Depth Past Paper Analysis | 剑桥11年级计算机科学：历年真题深度解析
Past papers are the single most valuable revision resource for Cambridge IGCSE Computer Science (0478). They reveal the precise style of questioning, the depth of knowledge expected, and the common traps set by examiners. By systematically analysing past papers, you can transform a daunting syllabus into a manageable set of repeatable patterns. This guide dives deep into the exam structure, revisits the most frequently tested concepts, and shares practical strategies to help you boost your marks.
历年真题是剑桥 IGCSE 计算机科学（0478）复习中最宝贵的资源。它们揭示了出题风格、知识深度要求及考官常设的陷阱。通过系统分析历年真题，你能将庞杂的考纲转化为可重复掌握的题型模式。本指南将深入剖析考试结构，回顾最高频考察的概念，并分享实用策略，助你提升成绩。
1. Understanding the Exam Structure | 理解考试结构
Cambridge IGCSE Computer Science consists of two papers. Paper 1 (Theory) lasts 1 hour 45 minutes, carries 75 marks, and is worth 60% of the total grade. Paper 2 (Problem-solving and Programming) also lasts 1 hour 45 minutes, has 50 marks, and accounts for 40%. Knowing the weight and timing of each paper helps you allocate revision time effectively.
剑桥 IGCSE 计算机科学包含两份试卷。试卷1（理论）时长1小时45分钟，满分75分，占总成绩的60%。试卷2（问题解决与编程）同样时长1小时45分钟，满分50分，占40%。了解每份试卷的权重与时间有助于你合理分配复习精力。
| Paper | Duration | Marks | Weighting | Focus |
|---|---|---|---|---|
| 1 Theory | 1 h 45 min | 75 | 60% | Data representation, networks, hardware, software, security, ethics |
| 2 Problem-solving | 1 h 45 min | 50 | 40% | Algorithms, programming, logic, databases, flowcharts |
Paper 2 includes a 20-mark scenario-based question using pre-release material. Familiarising yourself with this material in advance is essential; examiners expect you to have studied it thoroughly before the exam.
试卷2包含一道基于预发布材料的20分场景题。提前熟悉这份材料至关重要；考官期望你在考前已经彻底研究过它。
2. Paper 1 Theory: High-Yield Topics | 试卷1理论：高频考点
Paper 1 questions are drawn from the entire theory syllabus, but some topics appear almost every year. Binary and hexadecimal conversions, data storage (including file sizes), logic gates and truth tables, and networks (especially protocols and IP/MAC addresses) are all regular features. You must also be prepared for questions on cybersecurity threats, ethical implications of technology, and the fetch-decode-execute cycle.
试卷1题目覆盖全部理论考纲，但有些主题几乎每年出现。二进制与十六进制转换、数据存储（含文件大小计算）、逻辑门与真值表、网络（尤其是协议和IP/MAC地址）都是常客。你还必须准备应对网络安全威胁、科技伦理影响及“取指-解码-执行”循环等题目。
Examiners often test the application of knowledge, not just recall. For example, a question might give you a web address and ask you to explain the role of the DNS, or present a short Python-like pseudocode and ask for the output. Revise by linking concepts to real-world scenarios.
考官常考察知识应用，而非简单记忆。例如，考题可能给出一个网址让你解释DNS的作用，或展示一段类似Python的伪代码让你写出输出。复习时要将概念与现实场景联系起来。
3. Paper 2 Problem-Solving: Tackling the Programming and Algorithm Questions | 试卷2问题解决：攻克编程与算法题
Paper 2 tests your ability to design, trace, and debug algorithms. You will encounter flowchart completion, pseudocode writing, and array processing. The pre-release scenario often involves a menu-driven program, stock control, or a booking system. Spend time understanding the logic behind the pre-release, then practice adapting your solution to the specific tasks described in the exam.
试卷2考察你设计、追踪和调试算法的能力。你会遇到流程图补全、伪代码编写和数组处理。预发布材料常涉及菜单驱动程序、库存管理或预订系统。花时间理解预发布材料背后的逻辑，然后练习根据考题中的具体要求调整你的方案。
Past papers show that many students lose marks by failing to initialise variables, by using incorrect loop conditions, or by forgetting to output the required results. Always test your pseudocode with sample data and check edge cases.
历年真题显示，许多学生因未初始化变量、使用错误的循环条件或忘记输出所需结果而丢分。务必用示例数据测试你的伪代码并检查边界情况。
4. Common Mistakes in Flowchart Questions | 流程图题常见错误
Flowchart tasks frequently ask you to complete missing symbols or to interpret an existing diagram. A classic error is mixing up the diamond (decision) and rectangle (process). Another is drawing flow lines that cross without a clear junction, or failing to use arrows to show direction.
流程图题常要求补全缺失符号或解释已有图表。一个典型错误是混淆菱形（判断）与矩形（处理）。另一个错误是绘制的流程线交叉却没有清晰结点，或忘记用箭头标出方向。
When tracing a flowchart, students sometimes skip updating variables correctly, leading to incorrect final values. Practice on past flowchart trace-table questions, carefully stepping through each loop iteration and decision point.
在进行流程图追踪时，学生有时未能正确更新变量，导致最终值出错。通过练习历年流程图追踪表题目，仔细逐步执行每一轮循环和每一个判断点。
5. Binary and Hexadecimal Conversions | 二进制与十六进制转换
Conversions between denary, binary, and hexadecimal appear in almost every Paper 1. You need to be comfortable with methods like successive division by 2 for binary, and grouping binary bits into nibbles (4 bits) to convert to hex. Past papers also include binary addition and the concept of overflow errors.
十进制、二进制与十六进制之间的转换几乎在每份试卷1中出现。你需要熟练使用除2取余法获得二进制，以及将二进制位每4位一组（半字节）转换为十六进制。历年真题还包含二进制加法与溢出错误概念。
Example: 1101 0011₂ = D3₁₆
1111₂ + 00000001₂ = 1 00000000₂, causing an overflow because the 9th bit cannot be stored.
进行二进制加法时，务必检查是否超出给定位宽而产生进位。对于8位寄存器，11111111₂ + 00000001₂ = 1 00000000₂，会因无法存储第9位而导致溢出。
6. Logic Gates and Truth Tables | 逻辑门与真值表
Logic circuits are drawn using standard symbols for AND, OR, NOT, NAND, and NOR gates. You must be able to complete truth tables, write logic expressions, and draw a circuit from a given Boolean statement. Many past questions combine two or three gates into a single system.
逻辑电路使用AND、OR、NOT、NAND和NOR等标准符号绘制。你必须能补全真值表、写出逻辑表达式，并根据给定的布尔语句绘制电路。许多真题将两到三个门组合为一个系统。
| A | B | A AND B | A OR B | NOT A | NAND |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
A common exam trick is to provide a truth table for an unknown gate and ask you to identify it. Learn to recognise the output patterns of XOR and XNOR gates, which are frequently tested.
一个常见考试技巧是提供未知门的真值表让你识别。学会辨识XOR和XNOR门的输出模式，这些常被考到。
7. Data Storage and Compression | 数据存储与压缩
its, 1 KB = 1024 bytes, 1 MB = 1024 KB. Bit depth and sample rate calculations for audio files, as well as image resolution and colour depth, appear regularly.
文件大小计算题要求你在位、字节、千字节、兆字节等单位间转换。应记住1字节=8位、1KB=1024字节、1MB=1024KB。音频文件的位深度与采样率计算，以及图像分辨率和颜色深度计算也常出现。
Sound file size (bits) = sample rate × bit depth × duration (seconds) × number of channels
Data compression is split into lossy and lossless methods. Run-length encoding (RLE) and Huffman coding are typical lossless algorithms examined in Paper 2. Be ready to encode and decode a string using RLE, and to explain why lossy compression is suitable for JPEG images but not for text files.
数据压缩分为有损和无损两类。行程长度编码（RLE）和哈夫曼编码是试卷2常考的无损算法。准备好用RLE对字符串进行编码解码，并能解释为何JPEG图像适合有损压缩而文本文件不然。
8. Networks and Security | 网络与安全
Networking questions often focus on the role of an IP address versus a MAC address, the function of a router, and the purpose of protocols such as HTTP, HTTPS, FTP, and SMTP. Past papers also test your understanding of the domain name system (DNS) and the process of packet switching.
网络题常聚焦于IP地址与MAC地址的区别、路由器的功能以及HTTP、HTTPS、FTP、SMTP等协议的作用。历年真题也考察你对域名系统（DNS）和分组交换过程的理解。
On the security side, be ready to describe threats like phishing, denial-of-service attacks, malware, and SQL injection, along with prevention methods such as firewalls, encryption, and two-factor authentication. Questions often ask you to evaluate the effectiveness of different security measures for a given scenario.
在安全方面，准备好描述钓鱼、拒绝服务攻击、恶意软件和SQL注入等威胁，以及防火墙、加密和双因素认证等防范方法。题目常要求针对特定场景评估不同安全措施的有效性。
9. Algorithm Design and Pseudocode | 算法设计与伪代码
You are expected to write, read, and amend pseudocode using the Cambridge IGCSE syntax. Common requirements include input/output commands, IF…THEN…ELSE…ENDIF, FOR and WHILE loops, and array handling. Practice converting a written problem statement into a structured algorithm.
你需要使用剑桥 IGCSE 语法编写、阅读和修改伪代码。常见要求包括输入/输出命令、IF…THEN…ELSE…ENDIF、FOR和WHILE循环以及数组处理。练习将文字问题描述转换为结构化算法。
A typical question provides a partially completed algorithm and asks you to fill in missing conditions or statements. Use trace tables to verify your logic. Pay close attention to whether the question requires a count of iterations or the final values of certain variables.
典型题会给出不完整的算法，让你补全缺失条件或语句。使用追踪表验证你的逻辑。仔细留意题目要求的是迭代次数还是某些变量的最终值。
For example, a linear search algorithm might look like this in pseudocode:
例如，线性搜索算法的伪代码可能如下：
FOR i ← 0 TO LENGTH(arr)-1
IF arr[i] = target THEN OUTPUT i
NEXT i
10. Programming Concepts in Practice | 编程概念实战
Even though you do not write real code in the exam, programming fundamentals underpin Paper 2. Variables must be declared and initialised; string concatenation, arithmetic operations, and Boolean conditions should feel natural. Many scenarios involve reading data from a file or a 2D array, so practise traversing arrays and performing calculations like totals and averages.
尽管你在考试中不写真实代码，但编程基础支撑着试卷2。变量必须声明并初始化；字符串连接、算术运算和布尔条件应运感到自然。许多场景涉及从文件或二维数组读取数据，因此练习遍历数组并进行总和与平均值等计算。
Examiners appreciate clear indentation and meaningful variable names in pseudocode. In mark schemes, clear logic that matches the expected outcome often earns full marks even if the syntax is not perfect.
考官欣赏伪代码中的清晰缩进和有意义的变量名。在评分标准中，符合预期结果的清晰逻辑通常可获得满分，即使语法不尽完美。
11. Exam Technique and Time Management | 考试技巧与时间管理
Both papers demand careful time allocation. In Paper 1, aim to spend no more than 1 minute per mark. Longer descriptive questions (4–6 marks) require structured answers with clear paragraphs. Never leave a blank; even a partial attempt can pick up marks.
两份试卷都要求仔细分配时间。试卷1中，争取每题平均不超过1分钟/分。较长的描述性题目（4-6分）需要结构化的清晰段落作答。绝不留白；即使部分答案也可能得分。
For Paper 2, begin by reading the pre-release question thoroughly and identifying what is already provided and what needs to be built. Then move to the shorter algorithm tasks. Keep your pseudocode neat and leave space for amendments, as you may need to go back and correct a loop condition.
对于试卷2，开始时先通读预发布材料题，明确哪些部分已给出、哪些需构建。然后完成较短的算法任务。保持伪代码整洁并留出修改空间，因为你可能需要回头修正循环条件。
12. Revision Strategies Using Past Papers | 利用历年真题复习策略
Start your revision by printing a complete past paper and attempting it under timed conditions. This baseline reveals your weak areas. Afterwards, review the mark scheme carefully; sometimes the official answer uses specific terminology or a particular layout that you can replicate. Keep a log of your mistakes and revisit those topics in your textbook or notes.
开始复习时，打印一份完整真题并在限时条件下尝试。这份基线将暴露你的薄弱点。之后仔细审阅评分标准；有时官方答案使用特定术语或格式，你可以模仿。记录你的错误，并回头在教材或笔记中复习相关主题。
Create a topic checklist from the syllabus and track your confidence level after each past paper. Rotate between Paper 1 and Paper 2, and save the most recent papers for final mock exams. Active recall – writing out answers from memory – is far more effective than passive reading.
根据考纲制作一个主题清单，在每完成一套真题后追踪你的信心程度。在试卷1与试卷2间交替练习，并保留最新真题用于最终模拟考。主动回忆——凭记忆写出答案——远比被动阅读有效。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图