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
Consider a Boolean function of 3 inputs F(X,Y,Z) = Σ(3,5,6,7). Which of the following expressions is/are CORRECT?
For a Boolean variable x, which of the following statements is/are FALSE?
Consider the following Boolean expression. F = (X + Y + Z)(X̅ + Y)(Y̅ + Z) Which of the following Boolean expressions is/are equivalent to F̅ (complement of F)?
Total Unique Visitors
Loading......