RankRizz

Logical connectives, truth tables and tautologies — JEE Main Previous Year Questions

Every JEE Main question on Logical connectives, truth tables and tautologies, one of the ideas inside Mathematical Reasoning: 108 questions from 2008–2023, 86 of them in the last five years. Newest first, answer key on every one. Free to read.

Questions

108

Years asked

14

Since

2008

Of the chapter

79%

Every Logical connectives, truth tables and tautologies question

81–100 OF 108 · NEWEST FIRST

JEE MAIN 2019 · 10 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the Boolean expression ∼s∨(∼r∧s)\sim s \vee (\sim r \wedge s) is equivalent to

  1. A

    r

  2. B

    s∧rs \wedge r

  3. C

    s∨rs \vee r

  4. D

    ∼s∧∼r\sim s \wedge \sim r

JEE MAIN 2019 · 09 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

If p⇒(q∨r)p \Rightarrow (q \lor r) is False, then the truth values of p, q, r are respectively, (where T is True and F is False)

  1. A

    T, F, F

  2. B

    F, T, T

  3. C

    F, F, F

  4. D

    T, T, F

JEE MAIN 2019 · 11 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If q is false and p∧q↔rp \wedge q \leftrightarrow r is true, then which one of the following statements is a tautology?

  1. A

    (p∨r)→(p∧r)(p \vee r) \to (p \wedge r)

  2. B

    (p∧r)→(p∨r)(p \wedge r) \to (p \vee r)

  3. C

    p∧rp \wedge r

  4. D

    p∨rp \vee r

JEE MAIN 2019 · 09 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The logical statement [∼(∼p∨q)∨(p∧r)]∧(∼q∧r)[\sim(\sim p \vee q) \vee (p \wedge r)] \wedge (\sim q \wedge r) is equivalent to:

  1. A

    (∼p∧∼q)∧r(\sim p \wedge \sim q) \wedge r

  2. B

    (p∧r)∧∼q(p \wedge r) \wedge \sim q

  3. C

    (p∧∼q)∨r(p \wedge \sim q) \vee r

  4. D

    ∼p∨r\sim p \vee r

JEE MAIN 2019 · 12 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The Boolean expression ((p∧q)∨(p∨∼q))∧(∼p∧∼q)((p \wedge q) \vee (p \vee \sim q)) \wedge (\sim p \wedge \sim q) is equivalent to

  1. A

    p∧(∼q)p \wedge (\sim q)

  2. B

    (∼p)∧(∼q)(\sim p) \wedge (\sim q)

  3. C

    p∨(∼q)p \vee (\sim q)

  4. D

    p∧qp \wedge q

JEE MAIN 2019 · 12 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The Boolean expression ∼(p⇒(∼q))\sim(p \Rightarrow (\sim q)) is equivalent to

  1. A

    (∼p)⇒q(\sim p) \Rightarrow q

  2. B

    q⇒∼pq \Rightarrow \sim p

  3. C

    p∨qp \vee q

  4. D

    p∧qp \wedge q

JEE MAIN 2018 · 16 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

If p→(∼p∨∼q)p \to (\sim p \vee \sim q) is false, then the truth values of p and q are, respectively:

  1. A

    F, F

  2. B

    T, T

  3. C

    F, T

  4. D

    T, F

JEE MAIN 2018 · 15 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If (p∧∼q)∧(p∧r)→∼p∨q(p \wedge \sim q) \wedge (p \wedge r) \rightarrow \sim p \vee q is false, then the truth values of p, q and r are respectively:

  1. A

    F, T, F

  2. B

    T, F, T

  3. C

    F, F, F

  4. D

    T, T, T

JEE MAIN 2018 · 08 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The Boolean expression ∼(p∨q)∨(∼p∧q)\sim(p \vee q) \vee (\sim p \wedge q) is equivalent to:

  1. A

    ∼q\sim q

  2. B

    ∼p\sim p

  3. C

    p

  4. D

    q

JEE MAIN 2018 · 08 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

A bag contains 4 red and 6 black balls. A ball is drawn at random from the bag, its color is observed and this ball along with two additional balls of the same color are returned to the bag. If now a ball is drawn at random from the bag, then the probability that this drawn ball is red, is:

  1. A

    34\frac{3}{4}

  2. B

    310\frac{3}{10}

  3. C

    25\frac{2}{5}

  4. D

    15\frac{1}{5}

JEE MAIN 2017 · 02 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The statement p→q→(∼p→q→q)p \to q \to (\sim p \to q \to q) is

  1. A

    A tautology

  2. B

    Equivalent to ∼p→q\sim p \to q

  3. C

    Equivalent to p→∼qp \to \sim q

  4. D

    A fallacy

JEE MAIN 2017 · 08 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The proposition (∼p)∨(p∧∼q)(\sim p) \vee (p \wedge \sim q) is equivalent to:

  1. A

    p→∼qp \to \sim q

  2. B

    p∧∼qp \wedge \sim q

  3. C

    q→pq \to p

  4. D

    none

JEE MAIN 2016 · 03 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The Boolean Expression (p∧∼q)∨q∨(∼p∧q)(p \wedge \sim q) \vee q \vee (\sim p \wedge q) is equivalent to

  1. A

    p∨qp \vee q

  2. B

    p∨∼qp \vee \sim q

  3. C

    ∼p∧q\sim p \wedge q

  4. D

    p∧qp \wedge q

JEE MAIN 2015 · 04 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The negation of ∼s∨(∼r∧s)\sim s \vee (\sim r \wedge s) is equivalent to

  1. A

    s∧rs \wedge r

  2. B

    s∧∼rs \wedge \sim r

  3. C

    s∧(r∧∼s)s \wedge (r \wedge \sim s)

  4. D

    s∨(r∨∼s)s \vee (r \vee \sim s)

JEE MAIN 2015 · 11 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

Consider the following statements:
P: Suman is brilliant
Q: Suman is rich
R: Suman is honest

The negation of the statement, "Suman is brilliant and dishonest if and only if Suman is rich" can be equivalently expressed as

  1. A

    ∼Q↔∼P∨R\sim Q \leftrightarrow \sim P \vee R

  2. B

    ∼Q↔P∨∼R\sim Q \leftrightarrow P \vee \sim R

  3. C

    ∼Q↔P∧∼R\sim Q \leftrightarrow P \wedge \sim R

  4. D

    ∼Q↔∼P∧R\sim Q \leftrightarrow \sim P \wedge R

JEE MAIN 2014 · 06 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The statement ∼(p↔∼q)\sim(p \leftrightarrow \sim q) is:

  1. A

    A tautology

  2. B

    A fallacy

  3. C

    Equivalent to p↔qp \leftrightarrow q

  4. D

    Equivalent to ∼p↔q\sim p \leftrightarrow q

JEE MAIN 2014 · 12 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

Let p, q, r denote arbitrary statements. Then the logically equivalent of the statement p⇒(q∨r)p \Rightarrow (q \vee r) is:

  1. A

    (p∨q)⇒r(p \vee q) \Rightarrow r

  2. B

    (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee (p \Rightarrow r)

  3. C

    (p⇒∼q)∧(p⇒r)(p \Rightarrow \sim q) \wedge (p \Rightarrow r)

  4. D

    (p⇒q)∧(p⇒∼r)(p \Rightarrow q) \wedge (p \Rightarrow \sim r)

JEE MAIN 2014 · 11 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The proposition ∼(p∨∼q)∨∼(p∨q)\sim (p \vee \sim q) \vee \sim (p \vee q) is logically equivalent to:

  1. A

    p

  2. B

    q

  3. C

    ∼p\sim p

  4. D

    ∼q\sim q

JEE MAIN 2013 · 23 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

For integers mm and nn, both greater than 1, consider the following three statements : P : m divides n Q : m divides n2n^2 R : m is prime, then

  1. A

    Q∧R→PQ \wedge R \rightarrow P

  2. B

    P∧Q→RP \wedge Q \rightarrow R

  3. C

    Q→RQ \rightarrow R

  4. D

    Q→PQ \rightarrow P

JEE MAIN 2013 · 22 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED

The statement p→(q→p)p \rightarrow (q \rightarrow p) is equivalent to :

  1. A

    p→qp \rightarrow q

  2. B

    p→(p∨q)p \rightarrow (p \vee q)

  3. C

    p→(p→q)p \rightarrow (p \rightarrow q)

  4. D

    p→(p∧q)p \rightarrow (p \wedge q)