📚 Year 10 Cambridge Computer Science: Exam Preparation Time Planning & Strategies | 十年级剑桥计算机科学：备考时间规划与策略
Effective time planning is the secret to mastering Cambridge IGCSE Computer Science in Year 10. This guide provides a step-by-step strategy to balance theory, programming, and exam practice, ensuring you build strong foundations and enter the exam hall with confidence.
高效的时间规划是掌握十年级剑桥 IGCSE 计算机科学的秘诀。本指南提供分步策略，帮助你在理论、编程和考试练习之间取得平衡，确保打下坚实基础并自信走进考场。
1. Understanding the Exam Structure & Assessment | 了解考试结构与评分
Begin by downloading the official syllabus (0478 or 0984) from the Cambridge International website. Familiarise yourself with the two compulsory papers and their weightings.
首先从剑桥国际官网下载官方大纲（科目代码 0478 或 0984），熟悉两场必考试卷及其权重。
| Paper | Focus | Duration & Marks | Weighting |
|---|---|---|---|
| Paper 1: Computer Systems | Theory of data representation, hardware, software, networks, cybersecurity, ethics | 1 hr 45 min, 75 marks | 50% |
| Paper 2: Algorithms, Programming & Logic | Algorithm design, pseudocode, programming concepts, logic gates, databases | 1 hr 45 min, 75 marks | 50% |
Knowing the exact assessment objectives helps you allocate study time according to mark weight. For example, Paper 2 demands hands-on programming practice; reading alone is insufficient.
明确评分目标有助于按分值分配学习时间。例如 Paper 2 要求动手编程实践，仅靠阅读远远不够。
Review the grade thresholds from recent exam series to set a realistic target, such as aiming for a Grade 8 or 9, and understand how many marks you typically need.
查阅近几场考试的成绩等级线，设定切合实际的目标（如冲刺 8 级或 9 级），并弄清楚通常需要达到多少原始分数。
2. Setting Up a Long-Term Study Schedule | 制定长期学习时间表
Count the weeks until your mock exams and final exams. A typical Year 10 student has about 20–30 school weeks before the IGCSE series. Divide this into three phases: foundation building, intensive revision, and final sprint.
算一算距离模拟考试和最终大考还有多少周。一名典型的十年级学生在 IGCSE 考试前大约还有 20 到 30 个学周，可以将这段时间划分为三个阶段：基础构建、强化复习和最后冲刺。
- Phase 1 (Weeks 1–12): Learn new topics following the syllabus order; complete end-of-chapter questions and small programming tasks.
- 第一阶段（第 1–12 周）：按大纲顺序学习新课题，完成章末习题和小型编程任务。
- Phase 2 (Weeks 13–22): Revise all topics systematically, practise past paper questions by topic, and identify weak areas.
- 第二阶段（第 13–22 周）：系统复习所有课题，按专题练习历年真题，找出薄弱环节。
- Phase 3 (Weeks 23–30): Take full timed papers under exam conditions, refine time management, and consolidate high-frequency topics.
- 第三阶段（第 23–30 周）：在考试环境下完成完整限时试卷，优化时间管理，巩固高频考点。
Schedule at least three 45-minute Computer Science sessions per week. Keep a digital or paper planner to track your progress and adjust when a topic takes longer than expected.
每周至少安排三次 45 分钟的计算机科学学习时段。用电子或纸质计划本追踪进度，并在某个课题耗时超出预期时灵活调整。
3. Mastering Core Theory: Data Representation, Hardware & Software | 掌握核心理论：数据表示、硬件与软件
Data representation forms a significant portion of Paper 1. Practise conversions between binary, denary and hexadecimal until they become second nature. Use the method of place values and remember that binary addition can be checked with overflows.
数据表示在 Paper 1 中占有较大比重。反复练习二进制、十进制与十六进制之间的转换，直至熟练。利用位权方法，并记住可用溢出来验证二进制加法。
how the steps in kilobytes or megabytes and understand why 1 kB = 10³ bytes for storage while 1 KiB = 2¹⁰ bytes in some contexts, though Cambridge mainly uses powers of 10 for data transmission.
学会计算文件大小：图像文件大小 = 分辨率 × 色彩深度，声音文件大小 = 采样率 × 采样精度 × 时长。务必展示出换算至 KB 或 MB 的步骤，并理解为何存储有时用 1 KiB = 2¹⁰ 字节，但剑桥在数据传输中主要采用 10 的幂。
For hardware, focus on the fetch-decode-execute cycle, CPU components (ALU, CU, registers), and the difference between Von Neumann and Harvard architecture. Embed diagrams in your notes: a labelled CPU diagram clarifies many exam questions.
硬件部分重点关注取指—译码—执行周期、CPU 各组件（ALU、CU、寄存器）以及冯·诺依曼架构与哈佛架构的区别。在笔记中嵌入带标注的 CPU 示意图，可以有效澄清大量考题。
Operating systems, interrupts, and the role of firmware and device drivers are frequently tested. Create a comparison table for high-level vs low-level languages, compilers vs interpreters.
操作系统、中断以及固件与设备驱动程序的作用是常考内容。制作高级语言与低级语言、编译器与解释器的对比表格。
4. Networking, Internet & Cyber Security Essentials | 网络、互联网与网络安全基础
Memorise the protocols and their port numbers: HTTP (80), HTTPS (443), FTP (21), SMTP (25), POP3 (110), IMAP (143). Understand how each protocol operates and at which layer of the TCP/IP model it belongs.
熟记协议及其端口号：HTTP（80）、HTTPS（443）、FTP（21）、SMTP（25）、POP3（110）、IMAP（143）。理解每种协议的工作方式及其在 TCP/IP 模型中对应的层次。
Explain packet switching, the role of routers, and how a domain name is resolved to an IP address via DNS. Be able to describe the end-to-end journey of an email or a web request.
解释分组交换、路由器的作用以及域名如何通过 DNS 解析为 IP 地址。能够描述一封电子邮件或一个网页请求的端到端传输过程。
Cyber security topics include malware (virus, worm, Trojan), phishing, brute-force attacks, denial-of-service attacks, and social engineering. For each threat, you must suggest one or two prevention methods (firewall, anti-malware, encryption, 2FA, penetration testing).
网络安全课题包括恶意软件（病毒、蠕虫、木马）、网络钓鱼、暴力破解、拒绝服务攻击和社会工程学。针对每种威胁，你必须能提出一两种防护措施（防火墙、反恶意软件、加密、双因素认证、渗透测试）。
5. Algorithms, Problem-Solving & Pseudocode Practice | 算法、问题求解与伪代码练习
Cambridge pseudocode uses specific syntax: INPUT, OUTPUT, FOR … TO … NEXT, WHILE … ENDWHILE, IF … THEN … ELSE … ENDIF. Reproduce the standard format perfectly; examiners reward consistency. Use the <-- assignment operator as shown in the syllabus.
剑桥伪代码使用特定的语法：INPUT、OUTPUT、FOR … TO … NEXT、WHILE … ENDWHILE、IF … THEN … ELSE … ENDIF。完美复现标准格式，考官看重一致性。使用大纲中所示的赋值运算符 <--。
Practice common algorithms: linear search, binary search, bubble sort, counting and totalling, finding maximum/minimum, and validating input with REPEAT … UNTIL loops. Write each algorithm by hand without looking, then check against a reference.
练习常见算法：线性搜索、二分搜索、冒泡排序、计数与累加、寻找最大/最小值以及使用 REPEAT … UNTIL 循环进行输入验证。独立手写每一算法，然后与标准答案核对。
Trace tables are essential for Paper 2. Set up a table with columns for each variable and test the algorithm step by step. Pay special attention to loops and conditionals that may skip iterations.
跟踪表是 Paper 2 的必备技能。为每个变量设定一列，逐步测试算法。特别注意可能导致跳过迭代的循环与条件语句。
Logic gates (AND, OR, NOT, NAND, NOR, XOR) and truth tables appear in both papers. Learn to draw a logic circuit from a Boolean expression: use brackets to group terms. Simplify expressions using De Morgan’s laws or Karnaugh maps as an extension.
逻辑门（AND、OR、NOT、NAND、NOR、XOR）和真值表在两场考试中都会出现。学会从布尔表达式绘制逻辑电路：用括号分组。可尝试使用德·摩根定律或卡诺图化简表达式作为拓展。
6. Programming Proficiency: Python/Java/C# Implementation | 编程能力：Python/Java/C# 实现
Choose your programming language early—schools often use Python, but Java and C# are also supported. Stick to one language throughout the course to avoid confusion. Focus on variables, data types (INTEGER, REAL, CHAR, STRING, BOOLEAN), arithmetic operators (+, -, *, /, MOD, DIV), and string concatenation.
尽早选定编程语言——学校常用 Python，但也支持 Java 和 C#。整个课程坚持用一种语言以免混淆。重点掌握变量、数据类型（整数、实数、字符、字符串、布尔）、算术运算符（+、-、*、/、MOD、DIV）和字符串连接。
Implement all the algorithms from Topic 5 in real code. For example, write a Python program that performs a bubble sort, then extend it to count the number of swaps. Debugging exercises sharpen your logical reasoning.
将第 5 节中的所有算法用真实代码实现。例如用 Python 编写一个冒泡排序程序，然后扩展它来统计交换次数。调试练习能够磨炼你的逻辑推理能力。
Array handling (1D and 2D) is tested through pseudocode and code. Practise reading and modifying arrays using index notation like myArray[2]. For databases, practise SQL-style queries: SELECT … FROM … WHERE … ORDER BY, although the syllabus does not require full SQL implementation; you mainly interpret provided query structures.
一维和二维数组的处理会通过伪代码和代码考查。练习使用下标（如 myArray[2]）读取和修改数组。对于数据库，练习类似 SQL 的查询：SELECT … FROM … WHERE … ORDER BY，虽然大纲不要求完整实现 SQL，但需会解释给定的查询结构。
7. Active Revision with Flashcards & Summary Sheets | 用闪卡与总结表进行主动复习
ck side = concise definition and an example. For instance, front: "What is a checksum? errors in data transmission; calculate sum of data bytes and append the complement."
被动阅读教材的留存率很低。把每个大纲知识点变成闪卡：正面写关键词或问题，背面写精炼的定义和一个例子。例如，正面："什么是校验和？"，背面："一种检测数据传输错误的方法；计算数据字节之和并附加其补码。"
Create one A4 summary sheet per chapter using mind maps, colour codes, and key terms. Link theories of data compression (lossy vs lossless) with real examples: JPEG, MP3 (lossy), ZIP, PNG (lossless).
使用思维导图、颜色标注和关键词为每一章制作一张 A4 大小总结表。将数据压缩理论（有损与无损）与 JPEG、MP3（有损）、ZIP、PNG（无损）等实例联系起来。
Teach a topic to a classmate or record yourself explaining a concept like "how a firewall filters packets". Retrieval practice and the Feynman Technique significantly boost memory.
向同学讲述一个课题，或录下自己解释 "防火墙如何过滤数据包" 的过程。提取练习和费曼技巧能显著提升记忆效果。
8. Tackling Past Papers & Timed Mock Exams | 攻克历年真题与定时模拟考试
Start past papers early, ideally after the first 12 weeks. Begin with topic-specific questions, then move to full papers. Cambridge past papers are available from 2020 onwards; older ones (pre-2020) are still useful for core theory but be mindful of syllabus changes.
尽早开始做真题，理想的时间是第 12 周之后。先按课题练习，再过渡到完整试卷。剑桥 2020 年以后的真题均可获取；更早的试卷（2020 年之前）对核心理论仍有参考价值，但须注意大纲变动。
When attempting a timed paper, simulate exam conditions strictly: no phone, no notes, and a visible clock. After the paper, mark it using the official mark scheme and note down any mark lost due to missing details (e.g., forgetting to specify units, not labelling a diagram).
定时做模拟卷时要严格模拟考试环境：不带手机、不查看笔记、摆放一个清晰可见的时钟。做完后根据官方评分标准批改，并记下因遗漏细节（如忘记注明单位、未标注示意图）而丢失的分数。
olumn 3 = correct approach. Revisit this log weekly to ensure old errors are not repeated.
建立错题日志：第一列写上题号与课题，第二列写错误内容，第三列写正确方法。每周翻阅这份日志，确保旧错不再重犯。
9. Common Mistakes & How to Avoid Them | 常见错误与避免方法
- Relying on "common sense" for definitions: Cambridge expects precise technical terms. Instead of saying "the computer’s brain," write "CPU (Central Processing Unit) that fetches, decodes and executes instructions."
- 用 "常识" 去界定术语：剑桥要求准确的技术术语。不能写 "计算机的大脑"，而应写 "中央处理器（CPU），负责取指、译码和执行指令。"
- Ignoring unit conversions in calculations: Always show the conversion factor when moving from bytes to kilobytes (B ÷ 1000). If a question specifies kB or KiB, follow its lead precisely.
- 计算中忽视单位换算：从字节转到千字节时（B ÷ 1000）务必展示转换因子。若题目指明 kB 或 KiB，严格按其要求执行。
- Writing pseudocode that is too language-specific: Avoid Python-only syntax like range() or print(). Use OUTPUT and FOR counter ← 1 TO 10. Keep the style consistent with sample papers.
- 伪代码过于偏向特定语言：避免仅限 Python 的语法如 range() 或 print()。应使用 OUTPUT 和 FOR counter ← 1 TO 10。保持与样本试卷一致的风格。
- Skipping the planning phase in algorithm questions: Scribbling code immediately often leads to logical gaps. Spend 2–3 minutes outlining the steps using bullet points or a rough flowchart.
- 算法题跳过了规划阶段：立刻匆忙写代码常导致逻辑漏洞。花两到三分钟用要点或粗流程图列出步骤。
10. Final Weeks: Stress Management & Exam-Day Tips | 最后冲刺：压力管理与考试当天技巧
In the final three weeks, reduce new-content learning and focus on consolidation. Complete one full Paper 1 and one Paper 2 under timed conditions per week, and review the error log frequently.
最后三周减少新内容学习，重在巩固。每周在限时条件下完成一套完整的 Paper 1 和 Paper 2，并频繁回顾错题日志。
Maintain a healthy routine: sleep 7–8 hours, eat balanced meals, and incorporate short walks or breathing exercises. Science shows that sleep improves memory consolidation, especially for logic and language tasks.
保持健康作息：睡眠 7 至 8 小时，均衡饮食，穿插短途散步或呼吸练习。科学研究表明，睡眠能提升记忆巩固效果，尤其对逻辑和语言任务有益。
Prepare your exam kit the night before: clear pencil case, pens, ruler, highlighter, and a non-programmable calculator if allowed (check your centre’s rules). On the day, read each question twice, underline keywords, and manage time by allocating approximately 1 minute per mark.
考前一晚准备好考试文具：透明笔袋、笔、尺子、荧光笔以及允许携带的非编程计算器（查看考试中心规定）。考试当天，每道题目读两遍，划出关键词，并按大约每分钟 1 分的节奏管理时间。
For Paper 2, attempt the algorithm questions first if they are your strength, but do not spend more than 25 minutes on any 15-mark section. Leave space to show trace tables clearly; a messy trace table can lose marks even if the final answer is correct.
Paper 2 考试可先做你擅长的算法题，但不要在任何一个 15 分的小题上耗费超过 25 分钟。留出空间清晰地展示跟踪表；即便最终答案正确，一张凌乱的跟踪表也可能丢分。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图