391 views
1 votes
1 votes

Which of the following sets of components are sufficient to implement any arbitrary Boolean function (assume external 0/1 is available):

  1. XOR gates, NOT gates
  2. 2 to 1 multiplexors
  3. AND gates, OR gates
  4. Three input gates that output $(A.B) + C$ where $A,B,C$ are inputs

2 Answers

0 votes
0 votes
the ans should be c ?
Answer:

Related questions

0 votes
0 votes
0 answers
1
Bikram asked Sep 20, 2016
135 views
Latches constructed with NOR and NAND gates tend to remain in the latched condition due to which configuration feature?cross couplinggate impedancelow input voltagesasync...
0 votes
0 votes
2 answers
2
Bikram asked Sep 20, 2016
260 views
The minimum number of gates required to implement the Boolean function $(AB+C)$ if we have to use only 2-input NOR gate?
0 votes
0 votes
2 answers
3
Bikram asked Sep 20, 2016
300 views
Zero has only one representation inSign magnitude1's complement2's complementBoth 1's complement and 2's complement
3 votes
3 votes
1 answer
4
Bikram asked Sep 20, 2016
399 views
The number 3 in 2’s complement representation is00000011111111011111110001111100