📚 GCSE Computer Science: Boolean Algebra Key Points | GCSE 计算机：布尔代数 考点精讲
Boolean algebra is a fundamental pillar of computer science, forming the basis of all digital circuits and programming logic. In GCSE Computer Science, mastering Boolean algebra means understanding logic gates, truth tables, Boolean expressions, simplification techniques, and how these concepts link to the hardware and software that power our digital world. This revision guide walks you through every essential topic with clear explanations in both English and Chinese, ensuring you are fully prepared for your examinations.
布尔代数是计算机科学的基石，构成了所有数字电路和编程逻辑的基础。在 GCSE 计算机课程中，掌握布尔代数意味着要理解逻辑门、真值表、布尔表达式、化简技巧，以及这些概念如何与我们数字世界中的硬件和软件联系起来。本复习指南以清晰的中英文对照讲解每一个核心主题，助你为考试做好充分准备。
1. Introduction to Boolean Algebra | 布尔代数简介
Boolean algebra operates on binary variables that can only take two values: TRUE (1) or FALSE (0). It was introduced by George Boole in the 19th century and is now used universally in electronics and computer systems to describe logical relationships between inputs and outputs. All digital devices, from simple calculators to complex CPUs, rely on Boolean logic at their very core.
布尔代数处理的变量只能取两个值：真 (1) 或 假 (0)。它由乔治·布尔在19世纪提出，如今被广泛用于电子学和计算机系统中，以描述输入和输出之间的逻辑关系。从简单的计算器到复杂的中央处理器，所有数字设备本质上都依赖于布尔逻辑。
In a typical logic problem, you are given a set of inputs, and a Boolean expression determines the output. The three basic operations are AND, OR, and NOT, and from these, more complex functions can be built. Understanding how to combine these operations is the first step towards mastering circuit design and simplification.
在一个典型的逻辑问题中，给出一组输入，布尔表达式则决定了输出。三种基本的运算是与 (AND)、或 (OR) 和非 (NOT)，由此可以构建更复杂的函数。理解如何组合这些运算是掌握电路设计和表达式化简的第一步。
2. Basic Logic Gates | 基本逻辑门
AND gate: ly, Q = A AND B or Q = A · B. In a two-input AND gate, if A=1 and B=1, Q=1; otherwise Q=0.
与门：只有当所有输入都为真时，输出才为真。符号表示为 Q = A AND B 或 Q = A · B。对于二输入与门，如果 A=1且B=1，则Q=1；否则Q=0。
OR gate: : The output is TRUE if at least one input is TRUE. Symbolically, Q = A OR B or Q = A + B. Any 1 gives Q=1; only 0+0 yields 0.
或门：只要至少有一个输入为真，输出就为真。符号表示 Q = A OR B 或 Q = A + B。只要输入中有1，Q=1；只有0+0才得到0。
NOT gate: put. If A=1, Q=0; if A=0, Q=1. It is written as Q = NOT A, often denoted by a bar over A (Ā) or a prime (A').
非门：这是一个单输入的门，用于反转输入。如果A=1，Q=0；如果A=0，Q=1。写作 Q = NOT A，常用字母上方的横线 (Ā) 或一撇 (A') 表示。
These three gates form a functionally complete set, meaning any Boolean function can be implemented using only AND, OR and NOT gates. In GCSE exams, you may also see NAND (NOT AND) and NOR (NOT OR) gates, which are the inverse of AND and OR respectively. NAND and NOR are called universal gates because each can be used to create all other gate types.
这三种门组成了一个功能完备集，意味着任何布尔函数都可以仅用与门、或门和非门来实现。在 GCSE 考试中，你可能还会看到与非门 (NAND) 和或非门 (NOR)，它们分别是与门和或门的反向输出。NAND 和 NOR 被称为通用门，因为每一种都可以用来实现所有其他类型的门。
3. Truth Tables | 真值表
A truth table lists every possible combination of input values and shows the corresponding output for a given Boolean function. For a circuit with n inputs, there are 2ⁿ rows. Each row represents a unique binary pattern. Truth tables provide a systematic way to verify the behaviour of logic circuits and to derive Boolean expressions.
真值表列出了输入值的所有可能组合，并展示给定布尔函数对应的输出。对于一个有 n 个输入的电路，会有 2ⁿ 行。每一行代表一个唯一的二进制模式。真值表提供了一种系统化的方法来验证逻辑电路的行为，并推导布尔表达式。
For example, the truth table for Q = (A AND B) OR (NOT A) is:
例如，表达式 Q = (A AND B) OR (NOT A) 的真值表为：
| A | B | NOT A | A AND B | Q |
|---|---|---|---|---|
| 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 |
Learning to read and construct truth tables quickly is essential for the exam. When given a circuit diagram or an expression, you can fill intermediate columns step by step until you obtain the final output column. This method reduces the chance of making careless errors.
学会快速阅读和构建真值表对考试至关重要。给定一个电路图或一个表达式，你可以逐步填写中间列，直到得到最终的输出列。这种方法可以减少粗心出错的可能。
4. Boolean Expressions | 布尔表达式
A Boolean expression uses variables, operators and parentheses to describe a logical function. In GCSE notation, the AND operation is often represented by a dot (·) or simply by writing the variables next to each other (AB means A AND B). The OR operation uses a plus sign (+), and the NOT operation uses a prime (') or an overbar. Parentheses indicate the order of evaluation, just as in ordinary algebra.
布尔表达式使用变量、运算符和括号来描述逻辑功能。在 GCSE 的记法中，与运算通常用点号 (·) 表示，或者简单地把变量并列书写（AB 表示 A AND B）。或运算使用加号 (+)，非运算使用一撇 (') 或上横线。括号标明了求值顺序，就像在普通代数中一样。
re not the same as numeric arithmetic. For instance, 1 + 1 = 1 in Boolean algebra, because 'OR' puts still yields TRUE. The expression A+AB is not read as addition but as A OR (A AND B).
务必记住，布尔加法和乘法与数值算术不同。例如，在布尔代数中 1 + 1 = 1，因为两个真输入的“或”运算结果仍为真。表达式 A+AB 不是读作加法，而是读作 A OR (A AND B)。
e sum-of-products (SOP), where several AND terms are ORed together, for example Q = AB + A'C. You may also see product-of-sums (POS), but SOP is more frequent at GCSE.
你会遇到的常见表达式类型包括与或式 (SOP)，也就是几个与项通过或运算连接在一起，例如 Q = AB + A'C。你也可能见到或与式 (POS)，但 SOP 在 GCSE 中更为常见。
5. Drawing Logic Circuits from Expressions | 根据表达式绘制逻辑电路
Given a Boolean expression, you must be able to draw the corresponding logic circuit diagram. Work from the innermost operations outward. First identify all NOT operations applied directly to variables; then handle AND operations, and finally OR everything together. Use standard gate symbols as shown in your specification.
给出一个布尔表达式，你必须能够画出对应的逻辑电路图。要从最内层的运算开始，逐步向外。首先找出所有直接应用于变量的非运算；然后处理与运算；最后把所有项用或运算连接起来。使用考纲中规定的标准门符号。
For example, for Q = (A' the two AND outputs. Label all intermediate wires clearly if required by your exam board.
例如，对于 Q = (A' AND B) OR (A AND C)，你需要画一个非门作用于 A，然后与 B 一起输入到一个与门；A 和 C 直接输入到另一个与门；最后用一个或门将两个与门的输出组合起来。如果考试局要求，请清楚地标出所有中间连线。
Some questions will ask you to realise circuits using only NAND or only NOR gates. This requires you to convert the expression using double negation and De Morgan's laws. Practising these conversions will save you time in the exam.
有些题目会要求你仅用与非门或仅用或非门来实现电路。这就需要你利用双重否定和德摩根定律来转换表达式。多加练习这些转换，可以在考试中为你节省时间。
6. Boolean Laws and Simplification | 布尔定律与化简
Simplifying a Boolean expression reduces the number of gates needed, which in turn lowers cost and power consumption. The main laws you need to know for GCSE are:
化简布尔表达式可以减少所需门的数量，从而降低成本和功耗。GCSE 需要掌握的主要定律有：
- Annulment Law (零律): A·0 = 0, A+1 = 1
中文：A与0得0，A或1得1。 - Identity Law (恒等律): A·1 = A, A+0 = A
中文：A与1得A，A或0得A。 - Idempotent Law (幂等律): A·A = A, A+A = A
中文：A与A得A，A或A得A。 - Complement Law (互补律): A·A' = 0, A+A' = 1
中文：A与A非得0，A或A非得1。 - Commutative Law (交换律): A·B = B·A, A+B = B+A
中文：A与B等于B与A，A或B等于B或A。 - Associative Law (结合律): (A·B)·C = A·(B·C), (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, 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, A·(A+B) = A
中文：A或(A与B)等于A；A与(A或B)等于A。
tributive law, then look for terms that can be combined or eliminated. As an example, Q = A + A'B can be simplified to Q = A + B using the law A + A'B = A + B (a frequently tested reduction).
系统地应用这些定律，可以把复杂的表达式化简为最简形式。先用分配律展开括号，然后寻找可以合并或消去的项。例如，Q = A + A'B 可以利用 A + A'B = A + B 化简（这是一条常考的化简公式）。
7. De Morgan's Laws | 德摩根定律
De Morgan's laws are two transformation rules that are essential for simplifying expressions involving negated groups. They state:
德摩根定律是两条转换规则，对于化简包含取反括号的表达式至关重要。定律陈述如下：
(A + B)' = A' · B'
(A · B)' = A' + B'
In words, the complement of an OR is the AND of the complements, and the complement of an AND is the OR of the complements. These laws allow you to break a negation bar across multiple variables.
通俗地讲，或运算的取反等于各变量取反后的与运算；与运算的取反等于各变量取反后的或运算。这些定律让你能够把一长条取反横线分配到多个变量上。
De Morgan's laws are particularly useful when you need to implement a circuit using only NAND or NOR gates, because they help you convert between gate types. For instance, an OR gate with inverted inputs is equivalent to a NAND gate followed by a NOT (which is just an AND). Knowing this equivalence is a common GCSE question.
当你需要用与非门或或非门来实现电路时，德摩根定律尤其有用，因为它们有助于在不同门类型之间进行转换。例如，把两个输入都取反后再输入到或门，等效于一个与非门再加一个非门（其实就是与门）。理解这种等价性是 GCSE 的常见考点。
8. Simplifying Boolean Expressions (Examples) | 简化布尔表达式示例
Let's work through a typical exam simplification step by step. Simplify Q = AB + AB' + A'B.
我们来逐步完成一个典型的考试化简题。化简 Q = AB + AB' + A'B。
Step 1: Notice the first two terms share A: AB + AB' = A(B + B') = A(1) = A, because B + B' = 1.
第一步：注意到前两项有公因子 A：AB + AB' = A(B + B') = A(1) = A，因为 B + B' = 1。
Step 2: Now Q becomes A + A'B. Using the coverage rule A + A'B = A + B.
第二步：此时 Q 变为 A + A'B。利用吸收律 A + A'B = A + B。
A + B. We have reduced three AND terms down to a single OR. This simplification can be verified by constructing a truth table for the original and final expressions; they must be identical.
这样化简后的表达式为 Q = A + B。我们把三个与项化简为一个简单的或运算。可以通过为原表达式和最终表达式构建真值表来验证这个化简——它们必须完全相同。
Another common simplification involves applying De Morgan: simplify Q = (A' + B)' + A. First, (A' + B)' = A · B' (by De Morgan). Then Q = AB' + A = A + AB' = A (since A + AB' = A by absorption).
另一个常见的化简涉及德摩根定律：化简 Q = (A' + B)' + A。首先，(A' + B)' = A · B'（根据德摩根）。然后 Q = AB' + A = A + AB' = A（因为 A + AB' = A，吸收律）。
When simplifying, always double-check your use of laws, especially that you have not confused AND with OR. Practising past paper questions is the most effective way to build speed and accuracy.
化简时一定要反复检查定律的使用是否正确，尤其要区分与运算和或运算。练习历年真题是提升速度和准确率的最有效方法。
9. XOR and XNOR Gates | 异或门与同或门
The XOR (exclusive OR) gate gives an output of TRUE when the inputs are different. For two inputs, Q = A ⊕ B. Its truth table is: 0⊕0=0, 0⊕1=1, 1⊕0=1, 1⊕1=0. The XOR function can be expressed using basic gates as Q = A'B + AB'.
异或门 (XOR) 在输入不同时输出为真。对于两个输入，Q = A ⊕ B。其真值表为：0⊕0=0, 0⊕1=1, 1⊕0=1, 1⊕1=0。异或功能可以用基本门表示为 Q = A'B + AB'。
The XNOR (exclusive NOR) e complement of XOR; its output is TRUE when the inputs are equal. It is written as Q = (A ⊕ B)' or Q = A ⊙ B. Using basic gates, Q = AB + A'B'. XNOR is often used in equality comparators.
同或门 (XNOR) 是异或门的取反；当输入相等时输出为真。写作 Q = (A ⊕ B)' 或 Q = A ⊙ B。用基本门表示为 Q = AB + A'B'。同或门常用于等值比较器中。
At GCSE, you may be asked to recognise these gates from their symbols, complete truth tables, or derive their Boolean expressions. Understanding how XOR and XNOR relate to basic gates will help you tackle questions on adder circuits and parity checkers.
在 GCSE 考试中，你可能会遇到识别这些门的符号、填写真值表或推导其布尔表达式的题目。理解 XOR 和 XNOR 与基本门的关系将有助于你解决加法器电路和奇偶校验器相关的问题。
10. Common Exam Pitfalls | 常见考试陷阱
OR, unless parentheses indicate otherwise. For instance, Q = A + B · C is evaluated as A + (B·C), not (A+B)·C. Always insert implied parentheses when interpreting an expression.
最常见的错误之一就是弄错运算优先级。在布尔代数中，非运算优先级最高，其次是与运算，最后是或运算，除非括号另有指示。例如，Q = A + B · C 的求值相当于 A + (B·C)，而不是 (A+B)·C。解读表达式时，一定要补上隐含的括号。
Another pitfall is misapplying De Morgan' the bar, the AND must become OR and vice versa. Also, be careful with double negations: A'' = A. However, (A')' is not the same as A' without the brackets – write carefully.
另一个陷阱是误用德摩根定律，尤其是忘记更换运算符。去掉取反横线时，与必须变为或，反之亦然。此外，要小心双重否定：A'' = A。但是，(A')' 和没有括号的 A' 并不相同——书写时要仔细。
When drawing circuits, students sometimes connect a gate's output to the input of a previous gate incorrectly or miss a NOT bubble on a NAND/NOR symbol. Practice drawing from expressions and double-check the correspondence between expression and circuit. A truth table comparison can confirm correctness.
在绘制电路图时，学生有时会错误地将门的输出连接到前一门的输入，或者漏掉 NAND/NOR 符号上的取反小圆圈。多练习根据表达式绘制电路，并仔细核对表达式与电路的对应关系。通过真值表对比可以验证正确性。
By being aware of these common errors and practising systematically, you can approach Boolean algebra questions with confidence and pick up full marks in your GCSE Computer Science exam.
意识到这些常见错误并通过系统化的练习，你就可以自信地应对布尔代数题目，在 GCSE 计算机科学考试中拿下满分。
Published by TutorHao | 计算机 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图