The negation of the Boolean expression $x \leftrightarrow \sim y$ is equivalent to

  • A
    $(\sim x \wedge y) \vee (\sim x \wedge \sim y)$
  • B
    $(x \wedge \sim y) \vee (\sim x \wedge y)$
  • C
    $(x \wedge y) \vee (\sim x \wedge \sim y)$
  • D
    $(x \wedge y) \wedge (\sim x \vee \sim y)$

Explore More

Similar Questions

The logical expression $p \wedge (\sim p \vee \sim q) =$ ?

The symbolic form of the following circuit is (where $p$ and $q$ represent switches $S_{1}$ and $S_{2}$ being closed respectively):

If $p$: Every square is a rectangle and $q$: Every rhombus is a kite,then the truth values of $p \rightarrow q$ and $p \leftrightarrow q$ are $ . . . . . . $ and $ . . . . . . $ respectively.

State whether the "Or" used in the following statement is "exclusive" or "inclusive". Give reasons for your answer.
All integers are positive or negative.

Write the component statements of the following compound statement and check whether the compound statement is true or false.
"All living things have two legs and two eyes."

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo