📚 Boolean Algebra Key Points for IGCSE CIE Computer Science | IGCSE CIE 计算机：布尔代数 考点精讲
Boolean Algebra is a fundamental topic in IGCSE Computer Science. It forms the basis of digital logic and circuit design. Understanding how to manipulate logical expressions, construct truth tables, and simplify circuits is essential for both the exam and practical computing. This article breaks down every key concept you need to master.
布尔代数是 IGCSE 计算机科学的基础课题。它为数字逻辑和电路设计奠定了基础。理解如何操作逻辑表达式、构建真值表并化简电路，不仅对考试至关重要，对实际计算也同样重要。本文将逐一解析你需要掌握的每个关键概念。
1. What Is Boolean Algebra? | 什么是布尔代数？
Boolean Algebra is a mathematical discipline that deals with binary variables and logical operations. Every variable can only take one of two values: 0 or 1. These values represent false and true, off and on, or low and high voltage. It was invented by George Boole in the 19th century and is now the core of digital electronics.
布尔代数是一门处理二进制变量和逻辑运算的数学学科。每个变量只能取两个值之一：0 或 1。这些值代表假和真、关和开，或者低电平和高电平。它由乔治·布尔于 19 世纪发明，现在是数字电子学的核心。
The three basic operations in Boolean Algebra are conjunction (AND), disjunction (OR), and negation (NOT). All other functions can be derived from these. In IGCSE CIE Computer Science, you will use Boolean Algebra to analyse, design, and simplify logic circuits.
布尔代数中的三个基本运算是与 (AND)、或 (OR) 和非 (NOT)。所有其他函数都可以从这些运算派生。在 IGCSE CIE 计算机科学中，你将使用布尔代数来分析、设计和简化逻辑电路。
2. Basic Logic Gates and Their Symbols | 基本逻辑门及其符号
A logic gate is a physical electronic device that performs a Boolean function. Each gate has a distinctive symbol that you must recognise in circuit diagrams. The standard gates are NOT, AND, OR, NAND, NOR, XOR, and sometimes XNOR. For IGCSE, focus on NOT, AND, OR, NAND, NOR, and XOR.
逻辑门是一种实现布尔函数的物理电子设备。每种门都有其独特的符号，你必须在电路图中识别它们。标准门包括非门、与门、或门、与非门、或非门、异或门，有时还有同或门。对于 IGCSE，重点掌握非门、与门、或门、与非门、或非门和异或门。
- NOT gate: A triangle with a small circle at the output. Output is the inverse of the input.
非门：输出端带小圆圈的三角形。输出是输入的反相。 - AND gate: A D-shaped symbol. Output is 1 only if all inputs are 1.
与门：D 形符号。只有当所有输入都为 1 时，输出才为 1。 - OR gate: A curved shape converging to a point. Output is 1 if at least one input is 1.
或门：弯曲交汇于一点的形状。如果至少有一个输入为 1，则输出为 1。 - NAND gate: An AND gate with a small circle at the output. Output is 0 only if all inputs are 1.
与非门：输出端带小圆圈的与门。仅当所有输入都为 1 时，输出才为 0。 - NOR gate: An OR gate with a small circle at the output. Output is 1 only if all inputs are 0.
或非门：输出端带小圆圈的或门。仅当所有输入都为 0 时，输出才为 1。 - XOR gate: An OR gate with an extra curved line at the input. Output is 1 if an odd number of inputs are 1.
异或门：输入端多一条弧线的或门。输入中 1 的个数为奇数时，输出为 1。
3. Truth Tables: From Inputs to Outputs | 真值表：从输入到输出
A truth table lists all possible combinations of inputs and shows the corresponding output for a given Boolean expression or logic circuit. For n inputs, there are 2ⁿ rows. Each row represents a unique combination of 0s and 1s.
真值表列出了所有可能的输入组合，并显示给定布尔表达式或逻辑电路对应的输出。对于 n 个输入，有 2ⁿ 行。每一行代表一个唯一的 0 和 1 组合。
To construct a truth table, start by writing the input columns in binary counting order. Then evaluate the expression step by step for each row, adding intermediate columns if necessary. For example, the truth table for A AND B is:
要构造真值表，首先按二进制计数顺序写出输入列。然后逐行逐步计算表达式，如有必要可添加中间列。例如，A AND B 的真值表为：
| A | B | A AND B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
In the exam, you might be asked to complete a truth table for a given logic circuit. Always work systematically from inputs toward the output.
考试中，你可能会被要求为给定逻辑电路完成真值表。一定要系统地从输入端向输出端逐步计算。
4. Boolean Expressions and Notation | 布尔表达式及其记法
Boolean expressions combine variables and operators to describe logic functions. Common notation uses a dot (·) for AND, a plus (+) for OR, and an overbar or prime (') for NOT. For example, (A · B) + C' means (A AND B) OR (NOT C). Sometimes the AND dot is omitted: AB means A AND B.
布尔表达式将变量和运算符组合起来描述逻辑函数。常用记法是用点 (·) 表示与，加号 (+) 表示或，上划线或撇号 (') 表示非。例如，(A · B) + C' 表示 (A AND B) OR (NOT C)。有时与的点会被省略：AB 表示 A AND B。
You must be able to read and write expressions in both notations. When evaluating, remember the order of precedence: NOT first, then AND, then OR. Use parentheses to override this order when needed.
你必须能够读写两种记法的表达式。计算时，要记住优先级顺序：非运算最先，然后是与，最后是或。必要时使用括号改变运算顺序。
5. Boolean Laws and Identities | 布尔代数定律与恒等式
To simplify expressions, you need to apply Boolean laws. The most important ones are:
为了化简表达式，你需要应用布尔代数定律。最重要的定律有：
- Identity Law: A + 0 = A and A · 1 = A
同一律：A + 0 = A，A · 1 = A - Null Law: A + 1 = 1 and A · 0 = 0
零一律：A + 1 = 1，A · 0 = 0 - Idempotent Law: A + A = A and A · A = A
幂等律：A + A = A，A · A = A - Complement Law: A + A' = 1 and A · A' = 0
互补律：A + A' = 1，A · A' = 0 - Double Negation: (A')' = A
双重否定律：(A')' = A - Commutative Law: A + B = B + A and A · B = B · A
交换律：A + B = B + A，A · B = B · A - Associative Law: (A + B) + C = A + (B + C) and (A · B) · C = A · (B · C)
结合律：(A + B) + C = A + (B + C)，(A · B) · C = A · (B · C) - Distributive Law: A · (B + C) = A·B + A·C and A + (B · C) = (A + B)·(A + C)
分配律：A · (B + C) = A·B + A·C，A + (B · C) = (A + B)·(A + C) - Absorption Law: A + A·B = A and A·(A + B) = A
吸收律：A + A·B = A，A·(A + B) = A
Apply these laws step by step to reduce the number of gates or terms in an expression. This saves cost and improves circuit efficiency.
逐步应用这些定律可以减少表达式中的门的数量或项数。这样能节省成本并提高电路效率。
6. De Morgan’s Theorems | 德摩根定理
De Morgan’s Theorems provide a way to transform expressions involving AND and OR under negation. The two theorems are:
德摩根定理提供了一种在否定条件下转换包含与和或的表达式的方法。这两个定理是：
(A · B)' = A' + B'
The complement of a conjunction is the disjunction of the complements. 合取式的补等价于各补的析取。
(A + B)' = A' · B'
The complement of a disjunction is the conjunction of the complements. 析取式的补等价于各补的合取。
These laws are extremely useful when you have a NAND or NOR gate and want to convert it into an equivalent circuit using AND/OR plus NOT gates, or when simplifying complex expressions with multiple negations.
当你有一个与非门或或非门，并希望将其转换为使用与/或加非门的等效电路时，或者当化简带有多个否定的复杂表达式时，这些定律非常有用。
or example, prove that a NAND gate is equivalent to an OR gate with inverted inputs: (A·B)' = A' + B'. In a circuit diagram, you can replace a NAND with an OR whose inputs have bubbles.
例如，证明与非门等同于输入端取反的或门：(A·B)' = A' + B'。在电路图中，你可以用输入端带小圆圈的或门代替与非门。
7. Logic Circuits and Expression Conversion | 逻辑电路与表达式转换
A common exam question gives you a logic circuit diagram and asks you to write the Boolean expression, or provides an expression and asks you to draw the circuit. The conversion follows a direct mapping:
常见的考试题型是给出一个逻辑电路图，让你写出布尔表达式；或者给出一个表达式，让你画出电路图。转换遵循直接映射：
- Each gate corresponds to its operator.
每个门对应其运算符。 - Follow the circuit from left to right.
从左到右沿着电路走。 - Label intermediate wires with sub-expressions if necessary.
必要时用子表达式为中间连线标注。
ressions with parentheses to avoid ambiguity. For instance, the expression Q = (A + B) · C' results in an OR gate for A+B, a NOT gate for C, and an AND gate combining their outputs.
根据表达式绘制电路时，从优先级最高的运算（非）开始，然后是与，最后是或。用括号将子表达式分组以避免歧义。例如，表达式 Q = (A + B) · C' 会产生一个实现 A+B 的或门，一个实现 C 的非门，以及一个将它们的输出组合起来的与门。
In IGCSE, you may also encounter questions asking you to complete a truth table from a circuit. Just simulate the signals row by row.
在 IGCSE 中，你还可能遇到要求根据电路完成真值表的题目。只需逐行仿真信号即可。
8. Simplifying Boolean Expressions Using Algebra | 使用代数方法化简布尔表达式
Simplification reduces the number of logic gates needed, making circuits cheaper and faster. Use the Boolean laws and De Morgan’s theorems. Here is a worked example:
化简可以减少所需逻辑门的数量，使电路更便宜、更快。运用布尔代数定律和德摩根定理。下面是一个实例：
Simplify Q = A·B + A·B'
Factor out A: Q = A·(B + B')
提取公因子 A：Q = A·(B + B')
Apply Complement Law: B + B' = 1
应用互补律：B + B' = 1
Apply Identity Law: A·1 = A
应用同一律：A·1 = A
Thus, the whole expression simplifies to just A. This means the original circuit of two AND gates and one OR gate can be replaced by a single wire connected to input A.
因此，整个表达式化简为 A。这意味着原来由两个与门和一个或门组成的电路可以被单根连接输入 A 的导线取代。
Another common simplification involves De Morgan’s Theorem. For example, simplify (A·B)' + C. First apply De Morgan: (A·B)' = A' + B'. Then the expression becomes A' + B' + C.
另一种常见的化简涉及德摩根定理。例如，化简 (A·B)' + C。首先应用德摩根：(A·B)' = A' + B'。然后表达式变为 A' + B' + C。
9. Universal Gates: NAND and NOR | 万能门：NAND 和 NOR
NAND and NOR gates are called universal gates because any Boolean function can be implemented using only NAND gates or only NOR gates. This is important for manufacturing because producing a single gate type lowers costs.
与非门和或非门被称为万能门，因为任何布尔函数都可以仅用与非门或仅用或非门实现。这对制造很重要，因为生产单一门类型可以降低成本。
To implement other gates using NAND:
用与非门实现其他门的方法：
- NOT: Connect the input to both inputs of a NAND. Output = (A·A)' = A'
非门：将输入连接到与非门的两个输入端。输出 = (A·A)' = A' - AND: NAND followed by a NOT (which is a NAND with joined inputs).
与门：与非门后接一个非门（即输入端短接的与非门）。 - OR: Apply De Morgan: A + B = (A'·B')' . Use three NAND gates.
或门：应用德摩根：A + B = (A'·B')'。使用三个与非门。
The same approach works for NOR gates. Knowing these conversions may be tested in a design question where you are asked to redraw a circuit using only NAND gates.
同样的方法也适用于或非门。在需要你用仅含与非门重画电路的设计题中，可能会考察这些转换知识。
10. Common Pitfalls and Exam Tips | 常见误区与应试技巧
Many students lose marks by confusing the symbols for AND and OR, or by forgetting that the bubble indicates inversion. Always double-check the gate shapes in circuit diagrams. In truth table questions, ensure you have 2ⁿ rows for n inputs; a table with three inputs must have eight rows, not four or six.
许多学生因为混淆与门和或门的符号，或者忘记小圆圈表示反相而丢分。务必反复检查电路图中的门形状。在真值表题中，要确保 n 个输入有 2ⁿ 行；三个输入的真值表必须有八行，而不是四行或六行。
When simplifying, write down each law you apply so that examiners can follow your reasoning. Even if your final answer is wrong, method marks are often awarded. Do not try to simplify in one mental leap; write intermediate steps.
化简时，写下你应用的每条定律，以便阅卷老师能跟踪你的推理过程。即使最终答案错误，也常常能得到过程分。不要试图在心算中一步到位；要写下中间步骤。
Practise converting between circuit diagrams, expressions, and truth tables. These three representations are the backbone of the Boolean Algebra topic. The more you practise, the faster you will recognise patterns and shortcuts.
练习在电路图、表达式和真值表之间进行转换。这三种表示法是布尔代数课题的支柱。练习得越多，就越能快速识别模式和捷径。
11. Extended Topics for Higher Attainment | 更高要求的拓展内容
For those aiming for top grades, you may encounter questions on combining half and full adders with Boolean algebra, or on Karnaugh Maps (K-maps) for simplifying four-variable expressions. While K-maps are not always required in IGCSE specifications, some syllabuses introduce two-variable or three-variable K-maps. A K-map is a grid-based method for simplification that groups adjacent 1s to find the minimal sum-of-products expression. It can be faster and more visual than algebraic manipulation.
对于追求高分的学生，你可能会遇到将半加器和全加器与布尔代数相结合的题目，或者用卡诺图 (K-map) 化简四变量表达式。虽然 IGCSE 大纲并非总是要求卡诺图，但有些教学大纲会介绍两变量或三变量卡诺图。卡诺图是一种基于网格的化简方法，通过将相邻的 1 分组来找到最小积之和表达式。它比代数操作更快速、更直观。
If K-maps are part of your course, remember the rule: groups must be rectangles of size 1, 2, 4, 8, … and can wrap around edges. Each group eliminates variables that change within the group. This directly leads to a simplified expression.
如果卡诺图属于你的课程内容，记住这条规则：分组必须是大小为 1、2、4、8 …… 的矩形，且可以环绕边界。每个分组会消去在该组内发生变化的变量。这样直接得到简化后的表达式。
12. Summary | 总结
Boolean Algebra is not just an abstract mathematical exercise; it is the language of all digital devices, from simple calculators to complex microprocessors. By mastering truth tables, Boolean laws, De Morgan's theorems, and circuit conversion, you will be equipped to analyse and design logic systems. Keep practising past paper questions and write each step clearly. Good luck with your IGCSE Computer Science exam!
布尔代数不仅仅是一个抽象的数学练习；它是所有数字设备的语言，从简单的计算器到复杂的微处理器。通过掌握真值表、布尔代数定律、德摩根定理和电路转换，你将具备分析和设计逻辑系统的能力。坚持练习历年真题，并清晰地写出每一个步骤。祝你在 IGCSE 计算机科学考试中好运！
Published by TutorHao | IGCSE Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图