Boolean Algebra: IB & WJEC Exam Essentials | 布尔代数：IB 与 WJEC 考点精讲

📚 Boolean Algebra: IB & WJEC Exam Essentials | 布尔代数：IB 与 WJEC 考点精讲

Boolean algebra forms the mathematical backbone of digital logic and computer science. In IB and WJEC specifications, you are expected not only to manipulate Boolean expressions using laws and identities but also to simplify logic circuits, construct truth tables, and apply Karnaugh maps. This guide covers all essential topics with clear English–Chinese explanations to help you master every concept and tackle exam questions confidently.

布尔代数是数字逻辑和计算机科学的数学基础。在 IB 和 WJEC 的考试大纲中，你不仅需要运用定律和恒等式操作布尔表达式，还要能够化简逻辑电路、构建真值表并应用卡诺图。本指南涵盖所有核心考点，以清晰的中英双语解释帮助你掌握每一个概念，自信应对考试题目。

1. Binary Logic & Boolean Values | 二进制逻辑与布尔值

Boolean algebra deals with variables that can take only two values: 0 and 1. 0 usually represents FALSE, OFF, or LOW, while 1 represents TRUE, ON, or HIGH. Understanding this duality is the first step.

布尔代数处理的变量只能取两个值：0 和 1。0 通常表示假、关或低电平，1 表示真、开或高电平。理解这种二元性是最基础的一步。

Every Boolean variable and expression can be evaluated to either 0 or 1. Digital circuits use voltage levels to encode these states, making Boolean algebra directly applicable to circuit design.

每个布尔变量和表达式都可以求值为 0 或 1。数字电路使用电压电平对这两个状态进行编码，因此布尔代数可以直接应用于电路设计。

2. Basic Logic Gates & Operators | 基本逻辑门与运算符

The three fundamental operators are AND, OR, and NOT. In Boolean notation, AND is often represented by a dot (·) or simply by concatenation (AB); OR by a plus sign (+); and NOT by an overbar (A̅) or a prime symbol (A’).

三种基本运算符是 AND、OR 和 NOT。在布尔符号系统中，AND 通常用点号（·）或直接并列表示（AB）；OR 用加号（+）；NOT 用上划线（A̅）或撇号（A’）表示。

AND (Conjunction): A · B = 1 only when both A = 1 and B = 1. 与（合取）：A · B = 1 仅当 A = 1 且 B = 1。
OR (Disjunction): A + B = 1 when at least one input is 1. 或（析取）：A + B = 1 只要至少一个输入为 1。
NOT (Negation): A̅ = 1 when A = 0; A̅ = 0 when A = 1. 非（否定）：A̅ = 1 当 A = 0 时；A̅ = 0 当 A = 1 时。

NAND, NOR, XOR, and XNOR are derived gates used extensively in design. For instance, NAND is an AND followed by NOT; NOR is an OR followed by NOT.

NAND、NOR、XOR 和 XNOR 是衍生门，在设计中被广泛使用。例如，NAND 是在 AND 后接 NOT；NOR 是在 OR 后接 NOT。

Truth tables for derived gates:

衍生门的真值表：

A	B	NAND	NOR	XOR	XNOR
0	0	1	1	0	1
0	1	1	0	1	0
1	0	1	0	1	0
1	1	0	0	0	1

3. Truth Tables | 真值表

A truth table lists every possible input combination and the corresponding output for a Boolean expression or circuit. For n input variables, there are 2ⁿ rows.

真值表列出了所有可能的输入组合及其对应的布尔表达式或电路输出。对于 n 个输入变量，共有 2ⁿ 行。

You must be able to construct a truth table from an expression or logic diagram, and vice versa. For example, the expression F = A · (B + C) yields a specific truth table that helps verify logic behaviour.

你必须能够根据表达式或逻辑图构建真值表，反之亦然。例如，表达式 F = A · (B + C) 会产生特定的真值表，用以验证逻辑行为。

When filling truth tables, work through operator precedence: brackets first, then NOT, then AND, then OR. Compute intermediate columns before the final output.

填写真值表时，要遵循运算符优先级：先括号，然后 NOT，再 AND，最后 OR。先计算中间列，再得出最终输出。

4. Boolean Laws & Theorems | 布尔定律与定理

Simplifying Boolean expressions requires a solid grasp of the laws. The most important ones are:

化简布尔表达式需要扎实掌握各类定律。最重要的有：

Identity Laws: A + 0 = A, A · 1 = A 恒等律：A + 0 = A, A · 1 = A
Annulment Laws: A + 1 = 1, A · 0 = 0 零律/湮灭律：A + 1 = 1, A · 0 = 0
Idempotent Laws: A + A = A, A · A = A 幂等律：A + A = A, A · A = A
Complement Laws: A + A̅ = 1, A · A̅ = 0 互补律：A + A̅ = 1, A · A̅ = 0
Double Negation: A̅̅ = A 双重否定律：A̅̅ = A
Commutative Laws: A + B = B + A, A · B = B · A 交换律
Associative Laws: (A + B) + C = A + (B + C), (A · B) · C = A · (B · C) 结合律
Distributive Laws: A · (B + C) = A·B + A·C, A + (B·C) = (A+B)·(A+C) 分配律
Absorption Laws: A + A·B = A, A·(A + B) = A 吸收律：A + A·B = A, A·(A + B) = A
De Morgan’s Theorems: (A·B)̅ = A̅ + B̅, (A+B)̅ = A̅ · B̅ 德·摩根定理

De Morgan’s theorems are critical for converting between AND/OR logic to NAND/NOR logic, which is essential for circuit implementation using universal gates.

德·摩根定理对于实现 AND/OR 逻辑与 NAND/NOR 逻辑之间的转换至关重要，这是使用通用门实现电路的关键。

Always apply the laws in a sequence that reduces the number of terms or literals. Step-by-step simplification with named justifications is frequently tested in exams.

在考试中，常常要求你按步骤化简并写出所用定律名称，以逐步减少项或字母的数量。

5. Simplifying Expressions Algebraically | 代数化简表达式

Algebraic simplification uses the laws to reduce a Boolean expression to its simplest form. The goal is to minimize the number of gates and inputs in the circuit.

代数化简利用定律将布尔表达式化为最简形式，目标是最大限度地减少电路中的门和输入端数量。

Example: Simplify F = A·B + A·B̅

示例：化简 F = A·B + A·B̅

F = A·(B + B̅) (Distributive/分配律)
= A·1 (Complement/互补律)
= A (Identity/恒等律)

Another common technique is to expand, then eliminate redundant terms using absorption or consensus theorems.

另一种常用方法是先展开，然后利用吸收律或一致律消去冗余项。

Be careful to show each step and cite the law used. In WJEC questions, marks are awarded for both the correct simplification and the proper application of laws.

要注意写出每一步并注明所用定律。在 WJEC 的题目中，正确化简和恰当应用定律都能得分。

6. Logic Circuits & Gate Diagrams | 逻辑电路与门级图

You need to be able to draw a logic circuit from a Boolean expression, and conversely derive the expression from a given circuit diagram. Each AND, OR, NOT, NAND, NOR gate has a standard symbol.

你需要能够根据布尔表达式绘制逻辑电路，也能从给定的电路图推导出表达式。每个与门、或门、非门、与非门、或非门都有标准符号。

Practical tip: When drawing circuits, start from the output side and work backwards. Use the correct pin arrangement and label all signals clearly.

实用技巧：绘制电路时，从输出端开始逆向绘制；使用正确的引脚排列并清晰标注所有信号。

WJEC often asks you to implement a Boolean expression using only NAND gates or only NOR gates. You must apply De Morgan’s theorem and double negation to convert the expression.
For instance, F = A·B + C can be converted to NAND-only form as F = ( (A·B)̅ · C̅ )̅.

WJEC 经常要求仅用与非门或仅用或非门实现布尔表达式。你需要运用德·摩根定理和双重否定律进行转换。
例如，F = A·B + C 可以转换为全 NAND 形式：F = ( (A·B)̅ · C̅ )̅。

Always verify the truth table after conversion to ensure equivalence.

转换后务必要验证真值表以保证等价性。

7. Combinational Logic Design | 组合逻辑设计

In both IB and WJEC, you may be asked to design a logic system from a problem statement. This involves defining inputs and outputs, constructing a truth table, deriving a sum-of-products (SOP) or product-of-sums (POS) expression, and simplifying.

在 IB 和 WJEC 中，你都可能被要求根据问题描述设计一个逻辑系统。这包括定义输入和输出、构建真值表、推导最小项之和（SOP）或最大项之积（POS）表达式，然后进行化简。

SOP is formed by OR-ing the minterms where the output is 1. POS is formed by AND-ing the maxterms where the output is 0, often used after simplification via Karnaugh maps.

SOP 是将输出为 1 的最小项相或；POS 是将输出为 0 的最大项相与，通常在卡诺图化简后使用。

Example: A security alarm sounds (F=1) when door (D) is open AND motion (M) is detected, OR when a panic button (P) is pressed. This yields F = D·M + P.

示例：当门（D）打开且检测到移动（M），或者紧急按钮（P）被按下时，安全警报响起（F=1）。这直接得到 F = D·M + P。

Make sure your design accounts for all conditions. Don’t forget don’t-care states if specified.

确保设计涵盖所有条件。如果题目给出了无关项（don’t-care）状态，不要遗漏。

8. Karnaugh Maps (K-maps) | 卡诺图

Karnaugh maps provide a visual method for simplifying Boolean expressions of up to 4 variables (or 5 in some syllabuses). They help identify adjacent minterms that differ by only one variable, allowing grouping in powers of 2 (1,2,4,8,…).

卡诺图提供了一种对最多 4 个变量（部分大纲可到 5 个）的布尔表达式进行可视化简的方法。它帮助识别只相差一个变量的相邻最小项，从而按 2 的幂次（1,2,4,8…）分组。

Steps to create a K-map:

创建卡诺图的步骤：

Label rows and columns using Gray code order (00, 01, 11, 10). 使用格雷码顺序（00, 01, 11, 10）标记行和列。
Fill in cells with the output values from the truth table. 根据真值表的输出值填充单元格。
Group adjacent 1s (for SOP) in the largest possible rectangles, ensuring groups are as large as possible and number of cells is a power of 2. 将相邻的 1 分组（用于 SOP），尽可能形成最大的矩形，确保每组所含格子数为 2 的幂。
Derive simplified terms by identifying variables that remain constant within a group. Eliminate variables that change. 通过识别组内不变的变量推导出简化项，消去发生变化的变量。
Write the minimized SOP expression. 写出最简 SOP 表达式。

For POS, you can group 0s and then complement the resulting expression, or work with the original maxterms.

对于 POS，可将 0 分组，然后对所得表达式取补，或直接处理原始最大项。

K-maps are essential for achieving minimal expressions and are a major part of both IB and WJEC exams. Practice handling don’t-care conditions (X) which can be treated as 1 or 0 to help form larger groups.

卡诺图对于获得最简表达式至关重要，是 IB 和 WJEC 考试的重点内容。要练习处理无关项（X），可以将它们视为 1 或 0 来帮助形成更大的分组。

9. Don’t-Care Conditions & Incompletely Specified Functions | 无关条件与不完全指定函数

Sometimes certain input combinations never occur or the output is irrelevant. These are marked as X in truth tables and K-maps. You can choose to set X=1 or X=0 to maximize grouping.

有时某些输入组合永远不会出现，或者输出无关紧要。这些在真值表和卡诺图中标记为 X。你可以选择将 X 设为 1 或 0 来最大化分组。

Using don’t-cares wisely can lead to significantly simpler circuits. However, you must not overuse them—only treat an X as 1 if it helps form a larger group; if not, treat it as 0.

明智地利用无关项能显著简化电路。但不可滥用——仅当将 X 视为 1 有助于形成更大分组时才这样做；否则将其视为 0。

In exam questions, explicitly state which Xs you are using and why. The final expression may differ from a purely minimal form but should still be valid for all specified input combinations.

在考试中要明确指出你使用了哪些 X 以及原因。最终表达式可能与纯最简形式不同，但对于所有指定的输入组合必须是正确的。

10. Half Adders, Full Adders, and Combinational Blocks | 半加器、全加器与组合模块

Boolean algebra is the basis for arithmetic circuits like adders. A half adder adds two bits and produces Sum (S = A⊕B) and Carry (C = A·B). A full adder adds three bits (A, B, carry-in) with Sum = A⊕B⊕Cin, Cout = A·B + (A⊕B)·Cin.

布尔代数是加法器等算术电路的基础。半加器将两个比特相加，产生和（S = A⊕B）与进位（C = A·B）。全加器将三个比特（A、B、进位输入）相加，Sum = A⊕B⊕Cin，Cout = A·B + (A⊕B)·Cin。

You may be required to construct truth tables for these blocks and show how multiple full adders can be cascaded into a ripple-carry adder. This type of question combines Boolean manipulation with circuit design.

你可能需要为这些模块构建真值表，并展示如何将多个全加器级联成行波进位加法器。这类题目结合了布尔操作与电路设计。

Understanding the Boolean expressions inside these building blocks helps you optimize larger digital systems.

理解这些基本模块内部的布尔表达式有助于优化更大的数字系统。

11. De Morgan’s Theorem in Depth | 深度解析德·摩根定理

De Morgan’s theorem is frequently tested in both trivial and complex forms. The two forms are:

德·摩根定理在简单和复杂题目中都会频繁出现。两种形式为：

(A · B)̅ = A̅ + B̅ and (A + B)̅ = A̅ · B̅

They can be extended to any number of variables: (A·B·C)̅ = A̅ + B̅ + C̅, etc.

它们可以推广到任意数量的变量：(A·B·C)̅ = A̅ + B̅ + C̅，等等。

Application: When you are asked to implement a function using only NAND gates, you repeatedly apply De Morgan to eliminate OR operators. For example, converting F = (A̅ · B) + C:

应用：当要求仅用 NAND 门实现函数时，你需反复运用德·摩根定理消除 OR 运算符。例如，转换 F = (A̅ · B) + C：

F = ( (A̅ · B)̅ )̅ + C → F = ( (A̅ · B)̅ · C̅ )̅ (using De Morgan on the OR)

F = ( (A̅ · B)̅ )̅ + C → F = ( (A̅ · B)̅ · C̅ )̅（对 OR 使用德·摩根）

Practice converting expressions to NAND-only and NOR-only forms, and check your result by comparing truth tables.

要多练习将表达式转换为全 NAND 和全 NOR 形式，并通过比较真值表来检查结果。

12. Exam Tips & Common Mistakes | 考试技巧与常见错误

1. Always write the names of laws when simplifying in exam answers. Even if you get the simplification right, missing justification may lose marks.

考试时化简一定要写出定律名称。即使化简正确，缺少依据也可能丢分。

2. Double-check K-map adjacency. Edges are adjacent (top to bottom, left to right), and the four corners form a valid group.

再次检查卡诺图的相邻关系：边缘是相邻的（上下、左右），四个角可以形成一个合理的分组。

3. When drawing circuits from boolean expressions, use neat gate symbols. Label all inputs and outputs clearly.

根据布尔表达式绘制电路时，使用整洁的门符号，并清晰标注所有输入和输出。

4. Be careful with operator precedence: NOT has the highest priority, then AND, then OR. In bubble-to-bubble logic, use De Morgan to move bubbles.

注意运算符优先级：NOT 优先级最高，其次是 AND，最后是 OR。在气泡推拉逻辑中，使用德·摩根定理移动取反气泡。

5. In truth tables, 2ⁿ rows are required; missing a row is a common and costly error.

真值表需要 2ⁿ 行；遗漏一行是常见且代价很高的错误。

6. Don’t forget to consider don’t-care conditions when simplifying. They can drastically reduce the gate count.

化简时不要忘记考虑无关条件，它们能显著减少门数量。

7. When in doubt, verify with a truth table. This is the ultimate check for logical equivalence.

如有疑问，用真值表验证。这是检查逻辑等价性的终极大法。

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

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

Boolean Algebra: IB & WJEC Exam Essentials | 布尔代数：IB 与 WJEC 考点精讲