JEE MAIN 2019 · 10 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED
The negation of the Boolean expression ∼s∨(∼r∧s) is equivalent to
- A
- B
- C
- D
∼s∧∼r
JEE MAIN 2019 · 09 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED
If p⇒(q∨r) is False, then the truth values of p, q, r are respectively, (where T is True and F is False)
- A
- B
- C
- D
JEE MAIN 2019 · 11 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED
If q is false and p∧q↔r is true, then which one of the following statements is a tautology?
- A
(p∨r)→(p∧r)
- B
(p∧r)→(p∨r)
- C
- D
JEE MAIN 2019 · 09 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED
The logical statement [∼(∼p∨q)∨(p∧r)]∧(∼q∧r) is equivalent to:
- A
(∼p∧∼q)∧r
- B
(p∧r)∧∼q
- C
(p∧∼q)∨r
- D
JEE MAIN 2019 · 12 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED
The Boolean expression ((p∧q)∨(p∨∼q))∧(∼p∧∼q) is equivalent to
- A
p∧(∼q)
- B
(∼p)∧(∼q)
- C
p∨(∼q)
- D
JEE MAIN 2019 · 12 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED
The Boolean expression ∼(p⇒(∼q)) is equivalent to
- A
(∼p)⇒q
- B
q⇒∼p
- C
- D
JEE MAIN 2018 · 16 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED
If p→(∼p∨∼q) is false, then the truth values of p and q are, respectively:
- A
- B
- C
- D
JEE MAIN 2018 · 15 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED
If (p∧∼q)∧(p∧r)→∼p∨q is false, then the truth values of p, q and r are respectively:
- A
- B
- C
- D
JEE MAIN 2018 · 08 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The Boolean expression ∼(p∨q)∨(∼p∧q) is equivalent to:
- A
- B
- C
- D
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:
- A
- B
- C
- D
JEE MAIN 2017 · 02 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The statement p→q→(∼p→q→q) is
- A
- B
Equivalent to ∼p→q
- C
Equivalent to p→∼q
- D
JEE MAIN 2017 · 08 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The proposition (∼p)∨(p∧∼q) is equivalent to:
- A
- B
- C
- D
JEE MAIN 2016 · 03 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The Boolean Expression (p∧∼q)∨q∨(∼p∧q) is equivalent to
- A
- B
- C
- D
JEE MAIN 2015 · 04 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The negation of ∼s∨(∼r∧s) is equivalent to
- A
- B
- C
s∧(r∧∼s)
- D
s∨(r∨∼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
- A
∼Q↔∼P∨R
- B
∼Q↔P∨∼R
- C
∼Q↔P∧∼R
- D
∼Q↔∼P∧R
JEE MAIN 2014 · 06 APR OFFLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The statement ∼(p↔∼q) is:
- A
- B
- C
Equivalent to p↔q
- D
Equivalent to ∼p↔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) is:
- A
(p∨q)⇒r
- B
(p⇒q)∨(p⇒r)
- C
(p⇒∼q)∧(p⇒r)
- D
(p⇒q)∧(p⇒∼r)
JEE MAIN 2014 · 11 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The proposition ∼(p∨∼q)∨∼(p∨q) is logically equivalent to:
- A
- B
- C
- D
JEE MAIN 2013 · 23 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED
For integers m and n, both greater than 1, consider the following three statements : P : m divides n Q : m divides n2 R : m is prime, then
- A
Q∧R→P
- B
P∧Q→R
- C
- D
JEE MAIN 2013 · 22 APR ONLINELogical connectives, truth tables and tautologiesTRANSCRIBED
The statement p→(q→p) is equivalent to :
- A
- B
p→(p∨q)
- C
p→(p→q)
- D
p→(p∧q)