📚 IB & WJEC Computer Science: Multiple Choice Speed-Kill Techniques | IB WJEC 计算机：选择题秒杀技巧
In both IB Computer Science and WJEC A-level Computer Science exams, multiple choice questions (MCQs) can appear as a distinct section or be embedded within Paper 1. These questions test a wide range of topics from boolean logic and data structures to computer architecture and networking. Although they may seem straightforward, the time pressure and subtle distractors often cause students to lose valuable marks. This article provides a collection of killer techniques tailored for IB and WJEC candidates, enabling you to identify correct answers rapidly, eliminate wrong options strategically, and manage your time effectively during the exam.
在IB计算机科学和WJEC A-level计算机科学考试中，选择题既可以单独成卷，也可以嵌入试卷一。它们覆盖了布尔逻辑、数据结构、计算机体系结构和网络等广泛主题。看似简单，但在时间压力和迷惑性选项下，学生常会丢失不该丢的分数。本文为IB和WJEC考生整理了一系列选择题秒杀技巧，教你快速锁定正确答案、有策略地排除干扰项，并在考试中高效分配时间。
1. Know Your Enemy: MCQ Patterns in IB & WJEC | 知己知彼：IB与WJEC选择题题型分析
Before attempting any MCQ, understand the typical structure. In IB Computer Science HL/SL Paper 1, multiple choice questions often appear as a set of 20–30 standalone items covering the entire syllabus. WJEC A-level Unit 1 also includes a multiple choice section that tests fundamentals. Both exam boards use negative phrasing, 'except' questions, and multi-step reasoning items. Recognising these patterns helps you anticipate traps.
在动笔之前，先摸清题型。IB计算机科学高/标准水平卷一通常包含20–30道独立的选择题，范围覆盖全大纲。WJEC A-level单元一同样有选择题部分，考查基础知识。两个考试局都爱用否定措辞、“除了”题型，以及需要多步推理的题目。识别这些套路，才能提前防范陷阱。
Also note that IB questions often mix real-life scenarios with theoretical concepts, while WJEC leans towards direct technical recall. Read the stem actively: underline keywords such as 'NOT', 'EXCEPT', 'BEST', or 'LEAST'. Many errors stem from misreading a simple negation.
还需注意，IB题目常把实际场景与理论概念结合在一起，而WJEC更倾向直接的技术性回忆。主动阅读题干：在“NOT”“EXCEPT”“BEST”“LEAST”等关键词下划线。很多错误都源于对简单否定词的误读。
2. Rapid Elimination: Spot the Odd One Out | 快速排除：揪出格格不入的选项
Always scan all four options before reading the question in detail. Often one or two choices are fundamentally wrong due to incorrect syntax, impossible values, or blatant contradictions. For example, in a data structure question, if three options involve stacks and one involves a queue in a context where LIFO is required, eliminate the queue option instantly.
在细读题干前，先扫一眼四个选项。通常有一到两个选项从原理上就是错的，比如语法错误、数值离谱或明显矛盾。例如数据结构题中，如果三个选项涉及栈，而场景要求后进先出，另一个选项是队列，直接排除队列选项。
Another powerful elimination cue is 'absolute' language such as 'always', 'never', or 'must'. These qualifiers are rarely correct in computer science because exceptions often exist. If you see 'All algorithms are recursive' or 'A compiler never optimizes code', mark those as suspect.
另一个强力排除信号是“总是”“绝不”“一定”这类绝对化词语。计算机科学中很少有绝对真理，因为例外总是存在。如果看到“所有算法都是递归的”或“编译器从不优化代码”，这类选项通常可疑。
Similarly, in programming questions, options with mismatched data types or impossible array indices can be deleted without a second thought. Trust syntactic and semantic clues.
同样，编程题中，数据类型不匹配或数组下标越界的选项可以毫不犹豫地删掉。要相信语法和语义线索。
3. The Substitution Hack: Plug in Values | 代入法：用具体数值验证
a code snippet iterates while x < 10, pick x = 5 and trace the execution. This often reveals the correct output or the number of iterations much faster than formal analysis.
遇到循环、条件判断或算法跟踪题，用小的具体数值代入，可以避免心算出错。如果代码片段在 x < 10 时循环，就取 x = 5 来跟踪执行。这样往往比形式化分析更快得出正确输出或循环次数。
In boolean algebra simplification questions, if you struggle with algebraic laws, test the expression with a truth table row assignment. Plug in 0 and 1 values to see which answer choice matches the output. This approach turns a symbolic problem into a brute-force check, saving time under pressure.
布尔代数化简题中，如果代数定律记不牢，可以代入真值表某行的赋值。输入0和1，看哪个选项的输出与原始表达式一致。这种暴力验证法能将符号化难题变成简单核对，在紧张时刻非常省时。
4. Truth Table Shortcuts for Logic Gates | 逻辑门真值表速记
question rather than all four combinations. For a two-input circuit with A=1, B=0, just evaluate the output for that row and compare options. This targets the exact scenario and avoids unnecessary work.
逻辑门题目常把与、或、非、与非、或非、异或混在一起。画一个仅包含题干给定输入状态的迷你真值表，而不必写出全部四种组合。比如两输入电路 A=1, B=0，就只评估这一行的输出，再对比选项。这就能精准命中情景，避免多余计算。
Remember universal gate properties: NAND and NOR can implement any other gate. If a question asks 'Which gate can be used to build an XOR using only that type?' the answer is usually NAND or NOR. These patterns appear repeatedly in WJEC and IB exams.
记住通用门特性：与非门和或非门可以实现任何其他门。如果题目问“仅用哪一种门可以构造异或门？”，答案通常是与非或或非。WJEC和IB考试中会反复出现此类模式。
5. Boolean Algebra: Absorption and De Morgan in Seconds | 布尔代数：秒用吸收律与德摩根律
. In MCQs, a complex expression can often be reduced to a single variable just by spotting these identities. Also, apply De Morgan' uit diagrams or inverted expressions. Flip the operator and complement variables mentally.
要学会一眼识别可吸收模式：A + AB = A，以及 A(A + B) = A。选择题里，一个复杂表达式通过发现这些恒等式往往能化简为单个变量。另外，看到电路图中的断线取反或表示式上方的非号，马上用德摩根定律：心里把运算符翻转，变量取反。
For example, the complement of (A AND B) is (NOT A) OR (NOT B). In questions with multiple negation layers, apply De Morgan step by step from the outermost bar. Drawing small bubbles on a circuit diagram can help you keep track.
例如，(A AND B) 的补是 (NOT A) OR (NOT B)。在有多层取反的问题中，从最外层横杠开始逐步应用德摩根。在电路图上画小气泡能够帮你理清逻辑。
6. Data Structure Snapshots: Stack, Queue, Tree Traversal | 数据结构快照：栈、队列、树遍历
For stack and queue operation MCQs, draw a vertical array or box diagram quickly. After each push/pop or enqueue/dequeue, update the diagram. For post-order or pre-order traversal questions involving a binary tree, write the sequence directly beside each node using a short pencil note. This spatial aid prevents confusion between LNR, NLR, LRN orders.
遇到栈和队列操作选择题，迅速画一个竖直的数组或方框图。每次压入/弹出或入队/出队后更新示意图。涉及二叉树的后序或前序遍历时，直接用铅笔在每个节点旁写出访问顺序。这种空间辅助能避免LNR、NLR、LRN顺序混淆。
In linked list pointer manipulation MCQs, sketch nodes and arrows. A common trap is updating the wrong pointer first and losing the reference. Sketching the steps 'before' and 'after' will instantly reveal which option correctly inserts or deletes a node.
在链表指针操作选择题中，画出节点和箭头。常见陷阱是先更新了错误的指针而丢失引用。画出“之前”和“之后”的步骤，能立刻看出哪个选项正确插入了或删除了节点。
7. Complexity Classes without Panic | 时间复杂度不慌
log n). For recursive algorithms like binary search, the recurrence T(n) = T(n/2) + c points to O(log n). Memorise common complexities: O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ).
遇到大O符号选择题，先看主导项。嵌套循环通常表示O(n²)，但如果内层循环每次范围减半，则是O(n log n)。像二分查找这样的递归算法，递推关系 T(n) = T(n/2) + c 指向 O(log n)。熟记常见复杂度：O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)。
A handy reference table for common data structure operations (average case):
| Operation | Array | Linked List | BST (balanced) | Hash Table |
|---|---|---|---|---|
| Search | O(n) | O(n) | O(log n) | O(1) |
| Insert at end | O(1) | O(n) | O(log n) | O(1) |
常见数据结构操作平均时间复杂度速查表如上。利用此表可在选项中快速匹配，一旦看见对链表尾部插入声称 O(1) 的干扰项，可立即排除。
8. Number Systems: Binary to Hex in a Flash | 数字系统：二进制与十六进制秒转
Group binary digits into nibbles (4 bits) from right to left to convert to hex instantly. 10111010 becomes 1011 1010, which is BA in hex. For decimal to binary, use the power-of-two subtraction method instead of repeated division. Start with the highest power of 2 less than the number, write a 1, subtract, and continue. These tricks save precious seconds in WJEC and IB calculations.
二进制数从右向左每四位分组（半字节），就能瞬间转成十六进制。10111010 分成 1011 1010，即十六进制 BA。十进制转二进制，用2的幂相减法比反复除2更快：从小于该数的最大2的幂开始，写1，相减，继续。这些技巧在WJEC和IB计算中能省下宝贵的秒数。
For negative binary representations, remember two's complement shortcut: flip all bits and add 1. When a question asks for the 8-bit two's complement of -5, start with +5 (00000101), flip to 11111010, add 1 to get 11111011. Eliminate any option that does not start with 1 for a negative number.
对于负的二进制表示，记住二进制补码捷径：所有位取反再加1。如果题目问 -5 的8位补码，从+5 (00000101)开始，取反得11111010，加1得11111011。负数补码若不以1开头即可排除。
9. Architecture & Fetch-Decode-Execute Cycle | 体系结构与取指-译码-执行周期
MCQs on CPU components often ask about the sequence of the fetch-decode-execute cycle. Remember: MAR ← PC; memory read; MDR ← data; IR ← MDR; PC incremented; decode; execute. Any option that places execute before decode is immediately wrong. For pipelining, throughput improves but latency per instruction may stay the same.
关于CPU部件的选择题常考查取指-译码-执行周期顺序。记住：MAR ← PC；存储器读；MDR ← 数据；IR ← MDR；PC递增；译码；执行。任何把执行放在译码之前的选项可立刻排除。对于流水线，吞吐量提高但单条指令延迟可能不变。
Register-specific questions can be tackled by function: the Program Counter (PC) holds the address of the next instruction, the Memory Address Register (MAR) holds the address being accessed, and the Accumulator (ACC) stores results of ALU operations
Published by TutorHao | IB Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图