Question

Consider the operations:

f(X,Y,Z)=X′YZ+XY′+Y′Z′andg(X,Y,Z)=X′YZ+X′YZ′+XY.f(X, Y, Z) = X' Y Z + X Y' + Y' Z' \quad \text{and} \quad g(X, Y, Z) = X' Y Z + X' Y Z' + X Y.

Which one of the following is correct?

Choose one option
Official answer and solution
Official answer
B
From
Official GATE 2015 answer key

Solution

Test whether the boolean operations f and g can synthesize NOT and AND/OR gates.

  1. Analyze g(X,Y,Z)g(X, Y, Z):

    g(X,Y,Z)=X′YZ+X′YZ′+XYg(X, Y, Z) = X' Y Z + X' Y Z' + X Y

    Factor out X′YX' Y:

    g(X,Y,Z)=X′Y(Z+Z′)+XY=X′Y(1)+XY=(X′+X)Y=Y.g(X, Y, Z) = X' Y (Z + Z') + X Y = X' Y(1) + X Y = (X' + X) Y = Y.

    The function g(X,Y,Z)g(X, Y, Z) simplifies identically to the single variable YY. It is degenerate and cannot invert or combine signals. Hence, {g}\{g\} is not functionally complete.

  2. Analyze f(X,Y,Z)f(X, Y, Z):

    f(X,Y,Z)=X′YZ+XY′+Y′Z′=X′YZ+Y′(X+Z′).f(X, Y, Z) = X' Y Z + X Y' + Y' Z' = X' Y Z + Y'(X + Z').
    • To synthesize NOT: set X=ZX = Z:
      f(X,Y,X)=X′YX+Y′(X+X′)=0+Y′(1)=Y′.f(X, Y, X) = X' Y X + Y'(X + X') = 0 + Y'(1) = Y'.
      Thus, ff can generate the NOT gate NOT(Y)=f(X,Y,X)\text{NOT}(Y) = f(X, Y, X).
    • To synthesize AND/OR: set Y=1Y = 1:
      f(X,1,Z)=X′(1)Z+(0)+(0)=X′Z.f(X, 1, Z) = X'(1)Z + (0) + (0) = X' Z.
      Combining X′ZX' Z with the NOT gate generates XZX Z (the AND gate).
      Since {f}\{f\} can generate both NOT and AND, {f}\{f\} is functionally complete.

Therefore, only {f}\{f\} is functionally complete (option B).

Final answer

B

Common trap

Failing to minimize g algebraically to see that it degenerates to simply Y.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2015 Computer Science and Information Technology (CS) Session 1
Question
49 of 65, printed as CS Q.39
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.