Register

ISRO-DEC2017-76

• reopened by
2,416 views
1 votes
1 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$
• reopened by
User Avatar

1 Answer

1 votes
1 votes
  • 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

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

7 votes
7 votes
3 answers
1
makhdoom ghaya asked Apr 26, 2016
4,425 views
ISRO-2013-22
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ? {$NOT$, $OR$} {$NOR$} {$AND$, $OR$} {$AND$, $NOT$}
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?{$NOT$, $OR$}{$NOR$}{...
User Avatar
4 votes
4 votes
2 answers
2
gatecse asked Dec 17, 2017
2,662 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$
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to$-3.0$$-1.0$$-4.0$$-2.0$
User Avatar
0 votes
0 votes
1 answer
3
gatecse asked Dec 17, 2017
2,156 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 numbers is used to add two binary numbers.The sum is denoted by $c_{n-1}c_{n-2}\ldots c_{0}$.The carry out ... $c_{out}\oplus c_{n-1}$ $a_{n-1}\oplus b_{n-1}\oplus c_{n-1}$
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...
User Avatar
2 votes
2 votes
3 answers
4
gatecse asked Dec 17, 2017
7,009 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$
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$
User Avatar
Link Copied!