-
The SOP (sum of products) form of a Boolean function is ∑(0, 1, 3, 7, 11), where inputs are A, B, C, D (A is MSB, and D is LSB). The equivalent minimized expression of the function is
-
- (B + C)(A + C)(A + B)(C + D)
- (B + C)(A + C)(A + C)(C + D)
- (B + C)(A + C)(A = C)(C + D)
- (B + C)(A + B)(A + B)(C + D)
Correct Option: A
ƒ = ∑(0, 1, 3, 7, 11)
Constructing K-map, we have
For POS, insert ing 0’s in the cells of K-map unoccupied by L’s
Hence equivalent POS expresion
ƒ = (B - C)(A - C)(A - B)(C - D)
