Advertisements
Advertisements
प्रश्न
Draw truth table and write Boolean function for following circuit.
विस्तार में उत्तर
Advertisements
उत्तर
(i) Boolean expression at different stages:
X = (A′ + B′)′
After NOT gate:
X′ = A′ + B′
Lower AND gate:
AB
Therefore,
Y = (A′ + B′)AB
Since AB requires A = 1, B = 1, while A′ + B′ = 0 for A = 1, B = 1,
Y = 0
| A | B | A' | B' | A'+B' | AB | Y |
|---|---|---|---|---|---|---|
| 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 |
(ii) The first gate is an XOR gate.
X = A′ ⊕ B
The output is ANDed with B and then complemented:
Y = [(A′ ⊕ B)B]'
Simplified:
Y = (AB)′
| A | B | A' | A′ ⊕ B | (A′ ⊕ B)B | Y |
|---|---|---|---|---|---|
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 1 | 0 |
(iii) First NAND gate:
X = (A′B)′
The output of this gate and CC are given to a NOR gate:
Y = [(A′B)′ + C]′
Simplifying,
Y = A′BC′
| A | B | C | A' | A'B | (A′B)′ | Y |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 |
shaalaa.com
क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
