Professional Documents
Culture Documents
In Boolean algebra there is a precise duality between the operators (AND) & (OR) and the binary digits 0 & 1. In Boolean algebras the duality Principle can be is obtained by interchanging AND & OR operators and replacing 0's by 1's and 1's by 0's. Compare the identities on the left side with the identities on the right. If a theorem is proved, its dual theorem automatically holds and need not to be proved separately.
Example: A + AB = A+ B dual can be obtained in following steps
1.
A . (A + B) = A + B Hence dual of A + AB = A+ B is A . (A + B) = A + B Example 1: Find the dual of the Boolean expression 1.X +YZ Ans. (0+X) . (Y+ Z) Example 2: Find the dual of x(y + z) = xy + xz Ans. x+(yz) = (x+y).(x+z) Example 3: Find the dual of x + xy = x + y Ans. x.(x+y) = x.y
Ans.
DeMorgans Theorem
De Morgans Theorem is very much important for NOR & NAND gates. First Theorem According to this theorem, complement of sum of two variables is equal to product of complement of two variables. That is
(A+B)= A.B
Truth table for proving theorem 1 by perfect induction method A 0 0 1 1 B 0 1 0 1 A+B 0 1 1 1 (A+B) 1 0 0 0
A 0 0 1 1
B 0 1 0 1
A 1 1 0 0
B 1 0 1 0
A.B 1 0 0 0
The two truth tables are identical, and so the two expressions are identical. For N input
(A+B+C+_________N) = A.B.C.________N When 3 inputs are involved DeMorgans first theorem is (A+B+C)= (A.B.C)
Second Theorem - According to this theorem, the complement of product of variables is equal to sum of complement of variables. That is
(A .B) = A + B
Truth table for proving theorem 2 by perfect induction method. A 0 0 1 1 B 0 1 0 1 A.B 0 0 0 1 (A.B) 1 1 1 0
A 0 0 1 1 For N input
B 0 1 0 1
A 1 1 0 0
B 1 0 1 0
A+B 1 1 1 0
(A.B.C._______N) = A+B+C+______N When 3 inputs are involved (A.B.C) = A+B+C Hence DeMorgans Theorem is applicable for any number of variables. Shilpa umdekar.