The negation of the statement ((A∧(B∨C))⇒(A∨B))⇒A is
- A.equivalent to B∨∼C
- B.equivalent to ∼A
- C.equivalent to ∼C
- D.a fallacy
Show answer
Answer: B
The statement (p∧(∼q))∨((∼p)∧q)∨((∼p)∧(∼q)) is equivalent to _________.
- A.(∼p)∨(∼q)
- B.p∨(∼q)
- C.p∨q
- D.(∼p)∨q
Show answer
Answer: A
Among the two statements
(S1) : (p⇒q)∧(p∧(∼q)) is a contradiction and
(S2) : (p∧q)∨((∼p)∧q)∨(p∧(∼q))∨((∼p)∧(∼q)) is a tautology
- A.both are false.
- B.only (S1) is true.
- C.both are true.
- D.only (S2) is true.
Show answer
Answer: C
Let f:[2,4]→R be a differentiable function such that
(xlogex)f′(x)+(logex)f(x)+f(x)≥1,x∈[2,4] with f(2)=21 and f(4)=41.
Consider the following two statements :
(A) : f(x)≤1, for all x∈[2,4]
(B) : f(x)≥81, for all x∈[2,4]
Then,
- A.Neither statement (A) nor statement (B) is true
- B.Only statement (A) is true
- C.Only statement (B) is true
- D.Both the statements (A) and (B) are true
Show answer
Answer: D
The number of ordered triplets of the truth values of p,q and r such that the truth value of the statement (p∨q)∧(p∨r)⇒(q∨r) is True, is equal to _________.
Show answer
Answer: 7
For a∈C, let A={z∈C:Re(a+zˉ)>Im(aˉ+z)} and B={z∈C:Re(a+zˉ)<Im(aˉ+z)}. Then among the two statements :
(S1) : If Re(a),Im(a)>0, then the set A contains all the real numbers
(S2) : If Re(a),Im(a)<0, then the set B contains all the real numbers,
- A.both are false
- B.only (S1) is true
- C.only (S2) is true
- D.both are true
Show answer
Answer: A
The converse of ((∼p)∧q)⇒r is
- A.((∼p)∨q)⇒r
- B.(∼r)⇒p∧q
- C.(p∨(∼q))⇒(∼r)
- D.(∼r)⇒((∼p)∧q)
Show answer
Answer: C
The negation of the statement (p∨q)∧(q∨(∼r)) is :
- A.((∼p)∨r)∧(∼q)
- B.(p∨r)∧(∼q)
- C.((∼p)∨(∼q))∨(∼r)
- D.((∼p)∨(∼q))∧(∼r)
Show answer
Answer: A
The statement ∼[p∨(∼(p∧q))] is equivalent to :
- A.(∼(p∧q))∧q
- B.∼(p∨q)
- C.(p∧q)∧(∼p)
- D.∼(p∧q)
Show answer
Answer: C
Negation of (p⇒q)⇒(q⇒p) is :
- A.(∼q)∧p
- B.q∧(∼p)
- C.p∨(∼q)
- D.(∼p)∨q
Show answer
Answer: B
The negation of (p∧(∼q))∨(∼p) is equivalent to :
- A.p∧q
- B.p∧(∼q)
- C.p∧(q∧(∼p))
- D.p∨(q∨(∼p))
Show answer
Answer: A
Statement (P⇒Q)∧(R⇒Q) is logically equivalent to :
- A.(P⇒R)∧(Q⇒R)
- B.(P⇒R)∨(Q⇒R)
- C.(P∧R)⇒Q
- D.(P∨R)⇒Q
Show answer
Answer: D
Among the statements :
(S1) : 20232022−19992022 is divisible by 8
(S2) : 13(13)n−12n−13 is divisible by 144 for infinitely many n∈N
- A.both (S1) and (S2) are incorrect
- B.only (S1) is correct
- C.only (S2) is correct
- D.both (S1) and (S2) are correct
Show answer
Answer: D
Among the statements
(S1) : (p⇒q)∨((∼p)∧q) is a tautology
(S2) : (q⇒p)⇒((∼p)∧q) is a contradiction
- A.neither (S1) and (S2) is True
- B.only (S2) is True
- C.both (S1) and (S2) are True
- D.only (S1) is True
Show answer
Answer: A
The negation of the expression q∨((∼q)∧p) is equivalent to
- A.(∼p)∧(∼q)
- B.(∼p)∨q
- C.p∧(∼q)
- D.(∼p)∨(∼q)
Show answer
Answer: A
(S1) (p⇒q)∨(p∧(∼q)) is a tautology
(S2) ((∼p)⇒(∼q))∧((∼p)∨q) is a contradiction.
Then
- A.only (S2) is correct
- B.both (S1) and (S2) are correct
- C.only (S1) is correct
- D.both (S1) and (S2) are wrong
Show answer
Answer: C
The number of values of r∈{p,q,∼p,∼q} for which ((p∧q)⇒(r∨q))∧((p∧r)⇒q) is a tautology, is :
- A.2
- B.1
- C.4
- D.3
Show answer
Answer: A
Among the statements :
(S1) ((p∨q)⇒r)⇔(p⇒r)
(S2) ((p∨q)⇒r)⇔((p⇒r)∨(q⇒r))
- A.only (S1) is a tautology
- B.neither (S1) nor (S2) is a tautology
- C.both (S1) and (S2) are tautologies
- D.only (S2) is a tautology
Show answer
Answer: B
The statement B⇒((∼A)∨B) is equivalent to :
- A.B⇒((∼A)⇒B)
- B.A⇒(A⇔B)
- C.A⇒((∼A)⇒B)
- D.B⇒(A⇒B)
Show answer
Answer: A, C, D
The statement (p∧(∼q))⇒(p⇒(∼q)) is
- A.a tautology
- B.equivalent to (∼p)∨(∼q)
- C.a contradiction
- D.p∨q
Show answer
Answer: A
Let Δ,∇∈{∧,∨} be such that (p→q)Δ(p∇q) is a tautology. Then
- A.Δ=∨,∇=∨
- B.Δ=∨,∇=∧
- C.Δ=∧,∇=∧
- D.Δ=∧,∇=∨
Show answer
Answer: A
Let Ω be the sample space and A⊆Ω be an event.
Given below are two statements :
(S1) : If P(A) = 0, then A=ϕ
(S2) : If P(A) = 1, then A=Ω
Then :
- A.both (S1) and (S2) are true
- B.both (S1) and (S2) are false
- C.only (S2) is true
- D.only (S1) is true
Show answer
Answer: A
The compound statement (∼(P∧Q))∨((∼P)∧Q)⇒((∼P)∧(∼Q)) is equivalent to
- A.((∼P)∨Q)∧(∼Q)
- B.(∼Q)∨P
- C.((∼P)∨Q)∧((∼Q)∨P)
- D.(∼P)∨Q
Show answer
Answer: C
Let p and q be two statements. Then ∼(p∧(p⇒∼q)) is equivalent to
- A.(∼p)∨q
- B.p∨(p∧(∼q))
- C.p∨(p∧q)
- D.p∨((∼p)∧q)
Show answer
Answer: A