📚 Year 11 CAIE Computer Science: In-Depth Past Paper Analysis | Year 11 CAIE 计算机：历年真题深度解析
Past papers are the most effective revision resource for CAIE IGCSE Computer Science (0478). By systematically analysing previous examinations, you can uncover the patterns, question styles, and marking keys that lead directly to higher marks. This deep dive explores the core topics tested year after year, illustrates common pitfalls with real question types, and equips you with strategies to approach each paper confidently.
历年真题是备考 CAIE IGCSE 计算机科学 (0478) 最有效的复习资源。通过系统分析往年试卷，你可以发现出题规律、问题风格以及阅卷关键点，这些都能直接转化为更高的分数。这次深度解析将探究年复一年反复考查的核心主题，用真实的题型说明常见陷阱，并为你提供自信应对每一份试卷的策略。
1. Understanding the Paper Structure | 理解试卷结构
Paper 1 is a 1 hour 45 minute written theory paper worth 75 marks, covering all topics from data representation to the internet. Questions often combine short answers with longer structured questions that require justification. Paper 2 is a 1 hour 45 minute problem-solving and programming paper worth 75 marks, including algorithm design, pseudocode, and a substantial programming task. Knowing the weight of each section helps you allocate revision time proportionally.
试卷 1 是时长 1 小时 45 分钟的理论笔试，满分 75 分，涵盖从数据表示到互联网的所有主题。题目通常结合了简答题和需要论述理由的长篇结构化问题。试卷 2 是时长 1 小时 45 分钟的问题解决与编程考试，满分 75 分，包含算法设计、伪代码以及一项分值较高的编程任务。了解各部分的权重有助于你按比例分配复习时间。
2. Decoding Command Words | 指令词解码
Examiners use precise command words to signal what is expected. 'State' means give a concise fact; 'Describe' requires a step-by-step account; 'Explain' asks for reasons or causes; 'Compare' needs similarities and differences. A common mistake is to only state when an explanation is required. Use a table to memorise these triggers so you never lose marks through misunderstanding.
阅卷人使用准确的指令词来表示要求。'State' 表示给出简洁的事实；'Describe' 要求逐步陈述；'Explain' 需要理由或原因；'Compare' 则需要列出相似点和不同点。一个常见的错误是在要求解释时只进行了陈述。用一个表格记住这些提示词，这样你就不会因误解而丢分。
| Command Word 指令词 | Meaning 含义 | Typical Depth 典型深度 |
| Identify / State | Give a named fact or value | One word / phrase |
| Describe | Provide a detailed sequence | 3–4 connected points |
| Explain | Give reasons, causes, effects | Point + because/so |
| Compare | Similarities and differences | Both, whereas... |
3. Data Representation Pitfalls | 数据表示常见的陷阱
Questions on binary, hexadecimal, and overflow are extremely common. A typical past paper asks you to add two 8‑bit binary numbers and indicate whether an overflow occurs. For example, add 10111010₂ (186) and 01100101₂ (101). The correct result is 1 00011111₂, but since we are restricted to 8 bits, the ninth bit is lost, causing an overflow error. The key is to always show the carry and declare the overflow explicitly. Hexadecimal conversion traps appear when students confuse nibbles – remember each hex digit represents exactly 4 bits.
关于二进制、十六进制和溢出的考题非常常见。一道典型的真题会要求你将两个 8 位二进制数相加并指出是否发生溢出。例如，将 10111010₂ (186) 与 01100101₂ (101) 相加。正确结果为 1 00011111₂，但由于我们限制在 8 位内，第九位丢失，从而产生溢出错误。关键是一定要展示进位并明确声明溢出。十六进制转换的陷阱常常出现在学生混淆半字节时——记住每个十六进制数字恰好代表 4 个比特。
4. Networking and the Internet | 网络与互联网
Past papers heavily test the roles of protocols (HTTP, HTTPS, FTP, SMTP, POP3, IMAP), URL structure, and the distinction between IP and MAC addresses. A favourite 6‑mark question is 'Explain how a web page is retrieved using DNS and HTTP.' You must describe the DNS lookup translating the domain to an IP address, then the HTTP GET request and response. Always link the function of each protocol to the stage of the process – marks are lost for generic statements without sequence.
真题大量考查协议（HTTP、HTTPS、FTP、SMTP、POP3、IMAP）、URL 结构以及 IP 地址和 MAC 地址的区别。一道常考的 6 分题是“解释如何通过 DNS 和 HTTP 获取一个网页。”你必须描述 DNS 查询将域名转换为 IP 地址，然后浏览器发出 HTTP GET 请求并收到响应。始终把每个协议的功能与过程中的步骤联系起来——缺乏顺序的笼统陈述是失分点。
5. Computer Architecture Essentials | 计算机体系结构核心要点
The Von Neumann architecture, roles of the CPU registers (MAR, MDR, PC, CIR, ACC), and the fetch‑decode‑execute cycle are examined in nearly every session. When asked to describe the FDE cycle, a complete answer should mention: the address from the PC is copied to the MAR, the instruction is fetched from RAM into the MDR, it is moved to the CIR, the PC is incremented, and then the control unit decodes and executes it, possibly using the ACC. Linking each step to a specific register earns full marks.
冯·诺依曼体系结构、CPU 寄存器（MAR、MDR、PC、CIR、ACC）的作用以及取指‑解码‑执行周期几乎每次考试都会涉及。当被要求描述 FDE 周期时，完整的答案应包含：PC 中的地址被复制到 MAR，指令从 RAM 被取至 MDR，再移入 CIR，PC 递增，然后控制单元解码并执行该指令，可能用到累加器 ACC。将每一步与具体的寄存器关联起来，才能拿到满分。
6. System Software, Interrupts and Utility Programs | 系统软件、中断与实用程序
Examiners often set scenario‑based questions: 'A user is running a presentation and receives a video call. Explain how the operating system handles this interrupt.' A top‑band answer explains that the current process’s register data is saved onto the stack, the interrupt is identified, the appropriate interrupt service routine (ISR) is executed, and then the saved data is restored. Without mentioning the stack and ISR, you cap at half marks. Utility software such as disk defragmenters and backup tools are also tested; you must describe their purpose with a concrete example.
出题人经常设置情景题：“一位用户正在运行演示文档时接到视频电话。解释操作系统如何处理这个中断。”高分答案会解释当前进程的寄存器数据被保存到堆栈，中断被识别，相应的中断服务程序 (ISR) 得到执行，然后恢复已保存的数据。如果不提及堆栈和 ISR，你最多只能得到一半分数。磁盘碎片整理程序和备份工具等实用软件也常考；你必须用具体的例子说明其用途。
7. Security Threats and Ethical Scenarios | 安全威胁与伦理情景
Questions on phishing, brute‑force attacks, denial‑of‑service, malware, and social engineering require precise technical definitions and real‑world impacts. A past paper asked: 'Describe how a brute‑force attack is carried out and suggest one way to defend against it.' The answer must explain systematically trying all possible password combinations, and then state countermeasures like account lockout or strong password policies. Ethics and legal topics (Data Protection Act, Computer Misuse Act) are often paired with security, so be ready to link a threat to a specific piece of legislation.
关于网络钓鱼、暴力破解攻击、拒绝服务、恶意软件和社会工程学的问题，需要精确的技术定义和现实世界的影响。一道真题曾问：“描述暴力破解攻击是如何实施的，并提出一种防御方法。”答案必须解释系统地尝试所有可能的密码组合，然后陈述诸如账户锁定或强密码策略等对策。伦理与法律主题（数据保护法、计算机滥用法）常常与安全搭配出现，因此要准备好将威胁与具体的法规联系起来。
8. Algorithm Design and Trace Tables | 算法设计与追踪表
Paper 2 invariably includes a trace table question. You are given pseudocode with loops and conditions and must complete a table showing the step‑by‑step values of variables. A common error is to miss updating a variable inside a loop or to forget the final value after the loop condition fails. Practice by drawing extra columns for each relevant variable and carefully stepping through the code. The algorithm design tasks often ask you to write a flowchart or pseudocode for a given problem, such as calculating a running total or validating input. Use meaningful variable names and include validation loops to meet all mark scheme points.
试卷 2 几乎一定包含追踪表问题。你会得到带有循环和条件的伪代码，必须填写一个表格以显示变量逐步变化的值。一个常见错误是在循环内忘记更新某个变量，或者在循环条件失败后忘记最终值。练习时可以为每个相关变量多画几列，仔细地逐步执行代码。算法设计任务则经常要求你为一个给定问题画出流程图或写出伪代码，比如计算累加和或验证输入。使用有意义的变量名并包含验证循环，才能覆盖阅卷方案的所有计分点。
9. Programming Concepts and Pseudocode Techniques | 编程概念与伪代码技巧
Mastering the CAIE‑specific pseudocode notation is essential. Past papers highlight the need for correct IF...THEN...ELSE...ENDIF structures, FOR...TO...NEXT loops, and WHILE...DO...ENDWHILE loops. Array handling, including 1D and 2D arrays, is frequently tested – you must know how to declare, iterate, and search within arrays. The extended writing tasks often involve reading from or writing to a file, so be familiar with OPEN, READ, WRITE, and CLOSE statements. Neat indentation in your pseudocode not only improves readability but also signals logical clarity to the examiner.
掌握 CAIE 特定的伪代码符号至关重要。历年真题突显了正确使用 IF...THEN...ELSE...ENDIF 结构、FOR...TO...NEXT 循环以及 WHILE...DO...ENDWHILE 循环的必要性。数组处理，包括一维和二维数组，频频被考到——你必须知道如何声明、遍历和搜索数组。较长的写作题往往涉及文件读写，因此要熟悉 OPEN、READ、WRITE 和 CLOSE 语句。伪代码中清晰的缩进不仅能增强可读性，还能向阅卷人展示逻辑的清晰性。
10. Logic Gates and Boolean Algebra | 逻辑门与布尔代数
tion gives the expression X = (A AND B) OR (NOT C) and asks for a truth table and a circuit diagram. First construct the truth table with all input combinations, then evaluate sub‑expressions step‑wise. For the circuit, use standard AND (D‑ lification using laws like De Morgan’s is sometimes tested in theory; practice rewriting expressions into minimal forms.
逻辑电路在两张试卷中都会出现，往往要求你根据布尔表达式画出电路或完成真值表。一道典型的真题给出表达式 X = (A AND B) OR (NOT C) 并要求绘制真值表和电路图。首先用所有输入组合建立真值表，然后逐步计算子表达式。画电路时使用标准的与门（D 形）、或门（弧形）和非门（带小圆圈三角形）。图表必须整洁，并清楚地标注输入 A、B、C 以及输出 X。有时理论考试中还会考查用德摩根律等进行布尔化简；练习将表达式改写为最简形式。
11. Databases and SQL in Practice | 数据库与 SQL 实战
e structure. You must be fluent in SELECT, FROM, WHERE, ORDER BY, and aggregate functions like COUNT and SUM. A past paper presented a table Students(StudentID, Name, Year, TutorGroup) and asked: 'ite an SQL statement to list the names of all students in Year 11, ordered alphabetically.' ake sure you omit semicolons only if the mark scheme does not require them, but clarity is key. Also revise primary keys, foreign keys, and the concept of data redundancy.
数据库题目通常要求你为给定的表结构编写 SQL 查询。你必须熟练运用 SELECT、FROM、WHERE、ORDER BY 以及诸如 COUNT、SUM 等聚合函数。一道真题给出了表 Students(StudentID, Name, Year, TutorGroup) 并提问：“写出一条 SQL 语句，按字母顺序列出所有 11 年级学生的姓名。”答案是：SELECT Name FROM Students WHERE Year = 11 ORDER BY Name ASC。务必注意，除非阅卷方案另有要求，通常可以省略分号，但清晰性才是关键。此外，还需复习主键、外键以及数据冗余的概念。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图