Teaching TN TRB CS Mock Test Digital Logic Number Representations and Computer Arithmetic Minimization of Boolean Expression
What is the number of max terms after minimizing the following Boolean expression?
\(f\left( {X,\;Y,\;Z,\;W} \right) = XZW' + X'ZW' + XZ' + X' + Y'\)
1
0
2
1
3
15
4
16