IGCSE CIE Computer Science: MCQ Cracking Techniques | IGCSE CIE 计算机：选择题秒杀技巧

📚 IGCSE CIE Computer Science: MCQ Cracking Techniques | IGCSE CIE 计算机：选择题秒杀技巧

For many students, Paper 1 of the CIE IGCSE Computer Science exam (0478/0984) feels like a race against time. You have 40 multiple-choice questions to answer in 45 minutes, covering everything from binary logic to high-level languages. This article reveals the most effective shortcuts, common traps, and rapid calculation methods that can boost your score – often without writing a single line of code on paper. Each trick is aligned with the exact demands of the CIE syllabus, so you can approach every question with confidence.

对很多同学来说，CIE IGCSE 计算机科学（0478/0984）的 Paper 1 就像一场与时间的竞速。你需要在 45 分钟内完成 40 道选择题，考点遍及二进制逻辑到高级语言。本文汇编了最有效率的秒杀途径、高频陷阱和速算方法，帮助你在不动笔写大段代码的情况下大幅提高正确率。每一条技巧都紧扣 CIE 考纲，让你从容应对任何一道题。

---

1. Understand the Question Format | 了解题型结构

Each MCQ presents four options (A–D), and exactly one is correct. Before diving into calculations, always read the stem carefully – especially words like ‘NOT’, ‘EXCEPT’ or ‘MUST’. Many students lose marks because they answer the opposite of what was asked. Train yourself to underline the negative word mentally before looking at the choices.

每道选择题提供四个选项（A–D），有且仅有一个正确。开始计算前，一定要仔细阅读题干，尤其注意 ‘NOT’、’EXCEPT’ 或 ‘MUST’ 这类字眼。不少同学丢分就是因为答了反方向的问题。在浏览选项之前，先在脑海中划线标出否定词，养成习惯。

The distribution of answers among A, B, C and D is roughly even, but do not waste time looking for patterns. Focus on why three options are wrong rather than searching for a ‘correct‑looking’ one. Elimination is always more reliable than intuition on this paper.

虽然 A、B、C、D 四个选项的分布大致均衡，但不要浪费时间寻找规律。把注意力放在“为什么三个选项是错的”上，远比寻找一个“眼熟”的选项可靠。在这份试卷上，排除法永远比直觉稳当。

---

2. Master Binary & Hexadecimal Conversions | 掌握二进制与十六进制转换

Memorising the conversion table between one hex digit and four bits is non‑negotiable. Use this quick reference: 0=0000, 1=0001, 2=0010, 3=0011, 4=0100, 5=0101, 6=0110, 7=0111, 8=1000, 9=1001, A=1010, B=1011, C=1100, D=1101, E=1110, F=1111. When converting binary to hex, group bits from the right in fours; if the leftmost group has fewer than four bits, pad with leading zeros.

牢记一个十六进制位与四个二进制位的对照表是必修课。速查表如下：0=0000, 1=0001, 2=0010, 3=0011, 4=0100, 5=0101, 6=0110, 7=0111, 8=1000, 9=1001, A=1010, B=1011, C=1100, D=1101, E=1110, F=1111。将二进制转为十六进制时，从右往左每四位一组；最左边一组不足四位则用前导零补齐。

For denary ↔ hex, use repeated division by 16 for denary→hex; for hex→denary, multiply each hex digit by 16ⁿ based on its position. A common exam trap: ignoring the difference between signed and unsigned bytes. An 8‑bit unsigned integer ranges 0 to 255 (2⁸ – 1), while signed two’s complement ranges –128 to 127. Knowing boundary values helps you spot overflow errors instantly.

十进制与十六进制互转时，十→十六用不断除以 16 取余的方法；十六→十则将每位十六进制数字乘以对应权值 16ⁿ。考卷中常见陷阱：忽略有符号与无符号字节的区别。8 位无符号整数范围是 0 至 255（2⁸ – 1），而有符号补码范围是 –128 至 127。记住边界值能让你瞬间辨识溢出错误。

---

3. Logic Gate Simplification Tricks | 逻辑门化简技巧

CIE frequently tests AND, OR, NOT, NAND, NOR and XOR gates. Instead of drawing full circuits, develop a mental truth table for common combinations. For instance, (A AND B) OR (A AND C) is just A AND (B OR C). Recognising patterns like De Morgan’s laws (¬(A ∧ B) = ¬A ∨ ¬B; ¬(A ∨ B) = ¬A ∧ ¬B) can turn a seemingly complex logic expression into a simple two‑gate arrangement.

CIE 经常考查 AND、OR、NOT、NAND、NOR 和 XOR 门。与其画出完整电路，不如在脑海中构建常见组合的真值表。例如 (A ∧ B) ∨ (A ∧ C) 其实就是 A ∧ (B ∨ C)。识别出像德摩根定律（¬(A ∧ B) = ¬A ∨ ¬B ; ¬(A ∨ B) = ¬A ∧ ¬B）这样的模式，可以把看似复杂的逻辑表达式降维成只有两个门的排列。

Gate	Symbol	Output C = A ___ B
AND	∧	C = A ∧ B
OR	∨	C = A ∨ B
NOT	¬	C = ¬A
NAND	¬(A∧B)	C = ¬(A ∧ B)
NOR	¬(A∨B)	C = ¬(A ∨ B)
XOR	⊕	C = A ⊕ B

When a question asks for the output of a multi‑gate diagram, start from the inputs and work step‑by‑step, assigning temporary variables. If you are given a truth table and asked to identify the correct logic expression, compare the output column with the options – eliminate any expression that produces a different value for any row.

若题目让求多级门电路的输出，从输入端开始逐步计算，引入临时变量。如果给出真值表让你选择正确的逻辑表达式，将输出列与各选项逐一比对——凡在某一行产生与表格不符结果的表达式，立即剔除。

---

4. Pseudocode Trace Table Shortcuts | 伪代码追踪表捷径

Many MCQs present a short pseudocode snippet followed by ‘what is the final value of x?’. The fastest approach is to construct a miniature trace table with columns for each variable, and then execute each line in your head, updating values as you go. Pay attention to loop conditions: a WHILE loop checks before each iteration, a REPEAT…UNTIL checks after. For FOR loops, remember that the loop variable increments at the end of each cycle.

许多选择题先给出几行伪代码，然后问“x 的最终值是多少？”。最高效的方法是在纸上或脑中建一个微型追踪表，列出各变量的列，然后逐行执行更新。注意循环条件的区别：WHILE 循环在每次迭代前检查，REPEAT…UNTIL 在循环体结束后检查。对于 FOR 循环，循环变量在每一次循环末尾递增。

When handling arrays, index values are often part of the question. CIE pseudocode uses square brackets, e.g. arr[0] for the first element. Beware of boundary errors: if an array has 5 elements, indices run from 0 to 4. A statement like arr[i] where i has been set to 5 will cause an out‑of‑bounds error unless explicitly handled, but in MCQs they usually assume valid access – still, check the index value carefully.

涉及数组时，索引值经常是考点。CIE 伪代码使用方括号，例如 arr[0] 表示第一个元素。小心边界错误：含 5 个元素的数组，索引范围是 0 至 4。若代码出现 arr[i] 而 i 此时为 5，除非题目说明已处理，否则即为越界。选择题通常假设访问合法，但仍需仔细核对索引值。

---

5. Data Transmission & Error Detection | 数据传输与错误检测

Questions on parity, checksum and CRC often ask you to identify whether an error has occurred or what kind of parity is used. For even parity, the total number of 1s (including parity bit) must be even; for odd parity, it must be odd. A quick way: count the 1s in the data, then decide the parity bit. If you receive a byte with incorrect parity, a transmission error has occurred – but parity cannot say which bit is wrong, nor can it correct errors.

考查奇偶校验、校验和与 CRC 的题目常问是否能检测到错误或用了哪种校验。偶校验时，整个字节（含校验位）中 1 的个数必须为偶数；奇校验则须为奇数。速算方法：数出数据部分 1 的个数，再由此决定校验位。若收到的字节奇偶性不符，则发生了传输错误——但奇偶校验不能指出哪一位错，也无法纠错。

Check digits (like ISBN-13, modulo‑11) appear less frequently but require the same systematic method: multiply each digit by its weight, sum, then find remainder. A common trick is to compute the remainder first and see if it matches the check digit. If a question supplies several numbers and asks which one is correctly formatted, calculate the check digit for each and compare.

校验位（如 ISBN‑13、模 11）出现较少，但同样需要系统方法：每位数字乘以权值后求和，然后取余。常见技巧是先算出余数，再与校验位比对。若题目给出一串数字，问哪一个是正确格式，只需逐一计算对比即可。

---

6. Network Topologies & Protocols | 网络拓扑与协议

MCQs on this topic often mix up characteristics of star, mesh, bus and ring topologies. Memorise key property pairs: star – central switch, easy to isolate faults; mesh – every node connected to every other, most resilient but expensive; bus – single backbone cable, collisions possible. A quick diagram in your head helps: if one cable breaks in a bus topology, the whole network can fail, but in a star only that segment is affected.

该专题的选择题常混淆星型、网状、总线和环型拓扑的特征。记住关键属性组合：星型——中央交换机，故障易隔离；网状——每节点与所有其他节点直连，容错性最强但成本高；总线——单骨干线，可能发生碰撞。脑中速画拓扑图有助判断：总线中一处断缆全瘫，星型中仅有该支路受影响。

For protocols, don’t try to memorise long lists; instead, associate each protocol with its primary job. HTTP/HTTPS – web pages, SMTP – sending emails, IMAP – accessing emails while keeping them on server, POP – downloading emails, FTP – file transfer, TCP/IP – reliable packet delivery. CIE loves to ask ‘which protocol would be used for…?’ based on the scenario.

针对协议，不必死记长列表，而应将协议与其核心功能绑定。HTTP/HTTPS——网页，SMTP——发送邮件，IMAP——收取邮件并保留在服务器，POP——下载邮件，FTP——文件传输，TCP/IP——可靠包传输。CIE 超爱出场景题：“……应使用哪一个协议？”

---

7. Computer Architecture & Fetch‑Execute Cycle | 计算机架构与取指执行周期

The fetch‑decode‑execute cycle is a high‑frequency topic. Every cycle begins with the address from the Program Counter (PC) being copied to the Memory Address Register (MAR). The instruction is fetched into the Memory Data Register (MDR) and then copied to the Current Instruction Register (CIR). The PC is incremented. These steps are rigid; if a question shuffles the order of registers, eliminate that option immediately.

取指—译码—执行周期是超高频考点。每个周期开始，程序计数器（PC）中的地址被复制到存储器地址寄存器（MAR），指令经数据总线被取入存储器数据寄存器（MDR），然后复制到当前指令寄存器（CIR），随后 PC 自增。这组顺序是刚性的；若某选项打乱了寄存器出现的先后，立刻排除。

Questions on CPU components expect you to know the role of the ALU (arithmetic and logic operations), CU (control unit, decodes instructions), and registers. When asked ‘which component performs calculation?’, ALU is the answer. Also be ready to identify buses: address bus carries memory addresses, data bus carries actual data, control bus carries control signals.

考查 CPU 组成时，须清楚 ALU（算术逻辑运算）、CU（控制单元，译码指令）和寄存器的分工。问到“哪个部件负责计算？”，答案就是 ALU。同时要能识别三种总线：地址总线传送存储地址，数据总线传送实际数据，控制总线传送控制信号。

---

8. Memory & Storage Calculations | 存储器与存储计算

File size questions appear often and can be solved with a consistent unit ladder. Remember the CIE convention: 1 KB = 1024 bytes (2¹⁰), 1 MB = 1024 KB, 1 GB = 1024 MB. For images, file size = resolution × colour depth. For sound, file size = sample rate × bit depth × duration × channels. Set up a cancellation of units in your working to avoid mistakes.

文件大小计算题频繁出现，可用统一的单位阶梯破解。记住 CIE 的约定：1 KB = 1024 bytes（2¹⁰），1 MB = 1024 KB，1 GB = 1024 MB。对于图像，文件大小 = 分辨率 × 颜色深度。对于声音，文件大小 = 采样率 × 位深 × 时长 × 声道数。计算时列出单位，逐层约化，避免错位。

For example, a 30‑second stereo sound recorded at 44.1 kHz with 16‑bit depth: file size = 44100 × 16 × 30 × 2 = 42,336,000 bits ÷ 8 = 5,292,000 bytes ≈ 5.05 MB. When options are given in MB, always convert fully. Some questions offer answers in KiB, MiB – remain consistent with powers of 2.

例如，一段 30 秒立体声以 44.1 kHz、16 位深录制：文件大小 = 44100 × 16 × 30 × 2 = 42,336,000 bits，除以 8 得 5,292,000 bytes，约 5.05 MB。选项若以 MB 出现，务必转换完整。部分题目用 KiB、MiB 作答，则始终保持 2 的幂。

---

9. Databases & SQL Queries | 数据库与 SQL 查询

SQL is tested via simple SELECT statements. The basic pattern is SELECT field(s) FROM table WHERE condition. An MCQ may show a table and ask which query returns a specific set of records. Always verify the WHERE clause logic: AND requires both conditions true, OR requires at least one. For string matching, CIE often uses LIKE with wildcard % (any sequence of characters) and _ (exactly one character).

SQL 通过简单的 SELECT 语句来考查。基本句式是 SELECT 字段 FROM 表 WHERE 条件。选择题可能给出一张表格，问哪一个查询会返回特定记录集。务必核对 WHERE 子句的逻辑：AND 要求两条件均真，OR 至少一真。关于字符串匹配，CIE 常用 LIKE 搭配通配符 %（任意字符序列）和 _（刚好一个字符）。

Normalisation questions ask you to identify repeating groups or partial dependencies. If you see a table with columns like ‘StudentID, StudentName, TutorName’ where TutorName repeats for each student of that tutor, removing it to a separate Tutor table is more efficient. The first three normal forms (1NF, 2NF, 3NF) are about removing repeating groups, then removing partial dependencies, then removing transitive dependencies. A rapid check: a flat file with duplicated data almost certainly breaks 1NF.

规范化考题让你识别重复组或部分依赖。若看到一张表有 ‘StudentID, StudentName, TutorName’，且某个导师的名字为每名学生重复出现，那么将 Tutor 信息独立成表会减小冗余。第一、第二、第三范式（1NF、2NF、3NF）依次消除重复组、部分依赖和传递依赖。速判规则：一个存在完全相同重复行或重复列的扁平文件几乎必然破坏 1NF。

---

10. Programming Concepts: Arrays & Loops | 编程概念：数组与循环

Questions that ask ‘what is stored in array element X after the algorithm runs?’ are trace‑table exercises in disguise. Handle two‑dimensional arrays by treating them like a grid: array[row, column]. In pseudocode, nested loops often populate or search arrays. If a loop runs from 0 to n‑1, calculate exactly how many iterations occur to avoid off‑by‑one errors.

“算法运行后数组元素 X 中存的是什么？”这类题其实是伪装的追踪表题。遇到二维数组，不妨把它视作网格：array[行, 列]。伪代码中，嵌套循环常用于填充或搜索数组。若循环从 0 运行到 n‑1，要精确统计迭代次数，谨防差一错误。

When dealing with linear search, remember it checks each element sequentially and stops when found or when the end is reached. Binary search requires sorted data and repeatedly halves the search space. A question may show a sorted list and ask how many comparisons binary search makes to find a target – the maximum is ⌈log₂ N⌉; approximate by powers of 2.

涉及线性搜索时，记住它是逐个检查元素，找到即止或搜遍全表。二分搜索要求数据有序，并反复将搜索区间折半。题目可能给出一组有序列表，问二分搜索找到目标需要多少次比较——最大比较次数为 ⌈log₂ N⌉，可用 2 的幂做估算。

---

11. Cyber Security & Ethical Issues | 网络安全与道德问题

MCQs frequently ask you to match threats with countermeasures. Know the difference: malware is malicious software (virus, worm, Trojan), phishing is deceptive email/website to steal credentials, brute‑force attacks try many passwords. Firewalls filter traffic based on rules, encryption protects data confidentiality, two‑factor authentication adds an extra layer. When you see ‘shoulder surfing’, the answer is usually about physical security or screen filters.

选择题常让你为威胁匹配对策。分清几个概念：恶意软件（病毒、蠕虫、木马），网络钓鱼（欺骗性邮件/网站以窃取凭证），暴力攻击（尝试大量密码）。防火墙按规则过滤流量，加密保护数据机密性，双因素认证多一层防护。看到“肩窥”，答案往往关乎物理遮挡或屏幕防窥膜。

Ethical and legal questions revolve around data protection, computer misuse, and copyright. If a scenario describes unauthorised access to a system, the Computer Misuse Act is relevant; for mishandling personal data, the Data Protection Act (or GDPR) applies. Plagiarism and piracy connect to copyright law. The key is to pick the specific legislation named in the syllabus, not a generic phrase.

伦理与法律题围绕数据保护、计算机滥用和版权展开。若场景描述未经授权访问系统，相关法律是《计算机滥用法案》；不当处理个人数据则涉及《数据保护法案》（或 GDPR）。抄袭与盗版联系版权法。关键要选出考纲中列明的具体法律名称，而非泛泛其辞。

---

12. Exam Technique: Process of Elimination | 考试技术：排除法

Even when you are unsure, you can turn a 25% chance into near certainty by systematically eliminating impossible answers. Look for absolute words like ‘always’, ‘never’, ‘must’ – in computer science, such statements are often false because exceptions exist. Also watch for answers that contradict a basic fact from the syllabus; they are common distractors.

即使你拿不准，也能通过系统性地排除不可能选项，将 25% 的概率变成近乎确定。留意 ‘always’、’never’、’must’ 这样的绝对化用词——在计算机科学里，这类表述因为有例外而多为错误。此外，要警惕那些与考纲基本事实相矛盾的选项，它们正是常见的干扰项。

If two options are direct opposites, the correct answer is often one of them. When numbers are involved, try a quick sanity check: a file size of 200 GB for a short audio clip is clearly unreasonable. Finally, manage time by spending no more than one minute per question on the first pass; circle tough ones and return with remaining time. This strategy ensures you do not leave easy marks behind.

若有两个选项直接相反，正确答案往往是其中之一。涉及数字时，快速做个合理性检验：一段短音频的文件大小若为 200 GB，显然不合理。最后，时间管理：初轮每题不超过一分钟，给难题做记号，用余下时间回头思考。这样绝不会把送分题漏掉。

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

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