Answer
Verified
347.4k+ views
Hint: An EX-OR gate is a digital logic gate which gives a true output when the number of inputs is odd only. Whereas, EX-NOR gate is just an EX-OR gate followed by a NOT gate which gives a true output only when the number of inputs is even. Simply put, EX-NOR gate gives an opposite output when compared to the output of EX-OR gate under the same input conditions.
Complete answer:
(a)
The logic diagram of EX-OR gate using NAND gate only is given as:
To prove it using the Boolean equation, we know Exclusive-OR gate is “ A or B but not BOTH”.
Let us prove the above expression.
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=0\oplus 0=0.\overline{0}+\overline{0}.0=0.1+1.0=0$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=0\oplus 1=0.\overline{1}+\overline{0}.1=0.0+1.1=1$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=1\oplus 0=1.\overline{0}+\overline{1}.0=1.1+0.0=1$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=1\oplus 1=1.\overline{1}+\overline{1}.1=1.0+0.1=0$
So, it is proved that the Boolean expression for A ⊕ B is $A\overline{B}+\overline{A}B$ , as this Boolean expression satisfied all output states with respect to an XOR gate’s inputs conditions.
Proof using truth table:
Thus, it is proved using the Truth Table that EX-OR gate gives true output when the number of inputs is odd.
The logic diagram of EX-NOR gate using NAND gate is given as:
To proof it using Boolean equation, we know Exclusive-NOR gate is “$A\odot B$”
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.0+\overline{0}.\overline{0}=0.0+1.1=1$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.1+\overline{0}.\overline{1}=0.1+1.0=0$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.0+\overline{1}.\overline{0}=1.0+0.1=0$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.1+\overline{1}.\overline{1}=1.1+0.0=1$
Hence, it is proved that EX-NOR gate is A ⊙ B .
Proof using truth table:
Thus, it is proved using the Truth Table that EX-NOR gate gives true output when the number of inputs is even.
(b)
The logic diagram of EX-OR gate using NOR gate only is given as:
To prove it using the Boolean equation, we know Exclusive-OR gate is “ A or B but not BOTH”.
Let us prove the above expression.
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=0\oplus 0=0.\overline{0}+\overline{0}.0=0.1+1.0=0$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=0\oplus 1=0.\overline{1}+\overline{0}.1=0.0+1.1=1$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=1\oplus 0=1.\overline{0}+\overline{1}.0=1.1+0.0=1$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=1\oplus 1=1.\overline{1}+\overline{1}.1=1.0+0.1=0$
So, it is proved that the Boolean expression for A ⊕ B is $A\overline{B}+\overline{A}B$ , as this Boolean expression satisfied all output states with respect to an XOR gate’s inputs conditions.
Proof using truth table:
Thus, it is proved using the Truth Table that EX-OR gate gives true output when the number of inputs is odd.
The logic diagram of EX-NOR gate using NOR gate is given as:
To proof it using Boolean equation, we know Exclusive-NOR gate is “$A\odot B$”
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.0+\overline{0}.\overline{0}=0.0+1.1=1$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.1+\overline{0}.\overline{1}=0.1+1.0=0$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.0+\overline{1}.\overline{0}=1.0+0.1=0$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.1+\overline{1}.\overline{1}=1.1+0.0=1$
Hence, it is proved that EX-NOR gate is A ⊙ B .
Proof using truth table:
Thus, it is proved using the Truth Table that EX-NOR gate gives true output when the number of inputs is even.
Note:
All the complex logic gates can be deduced using only the basic logic gates. So, we should always remember the construction of basic logic gates and take help from their truth table and Boolean expression if there occurs any problem in any step while constructing these complex logic gates using basic gates.
Complete answer:
(a)
The logic diagram of EX-OR gate using NAND gate only is given as:
To prove it using the Boolean equation, we know Exclusive-OR gate is “ A or B but not BOTH”.
Let us prove the above expression.
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=0\oplus 0=0.\overline{0}+\overline{0}.0=0.1+1.0=0$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=0\oplus 1=0.\overline{1}+\overline{0}.1=0.0+1.1=1$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=1\oplus 0=1.\overline{0}+\overline{1}.0=1.1+0.0=1$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=1\oplus 1=1.\overline{1}+\overline{1}.1=1.0+0.1=0$
So, it is proved that the Boolean expression for A ⊕ B is $A\overline{B}+\overline{A}B$ , as this Boolean expression satisfied all output states with respect to an XOR gate’s inputs conditions.
Proof using truth table:
Input A | Input B | Output Q |
0 | 0 | 0 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
Thus, it is proved using the Truth Table that EX-OR gate gives true output when the number of inputs is odd.
The logic diagram of EX-NOR gate using NAND gate is given as:
To proof it using Boolean equation, we know Exclusive-NOR gate is “$A\odot B$”
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.0+\overline{0}.\overline{0}=0.0+1.1=1$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.1+\overline{0}.\overline{1}=0.1+1.0=0$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.0+\overline{1}.\overline{0}=1.0+0.1=0$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.1+\overline{1}.\overline{1}=1.1+0.0=1$
Hence, it is proved that EX-NOR gate is A ⊙ B .
Proof using truth table:
Input A | Input B | Output Q |
0 | 0 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
Thus, it is proved using the Truth Table that EX-NOR gate gives true output when the number of inputs is even.
(b)
The logic diagram of EX-OR gate using NOR gate only is given as:
To prove it using the Boolean equation, we know Exclusive-OR gate is “ A or B but not BOTH”.
Let us prove the above expression.
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=0\oplus 0=0.\overline{0}+\overline{0}.0=0.1+1.0=0$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=0\oplus 1=0.\overline{1}+\overline{0}.1=0.0+1.1=1$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\oplus B=1\oplus 0=1.\overline{0}+\overline{1}.0=1.1+0.0=1$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\oplus B=1\oplus 1=1.\overline{1}+\overline{1}.1=1.0+0.1=0$
So, it is proved that the Boolean expression for A ⊕ B is $A\overline{B}+\overline{A}B$ , as this Boolean expression satisfied all output states with respect to an XOR gate’s inputs conditions.
Proof using truth table:
Input A | Input B | Output Q |
0 | 0 | 0 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
Thus, it is proved using the Truth Table that EX-OR gate gives true output when the number of inputs is odd.
The logic diagram of EX-NOR gate using NOR gate is given as:
To proof it using Boolean equation, we know Exclusive-NOR gate is “$A\odot B$”
In the first case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.0+\overline{0}.\overline{0}=0.0+1.1=1$
In the second case consider,
\[A\text{ }=\text{ }0\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=0.1+\overline{0}.\overline{1}=0.1+1.0=0$
In third case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }0\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.0+\overline{1}.\overline{0}=1.0+0.1=0$
In fourth case consider,
\[A\text{ }=\text{ }1\] and\[B\text{ }=\text{ }1\] .
$\therefore A\odot B=AB+\overline{A}\overline{B}=1.1+\overline{1}.\overline{1}=1.1+0.0=1$
Hence, it is proved that EX-NOR gate is A ⊙ B .
Proof using truth table:
Input A | Input B | Output Q |
0 | 0 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
Thus, it is proved using the Truth Table that EX-NOR gate gives true output when the number of inputs is even.
Note:
All the complex logic gates can be deduced using only the basic logic gates. So, we should always remember the construction of basic logic gates and take help from their truth table and Boolean expression if there occurs any problem in any step while constructing these complex logic gates using basic gates.
Recently Updated Pages
Basicity of sulphurous acid and sulphuric acid are
Assertion The resistivity of a semiconductor increases class 13 physics CBSE
Three beakers labelled as A B and C each containing 25 mL of water were taken A small amount of NaOH anhydrous CuSO4 and NaCl were added to the beakers A B and C respectively It was observed that there was an increase in the temperature of the solutions contained in beakers A and B whereas in case of beaker C the temperature of the solution falls Which one of the following statements isarecorrect i In beakers A and B exothermic process has occurred ii In beakers A and B endothermic process has occurred iii In beaker C exothermic process has occurred iv In beaker C endothermic process has occurred
The branch of science which deals with nature and natural class 10 physics CBSE
What is the stopping potential when the metal with class 12 physics JEE_Main
The momentum of a photon is 2 times 10 16gm cmsec Its class 12 physics JEE_Main
Trending doubts
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Difference Between Plant Cell and Animal Cell
Fill the blanks with proper collective nouns 1 A of class 10 english CBSE
What is the color of ferrous sulphate crystals? How does this color change after heating? Name the products formed on strongly heating ferrous sulphate crystals. What type of chemical reaction occurs in this type of change.
One Metric ton is equal to kg A 10000 B 1000 C 100 class 11 physics CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Net gain of ATP in glycolysis a 6 b 2 c 4 d 8 class 11 biology CBSE
What organs are located on the left side of your body class 11 biology CBSE