31.The statement (p ∧ (p → q) ∧ (q → r)) → r is :- (1)a tautology
- (2)equivalent to p →∼ r
- (3)a fallacy
- (4)equivalent to q →∼ r
32.The compound proposition (p∧q)→p is- (1)A tautology
- (2)A contradiction
- (3)Neither (a) nor (b)
- (4)None of these
33.If (p∧∼r)→(∼p∨q) has truth value ' F ', then truth values of p,q and r respectively- (1)T,T,T
- (2)T, F, F
- (3)F, F, F
- (4)F, F, 'T'
34.Let p and q be two statements. Then (p∧(p⇒ q)) is equivalent to- (1)p∨(p∧( p))
- (2)p∨(( p)∧q)
- (3)( p)∨q
- (4)p∧(p∧q)
35.If c denotes the contradiction, then dual of the compound statement ∼p∧(q∨c) is- (1)∼p∨(q∧t)
- (2)∼p∧(q∨t)
- (3)p∨(∼q∨t)
- (4)∼p∨(q∧c)
36.The negation of the statement "The number is an odd number if and only if it is divisible by 3 ".- (1)The number is an odd number but not divisible by 3 or the number is divisible by 3 but not odd.
- (2)The number is not an odd number iff it is not divisible by 3 .
- (3)The number is not an odd number but it is divisible by 3 .
- (4)The number is not an odd number or is not divisible by 3 but the number is divisible by 3 or odd.
37.The negation of p∧(q→∼r) is- (1)p∨(q∧r)
- (2)∼p∧(q∧r)
- (3)∼p∨(q∧r)
- (4)p∨(q∨r)
38.The number of the real solutions of the equation: x|x+3|+|x−1|−2=0 is- (1)2
- (2)4
- (3)3
- (4)5
39.The number of integral values of x satisfying 5x−1<(x+1)2<7x−3 is- (1)0
- (2)1
- (3)2
- (4)3
40.Negation of the statement (p ∨ r) ⇒ (q ∨r) is :- (1)p∧∼ q∧∼ r
- (2)∼ p ∧ q∧∼ r
- (3)∼ p ∧ q ∧ r
- (4)p ∧ q ∧ r
41.The solution set of the inequation |x+4|x2+6x−7<0 is- (1)(−7,−4)
- (2)(−7,−4)∪(4,1)
- (3)(−7,1)
- (4)(−7,−4)∪(−4,1)
42.The product of all solutions of the equation e5(logex)2+3=x8,x>0, is :- (1)e8/5
- (2)e6/5
- (3)e2
- (4)e
43.(S1) (p⇒q)∨(p∧( q)) is a tautology (S2) (( p)⇒( q))∧(( p)∨q) is a contradiction. Then- (1)only (S2) is correct
- (2)both (S1) and (S2) are correct
- (3)Both (S1) and (S2) are wrong
- (4)only (S1) is correct
44.Consider the statement. “For an integer n, if n3−1 is even, then n is odd.” The contrapositive statement of this statement is:- (1)For an integer n, if n is odd, then n3−1 is even.
- (2)For an integer n, if n is even, then n3−1 is even.
- (3)For an integer n, if n is even, then n3−1 is odd.
- (4)For an integer n, if n3−1 is noteven, then n is even.
45.The negative of the statement (p∧q)→(∼p∨r) is- (1)p∨q∨∼r
- (2)p∧q∧∼r
- (3)∼p∨q∧r
- (4)∼p∨∼q∨∼r
46.The statement among the following that is a tautology is:- (1)A∧(A∨B)
- (2)B→[A∧(A→B)]
- (3)A∨(A∧B)
- (4)[A∧(A→B)]→B
47.The negation of the expression q∨(( q)∧p) is equivalent to- (1)( p)∧( q)
- (2)p∧( q)
- (3)( p)∨) ( q)
- (4)( p)∨q
48.Which of the following Boolean expressions is not a tautology ?- (1)(p ⇒ q) ∨ (∼ q ⇒ p)
- (2)(q ⇒ p) ∨ (∼ q ⇒ p)
- (3)(p ⇒∼ q) ∨ (∼ q ⇒ p)
- (4)(∼ p ⇒ q) ∨ (∼ q ⇒ p)
49.The negation of the statement " 72 is divisible by 2 and 3 " is- (1)72 is not divisible by 2 or 72 is not divisible by 3
- (2)72 is divisible by 2 or 72 is divisible by 3
- (3)72 is divisible by 2 and 72 is divisible by 3
- (4)72 is not divisible by 2 and 3
50.Which of the following is the negation of the statement "for all M > 0, there exists x ∈ S such that x ≥ M”- (1)there exists M > 0, such that x < M for all x ∈ S
- (2)there exists M > 0, there exists x ∈ S such that x ≥ M
- (3)there exists M > 0, there exists x ∈ S such that x < M
- (4)there exists M > 0, such that x ≥ M for all x ∈ S
51.The negation of the proposition "If 2 is prime, then 3 is odd" is- (1)if 2 is not prime then 3 is not odd
- (2)2 is prime and 3 is not odd
- (3)2 is not prime and 3 is odd
- (4)if 2 is not prime then 3 is odd
52.Which of the following statements is a tautology??- (1)p→(p∧(q→q))
- (2)(p∧q)→( (p)→q))
- (3)(p∧(p→q))→ q
- (4)p∨(p∧q)
53.The statementA→(B→A)is equivalent to:- (1)A→(A∧B)
- (2)A→(A∨B)
- (3)A→(A→B)
- (4)A→(A↔B)
54.Which of the following statements is a tautology ?- (1)((~p) v q) ⇒p
- (2)p ⇒ ((~p) v q)
- (3)((~p) v q) ⇒ q
- (4)q ⇒ ((~p) v q)
55.∼[(∼p)∧q] is logically equivalent to- (1)p∧(∼q)
- (2)∼(p∨q)
- (3)p∨(∼q)
- (4)∼[p∧(∼q)]
56.Which of the following statement is a tautology?- (1)((∼q)∧p)∧q
- (2)((∼q)∧p)∧(p∧(∼p))
- (3)((∼q)∧p)∨(p∨(∼p))
- (4)(p∧q)∧(∼(p∧q))
57.The logical statement (p→q)∧(q→∼p)is equivalent to- (1)∼p
- (2)p
- (3)p∧q
- (4)p∨q
58.Consider the two statements: (S1) : (p → q) ∨ (∼ q → p) is a tautology. (S2) : (p∧∼ q) ∧ (∼ p ∨ q) is a fallacy. Then :- (1)only (S1) is true.
- (2)both (S1) and (S2) are false.
- (3)both (S1) and (S2) are true.
- (4)only (S2) is true.
59.The converse of the contrapositive of the conditional p→∼q is- (1)∼q→p
- (2)p→q
- (3)∼p→q
- (4)∼p→∼q
60.The maximum number of compound propositions, out of p∨r∨s, p∨r∨~ s, p∨~q∨s, ~p∨~r∨s, ~p∨~r∨~s, ~p∨q∨~s, q∨r∨ ~ s, q∨ ~ r∨ ~ s, ~ p∨ - q∨ ~ s that can be made simultaneously true by an assignment of the truth values to p, q, r and s, is equal to
|