📚 Boolean Algebra for IGCSE OCR Computer Science | IGCSE OCR 计算机布尔代数考点精讲
Boolean algebra forms the mathematical backbone of digital logic. In the IGCSE OCR Computer Science syllabus, understanding how to represent, manipulate and simplify logical expressions is essential for both the theory paper and practical problem‑solving. This article covers all key concepts you need, from basic logic gates to Karnaugh maps, with clear worked examples.
布尔代数是数字逻辑的数学基础。在 IGCSE OCR 计算机科学课程中，理解如何表示、操作和化简逻辑表达式对于理论考试和实践解题都至关重要。本文涵盖你需要掌握的所有核心概念，从基本逻辑门到卡诺图，并配有清晰的例题。
1. What is Boolean Algebra? | 什么是布尔代数？
Boolean algebra is a branch of algebra where variables can only have two values: true (1) or false (0). It uses operators such as AND, OR and NOT to build logical expressions that model digital circuits.
布尔代数是代数学的一个分支，其中变量只能取两个值：真 (1) 或假 (0)。它使用 AND、OR 和 NOT 等运算符来构建逻辑表达式，用于模拟数字电路。
In OCR exams, you will work with Boolean variables (A, B, C) and construct expressions like A AND (B OR NOT C). The order of operations and the laws that govern simplification are key topics.
在 OCR 考试中，你将使用布尔变量（A、B、C）并构建诸如 A AND (B OR NOT C) 之类的表达式。运算优先级和用于化简的定律是核心考点。
2. Basic Logic Gates and Truth Tables | 基本逻辑门与真值表
The three fundamental logic gates are AND, OR and NOT. An AND gate outputs 1 only if all inputs are 1; an OR gate outputs 1 if at least one input is 1; a NOT gate inverts the input.
三种基本逻辑门是 AND、OR 和 NOT。AND 门仅当所有输入为 1 时输出 1；OR 门只要至少有一个输入为 1 则输出 1；NOT 门对输入取反。
| Gate | Symbol | Truth Table (A, B → Output) |
|---|---|---|
| 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̅ or ¬A | A=0 → 1; A=1 → 0 |
You should be able to draw a truth table for any given expression. List all input combinations, evaluate sub‑expressions step by step, and then find the final output column.
你应该能够为任意给定表达式绘制真值表。列出所有输入组合，逐步求解子表达式，然后找出最终的输出列。
3. Boolean Expression Notation | 布尔表达式表示法
OCR uses both symbolic notation (A ∧ B for AND, A ∨ B for OR, ¬A for NOT) and algebraic notation (A·B, A+B, A̅). Be comfortable with both.
OCR 同时使用符号表示法（A ∧ B 表示 AND，A ∨ B 表示 OR，¬A 表示 NOT）和代数表示法（A·B, A+B, A̅）。你需要熟练掌握两者。
An expression like (A ∨ B) ∧ ¬C can also be written as (A+B) · C̅. Parentheses dictate evaluation order: NOT first, then AND, then OR, unless brackets override.
像 (A ∨ B) ∧ ¬C 这样的表达式也可以写作 (A+B) · C̅。括号决定求值顺序：先 NOT，再 AND，最后 OR，除非括号改变了优先级。
4. Laws of Boolean Algebra | 布尔代数定律
The core laws allow you to simplify logical circuits. The most important are:
核心定律用于化简逻辑电路。最重要的是：
- Identity Law: A+0 = A, A·1 = A
- Null Law: A+1 = 1, A·0 = 0
- Idempotent Law: A+A = A, A·A = A
- Inverse Law: A + A̅ = 1, A · A̅ = 0
- Double Negation: A̅ = A
这些定律在考试中经常被直接考查，用于证明两个表达式是否等价。
These laws are often tested directly, to prove whether two expressions are equivalent.
5. Commutative, Associative and Distributive Laws | 交换律、结合律和分配律
These laws help reorder and regroup terms without changing the logic:
这些定律用于在不改变逻辑的情况下重新排序和组合项：
- Commutative: A+B = B+A ; A·B = B·A
- Associative: (A+B)+C = A+(B+C) ; (A·B)·C = A·(B·C)
- Distributive: A·(B+C) = A·B + A·C ; A+(B·C) = (A+B)·(A+C)
Notice that in Boolean algebra, AND distributes over OR and OR distributes over AND. This is different from ordinary algebra, so be careful.
注意，在布尔代数中，AND 对 OR 可分配，同时 OR 对 AND 也可分配。这与普通代数不同，务必小心。
6. De Morgan’s Laws | 德摩根定律
De Morgan’s laws are crucial for transforming expressions, especially when moving negations inward or changing ANDs to ORs and vice versa.
德摩根定律对于变换表达式至关重要，尤其是在将非号向内移动或将 AND 变为 OR（反之亦然）时。
The two laws are:
这两个定律是：
¬(A · B) = ¬A + ¬B
¬(A + B) = ¬A · ¬B
In words: the complement of a product is the sum of complements; the complement of a sum is the product of complements.
也就是说：与运算的补是各项取补后的或；或运算的补是各项取补后的与。
In OCR problems, you may need to simplify a circuit using De Morgan’s laws, e.g. A+B can be replaced by ¬(¬A · ¬B) in NAND‑only implementations.
在 OCR 的题目中，你可能需要用德摩根定律化简电路，例如在纯 NAND 门实现中可以将 A+B 替换为 ¬(¬A · ¬B)。
7. Simplifying Boolean Expressions | 化简布尔表达式
Simplification reduces the number of gates and inputs needed, which saves cost and power. You may be asked to simplify using laws or a Karnaugh map.
化简可以减少所需的门电路和输入数量，从而降低成本和功耗。考题可能要求运用定律或卡诺图进行化简。
Example: simplify A·B + A·B̅.
例题：化简 A·B + A·B̅。
Factor out A: A·(B + B̅) = A·1 = A. The circuit reduces from two AND gates and one OR gate to just a wire.
提取公因式 A：A·(B + B̅) = A·1 = A。电路从两个 AND 门和一个 OR 门简化为仅仅一根导线。
Always show your steps and cite the law used (e.g. ‘using the distributive law’).
始终展示你的推导步骤并注明所用的定律（例如“使用分配律”）。
8. Karnaugh Maps (K‑maps) | 卡诺图
A Karnaugh map is a visual tool for simplifying Boolean expressions of up to four variables. You place 1s in cells corresponding to minterms where the output is 1, and then group adjacent 1s in powers of two (1, 2, 4, 8).
卡诺图是一种用于化简最多四个变量布尔表达式的可视化工具。在输出为 1 的最小项对应格子中填入 1，然后将相邻的 1 按 2 的幂次（1、2、4、8）分组。
For a two‑variable K‑map, the layout is:
| A\B | 0 | 1 |
| 0 | 0 | 1 |
| 1 | 1 | 1 |
Groups of 1s give product terms. Overlapping groups are allowed. The final simplified expression is the sum of those prime implicants.
1 的分组生成乘积项，允许组与组重叠。最终的化简表达式是这些质蕴含项的和。
OCR expects you to draw and interpret a 3‑ or 4‑variable K‑map, and write the minimal SOP (Sum of Products) expression.
OCR 要求你能够绘制和解读三或四变量卡诺图，并写出最简的积之和（SOP）表达式。
9. Logic Gate Combinations and Circuit Diagrams | 逻辑门组合与电路图
You must be able to draw logic circuits from Boolean expressions and vice versa. Start from the output and work backwards, placing appropriate gates.
你必须能够根据布尔表达式绘制逻辑电路，反之亦然。从输出端开始反向构建，放置相应的门。
For example, the expression (A AND B) OR (NOT C) requires one AND gate, one NOT gate and one OR gate. Show connections clearly and label all intermediate signals.
例如，表达式 (A AND B) OR (NOT C) 需要一个 AND 门、一个 NOT 门和一个 OR 门。清晰地画出连线并标注所有中间信号。
In exam questions, you might need to complete a partially drawn circuit or identify the expression implemented by a given diagram.
在考试中，你可能需要补全部分绘制的电路图，或识别给定电路图实现的表达式。
10. NAND and NOR as Universal Gates | 作为通用门的 NAND 和 NOR
A universal gate is one that can be used to implement any Boolean function without needing any other gate type. NAND and NOR are universal gates.
通用门是指无需其他任何门类型就可以实现任意布尔函数的门。NAND 和 NOR 就是通用门。
For instance, an inverter can be made by joining the inputs of a NAND gate: A NAND A = NOT A. An AND gate is a NAND followed by a NOT (i.e. another NAND connected as inverter).
例如，将 NAND 门的输入连在一起可以构成非门：A NAND A = NOT A。AND 门可由一个 NAND 门后接一个非门（即另一个连接为非门的 NAND）实现。
In OCR papers, you may be asked to convert a circuit to all‑NAND or all‑NOR using bubble pushing and De Morgan’s laws.
在 OCR 试卷中，可能会要求你使用推气泡法和德摩根定律将电路转换为全 NAND 或全 NOR 实现。
11. Common Exam Pitfalls and Tips | 常见考试失分点与提示
One common mistake is forgetting operator precedence: NOT binds first, then AND, then OR. Use parentheses to avoid ambiguity.
一个常见错误是忘记运算符优先级：NOT 最先，然后 AND，最后 OR。使用括号以避免歧义。
Another pitfall is misapplying De Morgan’s law. Remember to change the operator and complement each variable. Also, check that your simplifications are fully reduced; sometimes a K‑map reveals a simpler form than algebraic manipulation alone.
另一个失分点是用错德摩根定律。记住要改变运算符并给每个变量取反。此外，要检查化简是否彻底；有时卡诺图能揭示比纯代数操作更简单的形式。
Clearly label truth table rows, and when drawing circuits, make sure gates are neatly drawn with straight lines. Always double‑check groups in K‑maps for adjacency (include wrap‑around).
清晰地标注真值表行，绘制电路时确保门电路整齐，连线用直线。检查卡诺图分组时务必注意邻接关系（包括两端环绕）。
12. Summary and Revision Checklist | 总结与复习清单
By now you should be confident with: basic gates and truth tables; Boolean laws and simplification; K‑maps for up to four variables; converting between expressions and circuits; and universal gates. Practice past paper questions under timed conditions to consolidate your skills.
到目前为止，你应该对以下内容充满信心：基本逻辑门和真值表；布尔定律与化简；最多四变量的卡诺图；表达式与电路的互相转换；以及通用门的使用。在限时条件下练习历年真题以巩固你的技能。
Remember that OCR often embeds Boolean algebra in larger system‑design contexts, so linking theory to practical applications will give you an edge.
请记住，OCR 经常将布尔代数嵌入到更大的系统设计背景中，因此将理论与实际应用联系起来会让你更具优势。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导