Introduction to Boolean Algebra and Logic Gates
Boolean Algebra , Boolean Expressions, Basic Theorems, Minterms, Maxterms, K-Map, Logical Operations, Logic Gates
Description
The details of the course are as below
Introduction
Introduction to Boolean Algebra
Number System - Overview
Binary Valued Quantities
Logical Operations
Logical Function And Logical Expressions
Truth Table, Tautology, Fallacy
Logical Operators
NOT
AND
OR
Evaluation of Boolean Expressions Using Truth Table
Evaluation of Boolean Expressions Using Truth Table - Concepts
Creation of Table and Possible Combination of Values
Evaluation of Boolean Expressions Using Truth Table - Examples
Logic Gates
Basic Logic Gates - Introduction
NOT
OR
AND
Derived Logic Gates - Introduction
NOR Gate
NAND Gate
XOR Gate
XNOR Gate
Universal Gates
Basic Postulates of Boolean Algebra
Basic Postulates of Boolean Algebra
Principle of Duality
Basic Theorems of Boolean Algebra
Properties of Zero and One
Idempotence law
Complementary law
Involution law
Commutative law
Associative law
Distributive law
Absorption law
Few More laws
De Morgan’s Theorems
DeMorgan’s Theorem Introduction
DeMorgan’s First theorem
DeMorgan’s Second theorem
Applications of DeMorgan’s theorems
Boolean Expression and Boolean Function
Boolean Expression and Boolean Function
Examples on Simplification of Boolean Expressions
Derivation of Boolean Expression
Recall Few Points - Binary to Decimal
Minterms
Maxterms
Concepts of Minterms and Maxterms
Canonical Expressions
Conversion for Non Standard SOP to SOP Form
Conversion for Non Standard POS to POS Form
Simplification of Boolean Expressions
Simplification using Karnaugh map
Recall Few Points - Gray Code
Draw and Fill K-Map for Sum of Product (SOP) form
Rules for Grouping Minterms in K-Map
Reduction rules in SOP form using K-map
Grouping and Reduction for Pairs in SOP form
Grouping and Reduction for Quads in SOP form
Grouping and Reduction for Octet in SOP form
Summary of Reduction Rules for SOP using K-map
K-Map Simplification Technique -SOP Form
SOP Reduction using Karnaugh Map - Examples
Draw and Fill K-Map for POS form
Rules for Grouping Maxterms in K-Map
Summary of Reduction Rules for POS using K-map
K-Map Simplification Technique - POS Form
POS Reduction using Karnaugh Map - Examples
What You Will Learn!
- Boolean Algebra
- Creation of Truth Table
- Boolean Expressions, Boolean Functions
- Basic Theorems, De Morgan's Theorems
- Sum of Product (SOP) , Product of Sum(POS)
- Minterms, Maxterms
- Karnaugh Map (K-Map), Pairs, Quad, Octet
- Logical Operators, Logic Gates, Basic Gates, Derived Gates
Who Should Attend!
- Bachelors of Engineering
- Bachelors Degree
- Competitive Exams Preparations