Question

 What is Boolean algebra? Explain how Boolean algebra methods are used in logic circuit design.

30 Nov 2017
Answer :
Word Count : 537

Definition: A Boolean algebra B is an algebraic structure which consists of a set X (≠ Ø) having

two binary operations (denoted by ∨ and ∧), one unary operation (denoted by ' ) and two specially

defined elements O and I (say), which satisfy the following five laws for all x, y, z ∈ X.

B1. Associative Laws: x ∨ (y ∨ z) = (x ∨ y) ∨ z,

x ∧ (y ∧ z) = (x ∧ y) ∧ z

B2. Commutative Laws: x ∨ y = y ∨ x,

x ∧ y = y ∧ x

B3. Distributive Laws: x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z),

x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)

B4. Identity Laws: x ∨ O = x,

x ∧ I = x

B5. Complementation Laws: x ∧ x' = O,

x ∨ x'= I.

We write this algebraic structure as B = (X, ∨, ∧, ' , O, I), or simply B, if the context makes the

meaning of the other terms clear. The two operations ∨ and ∧ are called the join operation and

meet operation, respectively. The unary operation ' is called the complementation.

Boolean algebra methods to circuit design.

__________ ________ ___ _______ ________ __________ ____ _______ _________ ________ ____ ________.
______ ____ ________ ____ __________ ____ ________.
_________ ________ ________ ____ ___ ________ __________ _____ ________ ________ _____.
_________ __________ ____ ____ __________ _____.
___ ______ ________ ____ _____ _______ __________.
____ ______ _______ _____ ________ ____ __________ ____ ___ ____ _______.
__________ ____ ______ __________ _________ ________ ___ ________ _______ ________ _______.
_______ ______ ____ _______ ________ ________ ____ ______.
__________ __________ ___ _______ __________ _____.
__________ ________ _____ ___ ___ ________.
_______ ______ ________ ______ ____ _______ ____ ___ _________ _________.
___ ___ __________ _________ ___ ______ _______ _____ __________ ___ ____.
____ __________ _____ ____ ___ ___ __________ ________.
___ _________ _______ _____ ____ _______ ________ _________ __________ ________.
________ ________ _________ ___ ________ _____ ________ ___ ____ ___ ________.
______ ___ _______ _____ _________ _________ ________ _______ ____ ___ ___ ______.
_________ ___ _________ ___ _____.
________ __________ __________ _____ ___ ___ _______ ________ ______ ______.
_______ _______ ____ _______ ___ __________ ___ __________.
____ ____ ____ _______ ____ ___.
__________ ____ _____ ________ ___ _________ _______.
___ ______ _____ ____ ________ __________ _________ __________ ____ __________ ____ ______.
_______ ____ _________ _____ ______ ____ ___ _________ _____ __________.
________ ____ _____ _____ ______ __________ ______ ______ ________ __________.
___ _____ ________ __________ ____.
__________ ___ __________ _______ ____ _______ _____ _______ _______ ______.
__________ ____ ____ _______ _________ _______ ___ _______ _____.
________ ____ ___ _______ __________ _____ _______ _______ ________.
____ _____ __________ __________ ___ ___ ________ _________ ____ ____ _________ ______.
____ ____ ________ _________ _____ ______ __________ _______ _____.
______ ________ ______ ______ ______.
_____ _______ __________ ______ ______ _____ ______ ____ __________ ________ ___ _________.
______ ___ ______ ____ ________ ___ __________ _________ _______ ____ ____.
_____ ________ ______ ________ ___ _____ _________.
__________ _________ ___ ___ ____ ______ ______ ___.
__________ ___ ___ _______ ________ ___ ______ ____ _______ __________ _________.
___ ______ ______ ________ _______.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 13 2010 -  What is Boolean algebra? Explain how Boolean algebra methods are | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→