■ Digital Computer & Logic
Design
Complete Notes + Logic Gate Truth Tables
Binary · Boolean Algebra · Logic Gates · K-Maps · SOP & POS
1■■ Digital Computer
A digital computer is a smart machine that only understands 0s and 1s. It takes information,
processes it using these two numbers, and gives us results.
2■■ Binary System
Binary is a way of counting using only two digits — 0 and 1. Humans count using digits 0–9, but
computers use only 0 and 1 because their switches are either:
• OFF = 0
• ON = 1
3■■ Boolean Algebra
Boolean Algebra works only with TRUE and FALSE (or 1 and 0). It uses three operations:
• AND — both must be true
• OR — at least one must be true
• NOT — inverts the value
4■■ Binary Logics (Logic Gates)
Computers make decisions using Logic Gates:
Gate Rule Example
AND Output 1 only if ALL inputs = 1 1·1=1, 1·0=0
OR Output 1 if ANY input = 1 1+0=1, 0+0=0
NOT Inverts the input NOT 1=0, NOT 0=1
NAND Opposite of AND (Universal Gate) NAND(1,1)=0
NOR Opposite of OR (Universal Gate) NOR(0,0)=1
5■■ Integrated Circuits (ICs)
An IC (microchip) contains thousands or millions of tiny components (gates, transistors). The
processor in your computer is built from many ICs.
6■■ Binary Codes
Binary codes represent letters, numbers, symbols using 0s and 1s.
• BCD — represents each decimal digit with 4 bits.
7■■ Complements
1's Complement — flip every bit
Example: 1010 → 0101
2's Complement — 1's complement + 1 (used for subtraction)
Example: 1010 → 0101 +1 = 0110
8■■ Octal & Hexadecimal Numbers
System Base Digits Purpose
Octal 8 0–7 Short form of 3-bit groups
Hexadecimal 16 0–9, A–F 8 binary bits = 2 hex digits
9■■ NAND & NOR Gates (Universal Gates)
NAND: Output 0 only when both inputs = 1; else output 1.
NOR: Output 1 only when both inputs = 0.
Called Universal Gates — any logic circuit can be built with only NAND or only NOR gates.
■ Binary Storage & Registers
Binary Storage — temporary memory for 0s and 1s during processing.
Register — the smallest, fastest storage inside the CPU, holds data currently in use.
1■■1■■ Boolean Algebra — Theorems & Properties
Law OR Form AND Form
Identity Law A + 0 = A A · 1 = A
Null Law A + 1 = 1 A · 0 = 0
Idempotent Law A + A = A A · A = A
Complement Law A + A' = 1 A · A' = 0
Commutative Law A + B = B + A A · B = B · A
Associative Law (A+B)+C = A+(B+C) (A·B)·C = A·(B·C)
Distributive Law A·(B+C) = A·B+A·C (A+B)·(A+C) = A+B·C
De Morgan's Theorems
Theorem 1: (A + B)' = A' · B'
Theorem 2: (A · B)' = A' + B'
1■■2■■ Karnaugh Map (K-Map)
K-Map is a visual grid method to simplify Boolean expressions — no need to apply algebra laws
manually. Group adjacent 1s to find the shortest expression.
1■■3■■ Two and Three Variable Maps
Two Variable Map — 2×2 grid (4 cells) for A, B
Three Variable Map — 2×4 grid (8 cells) for A, B, C
Put 1 where function is TRUE, 0 where FALSE. Group 1s in powers of 2.
1■■4■■ Four Variable Map
Most common exam map — 4×4 grid, 16 cells for A, B, C, D. Wrap-around grouping allowed.
1■■5■■ Sum of Products (SOP) Simplification
SOP = OR of AND terms. Most direct K-Map output.
Example: F = A'B + AB' + AB
• Group 1s on K-Map → each group = one AND term → OR all terms.
1■■6■■ Product of Sums (POS) Simplification
POS = AND of OR terms.
• Method 1: Group 0s on K-Map directly.
• Method 2: Get SOP first, then apply De Morgan's theorem.
Example: F = (A+B)(A'+C)(B'+C')
■ LOGIC GATE TRUTH TABLES
AND · OR · NOT · NAND · NOR · XNOR · XOR
■ AND Gate ■ OR Gate
Output = 1 only when ALL inputs = 1 Output = 1 when ANY input = 1
A B A A · B (Output) B
0 0 0 0 0
0 1 0 0 1
1 0 1 0 0
1 1 1 1 1
■ NOT Gate (Inverter) ■ NAND Gate (Universal)
Output = opposite of input (single input gate) Output = 0 only when ALL inputs = 1 (NOT AND)
A (Input) A A' (Output) B
0 0 1 0
1 0 0 1
1 0
1 1
■ NOR Gate (Universal) ■ XOR Gate (Exclusive OR)
Output = 1 only when ALL inputs = 0 (NOT OR) Output = 1 when inputs are DIFFERENT
A B A (A + B)' Output B
0 0 0 1 0
0 1 0 0 1
1 0 1 0 0
1 1 1 0 1
■ XNOR Gate (Exclusive NOR) ■ AND Gate (3 Inputs)
Output = 1 when inputs are SAME (NOT XOR) Output = 1 only when A=1, B=1, C=1
A B A A ■ B (Output)
B C
0 0 0 1 0
0 1 0 0 0
1 0 0 0 1
1 1 0 1 1
1 0
1 0
1 1
1 1
■ OR Gate (3 Inputs) ■ De Morgan Verification
Output = 1 when ANY input = 1 (A+B)' = A'·B' and (A·B)' = A'+B'
A B A C B A+B+C Output
(A+B)' A'·B'
0 0 0 0 0 0 1 1
0 0 0 1 1 1 0 0
0 1 1 0 0 1 0 0
0 1 1 1 1 1 0 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Quick Reference — All Gates at a Glance
Gate Symbol Inputs Output = 1 when… Universal?
AND A·B 2+ ALL inputs = 1 No
OR A+B 2+ ANY input = 1 No
NOT A' 1 Input = 0 No
NAND (A·B)' 2+ NOT all inputs = 1 YES
NOR (A+B)' 2+ ALL inputs = 0 YES
XOR A⊕B 2 Inputs are DIFFERENT No
XNOR A■B 2 Inputs are SAME No
Digital Computer & Logic Design Notes • Complete Edition • Green = Output 1 | Red = Output 0