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
A
(¯B+C)(A+¯B)(¯A+¯B)(¯C+D)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
(¯B+C)(¯A+C)(¯A+¯C)(¯C+¯D)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
(¯B+C)(¯A+C)(¯A+¯C)(¯C+D)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
(¯B+C)(¯A+C)(¯A+¯B)(¯C+D)
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is D(¯B+C)(¯A+C)(¯A+¯B)(¯C+D) The 4 variable Boolean function is given in canonical sum of products form as, f(A,B,C,D)=∑(0,1,3,7,11)
As the options are given in the simplified product of sum form, we first convert the given function in canonical product of sums form, as under f(A,B,C,D)=∏(2,4,5,6,8,9,10,12,13,14,15)
Now by plotting the above function on a 4 variable K-map (maxterms map), obtain the simplified expression of the function