Table of Contents
Digital Electronics Tutorials
Boolean Algebra Simplification in Hindi
Boolean Algebra Simplification
Simplification का use हम Boolean expression को छोटा करने के लिए करते है। किसी भी Boolean expression का 2 तरीके से simplify किया जा सकता है-
- Using Boolean algebra theorems
- Using K-map
Simplification of Boolean expressions using Boolean algebra theorems
Boolean algebra मे कई सारे ऐसे theorems होते है जिनका use करके हम किसी Boolean expression का आसानी से simplify कर सकते है।
Example :
Simplify this Boolean expression
A.B + A.B’
= A.(B + B’) [using distributive law]
= A.1 [using complement law]
= A
So, simplified expression is A
Simplification of Boolean expressions using K-Map
K-map एक graphical method है जो किसी Boolean expression को simplify करने के लिए systematic method provide करता है। अगर कोई n variable का k-map है तो उसमे 2n cells होंगे।
- All Posts
- Artificial Intelligence
- Computer Fundamentals
- Computer Networks
- Data Analytics
- Data Science
- DBMS
- Deep Learning
- Digital Electronics
- DSA with Python
- Excel
- Exercise
- Git & Github
- Machine Learning
- Matplotlib
- Natural Language Processing
- NumPy
- Operating System
- Pandas-s
- Power BI
- Python Tutorial
- Scikit-learn
- Seaborn
- SQL & MySQL
Table of Contents All Chapters 1. Personal Area Network 2. Local Area Network 3. Campus Area Network 4. Metropolitan Area...
Table of Contents All Chapters 1. Data Communication 2. Types of Data Communication 2.1. Simplex 2.2....
Table of Contents All Chapters 1. Special Logic Gate 2. XOR Gate 2.1. XOR Gate Truth Table 3....
Table of Contents All Chapters 1. Universal Logic Gates 2. NOR Gate 2.1. NOR Gate Truth Table 3....
Table of Contents All Chapters 1. Logic Gate 2. AND Gate 2.1. AND Gate Truth Table 3. OR...
Table of Contents All Chapters 1. Simplification 2. Simplification using Boolean Algebra Theorems 3. Simplification using K-map Digital Electronics...
Table of Contents All Chapters 1. Identity Laws 2. Null Laws 3. Domination Laws 4. Idempotent Laws 5. Complement Laws...