Computer Sciences > GATE 2015 SET-1 > Boolean Algebra
Consider the operations
f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X, Y, Z) = X'YZ + X'YZ' + XY.
Which one of the following is correct?
A
Both {f} and {g} are functionally complete.
B
Only {f} is functionally complete.
C
Only {g} is functionally complete.
D
Neither {f} nor {g} is functionally complete.

Correct : b

Similar Questions

The number of min-terms after minimizing the following Boolean expression is _______. [D' + AB' + A'C + AC'D + A'C'D]'
#1178 NAT
The number of min-terms after minimizing the following Boolean expression is _______. [D' + AB' + A'C + AC'D + A'C'D]'
#1178 NAT
The number of min-terms after minimizing the following Boolean expression is _______. [D' + AB' + A'C + AC'D + A'C'D]'
#1178 NAT

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: