closed by
692 views

1 Answer

0 votes
0 votes
$2$ -input XOR $\rightarrow F=A'B+AB'=m_1+m_2 \text{ [2 out of 4 min terms]}$
$3$ -input XOR $\rightarrow F=A \oplus B \oplus C = \Sigma m (1, 2, 4, 7) \text{ [4 out of 8 min terms]}$
(i.e.,) any EX-OR , EX-NOR gate contains half of total number minterms $6$ input EX-OR is $\frac{2^6}{2}=32 \text{ out of 64 minterms}$
Formula:
N-input EX-OR Gate contains $\frac{2^n}{2}$ number of minterms at its output.
Answer:

Related questions

1 votes
1 votes
1 answer
2
Applied Course asked Jan 16, 2019
526 views
How many number bits are required to represent a $32$ digit decimal number in binary?$6$ bits$32$ bits$106$ bits$107$ bits
1 votes
1 votes
1 answer
3
Applied Course asked Jan 16, 2019
514 views
What is the minimal form of the function of the given $k$-map, where $\phi$ is the don't care term?$a'b+bd+bc'$$a'b+bd+ad+bc'$$a'b+ad+bd$$a'b+bc'+ad$
1 votes
1 votes
1 answer
4
Applied Course asked Jan 16, 2019
728 views
$\begin{array}{l} A = 2000 \\ B = A - 999 \\ C = A + B - 998 \\ D = A + B + C - 997 \\ \vdots \\ \vdots \\ Z = A + B + C + \dots + Y - 975 \end{array}$How much $\frac{Z+1...