Computer Sciences > GATE 2021 SET-2 > Boolean Algebra
Consider a Boolean function f(w,x,y,z) such that
f(w,0,0,z) = 1
f(1,x,1,z) = x + z
f(w,1,y,z) = wz + y
The number of literals in the minimal sum-of-products expression of f is _______.
f(w,0,0,z) = 1
f(1,x,1,z) = x + z
f(w,1,y,z) = wz + y
The number of literals in the minimal sum-of-products expression of f is _______.
Correct : 6 to 6
Similar Questions
The binary operator ≠ is defined by the following truth table.
Which one of the following is true about the binary operator ≠?
The binary operator ≠ is defined by the following truth table.
Which one of the following is true about the binary operator ≠?
The binary operator ≠ is defined by the following truth table.
Which one of the following is true about the binary operator ≠?
Total Unique Visitors
Loading......