Day 10: Boolean Algebra Basics – Laws, Theorems, and Applications | Class 11 - BSEB Class 11-12 Computer Science: 100-Day Bilingual Guide with MCQs, Solutions and Questions

Day 10 – Chapter 2: Boolean Algebra Basics

Class 11 Computer Science

2.11 Introduction to Boolean Algebra (बूलियन बीजगणित का परिचय)

Boolean algebra is a branch of mathematics that deals with binary variables and logical operations. It is fundamental in designing digital circuits and computer logic.
बूलियन बीजगणित गणित की एक शाखा है जो बाइनरी वेरिएबल्स और तार्किक संचालन से संबंधित है। यह डिजिटल सर्किट और कंप्यूटर लॉजिक को डिजाइन करने में मौलिक है।

2.12 Laws of Boolean Algebra (बूलियन बीजगणित के नियम)

Boolean algebra follows several laws that simplify logical expressions. These include:
बूलियन बीजगणित कई नियमों का पालन करता है जो तार्किक अभिव्यक्तियों को सरल बनाते हैं। इनमें शामिल हैं:

• Commutative Law: A + B = B + A, A × B = B × A
• Associative Law: (A + B) + C = A + (B + C), (A × B) × C = A × (B × C)
• Distributive Law: A × (B + C) = (A × B) + (A × C)
• Identity Law: A + 0 = A, A × 1 = A
• Null Law: A + 1 = 1, A × 0 = 0
• Idempotent Law: A + A = A, A × A = A
• Complement Law: A + A’ = 1, A × A’ = 0

2.13 Boolean Theorems (बूलियन प्रमेय)

Boolean theorems help in simplifying logical expressions and include:
बूलियन प्रमेय तार्किक अभिव्यक्तियों को सरल बनाने में मदद करते हैं और इनमें शामिल हैं:

• De Morgan’s Theorems:
  • (A + B)’ = A’ × B’
  • (A × B)’ = A’ + B’
• Absorption Theorem: A + (A × B) = A
• Consensus Theorem: (A × B) + (A’ × C) + (B × C) = (A × B) + (A’ × C)

2.14 Applications of Boolean Algebra (बूलियन बीजगणित के अनुप्रयोग)

Boolean algebra is widely used in the design and analysis of digital circuits, such as:

• Simplifying logic circuits
• Designing combinational circuits like adders, multiplexers, and decoders
• Analyzing sequential circuits like flip-flops and counters

Practice Questions (अभ्यास प्रश्न)

Multiple Choice Questions (MCQs)

1. What is the result of A + 1 in Boolean algebra?
   (a) 0 | (b) 1 | (c) A | (d) A’
2. Which law states A + 0 = A?
   (a) Identity Law | (b) Null Law | (c) Complement Law | (d) Distributive Law
3. What is the complement of (A × B) in De Morgan’s theorem?
   (a) A + B | (b) A’ × B’ | (c) A’ + B’ | (d) A × B
4. Which theorem is represented as A + (A × B) = A?
   (a) Consensus Theorem | (b) Absorption Theorem | (c) Distributive Law | (d) Idempotent Law
5. What does (A × A)’ equal?
   (a) A | (b) A’ | (c) 1 | (d) 0
6. What is the result of (A + B)’ according to De Morgan’s theorem?
   (a) A × B | (b) A’ × B’ | (c) A’ + B’ | (d) A × B’
7. Which Boolean law states A × 0 = 0?
   (a) Null Law | (b) Identity Law | (c) Complement Law | (d) Absorption Law
8. Which operation represents OR in Boolean algebra?
   (a) + | (b) × | (c) / | (d) -
9. What is the result of A × A in Boolean algebra?
   (a) A | (b) 0 | (c) 1 | (d) A’
10. Which application uses Boolean algebra?
    (a) Digital circuit design | (b) Networking | (c) Memory storage | (d) None of the above

Answers to MCQs:

1: (b), 2: (a), 3: (c), 4: (b), 5: (d), 6: (b), 7: (a), 8: (a), 9: (a), 10: (a)

Short Answer Questions (लघु उत्तरीय प्रश्न)

1. What is Boolean algebra?
   Answer: Boolean algebra is a mathematical framework for binary variables and logical operations.
2. Define De Morgan’s theorem.
   Answer: De Morgan’s theorem states that (A + B)’ = A’ × B’ and (A × B)’ = A’ + B’.
3. State the identity law in Boolean algebra.
   Answer: Identity law states A + 0 = A and A × 1 = A.
4. Why is Boolean algebra important in computer science?
   Answer: Boolean algebra is used to simplify logic circuits and design digital systems.
5. What is the absorption theorem?
   Answer: The absorption theorem states A + (A × B) = A.

Long Answer Questions (दीर्घ उत्तरीय प्रश्न)

1. Explain the basic laws of Boolean algebra with examples.
2. Discuss the role of Boolean algebra in simplifying logic circuits.
3. Describe De Morgan’s theorems and their applications in digital systems.