Useful Links
Mathematics
Discrete Mathematics
1. Foundations of Logic and Proofs
2. Set Theory and Basic Structures
3. Combinatorics
4. Number Theory
5. Graph Theory
6. Trees
7. Discrete Probability
8. Algorithms and Complexity
9. Boolean Algebra and Logic Circuits
Boolean Algebra and Logic Circuits
Boolean Algebra Fundamentals
Boolean Variables and Functions
Binary Variables
Boolean Operations
Truth Tables for Boolean Functions
Boolean Laws and Identities
Commutative Laws
Associative Laws
Distributive Laws
Identity Laws
Complement Laws
Absorption Laws
De Morgan's Laws
Boolean Function Representation
Sum of Products Form
Product of Sums Form
Canonical Forms
Minterms and Maxterms
Logic Gates and Circuits
Basic Logic Gates
AND Gate
OR Gate
NOT Gate
NAND Gate
NOR Gate
XOR Gate
Gate Combinations
Compound Gates
Universal Gates
Gate Equivalences
Circuit Design
From Boolean Expressions
From Truth Tables
Multi-Level Circuits
Boolean Function Minimization
Algebraic Minimization
Using Boolean Laws
Factoring and Expansion
Systematic Approaches
Karnaugh Maps
Construction of K-Maps
Grouping Rules
Minimization Process
Don't Care Conditions
Quine-McCluskey Method
Tabular Minimization
Prime Implicants
Essential Prime Implicants
Applications in Digital Systems
Combinational Circuits
Adders
Multiplexers
Decoders
Encoders
Sequential Circuits
Flip-Flops
Counters
Registers
Computer Arithmetic
Binary Addition
Binary Subtraction
Overflow Detection
Previous
8. Algorithms and Complexity
Go to top
Back to Start
1. Foundations of Logic and Proofs