Register

ISRO-DEC2017-76

• reopened by
3,594 views
3 3 votes

Which of the following set of components is sufficient to implement any arbitrary Boolean function?

  1. $XOR$ gates, $NOT$ gates
  2. $AND$ gates, $XOR$ gates and $1$
  3. $2$ to $1$ multiplexer
  4. Three input gates that output $(A.B)+C$ for the inputs $A, B, C$

1 Answer

1 1 vote
  • a⊕1=  a'
  • a'  ⊕1=a
  • Thus XOR ⊕ and  1 can make NOT gate
  • AND is given

{AND, NOT} is functionally complete.

Answer is B

Voting & Accepting an answer helps improve the community
Answer:
← Previous · ISRO-DEC2017-75Next → · ISRO-DEC2017-77
← Previous in category · ISRO-DEC2017-75Next in category → · Latch
Position:
Show:

Related questions

5 5 votes
2 answers 2 answers
3.4k
3.4k views
gatecse asked Dec 17, 2017
3,406 views
ISRO-DEC2017-75
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to$-3.0$$-1.0$$-4.0$$-2.0$
3 3 votes
1 answers 1 answer
2.0k
2.0k views
gatecse asked Dec 17, 2017
2,026 views
ISRO-DEC2017-40
Let $M=11111010$ and $N=00001010$ be two $8$-$bit$ two's complement number.Their product in two's complement is$11000100$$10011100$$10100101$$11010101$
0 0 votes
1 1 answer
3.2k
3.2k views
gatecse asked Dec 17, 2017
3,184 views
ISRO-DEC2017-72
We consider the addition of two ${2}'s$ compliment numbers $b_{n-1}b_{n-2}\ldots b_{0}$ and$a_{n-1}a_{n-2}\ldots a_{0}$. A binary adder for adding two unsigned binary num...
3 3 votes
4 4 answers
9.8k
9.8k views
gatecse asked Dec 17, 2017
9,787 views
ISRO-DEC2017-71
A $32$-$bit$ adder is formed by cascading $4$-$bit$ CLA adder.The gate delays (latency)for getting the sum bits is$16$$18$$17$$19$