CH 3. Boolean Algebra
CH 3. Boolean Algebra
1. AND Gate (A · B)
2. OR Gate (A + B)
3. NOT Gate (A’ or A̅ )
4. Derived or Universal Gates
1. NAND Gate ((A · B)’)
2. NOR Gate ((A + B)’)
3. XOR Gate (A ⊕ B)
4. XNOR Gate ((A ⊕ B)’)
5. Truth Tables
Truth tables show all possible input combinations and their corresponding outputs for a
logic gate or circuit.
Rules for Forming Truth Tables
To form a truth table:
1. List all input variables (e.g., A, B, C).
2. Calculate total combinations: For n variables, use 2ⁿ rows (e.g., 3 variables → 8
rows).
3. Create a binary count from 0 to 2ⁿ - 1 for input combinations.
4. Write expressions or operations for which output is required.
5. Evaluate output for each combination.
6. Basic Laws and Rules of Boolean Algebra
7. Demorgan’s Theorems
First Theorem: (A · B)’ = A’ + B’
Second Theorem: (A + B)’ = ‘A · ‘B
2) (x.y)’=x’+y’
8. Duality Principle
the duality principle in Boolean algebra states that for any true Boolean expression, its dual
expression is also true. The dual expression is obtained by swapping the AND and OR
operators, and the 0s and 1s in the original expression.
Example:
Original Expression: A + 0 = A (This is a true Boolean expression)
Dual Expression: A * 1 = A (This is also a true Boolean expression)
Explanation:
AND (·) and OR (+): In Boolean algebra, the + symbol represents the OR operation,
and the · (or sometimes omitted) symbol represents the AND operation.
Swapping operators: To find the dual, you swap the + and · symbols.
Swapping 0 and 1: You also swap the 0 and 1 values.
Why is this important?
The duality principle helps in simplifying proofs and understanding Boolean algebra
better. If you prove a theorem in Boolean algebra, the dual of that theorem is also
automatically proven, as the principle guarantees that if a statement is true, its dual will also
be true.
More Examples:
Original: A + AB = A (True)
Dual: A * (A+B) = A (True)
Original: 1 + 0 = 1 (True)
Dual: 0 * 1 = 0 (True)
9. Logic Circuits