engineering recuitment GATE CSE 2023-24 Test Series Digital Logic Number Representations and Computer Arithmetic Minimization of Boolean Expression
The min-term list form of a Boolean function F(A, B, C, D) is given below.
F(A, B, C, D) = ∑m(0, 1, 3, 4, 5, 6, 9, 10, 11, 12, 14, 15) + d(2, 7, 8)
Here, 𝑚 denotes a min-term and 𝑑 denotes a don’t care term. The minimized Boolean expression is ____.1
A̅ + B + C + D̅
2
A̅ + B̅ + C + D̅
3
A + B̅ + C + D̅
4
A̅ + B̅ + C̅ + D̅