640 views
1 votes
1 votes

The following expression was to be realized using 2-input AND and OR gates, but by mistake all 2-input AND gates were taken as 2-input NAND gates,

$$(a.b).c + (\bar a.c).d + (\bar b.c).d + a.d$$

What is the function finally realized ?

  1. $1$
  2. $\bar a + \bar b + \bar c + \bar d$
  3. $\bar a + b + \bar c + \bar d$
  4. $\bar a + \bar b + c + \bar d$

2 Answers

Best answer
5 votes
5 votes

I have not indicated the k map properly but answer is 1

selected by
Answer:

Related questions

0 votes
0 votes
0 answers
2
Bikram asked Sep 20, 2016
131 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
3
Bikram asked Sep 20, 2016
248 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
4
Bikram asked Sep 20, 2016
279 views
Zero has only one representation inSign magnitude1's complement2's complementBoth 1's complement and 2's complement