Chapter 6 Boolean Algebra - 7


Computer Class 10
1. Postulate are the basic axioms of the Boolean algebra and need multiple proves.


2. A.(B.C) = (A.B) +C


3. Truth Table provides you the maximum combination.


4. A.(A+B) = A


5. A Boolean function is an expression which can be formed by binary variables.


6. Boolean function is implemented by logical gates.


7. Karnaugh map is used to simplify the truth table.


8. Boolean expressions are represented by variables connected with logical operators.


This is more feedback!
This is the feedback!