2. Boolean Algebra
Boolean algebra, expression minimising, axioms, theorems, Karnaugh Maps and combinational logic circuit design
- F = A + 1 = 1 >>
- F = A + 0 = A >>
- F = A And 0 = 0 >>
- F = A And 1 = A >>
- A Or Not(A) = 1 >>
- F = Not(Not(A)) = A >>
- F = A Or (A And B) >>
- A Or (Not(A) And B) = A Or B >>
- Associative Law (1 of 2) >>
- Associative Law (2 of 2) >>
- Commutative Laws >>
- Distributive Law (1 of 5) >>
- Distributive Law (2 of 5)>>
- Distributive Law (3 of 5) >>
- Distributive Law (4 of 5) >>
- Distributive Law (5 of 5) >>
- Introduction to Axioms >>
- Axioms >>
- Deriving a Theorem using axioms >>
- Deriving a Theorem >>
- Perfect Induction >>
- Two Variable Sum of Minterms >>
- Three Variable Sum of Minterms >>
- Four Variable Sum of Minterms >>
- Two Variable Karnaugh Map >>
- Karnaugh Map Examples (2 variables) >>
- Three Variable Karnaugh Map >>
- Karnaugh Map Examples (Three Variables) >>
- Four Variable Karnaugh Map >>
- Karnaugh Map Examples (4 variables) >>
- Combinational Logic Circuit Design >>
- Half Adder Design >>
- Half Subtractor Design >>
- De Morgan's Theorem >>
- Universal Logic (Nand Gates) >>.
- Half Adder Design (using universal gates) >>
- Half Adder Design (using Nor gates) >>
- Exclusive Or Gate >>
- Half Adder Design (XOR) >>
- Logic Circuit Design for Memory >>
- Combinational Logic Circuit Design (Memory) >>
- Combinational Logic Circuit Design (Four Chips) >>
- XOR gate >>