GCSE Edexcel Computer Science: Logic Gates Exam Essentials | GCSE Edexcel 计算机：逻辑门考点精讲

📚 GCSE Edexcel Computer Science: Logic Gates Exam Essentials | GCSE Edexcel 计算机：逻辑门考点精讲

Logic gates are the fundamental building blocks of digital circuits. In GCSE Edexcel Computer Science, you need to understand how AND, OR, NOT, NAND, NOR, and XOR gates work, construct truth tables, analyse Boolean expressions, and combine gates to create logical functions. Mastering logic gates is essential for tackling questions on circuit design, problem‑solving, and data representation.

逻辑门是数字电路的基本构建模块。在 GCSE Edexcel 计算机科学课程中，你需要掌握与门、或门、非门、与非门、或非门和异或门的工作原理，会创建真值表、分析布尔表达式，并能够组合逻辑门实现逻辑功能。熟练掌握逻辑门是应对电路设计、解题和数据表示等考题的关键。

1. What Are Logic Gates? | 什么是逻辑门？

Logic gates are electronic switches that take one or more binary inputs and produce a single binary output. They follow the rules of Boolean logic, where inputs and outputs are represented as 0 (low voltage, false) or 1 (high voltage, true). Each gate type has a unique symbol and function, allowing engineers to build everything from simple counters to complex processors.

逻辑门是电子开关，接受一个或多个二进制输入并产生一个二进制输出。它们遵循布尔逻辑规则，输入和输出用 0（低电平，假）或 1（高电平，真）表示。每种门都有独特的符号和功能，工程师借助它们可以构建从简单计数器到复杂处理器的所有数字电路。

2. Basic Gates: AND, OR, NOT | 基本门：与门、或门、非门

AND Gate: The output Q is 1 only when all inputs are 1. For a two‑input AND gate, Q = A AND B. If either input is 0, the output becomes 0. Symbolically, the AND gate is represented by a flat‑ended D‑shaped block with two inputs on the left and one output on the right. In Boolean notation, this is often written as Q = A · B or simply A ∧ B.

与门 (AND Gate)： 只有所有输入都为 1 时输出 Q 才为 1。对于两输入与门，Q = A AND B。只要有一个输入为 0，输出就是 0。与门的电路符号是一个平头的 D 形框，左侧有两个输入，右侧一个输出。在布尔记法中通常写成 Q = A · B 或 A ∧ B。

OR Gate: The output becomes 1 if at least one input is 1. For a two‑input OR gate, Q = A OR B. It only outputs 0 when both inputs are 0. The OR gate symbol curves to a point on the left and has a rounded right side. Its Boolean expression is Q = A + B or A ∨ B.

或门 (OR Gate)： 只要至少一个输入为 1，输出就为 1。两输入或门，Q = A OR B。只有当两个输入都为 0 时输出才为 0。或门的符号左边内弯成弧形，右边为圆角。布尔表达式用 Q = A + B 或 A ∨ B 表示。

NOT Gate (Inverter): This gate has only one input and one output. It inverts the input: if A = 0, Q = 1; if A = 1, Q = 0. The symbol is a triangle with a small circle (bubble) at the output. Boolean expression: Q = ¬A or Q = A’. The NOT gate is essential for creating complement signals.

非门 (NOT Gate，反相器)： 非门只有一个输入和一个输出。它将输入取反：若 A = 0，则 Q = 1；若 A = 1，则 Q = 0。其符号是一个三角形，输出端有一个小圆圈（气泡）。布尔表达式为 Q = ¬A 或 Q = A’。非门对于产生互补信号至关重要。

3. Universal Gates: NAND and NOR | 通用门：与非门和或非门

NAND and NOR gates are called universal gates because any other logic function can be implemented using only NAND gates or only NOR gates. They are widely used in manufacturing because they are simpler to fabricate on silicon.

与非门和或非门被称为通用门，因为仅使用与非门或仅使用或非门就可以实现任何其他逻辑函数。它们在芯片制造中被广泛使用，因为在硅片上制作它们更简单。

NAND Gate: It is an AND gate followed by a NOT gate. Its output is 0 only when all inputs are 1. The symbol is the AND shape with a bubble on the output. Boolean expression: Q = ¬(A · B). Truth table example: inputs 00 → 1, 01 → 1, 10 → 1, 11 → 0.

与非门 (NAND Gate)： 相当于一个与门后接一个非门。仅在所有输入都为 1 时输出才为 0。符号是与门外形加输出端的小圆圈。布尔表达式：Q = ¬(A · B)。真值表示例：输入 00 → 1，01 → 1，10 → 1，11 → 0。

NOR Gate: An OR gate followed by a NOT gate. Output is 1 only when all inputs are 0. Symbol is the OR shape with a bubble. Boolean expression: Q = ¬(A + B). Truth table: 00 → 1, 01 → 0, 10 → 0, 11 → 0.

或非门 (NOR Gate)： 一个或门后接一个非门。仅在所有输入都为 0 时输出才为 1。符号是或门外形加输出端小圆圈。布尔表达式：Q = ¬(A + B)。真值表：00 → 1，01 → 0，10 → 0，11 → 0。

4. Exclusive OR Gate | 异或门 (XOR)

The XOR gate outputs 1 when the inputs are different. For two inputs, Q = 1 if A and B are not the same; otherwise 0. Its symbol is similar to the OR gate but with an extra curved line on the input side. Boolean expression: Q = A ⊕ B or Q = (A · ¬B) + (¬A · B). XOR is used in parity checkers and addition circuits.

异或门在输入不同时输出 1。对于两个输入，如果 A 和 B 不同则 Q = 1，否则为 0。它的符号与或门类似，但在输入侧多一条弧线。布尔表达式：Q = A ⊕ B 或 Q = (A · ¬B) + (¬A · B)。异或门用于奇偶校验和加法电路。

5. Truth Tables | 真值表

A truth table lists all possible input combinations and the corresponding output for a logic gate or circuit. For n inputs there are 2ⁿ rows. You must be able to create truth tables from a given circuit or Boolean expression, and vice versa. Below is a combined truth table for the basic two‑input gates:

真值表列出所有可能的输入组合以及逻辑门或电路的对应输出。对于 n 个输入，有 2ⁿ 行。你必须能从给定的电路或布尔表达式创建真值表，反之亦然。以下是基本两输入门的综合真值表：

A	B	AND (A·B)	OR (A+B)	NAND ¬(A·B)	NOR ¬(A+B)	XOR (A⊕B)
0	0	0	0	1	1	0
0	1	0	1	1	0	1
1	0	0	1	1	0	1
1	1	1	1	0	0	0

Exam questions often ask you to complete a truth table for a combination of gates. Always work step by step, labelling intermediate outputs before determining the final output.

考试题目常要求你补全组合逻辑门的真值表。一定要分步进行，先标出中间输出节点，再确定最终输出。

6. Boolean Expressions | 布尔表达式

A Boolean expression uses operators and variables to describe a logic circuit. In Edexcel GCSE, you may be asked to derive an expression from a circuit diagram or to draw a circuit from an expression. Expressions use AND (· or ∧), OR (+ or ∨), NOT (¬ or overbar), and XOR (⊕). Precedence rules: NOT is evaluated first, then AND, then OR. Parentheses override normal precedence.

布尔表达式使用运算符和变量来描述逻辑电路。在 Edexcel GCSE 中，你可能会被要求根据电路图推导表达式，或根据表达式画出电路图。表达式中使用 AND（· 或 ∧）、OR（+ 或 ∨）、NOT（¬ 或上划线）和 XOR（⊕）。优先级规则：先算 NOT，再算 AND，最后算 OR。括号可以改变优先级。

Example: The expression Q = (A · ¬B) + (¬A · B) directly describes an XOR gate. When simplifying expressions, look for opportunities to apply Boolean laws such as identity, annulment, idempotent, and De Morgan’s theorems.

示例：表达式 Q = (A · ¬B) + (¬A · B) 直接描述了一个异或门。在化简表达式时，可以尝试使用恒等律、零一律、幂等律和德摩根定理等布尔代数定律。

7. Combining Logic Gates | 组合逻辑门

Real‑world circuits typically combine several gates. You may be given a logic diagram and asked to produce the truth table or Boolean expression. Start by identifying each gate’s operation. For a circuit with inputs A and B feeding an AND gate whose output goes to a NOT gate, the overall function is Q = ¬(A · B), i.e. a NAND gate.

实际电路通常会组合多个逻辑门。你可能会遇到给出逻辑图，要求写出真值表或布尔表达式的题目。先从识别每个门的运算入手。例如，A 和 B 输入一个与门，其输出再经过一个非门，整体功能就是 Q = ¬(A · B)，也就是一个与非门。

When analysing multi‑level circuits, write the expression for each internal wire. For instance, a circuit with an OR gate taking A and B, and its output ANDed with C, yields Q = (A + B) · C. Always double‑check your evaluation by plugging sample values into both the diagram and your expression.

分析多级电路时，为每一根内部连线写出表达式。例如，一个或门输入为 A 和 B，其输出再与 C 进行 AND 运算，最终 Q = (A + B) · C。务必代入几组样例值同时验证电路图和你的表达式，确保正确。

8. Applications and Exam Tips | 应用与考试技巧

Logic gates underpin the operation of adders, multiplexers, and flip‑flops. In the GCSE specification, you may be asked to design a simple logic system, such as a half adder: Sum = A ⊕ B, Carry = A · B. These two functions are wired together to add two binary digits.

逻辑门是加法器、多路复用器和触发器等电路的基础。在 GCSE 考纲中，你可能会被要求设计一个简单的逻辑系统，例如半加器：Sum = A ⊕ B，Carry = A · B。将这两个功能电路组合起来就能完成两个二进制位的加法。

Exam tips:

Always draw logic diagrams neatly; label all gates and connections. In Edexcel papers, symbols must follow the convention (D‑shaped AND, curved OR, triangle with bubble for NOT).

始终整洁地绘制逻辑图；标注所有门和连线。在 Edexcel 试卷中，必须使用规定的符号（D 形与门、弧形或门、三角形加小圆圈的非门）。
When constructing a truth table from a circuit, list inputs in binary counting order. Work left to right through the circuit.

根据电路构建真值表时，按二进制递增顺序列出输入组合，并从左到右逐级分析电路。
Use Boolean algebra to simplify expressions when asked, but if no simplification is required, a direct transliterate of the circuit is acceptable.

当题目要求化简表达式时，运用布尔代数；如果没有化简要求，直接将电路翻译成表达式亦可。
Watch out for ‘unused’ input configurations in problem‑solving questions – they often lead to errors if you assume all combinations appear.

注意解题题中可能出现的“未使用”输入组合 – 如果假设所有组合都会出现，容易出错。
Remember that NAND and NOR are universal; you can use this knowledge to convert any gate network into one using only NANDs, which sometimes simplifies chip design questions.

记住 NAND 和 NOR 是通用门，你可以利用这一知识将任何门网络转换为仅用 NAND 的电路，这有时可以简化芯片设计类题目。

By focusing on clear truth tables, careful circuit analysis, and systematic expression writing, you can secure full marks on logic gate questions in your GCSE Edexcel Computer Science exam.

通过注重清晰的真题表、细致的电路分析和有条理的表达式书写，你就能在 GCSE Edexcel 计算机科学考试中稳拿逻辑门相关题目的满分。

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

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

GCSE Edexcel Computer Science: Logic Gates Exam Essentials | GCSE Edexcel 计算机：逻辑门考点精讲