The XOR Gate

The XOR gate (pronounced "exclusive OR") is an important logic gate that appears frequently in GCSE Computer Science exams. It is similar to the OR gate but with one key difference — the output is 1 only when the inputs are different.

---

How the XOR Gate Works

XOR stands for Exclusive OR. For a two-input XOR gate:

• The output is 1 when the inputs are different (one is 0 and the other is 1).
• The output is 0 when the inputs are the same (both 0 or both 1).

The crucial difference between OR and XOR is what happens when both inputs are 1:

• OR: 1 OR 1 = 1 (at least one input is true — output is true)
• XOR: 1 XOR 1 = 0 (both inputs are the same — output is false)

---

Truth Table for XOR

Input A	Input B	Output (A ⊕ B)
0	0	0
0	1	1
1	0	1
1	1	0

The block view of the gate:

graph LR
    A((A)) --> XOR["XOR"]
    B((B)) --> XOR
    XOR --> Q((Q = A XOR B))

Compare this with the OR truth table — they are identical except for the last row. In OR, 1 and 1 gives 1. In XOR, 1 and 1 gives 0.

Exam Tip: The easiest way to remember XOR is: "the output is 1 when the inputs are DIFFERENT." If both inputs are the same (both 0 or both 1), the output is 0.

---

Logic Gate Symbol

The XOR gate symbol looks like the OR gate but with an extra curved line on the left side of the gate:

         +------\
  A ---||        \
       ||   XOR   )---- Output (A ⊕ B)
  B ---||        /
         +------/

The double curved line on the left distinguishes XOR from OR. Some exam boards show this as an OR gate with an additional arc across the inputs.

---

Boolean Expression

The Boolean expression for XOR is written as:

• A ⊕ B (using the circled plus symbol)
• A XOR B (using the English word)

XOR can also be expressed using the fundamental gates (AND, OR, NOT):

A ⊕ B = (A ∨ B) ∧ ¬(A ∧ B)

In words: "A OR B, AND NOT (A AND B)." This means: at least one input must be true, but NOT both at the same time.

An equivalent expression is:

A ⊕ B = (A ∧ ¬B) ∨ (¬A ∧ B)

In words: "A AND NOT B, OR NOT A AND B." This means: exactly one input must be true.

---

OR vs XOR — A Direct Comparison

Input A	Input B	OR (A ∨ B)	XOR (A ⊕ B)
0	0	0	0
0	1	1	1
1	0	1	1
1	1	1	0

The only difference is in the last row. OR includes the case where both inputs are true; XOR excludes it.

---

Real-World Analogies

Two-Way Light Switch

A staircase often has a light switch at the top AND at the bottom. The light changes state whenever either switch is flipped. This is XOR behaviour:

• Both switches in the same position → Light OFF
• Switches in different positions → Light ON

Switch 1	Switch 2	Light
Down (0)	Down (0)	OFF (0)
Down (0)	Up (1)	ON (1)
Up (1)	Down (0)	ON (1)
Up (1)	Up (1)	OFF (0)

Choosing One or the Other

"You can have cake OR ice cream, but not both." This is an exclusive OR — you must choose one or the other, not both together.

---

XOR in Computing

XOR has several important uses in computing:

1. Binary Addition (Half Adder)

The sum bit of binary addition follows the XOR pattern:

A	B	Sum (A ⊕ B)	Carry (A ∧ B)
0	0	0	0
0	1	1	0
1	0	1	0
1	1	0	1

A half adder circuit uses an XOR gate for the sum and an AND gate for the carry.

2. Encryption

XOR is widely used in encryption because it is easily reversible:

• If you XOR a value with a key, you get an encrypted value.
• If you XOR the encrypted value with the same key again, you get the original value back.

A ⊕ K = C (encrypt) C ⊕ K = A (decrypt)

3. Error Detection

XOR is used in parity checks — a simple form of error detection where you XOR all the bits together to get a parity bit.

---

XOR in Programming

Most programming languages do not have a dedicated XOR keyword, but it can be achieved:

Python:

a = True
b = False
result = a ^ b  # True (inputs are different)

JavaScript:

let a = true;
let b = false;
let result = a ^ b;  // 1 (true, inputs are different)

In both languages, the ^ operator performs XOR on Boolean values or integers.

---

Key Properties of XOR

• Identity element: A ⊕ 0 = A (XOR with 0 gives back the original value)
• Self-inverse: A ⊕ A = 0 (XOR a value with itself always gives 0)
• Reversible: A ⊕ B ⊕ B = A (XOR is its own inverse — used in encryption)
• Commutative: A ⊕ B = B ⊕ A (order does not matter)

---

Summary

• The XOR gate has two inputs and one output.
• The output is 1 when the inputs are different.
• The output is 0 when the inputs are the same.
• The Boolean expression is A ⊕ B.
• XOR differs from OR only when both inputs are 1 (OR gives 1; XOR gives 0).
• XOR is used in binary addition, encryption and error detection.
• The gate symbol looks like an OR gate with an extra curved line on the left.

---