PRASHNIKAप्रश्निका
‹ Back to the paper

The Equivalence expression is .

Computer Science20251 markAssertion-reason

Assertion: The Equivalence expression is $p \leftrightarrow q$.

Reason: An Equivalence Statement always gives the final result as Contingencies.

  • aBoth A and R are true, and R is the correct explanation of A.
  • bBoth A and R are true, but R is not the correct explanation of A.
  • cA is true, but R is false.
  • dA is false, but R is true.

Answer

Answer

AI

Correct option: c

Answer: (c) A is true, but R is false. The biconditional/equivalence of p and q is written p <-> q, so A is true. R is false as a general claim: an equivalence statement is not always a contingency - for example p <-> p is a tautology (always true) and p <-> ~p is a contradiction (always false), so equivalence statements can also be tautologies or contradictions.
Boolean Algebra

From ISC Computer Science - Competency Focused Practice Questions (CISCE, August 2024), question 24.

Check your working with the Boolean algebra solver: the steps law by law, the K-map and the logic circuit for any expression.