edited by
1,334 views
4 votes
4 votes

In the given truth table, $f(x,y)$ represent the Boolean function.

$$\begin{array}{|c|c|c|} \hline x & y & f(x,y) \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 1 & 0 & 0 \\ \hline 1 & 1 & 1 \\ \hline \end{array}$$

  1. $x \leftrightarrow y$
  2. $ x \wedge y$
  3. $x \vee y$
  4. $x \rightarrow y$
edited by

2 Answers

1 votes
1 votes
→ The output of a digital logic Exclusive-NOR gate ONLY goes “HIGH” when its two input terminals, A and B are at the “SAME” logic level which can be either at a logic level “1” or at a logic level “0”.
→ In other words, an even number of logic “1’s” on its inputs gives a logic “1” at the output, otherwise is at logic level “0”.
→ This type of gate gives and output “1” when its inputs are “logically equal” or “equivalent” to each other, which is why an Exclusive-NOR gate is sometimes called an Equivalence Gate
Answer:

Related questions

2 votes
2 votes
2 answers
1
Arjun asked Dec 7, 2018
843 views
$(A+C’)(B’+C’)$ simplifies to$AC’+B’$$C(A’+B’)$$BC’+A$$AB’+C’$
4 votes
4 votes
2 answers
2
Arjun asked Dec 7, 2018
1,391 views
____ number of gates are required to implement the Boolean function $(AB+C)$ with using only $2$-input NOR gates.$2$$3$$4$$5$
1 votes
1 votes
3 answers
3
Arjun asked Dec 7, 2018
2,627 views
A RAM chip has a capacity of $1024$ words of $8$ bits each $(1K \times 8)$. The number of $2 \times 4$ decoders with enable line needed to construct a $32 K \times 8$ RAM...
1 votes
1 votes
1 answer
4
Arjun asked Dec 7, 2018
1,408 views
The hexadecimal representation of $(632)_8$ is$19A$$198$$29A$$291$