📚 IB Computer Science: Boolean Algebra Key Points | IB 计算机：布尔代数考点精讲
Boolean algebra provides the mathematical foundation for digital electronics and the logic circuits at the heart of every computer. In IB Computer Science, mastering Boolean logic means being able to analyse, simplify, and design circuits with confidence—skills that are tested extensively in Topic 2 and the internal assessment. This guide walks you through every essential concept, from truth tables to Karnaugh maps, with worked examples and exam-ready explanations.
布尔代数为数字电子学和计算机核心的逻辑电路提供了数学基础。在 IB 计算机科学中，掌握布尔逻辑意味着能够自信地分析、简化和设计电路，这些技能在主题 2 和内部评估中被大量考察。本文带您逐一深入每个重要概念，从真值表到卡诺图，配有例题和考试导向的讲解。
1. Introduction to Boolean Algebra | 布尔代数简介
Boolean algebra operates on binary values—true (1) and false (0)—and uses operators such as AND, OR, and NOT to build logical expressions. Named after George Boole, this system underpins everything from simple decision-making statements in code to complex microprocessor design.
布尔代数处理二进制值——真（1）和假（0），并使用与、或、非等运算符构建逻辑表达式。以乔治·布尔命名，这个体系支撑着从代码中的简单判断语句到复杂微处理器设计的一切。
Understanding Boolean algebra is not just about crunching truth tables. It is the language of digital logic; grasping it early makes later topics like adders, flip-flops, and CPU control units far more intuitive.
理解布尔代数不仅仅是填写真值表。它是数字逻辑的语言；尽早掌握它会让后续的加法器、触发器和 CPU 控制单元等内容变得直观得多。
2. Boolean Variables and Constants | 布尔变量与常量
A Boolean variable can only take one of two values: 0 or 1. Constants are fixed Boolean values, usually represented by 0 (false) and 1 (true). In expressions, variables are often labelled A, B, C, and sometimes their complements (NOT A) appear as ¬A or A’.
布尔变量只能取两个值之一：0 或 1。常量是固定的布尔值，通常用 0（假）和 1（真）表示。在表达式中，变量常被标为 A、B、C，有时其补数（非 A）表示为 ¬A 或 A’。
In IB exam questions, you will frequently be asked to complete truth tables for given expressions using the full range of input combinations. Remember: with n variables, there are 2ⁿ possible combinations. So for two variables, you need four rows; for three variables, eight rows.
在 IB 考题中，你经常会被要求使用所有输入组合为给定表达式填写真值表。请记住：对于 n 个变量，共有 2ⁿ 种可能的组合。因此，两个变量需要 4 行；三个变量需要 8 行。
3. Basic Logic Gates: AND, OR, NOT | 基本逻辑门：与、或、非
The three fundamental gates form the building blocks of all digital circuits. The AND gate outputs 1 only when all inputs are 1. The OR gate outputs 1 when at least one input is 1. The NOT gate inverts its single input: 0 becomes 1, 1 becomes 0.
三种基本门构成了所有数字电路的基石。与门仅在所有输入均为 1 时输出 1。或门在至少一个输入为 1 时输出 1。非门将其单一输入取反：0 变 1，1 变 0。
| Gate | Symbol | Boolean Expression | Truth Table (A=0,1) |
|---|---|---|---|
| AND | ∧ | A ∧ B | 0,0 → 0; 0,1 → 0; 1,0 → 0; 1,1 → 1 |
| OR | ∨ | A ∨ B | 0,0 → 0; 0,1 → 1; 1,0 → 1; 1,1 → 1 |
| NOT | ¬ | ¬A | 0 → 1; 1 → 0 |
These three operations are sufficient to express any Boolean function. You should be able to draw the logic gate symbols, write the corresponding expressions, and produce truth tables without hesitation.
这三种运算足以表达任何布尔函数。你应该能够毫不犹豫地画出逻辑门符号、写出对应的表达式并生成真值表。
4. Truth Tables | 真值表
A truth table systematically lists every possible input combination for a logic circuit and the resulting output. It is the most reliable way to verify that a Boolean expression behaves as intended. When constructing a truth table, always follow a binary counting sequence in the inputs to avoid omissions.
真值表系统地列出逻辑电路的每种可能输入组合及其输出结果。它是验证布尔表达式行为是否符合预期的最可靠方法。构建真值表时，始终遵循输入的二进制计数顺序，以避免遗漏。
For example, the expression F = (A ∧ B) ∨ ¬C yields a truth table with eight rows. You evaluate each gate step by step: first compute A∧B, then ¬C, then OR the two intermediate results. In IB exams, you may be asked to fill in an incomplete truth table or to derive an expression from a given table.
例如，表达式 F = (A ∧ B) ∨ ¬C 会产生一个 8 行的真值表。你需要逐步评估每个门：先计算 A∧B，再计算 ¬C，然后将两个中间结果进行或运算。在 IB 考试中，你可能需要填写不完整的真值表，或从给定的表中推导出表达式。
5. Boolean Expressions and Evaluation | 布尔表达式与求值
Boolean expressions combine variables, constants, and operators, with the order of operations defined by parentheses and operator precedence. The standard priority is: NOT (¬) first, then AND (∧), and then OR (∨). Parentheses override this hierarchy.
布尔表达式将变量、常量和运算符组合在一起，运算顺序由括号和运算符优先级决定。标准优先级为：先非（¬），再与（∧），然后是或（∨）。括号可以覆盖这一层级关系。
For instance, in the expression ¬A ∧ B ∨ C, you first evaluate ¬A, then AND with B, and finally OR with C. Without clear parentheses, misinterpretation is easy. IB questions deliberately test precedence, so make it a habit to insert parentheses when working step by step.
例如，在表达式 ¬A ∧ B ∨ C 中，你先计算 ¬A，再与 B 进行与运算，最后与 C 进行或运算。如果没有明确的括号，很容易产生误解。IB 题目会刻意考察优先级，因此逐步运算时要养成插入括号的习惯。
6. Laws of Boolean Algebra | 布尔代数定律
A set of powerful identities allows you to manipulate and simplify Boolean expressions. The most fundamental include identity, annulment, idempotent, complement, commutative, associative, distributive, and absorption laws.
一系列强大的恒等式使你能够操作和简化布尔表达式。最基本的包括同一律、零律、幂等律、互补律、交换律、结合律、分配律和吸收律。
A ∧ 0 = 0 (Annulment) | A ∨ 1 = 1 (Annulment)
A ∧ 1 = A (Identity) | A ∨ 0 = A (Identity)
A ∧ A = A (Idempotent) | A ∨ A = A (Idempotent)
A ∧ ¬A = 0 (Complement) | A ∨ ¬A = 1 (Complement)
These laws are not just theoretical; they are the tools you will use to reduce a tangled expression into its simplest form. Memorising them and, more importantly, learning to recognise patterns where they apply, is essential for high marks on simplification questions.
这些定律不仅是理论，也是你用来将复杂表达式化简为最简形式的工具。记住它们，更重要的是学会识别适用这些定律的模式，对于在简化题中取得高分至关重要。
7. De Morgan’s Theorems | 德摩根定理
De Morgan’s two theorems show how to break the negation of an AND into an OR of negations, and vice versa. They are indispensable for converting between gate types and for simplifying circuits.
德摩根的两条定理展示了如何将“与”的否定拆分为否定的“或”，反之亦然。它们在门类型转换和电路简化中不可或缺。
¬(A ∧ B) = ¬A ∨ ¬B
¬(A ∨ B) = ¬A ∧ ¬B
In practice, these theorems let you replace an AND-NOT combination with a NOR gate, or an OR-NOT combination with a NAND gate. IB exam questions often ask you to prove a simplification using De Morgan, or to draw a circuit using only NAND gates after applying these rules.
在实践中，这些定理让你可以用或非门替代与-非组合，或用与非门替代或-非组合。IB 考题常要求你使用德摩根证明某个简化结果，或应用这些规则后仅用与非门绘制电路。
8. Simplification Using Boolean Laws | 使用布尔定律化简
Simplification reduces the number of gates and inputs in a circuit, making it cheaper, faster, and less power-hungry. The approach is to apply Boolean laws strategically. Consider the expression F = A ∧ B ∨ A ∧ ¬B. By factoring out A, we get A ∧ (B ∨ ¬B) = A ∧ 1 = A.
简化能减少电路中的门和输入数量，使其更便宜、更快且功耗更低。方法是策略性地应用布尔定律。考虑表达式 F = A ∧ B ∨ A ∧ ¬B。通过提取公因子 A，我们得到 A ∧ (B ∨ ¬B) = A ∧ 1 = A。
Always look for opportunities to apply the complement and absorption laws. Absorption, in particular, is a common time-saver: A ∧ (A ∨ B) = A and A ∨ (A ∧ B) = A. Practice with past paper questions is the best way to develop a feel for which law to use next.
始终寻找应用互补律和吸收律的机会。特别是吸收律，常能节省时间：A ∧ (A ∨ B) = A，A ∨ (A ∧ B) = A。通过练习历年真题，是培养接下来该用哪条定律的最佳方法。
9. Karnaugh Maps (K-maps) | 卡诺图
A Karnaugh map is a visual tool for simplifying Boolean expressions, especially for three or four variables. It rearranges the truth table into a grid where adjacent cells differ by only one variable, allowing you to circle groups of 1s and read off the simplified product terms.
卡诺图是一种用于简化布尔表达式的可视化工具，尤其适用于三变量或四变量。它将真值表重新排列成一个网格，相邻单元仅有一个变量不同，让你可以圈出 1 的群组，并读出简化的乘积项。
For three variables A, B, C (with A as the MSB), the map layout is:
| B’C’ | B’C | BC | BC’ | |
| A’ | 0 | 1 | 3 | 2 |
| A | 4 | 5 | 7 | 6 |
You fill the map with 1s according to the function, then group adjacent 1s in powers of two (1,2,4,8). Each group yields a term where variables that change are eliminated. The final expression is the OR of all group terms.
根据函数在图中填入 1，然后以 2 的幂次（1、2、4、8）将相邻的 1 分组。每个组得出一个项，其中发生变化的变量被消除。最终表达式是所有组项的或运算。
K-maps appear in Paper 2 and are highly efficient for four-variable functions where algebraic simplification would be extremely tedious. Practice drawing the mirror-indexed grids and correctly circling wraparound groups across edges.
卡诺图出现在试卷 2 中，对于四变量函数非常高效，而代数化简则会极其繁琐。练习绘制镜像索引的网格，并正确圈出跨越边界的环绕组。
10. Converting Between Gates, Expressions, and Truth Tables | 门、表达式和真值表之间的转换
IB exams frequently ask you to move flexibly from one representation to another. Given a circuit diagram, you must derive its Boolean expression and truth table. Conversely, given an expression like ¬(A ∧ B) ∨ C, you should draw the corresponding logic diagram using standard gate symbols.
IB 考试经常要求你在不同表示方式之间灵活转换。给定一个电路图，你必须推导出其布尔表达式和真值表。反之，给定一个如 ¬(A ∧ B) ∨ C 的表达式，你应该使用标准门符号画出相应的逻辑图。
The process is systematic: label all interim wires, write the sub-expression for each gate output, and combine them following the circuit structure. When converting an expression to a truth table, evaluate the expression for every input row in order. Double-check boundary cases where an input change flips the output—these are often where careless errors occur.
这个过程是系统的：标注所有中间连线，为每个门输出写出子表达式，并按照电路结构将它们组合。将表达式转换为真值表时，按顺序评估每一输入行的表达式。仔细检查输入变化导致输出翻转的边界情况——这往往是粗心错误的发生点。
11. NAND and NOR as Universal Gates | 作为通用门的与非和或非门
A universal gate is one that can implement any Boolean function without needing any other gate type. Both NAND and NOR possess this property. A NAND gate is an AND followed by a NOT: ¬(A ∧ B). A NOR gate is an OR followed by a NOT: ¬(A ∨ B).
通用门是指可以仅靠自己实现任何布尔函数，而无需任何其他类型门的门。与非门和或非门都具备此性质。与非门是与门后接一个非门：¬(A ∧ B)。或非门是或门后接一个非门：¬(A ∨ B)。
To prove universality, show that you can construct NOT, AND, and OR using only NAND (or only NOR). For NAND: NOT A = A NAND A; A AND B = NOT (A NAND B); A OR B = (NOT A) NAND (NOT B). Exactly the same reasoning applies with NOR. In the IB syllabus, you are expected to understand this concept and apply it to simplify real-world chip design.
要证明通用性，需展示你只能使用与非门（或仅或非门）构建出非、与和或。对于与非门：非 A = A NAND A；与 B = NOT (A NAND B)；或 B = (NOT A) NAND (NOT B)。或非门同理。在 IB 大纲中，你需要理解这一概念，并将其应用于简化实际的芯片设计。
12. Exam Tips and Common Pitfalls | 考试技巧与常见陷阱
Boolean algebra questions reward precision and methodical working. Always show intermediate steps when simplifying—exam marks are awarded for the process, not just the final answer. If a simplification leads to a surprising result, test it with a truth table to be sure.
布尔代数题目看重精确和有条理的计算过程。化简时务必展示中间步骤——考试会给过程打分，而不仅仅是最终答案。如果化简得到一个令人意外的结果，请用真值表测试以确认。
Common pitfalls include forgetting operator precedence, mishandling double negations (¬¬A = A), and incorrectly applying De Morgan by missing a negation sign. When drawing K-maps, always remember the Gray-code ordering of rows and columns. And when a question asks for a circuit using only NAND gates, don’t mix in other gates unless you first convert them.
常见陷阱包括：忘记运算符优先级、错误处理双重否定（¬¬A = A）、以及因遗漏一个否定符号而错误应用德摩根。绘制卡诺图时，务必记住行和列的格雷码顺序。当题目要求仅使用与非门绘制电路时，不要混入其他门，除非先将其转换。
Finally, practise under timed conditions with past papers from multiple sessions. The more you train your eye to spot factorisable terms and redundant groups, the faster and more accurately you will navigate the exam.
最后，在多套历年真题下进行限时练习。你训练得越多，越能一眼识别出可提取公因子的项和多余的群组，从而在考试中更快速、更准确地作答。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply