A boolean function F is defined on three input variables A, B and C is 1 if and only if number of 1 inputs is odd. Draw the truth table for the above function and express it in sum of products
Advertisements
प्रश्न
A boolean function F is defined on three input variables A, B and C is 1 if and only if number of 1 inputs is odd. Draw the truth table for the above function and express it in sum of products and product of sums formats.
संख्यात्मक
Advertisements
उत्तर
The Boolean function F is 1 when the number of 1 inputs is odd (1 or 3). Otherwise, F is 0.
1. Truth Table
|
A |
B |
C |
F(A,B,C) |
|---|---|---|---|
|
0 |
0 |
0 |
0 |
|
0 |
0 |
1 |
1 |
|
0 |
1 |
0 |
1 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
1 |
|
1 |
0 |
1 |
0 |
|
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
2. Sum of Products (SOP) Form
In SOP form, we consider the rows where F = 1.
The input combinations are (001), (010), (100) and (111).
Therefore,
F = A'B'C + A'BC' + AB'C' + ABC
3. Product of Sums (POS) Form
In POS form, we consider the rows where F = 0.
The input combinations are (000), (011), (101) and (110).
Therefore,
F = (A + B + C) (A + B' + C') (A' + B + C') (A' + B' + C)
shaalaa.com
क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
