484 views

1 Answer

Best answer
3 votes
3 votes
The answer is 3 input XOR gate.

M (a,b,c)=ab+bc+ca

M (M (a,b,c)',M (a,b,c'),c)

Consider

M (a,b,c)'=x

M (a,b,c')=y

To find M (x,y,c)

= xy+yc+cx    (from given def of M)

Now substitute the values pf x and y

=(ab+bc+ca)'(ab+bc'+c'a) + (ab+bc'+c'a)c + c (ab+bc+ca)'

 

You need to expand the above exp and then reduce it accordingly.

In the end you will get

C XOR a XOR b
selected by

Related questions

0 votes
0 votes
0 answers
1
indrajeet asked Feb 2, 2017
547 views
Consider the B+ tree shown in FigureWhat is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change ...
2 votes
2 votes
1 answer
4
GäteMann asked Nov 5, 2017
1,715 views
What are the relevant chapters for GATE from the Graph Theory book by Narsingh Deo?