The Gateway to Computer Science Excellence
0 votes
117 views

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$
in Digital Logic by Veteran
edited by | 117 views
0

$(A)$ is the correct answer.

$X$ $Y$ $X\Leftrightarrow Y$
T T T
T F F
F T F
F F T

 

2 Answers

0 votes

The given function is nothing but an EXNOR which is same as BICONDITIONAL.

[$\bigodot \equiv \Leftrightarrow$]

so option A is correct.

REFER:-> https://en.wikipedia.org/wiki/Logical_biconditional

by Active
0 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
by Junior

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,215 questions
59,981 answers
201,180 comments
94,636 users