📚 GCSE OCR Computer Science: Boolean Algebra | GCSE OCR 计算机：布尔代数考点精讲
Boolean algebra is the mathematical backbone of digital logic. In GCSE OCR Computer Science, you are expected to master logic gates, truth tables, Boolean expressions, and simplification techniques. This revision guide breaks down every essential concept so you can tackle exam questions with confidence.
布尔代数是数字逻辑的数学基础。在 GCSE OCR 计算机科学中，你需要掌握逻辑门、真值表、布尔表达式以及化简技巧。本考点精讲为你分解每个重要概念，帮助你在考试中充满信心地解题。
1. Introduction to Boolean Algebra | 布尔代数简介
Boolean algebra is a branch of algebra where variables can only take the values 1 (TRUE) or 0 (FALSE). It is used to describe the behaviour of logic circuits inside computers. Every digital system, from simple calculators to powerful processors, relies on Boolean logic.
布尔代数是一个代数分支，其中的变量只能取 1（真）或 0（假）两个值。它用于描述计算机内部逻辑电路的行为。从简单的计算器到强大的处理器，每一个数字系统都依赖于布尔逻辑。
In the OCR specification, you will work with logic gates, write Boolean expressions, complete truth tables, and simplify logic statements. Understanding Boolean algebra helps you design more efficient circuits and think like a computer scientist.
在 OCR 考试大纲中，你将处理逻辑门、写出布尔表达式、填写真值表并化简逻辑陈述。理解布尔代数能帮助你设计更高效的电路，像计算机科学家一样思考。
2. Basic Logic Gates: AND, OR, NOT | 基本逻辑门：AND、OR、NOT
The three fundamental logic gates are AND, OR and NOT. An AND gate outputs 1 only when all inputs are 1. An OR gate outputs 1 if at least one input is 1. A NOT gate simply inverts its input: 0 becomes 1 and 1 becomes 0.
三种基本的逻辑门是 AND、OR 和 NOT。AND 门仅在所有输入都为 1 时输出 1。OR 门只要至少有一个输入为 1 就输出 1。NOT 门则将输入取反：0 变为 1，1 变为 0。
For the AND operation, we often use a dot: A · B. For OR we use a plus sign: A + B. The NOT operation is shown with an overbar: A. Exam questions may also use the words AND, OR and NOT.
对于 AND 运算，我们通常使用点号：A · B。对于 OR 运算使用加号：A + B。NOT 运算用上划线表示： A。考试题中也可能直接使用 AND、OR 和 NOT 词语。
3. Truth Tables | 真值表
A truth table lists every possible combination of inputs and shows the corresponding output for a logic circuit. It is the most reliable way to verify the behaviour of a Boolean expression.
真值表列出了输入的所有可能组合，并显示逻辑电路对应的输出。它是验证布尔表达式行为最可靠的方法。
For a simple AND gate with inputs A and B, the truth table is:
对于一个简单的 AND 门，输入为 A 和 B，其真值表如下：
| A | B | A · B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
When building a truth table for a larger circuit, count the number of inputs (n) and create 2ⁿ rows so that all combinations are covered. Always present inputs in binary counting order to avoid mistakes.
为较复杂的电路建立真值表时，先数出输入个数（n），然后创建 2ⁿ 行以涵盖所有组合。始终按二进制计数顺序列出输入，避免出错。
4. Boolean Expressions | 布尔表达式
A Boolean expression describes the logic of a circuit using variables and operators. For example, F = A · B + C means: F is true when (A AND B) OR (NOT C) is true. Parentheses clarify the order of operations.
布尔表达式使用变量和运算符来描述电路逻辑。例如，F = A · B + C 表示：当 (A AND B) 或 (NOT C) 为真时，F 为真。括号可以明确运算顺序。
In standard Boolean algebra, AND takes precedence over OR, just as multiplication takes precedence over addition. However, it is safer to use parentheses to make the intended evaluation order clear, especially under exam pressure.
在标准布尔代数中，AND 优先于 OR，就像乘法优先于加法一样。不过，为了安全起见，最好用括号明确你想要的求值顺序，尤其是在考试时。
5. Creating Logic Circuits from Expressions | 从表达式构建逻辑电路
You can draw a logic circuit directly from a Boolean expression. Each AND operation becomes an AND gate, each OR becomes an OR gate, and every overbar represents a NOT gate. Work from the innermost parentheses outward.
你可以直接从布尔表达式绘制逻辑电路。每个 AND 运算对应一个 AND 门，每个 OR 对应一个 OR 门，每个上划线代表一个 NOT 门。从最内层括号开始，向外逐步构建。
For example, to implement F = (A + B) · C, you first feed A through a NOT gate, then combine it with B through an OR gate, and finally AND the result with C. Sketching the circuit helps you understand how computers execute logical decisions.
例如，要实现 F = (A + B) · C，首先将 A 通过 NOT 门，然后将其与 B 通过 OR 门组合，最后将结果与 C 进行 AND 运算。画出电路图有助于你理解计算机如何执行逻辑决策。
6. Boolean Laws and Identities | 布尔代数定律与恒等式
Several algebraic laws allow you to simplify Boolean expressions. The most important ones for GCSE include the identity law (A + 0 = A, A · 1 = A), the complement law (A + A = 1, A · A = 0), and the idempotent law (A + A = A, A · A = A).
有几条代数定律可以帮助你化简布尔表达式。对 GCSE 最重要的包括：恒等律（A + 0 = A，A · 1 = A）、互补律（A + A = 1，A · A = 0）和幂等律（A + A = A，A · A = A）。
You will also encounter the commutative law (A + B = B + A), the associative law (A + (B + C) = (A + B) + C) and the distributive law (A · (B + C) = A · B + A · C). These laws help you rearrange and reduce expressions without changing their truth tables.
你还会用到交换律（A + B = B + A）、结合律（A + (B + C) = (A + B) + C）和分配律（A · (B + C) = A · B + A · C）。这些定律帮助你重新整理并化简表达式，同时不改变真值表。
Key identity: A + A · B = A (absorption law)
关键恒等式：A + A · B = A（吸收律）
7. De Morgan’s Laws | 德摩根定律
De Morgan’s laws provide rules for moving negation across AND and OR operations. They are essential for simplifying complex expressions and transforming circuits.
德摩根定律给出了将否定移到 AND 和 OR 运算中的规则。它们对于化简复杂表达式和转换电路至关重要。
A · B = A + B and A + B = A · B
A · B = A + B 以及 A + B = A · B
In words: the complement of a product equals the sum of the complements; the complement of a sum equals the product of the complements. These laws are often tested by asking you to simplify an expression like A · B + C or to convert a circuit into a NAND-only implementation.
用语言表述：乘积的补等于各补的和；和的补等于各补的乘积。考试常要求你化简类似 A · B + C 的表达式，或将电路转换为只用 NAND 门实现，这时德摩根定律就派上了用场。
8. Algebraic Simplification Examples | 代数化简示例
Let’s work through a typical GCSE simplification: simplify F = A · B + A · B. Using the distributive law, factor out A: A · (B + B). Since B + B = 1, the expression becomes A · 1 = A. So, F = A.
我们来完成一个典型的 GCSE 化简题：化简 F = A · B + A · B。使用分配律，提取因子 A：A · (B + B)。由于 B + B = 1，该表达式变为 A · 1 = A。因此，F = A。
Another example: simplify F = A + A · B. Apply the absorption law directly: A at the end? No, absorption works when you have A + A · B = A. Here we have A + A · B. This doesn’t immediately fit. Instead, use the distributive law and identities: A + A · B = (A + A) · (A + B) = 1 · (A + B) = A + B. Always verify your simplification with a truth table.
另一个例子：化简 F = A + A · B。直接应用吸收律？吸收律是 A + A · B = A。但这里是 A + A · B，并不直接匹配。我们可以使用分配律和恒等式：A + A · B = (A + A) · (A + B) = 1 · (A + B) = A + B。请始终用真值表验证你的化简结果。
9. Circuit Simplification | 电路简化
Simplified expressions lead to smaller, cheaper and faster circuits. Suppose a circuit is built for F = A · B + A · B + A · B. After Boolean simplification, the expression reduces to A + B. You would then replace several AND and OR gates with a single OR gate, saving components.
化简后的表达式能使电路更小、更便宜、更快。假设某电路是按 F = A · B + A · B + A · B 构建的。经过布尔代数化简后，表达式简化为 A + B。此时你可用一个 OR 门替代好几个 AND 和 OR 门，节省元件。
The exam may present a logic diagram and ask you to write the Boolean expression, simplify it, and then redraw the simplified circuit. Always rewrite the expression clearly, label intermediate outputs, and apply the Boolean laws step by step.
考试可能会给出一个逻辑图，要求你写出布尔表达式、进行化简并重新绘制简化电路。始终清晰写下表达式，标注中间输出，并一步一步应用布尔定律。
10. Common Exam Pitfalls | 常见考试陷阱
One common mistake is forgetting that NOT has the highest priority. In an expression like A · B + C, the negation applies only to A. If you intend to negate the whole product, you must write A · B or (A · B).
一个常见错误是忘记 NOT 的优先级最高。在 A · B + C 这样的表达式中，否定只作用于 A。如果你想要否定整个乘积，就必须写作 A · B 或 (A · B)。
Another pitfall is misapplying De Morgan’s laws. Always break the negation over the whole group, swap AND and OR, and negate each variable individually. Double-check your work by building a truth table for both the original and simplified expressions.
另一个陷阱是错误运用德摩根定律。务必逐步分解：将整个括号上的取反线打破，交换 AND 和 OR，并对每个变量单独取反。通过为原表达式和化简后的表达式分别建立真值表来复查结果。
11. Practice Problems | 练习题
Try these exam-style questions:
试试这些考试风格的题目：
1. Simplified expression: Show that A · B + A · B = A. (Hint: factor out A and use complement law.)
1. 化简表达式：证明 A · B + A · B = A。（提示：提取因子 A 并利用互补律。）
2. Draw a circuit: Create a logic diagram for F = (A + B) · C and then build its truth table.
2. 绘制电路：为 F = (A + B) · C 画出逻辑图，并建立真值表。
3. De Morgan’s challenge: Simplify X · Y + Z using De Morgan’s laws so that the expression uses only NAND operations.
3. 德摩根挑战：利用德摩根定律化简 X · Y + Z，使表达式只使用 NAND 运算。
Working through these problems systematically will strengthen your Boolean algebra skills. Always show your steps to gain full marks in the exam.
有条理地完成这些练习题将巩固你的布尔代数技能。在考试中一定要展示解题步骤，以获得满分。
12. Summary | 总结
Boolean algebra is the foundation of all digital logic. Remember the basic gates, learn to read and write expressions, master truth tables, and practise simplification using algebraic laws and De Morgan’s laws. With regular practice, you will be able to handle any Boolean question in the OCR GCSE exam.
布尔代数是所有数字逻辑的基础。记住基本门电路，学会读写表达式，掌握真值表，并练习使用代数定律和德摩根定律进行化简。通过经常练习，你将能应对 OCR GCSE 考试中任何布尔代数问题。
Keep a list of key identities handy, double-check your truth tables, and always look for opportunities to reduce gates. Good luck with your revision!
准备一份关键恒等式的清单随时查阅，反复检查真值表，并始终寻找减少门电路的机会。祝你复习顺利！
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课程辅导，国外大学本科硕士研究生博士课程论文辅导