edited by
433 views
0 votes
0 votes

Which of the following circuits are equivalent (i.e., they produce the same output for all inputs)?

$\text{F} = ab + bc + ca$

$\text{G} = (a+b)(b+c)(c+a)$

$\text{H} = \text{NAND(NAND(a,b), NAND(b,c),NAND(c,a))} $

  1. $\text{F}$ and $\text{H}$
  2. $\text{F}$ and $\text{G}$
  3. $\text{F, G}$ and $\text{H}$
  4. $\text{G}$ and $\text{H}$
edited by

1 Answer

1 votes
1 votes

F = ab + bc + ca

 

G = (a + b)(b + c)(c + a)

   =  (b + ac)(c + a)                                                                    Distributive Law [ (x+y)(x+z) = x + yz]

   =  bc + ba + ac*c +ac*c

   =  bc+ ba +ac +ac

   =  ab + bc + ca

NAND- NAND Realization is Equivalent to AND-OR Realization.

H =  NAND [NAND(a,b), NAND(b,c), NAND(c,a)]

    =  OR[AND(a,b), AND(b,c), AND(c,a)]

    =  OR[ab, bc, ca]

    =   ab + bc + ca 

So, F,G,H are Equivalent.

        

Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Jan 5, 2019
390 views
How many Boolean functions in one variable are $\text{NOT}$ idempotent: i.e. they do not satisfy $\forall a.f(f(a)) = f(a).$$4$Infinite$1$$0$
1 votes
1 votes
2 answers
2
admin asked Jan 5, 2019
410 views
How many different Boolean circuits of $n$ variables are there?None of the above$n^{2^{n}}$$2^{2^{n}}$$2^{n}$
0 votes
0 votes
3 answers
3
admin asked Jan 5, 2019
868 views
Which Boolean function does the following Karnaugh map represent?Inclusive $\text{NOR}$Exclusive $\text{NOR}$Exclusive $\text{OR}$Inclusive $\text{OR}$
0 votes
0 votes
1 answer
4
admin asked Jan 5, 2019
364 views
Which of the following gates is $\text{NOT}$ universal?$\text{NOR}$ gate defined as $\overline{a+b}$$\text{NAND}$ gate defined as $\overline{a.b}$$\text{OR-AND}$ gate def...