01Hard115×since 2008Q4308The statement p→(q→p)p \to \left( {q \to p} \right)p→(q→p) is equivalent toAp→(p↔q)p \to \left( {p \leftrightarrow q} \right)p→(p↔q)Bp→(p→q)p \to \left( {p \to q} \right)p→(p→q)Cp→(p∨q)p \to \left( {p \vee q} \right)p→(p∨q)Dp→(p∧q)p \to \left( {p \wedge q} \right)p→(p∧q)Check answerSkip
02Medium115×since 2008Q4309Statement-1 : ∼(p↔∼q)\sim \left( {p \leftrightarrow \sim q} \right)∼(p↔∼q) is equivalent to p↔q{p \leftrightarrow q}p↔q. Statement-2 : ∼(p↔∼q)\sim \left( {p \leftrightarrow \sim q} \right)∼(p↔∼q) is a tautology.AStatement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1BStatement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1CStatement-1 is true, Statement-2 is falseDStatement-1 is false, Statement-2 is trueCheck answerSkip
03Hard115×since 2008Q4310Consider : Statement − I : (p∧∼q)∧(∼p∧q)\left( {p \wedge \sim q} \right) \wedge \left( { \sim p \wedge q} \right)(p∧∼q)∧(∼p∧q) is a fallacy. Statement − II :(p→q)↔(∼q→∼p)\left( {p \to q} \right) \leftrightarrow \left( { \sim q \to \sim p} \right)(p→q)↔(∼q→∼p) is a tautology.AStatement - I is True; Statement -II is true; Statement-II is not a correct explanation for Statement-IBStatement -I is True; Statement -II is False.CStatement -I is False; Statement -II is TrueDStatement -I is True; Statement -II is True; Statement-II is a correct explanation for Statement-ICheck answerSkip
04Hard115×since 2008Q4311The statement ∼(p↔∼q)\sim \left( {p \leftrightarrow \sim q} \right)∼(p↔∼q) is :Aequivalent to ∼p↔q{ \sim p \leftrightarrow q}∼p↔qBa tautologyCa fallacyDequivalent to p↔q{p \leftrightarrow q}p↔qCheck answerSkip
05Hard115×since 2008Q4314The following statement (p→q)→[(∼p→q)→q]\left( {p \to q} \right) \to \left[ {\left( { \sim p \to q} \right) \to q} \right](p→q)→[(∼p→q)→q] is :Aequivalent to ∼p→q{ \sim p \to q}∼p→qBequivalent to p→∼q{p \to \sim q}p→∼qCa fallacyDa tautologyCheck answerSkip
06Hard115×since 2008Q4319If the truth value of the statement p →\to→ (~q ∨\vee∨ r) is false (F), then the truth values of the statements p, q, r are respectively :AT, F, TBF, T, TCT, T, FDT, F, FCheck answerSkip
07Easy115×since 2008Q4320The negation of the Boolean expression ~ s ∨\vee∨ (~r ∧\wedge∧ s) is equivalent to :A~ s ∧\wedge∧ ~ rBrCs ∨\vee∨ rDs ∧\wedge∧ rCheck answerSkip
08Easy115×since 2008Q4321Which one of the following Boolean expressions is a tautology?A(p ∨\vee∨ q) ∧\wedge∧ (~ p ∨\vee∨ ~ q)B(p ∨\vee∨ q) ∨\vee∨ ( p ∨\vee∨ ~ q)C(p ∧\wedge∧ q) ∨\vee∨ ( p ∧\wedge∧ ~ q)D(p ∨\vee∨ q) ∧\wedge∧ ( p ∨\vee∨ ~ q)Check answerSkip
09Easy115×since 2008Q4322If p ⇒\Rightarrow⇒ (q ∨\vee∨ r) is false, then the truth values of p, q, r are respectively :-AF, F, FBT, F, FCF, T, TDT, T, FCheck answerSkip
10Easy115×since 2008Q4323For any two statements p and q, the negation of the expression p ∨\vee∨ (~p ∧\wedge∧ q) is :Ap↔\leftrightarrow↔qB~p∧\wedge∧~qCp∧\wedge∧qD~p∨\vee∨~qCheck answerSkip