Year 10 CIE Computer Science: Exam Tips & Marking Criteria | Year 10 CIE 计算机：答题技巧与评分标准

📚 Year 10 CIE Computer Science: Exam Tips & Marking Criteria | Year 10 CIE 计算机：答题技巧与评分标准

Mastering CIE IGCSE Computer Science (0478/0984) requires more than just knowledge – you must also understand how the exam is marked and what techniques achieve full marks. This guide breaks down the marking criteria and shares essential exam techniques to help you maximise your score in both Paper 1 (Theory) and Paper 2 (Problem‑solving and Programming).

掌握 CIE IGCSE 计算机科学 (0478/0984) 不仅仅需要知识——你还必须理解考试如何评分，以及哪些技巧能够获得满分。本文解析评分标准，并分享关键的答题技巧，帮助你在 Paper 1（理论）和 Paper 2（问题解决与编程）中最大化分数。

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

CIE IGCSE Computer Science consists of two compulsory written papers. Paper 1: Theory lasts 1 hour 45 minutes and carries 50% of the total marks. It covers data representation, data transmission, hardware, software, the internet and its uses, automated and emerging technologies. Paper 2: Problem‑solving and Programming also lasts 1 hour 45 minutes and contributes the remaining 50%. It focuses on algorithm design, pseudocode, programming, databases and Boolean logic.

CIE IGCSE 计算机科学包含两份必考笔试。Paper 1：理论，时长 1 小时 45 分钟，占总分 50%。内容涵盖数据表示、数据传输、硬件、软件、互联网及其应用、自动化与新兴技术。Paper 2：问题解决与编程，同样 1 小时 45 分钟，占 50%，侧重算法设计、伪代码、编程、数据库和布尔逻辑。

All questions are mapped to three Assessment Objectives (AOs): AO1 (Knowledge with understanding, ~30–40%), AO2 (Application, ~40–50%) and AO3 (Analysis and evaluation, ~15–25%). The mark scheme rewards accurate, concise answers that directly address the command word. For each mark, examiners look for a specific point or an element of reasoning. Understanding this breakdown helps you allocate effort: spend more revision time on AO2 and AO3 for higher‑order thinking skills.

所有试题都对应三个评估目标（AO）：AO1（知识理解，约占30–40%）、AO2（应用，约占40–50%）和 AO3（分析与评价，约占15–25%）。评分方案奖励准确、简洁、直接回应命令词的答案。每一分值对应一个得分点或一项推理要素。了解这种比例有助于你分配精力：在 AO2 和 AO3 等高阶思维技能上投入更多复习时间。

Assessment Objective	Description	Typical Weighting
AO1	Recall facts, terms and principles	30–40%
AO2	Apply knowledge and understanding to problems	40–50%
AO3	Analyse, evaluate and justify choices	15–25%

评估目标	描述	典型权重
AO1	回忆事实、术语和原理	30–40%
AO2	运用知识解决实际问题	40–50%
AO3	分析、评价并论证选择	15–25%

---

2. Decode Command Words | 解读命令词

Command words tell you exactly what the examiner wants. For example, ‘State’ requires a brief, factual answer, often a single word or phrase. ‘Identify’ means name or select from given information. ‘Describe’ asks for a detailed account of characteristics or steps, but does not require reasons. ‘Explain’ demands a clear justification showing ‘how’ or ‘why’. ‘Compare’ needs both similarities and differences. ‘Evaluate’ means to consider strengths and weaknesses and reach a supported conclusion. Always underline the command word and respond precisely – adding extra irrelevant detail can waste time without earning extra marks.

命令词明确告诉你考官想要什么。例如，“State（陈述）”要求简短的事实性回答，通常是一个词或短语。“Identify（识别）”指命名或从给定信息中选出。“Describe（描述）”要求详细说明特征或步骤，但不需要给出原因。“Explain（解释）”需要清晰的论证，展示“如何”或“为什么”。“Compare（比较）”需要给出相似点和不同点。“Evaluate（评价）”意味着考虑优缺点并得出有依据的结论。务必划出命令词并精准回应——增加无关的细节既浪费时间又得不到分数。

Here is a quick reference table for common IGCSE Computer Science command words:

以下是对 IGCSE 计算机科学常见命令词的速查表：

Command Word	What to Do	Example
State	Give a concise fact	State the function of a router.
Describe	Paint a picture with words	Describe how a barcode scanner works.
Explain	Give reasons, use ‘because’	Explain why hexadecimal is used.
Compare	Similarities AND differences	Compare RAM and ROM.
Evaluate	Judge + justify	Evaluate the use of cloud storage.

命令词	要求	示例
State 陈述	给出简洁事实	陈述路由器的功能。
Describe 描述	用文字描绘	描述条形码扫描器的工作方式。
Explain 解释	给出理由，使用“因为”	解释为何使用十六进制。
Compare 比较	相似点和不同点	比较 RAM 和 ROM。
Evaluate 评价	判断 + 论证	评价云存储的使用。

---

3. Read the Question and Identify Key Information | 审题与识别关键信息

Many candidates lose marks by misreading the question. Underline the command word, the topic focus, and any qualifiers such as ‘and’, ‘or’, ‘give two reasons’, or ‘other than…’. If a question asks for three examples, write exactly three – providing extras will not be rewarded. Pay special attention to context, like ‘in the context of a sensor network’ or ‘for a business’, because your answer must fit that scenario. Ignoring context often leads to generic answers worth zero marks.

许多考生因为审题不清而丢分。划出命令词、主题焦点以及限定词，如“和”、“或”、“给出两个理由”或“除…之外”。如果题目要求给出三个例子，就恰好写三个——多写不会得分。格外留意场景，如“在传感器网络的背景下”或“针对一家企业”，因为你的答案必须贴合情境。忽视场景往往会给出通用的答案，导致零分。

For problem‑solving questions, extract the inputs, outputs and processing requirements from the scenario. Jot down a quick diagram or a list of variables. This helps you structure your pseudocode logically. Many mark scheme errors come from candidates solving a different problem than the one set.

对于问题解决类题目，从情境中提取输入、输出和处理需求。快速画出草图或列出变量。这有助于你逻辑清晰地组织伪代码。许多评分方案中的错误源于考生解答了一个与题目要求不同的问题。

---

4. Answering Theory Questions with Precision | 精确回答理论题

Use precise technical terminology. For instance, say ‘A CPU fetches, decodes and executes instructions using the fetch‑decode‑execute cycle’ rather than ‘The computer reads the program’. Where a question asks for an advantage or disadvantage, always link it to the context. For a ‘2 marks’ question such as ‘Give two reasons for using a database’, state each reason clearly and punctuate them as separate points.

使用准确的技术术语。例如，要说“CPU 通过取指-译码-执行周期来取指、译码和执行指令”，而不是“计算机读取程序”。当题目问到优点或缺点时，一定要结合上下文。对于像“给出使用数据库的两个理由”这样的 2 分题，清晰陈述每条理由，并用标点分隔成独立得分点。

When ‘explaining’, structure your answer as statement + reason. For example, ‘Data is compressed (statement) so that it occupies less storage space and transmits faster over a network (reason).’ The mark scheme often splits marks between the identification and the development. Always ask yourself: ‘Is my reasoning developed enough?’ A single cause‑and‑effect chain often secures full marks.

在“解释”时，将答案组织为陈述+理由。例如，“数据被压缩（陈述）以便占用更少的存储空间并在网络上更快传输（理由）。”评分方案通常将分值拆分为识别和展开。时刻问自己：“我的推理是否足够深入？”单一因果链往往就能拿到满分。

---

5. Writing High‑Quality Pseudocode | 编写高质量的伪代码

CIE IGCSE pseudocode uses a specific style: keywords like ‘INPUT’, ‘OUTPUT’, ‘IF … THEN … ELSE … ENDIF’, ‘FOR … TO … NEXT’ and ‘WHILE … DO … ENDWHILE’. Indent blocks of code consistently to show structure. Variables are typically given meaningful names and assigned using ← (the assignment operator). Never use language‑specific syntax, such as curly braces or semicolons. The mark scheme rewards logically correct algorithms, not perfect syntax, but your code must be clear and unambiguous.

CIE IGCSE 伪代码使用特定的风格：关键词如 ‘INPUT’、’OUTPUT’、’IF … THEN … ELSE … ENDIF’、’FOR … TO … NEXT’ 以及 ‘WHILE … DO … ENDWHILE’。一致地缩进代码块以显示结构。变量通常使用有意义的名字，并用 ←（赋值运算符）赋值。切勿使用特定语言语法，如花括号或分号。评分方案奖励逻辑正确的算法，而非完美的语法，但你的代码必须清晰、无歧义。

• Always initialise variables and declare totals before using them.
• Check boundary conditions: does your loop run exactly the required number of times?
• Include comments where necessary, especially when the logic is complex.

• 始终在使用前初始化变量，并声明累加变量。
• 检查边界条件：循环是否准确运行了所需次数？
• 必要时添加注释，特别是在逻辑复杂的地方。

Consider this simple pseudocode for finding the maximum of two numbers:

以下是一个求两数最大值的简单伪代码示例：

INPUT a
INPUT b
IF a > b THEN
    OUTPUT a
ELSE
    OUTPUT b
ENDIF

Examiners look for clear decision logic. Avoid irrelevant PRINT statements or over‑engineering; the simplest correct solution usually earns full marks.

考官看重清晰的决策逻辑。避免无关的 PRINT 语句或过度设计；最简单正确的解法通常能获得满分。

---

6. Mastering Trace Tables | 掌握跟踪表

A trace table is a systematic way to test an algorithm by hand. It records the values of variables as each line of code executes. To complete one correctly, list every variable and decision outcome in the table header, then step through the algorithm line by line, updating the table after each assignment or conditional branch. The mark scheme awards marks for the correct final values and for showing the progressive changes.

跟踪表是一种用手工测试算法的系统方法，它记录每一行代码执行时变量的值。要正确填写，先在表头列出每个变量与判断结果，然后逐行执行算法，在每次赋值或条件分支后更新表格。评分方案给予正确最终值和展示变化过程的步骤分数。

For loops, track the loop counter and any accumulated output carefully. If a variable is not changed in a step, leave its cell unchanged – do not leave it blank unless unused. Examiners expect to see a clear trace indicating you understand the flow of the algorithm.

对于循环，仔细跟踪循环计数器和任何累加输出。如果某一步变量未改变，保留原值不变——除非从未使用，否则不要留空。考官期望看到清晰的跟踪轨迹，表明你理解算法流程。

---

7. Logic Gates and Truth Tables | 逻辑门与真值表

In Paper 2, you will need to recognise and draw standard logic gate symbols: AND, OR, NOT, NAND and NOR. The AND gate is a D‑shaped symbol; OR is a shield‑like curve; NOT is a triangle with a small circle. When asked to draw a circuit from a logic expression, build it gate by gate, starting with brackets. Neatness matters because ambiguous diagrams are penalised.

在 Paper 2 中，你需要识别并绘制标准逻辑门符号：AND、OR、NOT、NAND 和 NOR。AND 门是一个 D 形符号；OR 门是盾形曲线；NOT 门是一个带小圆圈的三角形。要求根据逻辑表达式画电路时，从括号开始，逐门构建。整洁很重要，因为模糊的图会被扣分。

For truth tables, list all possible input combinations in binary counting order. If there are n inputs, you need 2ⁿ rows. Then compute intermediate columns one at a time. Always double‑check your final column matches the expected Boolean expression. Marks are often given for the intermediate steps, so show your workings.

对于真值表，按二进制计数顺序列出所有可能的输入组合。若有 n 个输入，则需要 2ⁿ 行。然后一次计算一个中间列。务必核对最终列是否与期望的布尔表达式相符。中间步骤往往也有分数，所以请展示运算过程。

Example truth table for A AND B:

以 A AND B 为例的真值表：

A	B	A AND B
0	0	0
0	1	0
1	0	0
1	1	1

---

8. Data Representation and Conversions | 数据表示与转换

You must be able to convert between denary, binary and hexadecimal. For binary to denary, write the place values (e.g. 128, 64, 32, 16, 8, 4, 2, 1) and sum those where a 1 appears. Binary to hex: split the binary number into groups of 4 bits from the right, then convert each nibble. Common mistakes include misaligning groups or forgetting leading zeros. Show your working to gain method marks even if the final answer is wrong.

你必须能够在十进制、二进制和十六进制之间进行转换。二进制转十进制：写出位权（如 128, 64, 32, 16, 8, 4, 2, 1）并将出现 1 的位相加。二进制转十六进制：从右开始将二进制数按 4 位一组拆分，再转换每个半字节。常见错误包括分组不对齐或忘记前导零。展示运算过程，即使最终答案有误也能得到方法分。

When working with binary addition, remember rules: 0+0=0, 0+1=1, 1+0=1, 1+1=0 carry 1, 1+1+1=1 carry 1. An overflow occurs when the result exceeds the available number of bits. In exam questions on character sets, know that ASCII uses 7 bits, extended ASCII uses 8 bits, and Unicode can use up to 32 bits to represent a vast range of characters.

处理二进制加法时，记住规则：0+0=0，0+1=1，1+0=1，1+1=0 进 1，1+1+1=1 进 1。当结果超出可用位数时，就发生了溢出。关于字符集的考题中，应知道 ASCII 使用 7 位，扩展 ASCII 使用 8 位，Unicode 可最多使用 32 位来表示大量字符。

---

9. Avoiding Common Pitfalls in Problem‑Solving | 避免问题解决中的常见陷阱

Many students lose marks by failing to break a problem into smaller parts. Use stepwise refinement: write the overall solution in plain English, then convert each step into pseudocode. Check that your algorithm handles all normal, boundary and exceptional cases. For example, if you’re checking whether a number is prime, test 1, 2, a large prime, and a large non‑prime.

许多学生因未能将问题分解而丢分。使用逐步求精法：先用自然语言写出整体解决方案，再将每一步转换为伪代码。检查你的算法是否处理了所有正常、边界和异常情况。例如，检验一个数是否为质数时，测试 1、2、一个大质数和一个大非质数。

When a question asks for a program to calculate something, do not forget to output the result. It sounds obvious, but many scripts miss the final OUTPUT statement. Also, be careful with data types: mixing strings and numbers can cause logic errors. Use meaningful variable names and keep your code organised.

当题目要求编写计算程序时，不要忘记输出结果。这听起来简单，但许多脚本遗漏了最后的 OUTPUT 语句。同时，注意数据类型

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

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