Boolean Logic and Logic Gates

**1. Digital Logic — The Language Computers Actually Speak**

Every computer, from the traffic light controllers on Karachi's II Chundrigar Road to SUPARCO's satellite systems, thinks in binary — just 1s and 0s. Boolean logic is the mathematics of these binary decisions.

George Boole (1815-1864) invented this system. Every digital circuit in every device uses Boolean logic — it is the foundation of computing.

Boolean values: TRUE (1) or FALSE (0). That's it. Every complex computation — from rendering a PSL live stream to processing a JazzCash transaction — breaks down into millions of simple TRUE/FALSE decisions.

**2. The Basic Logic Gates**

A logic gate takes one or more binary inputs and produces one binary output.

NOT gate (inverter):

• 1 input, 1 output
• Flips the input: 0→1, 1→0
• Expression: `Q = NOT A` or `Q = Ā`

| A | Q |

|---|---|

| 0 | 1 |

| 1 | 0 |

AND gate:

• 2+ inputs, 1 output
• Output is 1 ONLY when ALL inputs are 1
• Expression: `Q = A AND B`
• Think: "You need your CNIC AND your photo AND your fingerprint to get a passport"

| A | B | Q |

|---|---|---|

| 0 | 0 | 0 |

| 0 | 1 | 0 |

| 1 | 0 | 0 |

| 1 | 1 | 1 |

OR gate:

• 2+ inputs, 1 output
• Output is 1 when ANY input is 1
• Expression: `Q = A OR B`
• Think: "You can pay with cash OR JazzCash OR card — any one works"

| A | B | Q |

|---|---|---|

| 0 | 0 | 0 |

| 0 | 1 | 1 |

| 1 | 0 | 1 |

| 1 | 1 | 1 |

**3. Combined Gates**

NAND gate (NOT AND):

• Output is the opposite of AND
• `Q = NOT (A AND B)`
• Output is 0 ONLY when both inputs are 1

NOR gate (NOT OR):

• Output is the opposite of OR
• `Q = NOT (A OR B)`
• Output is 1 ONLY when both inputs are 0

XOR gate (Exclusive OR):

• Output is 1 when inputs are DIFFERENT
• `Q = A XOR B`
• Think: "Either biryani OR nihari, but not both — exclusive choice"

| A | B | XOR |

|---|---|---|

| 0 | 0 | 0 |

| 0 | 1 | 1 |

| 1 | 0 | 1 |

| 1 | 1 | 0 |

**4. Building Logic Circuits**

Logic gates combine to make useful circuits. To solve a logic circuit problem:

1. Identify all gates and their connections
2. Work from inputs to output, calculating intermediate values
3. Build the truth table row by row for all input combinations

Example: A burglar alarm system. Sensor A detects door open, Sensor B detects window open. Alarm should ring if EITHER is triggered AND the system is armed (C = 1).

Circuit: `Q = (A OR B) AND C`

If door opens (A=1) while system armed (C=1): (1 OR 0) AND 1 = 1 AND 1 = 1 → alarm rings.

Writing Boolean expressions from circuits:

• Read the circuit diagram left to right
• Note each gate's operation
• Combine into a single expression
• Simplify if possible

**5. Exam Strategy**

• Always draw truth tables with ALL possible input combinations (2 inputs = 4 rows, 3 inputs = 8 rows).
• For 3-input tables: list inputs systematically (000, 001, 010, 011, 100, 101, 110, 111).
• Work through combined circuits step by step — label intermediate outputs.
• Recognise gate symbols instantly — practise drawing them from memory.
• XOR is the one students forget — "different = 1, same = 0".
• NAND is called the "universal gate" because you can build ANY other gate from just NAND gates.