27,178 views
94 votes
94 votes

Consider the operations

$\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$

Which one of the following is correct?

  1. Both $\left\{\textit{f} \right\}$ and  $\left\{ \textit{g}\right\}$ are functionally complete
  2. Only  $\left\{ \textit{f} \right\}$  is functionally complete
  3. Only  $\left\{ \textit{g}\right\}$  is functionally complete 
  4. Neither $\left\{ \textit{f}\right\}$  nor  $\left\{\textit{g}\right\}$ is functionally complete

8 Answers

4 votes
4 votes

$g(X.Y,Z)=X'YZ+X'YZ'+XY$

 

Preserves Zero $:\checkmark$ 

Not functionally complete.

 

 

 

 

 

 

 

$f(X,Y,Z)=X'YZ+XY'+Y'Z'$

 

Preserves zero $\times$

Preserves one $\times$

Linear $\times$ (Observe $6^{th}$ line)

Monotone $\times$

Self-dual $\times$

Functionally complete $\checkmark$

0 votes
0 votes

- F produces both the operations, NOT(try f(X,X,X)) and OR.

- G cannot produce the Compliment i.e. NOT. Hence it can not be a functionally complete.

NOTE: A function is said to be functionally complete if it can produce any one among:

  1. AND, OR, NOT
  2. AND, NOT
  3. OR,NOT
0 votes
0 votes
f(1,Y,1) = Y’ (not gate realisation)

f(f(1,x,1),1,z) = (x’)’z = xz (AND gate realization)

 Therefore from the given f(x,y,z) we can get AND+NOT = NAND gate so, Universal

any thing can be created .

g(x,y,z) = x’y(z+z’) + xy

         = x’y + xy

         = y

so, g(x,y,z) = y

we can’t create any thing from here
0 votes
0 votes

following the similar steps for function g(X,Y,Z) . the function g becomes functionally incomplete . Thus only function f is functionally complete and hence ,

ans ) B : Only  {f}  is functionally complete

Answer:

Related questions

12 votes
12 votes
3 answers
1
makhdoom ghaya asked Feb 11, 2015
5,064 views
Which one of the following combinations is incorrect?Acquiescence - SubmissionWheedle - RoundaboutFlippancy - LightnessProfligate - Extravagant
52 votes
52 votes
7 answers
3
makhdoom ghaya asked Feb 12, 2015
20,829 views
Consider a $4$-bit Johnson counter with an initial value of $0000.$ The counting sequence of this counter is $0, 1, 3, 7, 15, 14, 12, 8, 0$$0, 1, 3, 5, 7, 9, 11, 13, 15, ...
80 votes
80 votes
7 answers
4
makhdoom ghaya asked Feb 13, 2015
29,031 views
The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is_...