edited by
4,169 views

2 Answers

1 1 vote
3$^{rd}$ NOR gate can replaced by Bubbled AND gate ==> those bubble will cancel the Bubbles of 1,2 gates.

∴ 1$^{st}$ is AND gate, 2$^{nd}$ is OR gate, 3$^{rd}$ is AND gate.

from 1$^{st}$ gate o/p is  = AB

from 2$^{nd}$ gate o/p is  = $\overline{A}$ + B

==> o/ of 3$^{rd}$ gate = AB . ( $\overline{A}$ + B ) = AB
0 0 votes
$Y=\overline{\overline{AB}+(\overline{\bar {A}+B}})$

$\implies Y=\overline{\overline{(AB)}}.(\overline{\overline{\bar A+B}})$

$\implies Y= AB.(\bar A+B)$

$\implies Y=AB.\bar A+AB.B$

$\because A.\bar A=0$

$\implies Y=AB$

Option $(C)$ is correct.
Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
2.0k
2.0k views
Arjun asked Jan 2, 2019
1,993 views
​​​​​​Which of the following statements are true ?Every logic network is equivalent to one using just NAND gates or just NOR gates.Boolean expressions and logic networks ...
0 0 votes
2 2 answers
2.5k
2.5k views
Arjun asked Jan 2, 2019
2,516 views
The boolean expression $\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B$ is equivalenet to$\overline{A} \cdot B$$\overline{A+B}$$A \cdot B$$A+B$
0 0 votes
1 1 answer
7.8k
7.8k views
Arjun asked Jan 2, 2019
7,793 views
In computers, subtraction is generally carried out by$9$’s complement$1$’s complement$10$’s complement$2$’s complement
0 0 votes
1 1 answer
2.0k
2.0k views
Arjun asked Jan 2, 2019
1,986 views
Consider the following boolean equations:$wx+w(x+y)+x(x+y)=x+wy$$(w \overline{x}(y+x \overline{z})+ \overline{w} \overline{x})y= \overline{x}y$What can you say about the ...