Está en la página 1de 20

A book for Std.

XII, MHT-CET, ISEET and other Competitive Entrance Exams


Written according to the New Text book (2012-2013) published by the Maharashtra State
Board of Secondary and Higher Secondary Education, Pune.

Std. XII Sci.


Triumph Maths

Mr. Vinodkumar J. Pandey Mrs. Shama Mittal


B.Sc. (Mathematics) M.Sc., (Mathematics), B.Ed.
G. N. Khalsa College, Mumbai Punjabi University (Patiala)

Salient Features:
9 Exhaustive coverage of MCQs subtopic wise.
9 Each chapter contains three sections.
9 Section 1 contains easy level questions.
9 Section 2 contains competitive level questions.
9 Section 3 contains questions from various competitive exams.
9 Important formulae.
9 Hints provided wherever relevant.
9 Useful for MHT-CET and ISEET preparation.

Target PUBLICATIONS PVT. LTD.


Mumbai, Maharashtra
Tel: 022 – 6551 6551
Website : www.targetpublications.in
www.targetpublications.org
email : mail@targetpublications.in
Std. XII
Triumph Maths

©
Target Publications Pvt Ltd.

First Edition : October 2012

Price : ` 330/-

Printed at:
Vijaya Enterprises
Sion,
Mumbai

Published by
Target PUBLICATIONS PVT. LTD.
Shiv Mandir Sabhagriha,
Mhatre Nagar, Near LIC Colony,
Mithagar Road,
Mulund (E),
Mumbai - 400 081
Off.Tel: 022 – 6551 6551
email: mail@targetpublications.in
PREFACE
With the change in educational curriculum it’s now time for a change in Competitive Examinations.
NEET and ISEET are all poised to take over the decade old MHT-CET. The change is obvious not merely
in the names but also at the competitive levels. The state level entrance examination is ushered aside and the
battleground is ready for a National level platform. However, keeping up with the tradition, Target Publications
is ready for this challenge.
To be at pace with the changing scenario and equip students for a fierce competition, Target Publications
has launched the Triumph series. Triumph Maths is entirely based on Std XII (Science) curriculum of the
Maharashtra Board. This book will not only assist students with MCQs of Std. XII but will also help them
prepare for MHT-CET / NEET and ISEET and various other competitive examinations.
The content of this book has evolved from the State Board prescribed Text Book and we’ve made every
effort to include most precise and updated information in it. Multiple Choice Questions form the crux of this
book. We have framed them on every sub topic included in the curriculum. Each chapter is divided into three
sections:
Section 1 consists of basic MCQs based on subtopics of Text Book.
Section 2 consists of MCQs of competitive level.
Section 3 consists of MCQs compiled from various competitive examinations.
To end on a candid note, we make a humble request for students: Preserve this book as a Holy Grail. This
book would prove as an absolute weapon in your arsenal for your combat against Medical and Engineering
entrance examinations.

Best of luck to all the aspirants!

Yours faithfully
Publisher
Contents
Sr. No. Topic Name Page No.

1 Mathematical Logic 1

2 Matrices 16

3 Trigonometric Functions 40

4 Pair of Straight Lines 85

5 Circle 120

6 Conics 146

7 Vectors 174

8 Three Dimensional Geometry 198

9 Line 217

10 Plane 239

11 Linear Programming 269

12 Continuity 303

13 Differentiation 330

14 Applications of Derivatives 376

15 Integration 434

16 Definite Integral 494

17 Applications of Definite Integral 531

18 Differential Equations 554

19 Bivariate Frequency Distribution 589

20 Probability Distribution 604

21 Binomial Distribution 619


TARGET Publications Std. XII: Triumph Maths

01 MATHEMATICAL LOGIC
1. Logical Connectives:
Connective Symbol Example
And (Conjuction) ∧ p and q : p ∧ q
Or (Disjunction) ∨ p or q : p ∨ q
If … then (Conditional) → or ⇒ If p, then q: p → q
(Implication)
If and only if (Biconditional) ↔ or ⇔ p iff q : p ↔ q
(iff) (Double implication)
Not (Negation) ∼ p:∼p
The truth table of above logical connectives are as given below:
p q p ∨ q p ∧ q p → q p ↔ q p ~p
T T T T T T T F
T F T F F F F T
F T T F T F
F F F F T T
2. Types of Statements:
i. If a statement is always true, then the statement is called “tautology.”
ii. If a statement is always false, then the statement is called “contradiction.”
iii. If a statement is neither tautology nor a contradiction, then it is called “contingency.”
3. Converse, Contrapositive, Inverse of a Statement:
If p → q is a hypothesis, then
i. Converse: q → p
ii. Contrapositive: ~q → ~ p
iii. Inverse: ~p → ~q
Consider the truth table for each of the above:
p q ~p ~q p→q q→p ~q→~p ~p→~q
T T F F T T T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
From the above truth table, hypothesis and its contrapositive are logical equivalent. Also, the converse
and its inverse are equivalent.
4. Principles of Duality:
Two compound statements are said to be dual of each other, if one can be obtained from other by replacing
“∧” by “∨” and vice versa. The connectives “∧” and “∨” are duals of each other.
5. Negation of a Statement:
i. ~ (p ∨ q) ≡ ~ p ∧ ~ q
ii. ~ (p ∧ q) ≡ ~ p ∨ ~ q
iii. ~ (p → q) ≡ p ∧ ~ q
iv. ~ (p ↔ q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)
1
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

6. Application of Logic to Switching Circuits:


i. AND : [∧]
Let p : S1 switch is ON S1 S2
q : S2 switch is ON
L
then for the lamp L to be ‘ON’ both S1 and S2 must be put ON
Which logically indicates truth table of AND.
∴ the adjacent circuit resembles p ∧ q.
ii. OR : [∨] S1
Let p : S1 switch is ON
q : S2 switch is ON
for lamp L to be put ON either of S1 or S2 must be S2
L
put ON even both can be put ON.
Which resembles truth table of OR.
∴ the adjacent circuit resembles p ∨ q.
iii. If two or more switch open or close simultaneously then the switches are denoted by the same letter.
If p : switch S is closed.
~ p : switch S is open.
If S1 and S2 are two switches such that if S1 is open; S2 is closed and vice versa.
then S1 ≡ ~ S2
or S2 ≡ ~ S1

Shortcuts
1. p∨q=q∨p Commutative property
p∧q=q∧p
2. (p ∨ q) ∨ r = p ∨ (q ∨ r)
Associative property
(p ∧ q) ∧ r = p ∧(q ∧ r)
3. p ∨ (q ∧ r) = (p ∨ q) ∧ (p ∨ r)
Distributive property
p ∧ (q ∨ r) = (p ∧ q) ∨ (p ∧ r)
4. ~ (p ∨ q) = ~ p ∧ ~ q Demorgan’s law
~ (p ∧ q) ≡ ~ p ∨ ~ q
5. p→q≡~p∨q
p ↔ q ≡ (p → q) ∧ (q → p) Equivalent statements
≡ (~ p ∨ q) ∧ (~ q ∨ p)
6. p ∨ (p ∧ q) = p Absorption laws
p ∧ (p ∨ q) = p
7. If T denotes the tautology and F denotes the contradiction, then for any statement ‘p’:
i⋅ p ∨ T = T; p ∨ F = p Identity laws
ii. p ∧ T = p; p ∧ F = F
8. i. p∨~p=T
ii. p∧~p=F
iii. ∼(∼p) = p Complement laws
iv. ∼T=F
v. ∼F=T
9. p∨p=p
Idempotent laws
p∧p=p

2 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
9. If p: Sita gets promotion, q: Sita is transferred
SECTION - 1 to Pune.
The verbal form of ~p ↔ q is written as
1.1 Statement, Logical Connectives, Compound
Statements and Truth Table (A) Sita gets promotion and Sita gets
transferred to Pune.
1. Which of the following is a statement in logic? (B) Sita does not get promotion then Sita
(A) What a wonderful day! will be transferred to Pune.
(B) Shut up! (C) Sita gets promotion if Sita is transferred
(C) What are you doing? to Pune.
(D) Bombay is the capital of India. (D) Sita does not get promotion if and only
if Sita is transferred to Pune.
2. Which of the following is a statement?
(A) Open the door. 10. p = There are clouds in the sky and q = it is
not raining. The symbolic form is
(B) Do your homework.
(A) p → q (B) p → ~q
(C) Switch on the fan.
(C) p ∧ ~q (D) ~p ∧ q
(D) Two plus two is four.
11. Write in verbal form: p: he is fat, w: he is hard
3. Which of the following is an open statement?
working, then (~p) ∨ (~w) is
(A) x + 5 = 11
(A) If he is fat or he is hard working.
(B) Good morning to all.
(B) He is not fat and he is not hard working.
(C) What is your problem?
(C) He is not fat or he is not hard working.
(D) Listen to me, Rahul!
(D) He is fat or hard working.
4. Which of the following is not a proposition in
12. If p: Rohit is tall, q: Rohit is handsome, then
logic.
the statement ‘Rohit is tall or he is short and
(A) 3 is a prime handsome’ can be written symbolically as
(B) 2 is an irrational number (A) p ∨ (~p ∧ q) (B) p ∧ (~p ∨ q)
(C) Mathematics is interesting (C) p ∨ (p ∧ ~q) (D) ~p ∧ (~p ∧ ~q)
(D) 5 is an even integer 13. p: Sunday is a holiday, q: Ram does not study
5. Which of the following is a statement in on holiday.
Logic? The symbolic form of the statement
(A) Go away (B) How beautiful! ‘Sunday is a holiday and Ram studies on
(C) x > 5 (D) 2 = 3 holiday’ is
(A) p ∧ ~q (B) p ∧ q
6. Using quantifiers ∀, ∃, convert the following (C) ~p ∧ ~q (D) p ∨ ~q
open statement into true statement.
‘x + 5 = 8, x ∈ N’ 14. The converse of the statement ‘If I work hard
then I get the grade’ is
(A) ∀ x ∈ N, x + 5 = 8
(A) If I get the grade then I work hard.
(B) For every x ∈ N, x + 5 > 8 (B) If I don’t work hard then I don’t get the
(C) ∃ x ∈ N, such that x + 5 = 8 grade.
(D) For every x ∈ N, x + 5 < 8 (C) If I don’t get the grade then I don’t work
hard.
7. ~(p ∨ q) is
(D) If I work hard then I don’t get the grade.
(A) ~p ∨ q (B) p ∨ ~q
(C) ~p ∨ ~q (D) ~p ∧ ~q 15. The converse of ‘If x is zero then we cannot
divide by x’ is
8. If p: The sun has set, q: The moon has risen, (A) If we cannot divide by x then x is zero.
then symbolically the statement ‘The sun has (B) If we divide by x then x is non-zero.
not set or the moon has not risen’ is written as (C) If x is non-zero then we can divide by x.
(A) p ∧ ~q (B) ~q ∨ p (D) If we cannot divide by x then x is
(C) ~p ∧ q (D) ~p ∨ ~q non-zero.
3
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

16. Write verbally ~p ∨ q where 24. When two statements are connected by the
p: She is beautiful; q: She is clever connective ‘if’ then the compound statement is
(A) She is beautiful but not clever called
(B) She is not beautiful or she is clever (A) conjunctive statement.
(C) She is not beautiful or she is not clever (B) disjunctive statement.
(D) She is beautiful and clever. (C) biconditional statement.
17. If p: Ram is lazy, q: Ram fails in the (D) conditional statement.
examination, then the verbal form of ~p ∨ ~q 25. For the statements ‘p’ and ‘q’ ‘p → q’ is read
is as if p then q. Here, the statement ‘q’ is called
(A) Ram is not lazy and he fails in the (A) antecedent.
examination. (B) consequent.
(B) Ram is not lazy or he does not fail in the (C) logical connective.
examination.
(D) prime component.
(C) Ram is lazy or he does not fail in the
examination. 26. The contrapositive of the statement: “If a child
(D) Ram is not lazy and he does not fail in concentrates then he learns” is
the examination. (A) If a child does not concentrate he can
not learn.
18. The inverse of logical statement p → q is
(B) If a child does not learn then he does not
(A) ~p → ~q (B) p ↔ q
concentrate.
(C) q → p (D) q ↔ p
(C) If a child practises then he learns.
19. Let p: Mathematics is interesting, (D) If a child concentrates, he can’t forget.
q: Mathematics is difficult, then the symbol
p → q means 27. A compound statement p or q is false only
(A) Mathematics is interesting implies that when
Mathematics is difficult. (A) p is false.
(B) Mathematics is interesting is implied by (B) q is false.
Mathematics is difficult. (C) both p and q are false.
(C) Mathematics is interesting and (D) depends on p and q.
Mathematics is difficult.
28. A compound statement p and q is true only
(D) Mathematics is interesting or
when
Mathematics is difficult.
(A) p is true.
20. Which of the following is logically equivalent (B) q is true.
to ~(p ∧ q) (C) both p and q are true.
(A) p ∧ q (B) ~p ∨ ~q (D) none of p and q is true.
(C) ~(p ∨ q) (D) ~p ∧ ~q
29. A compound statement p → q is false only
21. ~(p → q) is equivalent to when
(A) p ∧ ∼q (B) ~p ∨ q (A) p is true and q is false.
(C) p ∨ ~q (D) ~p ∧ ~q (B) p is false but q is true.
22. Contrapositive of p → q is (C) atleast one of p or q is false.
(A) q → p (B) ~q → p (D) both p and q are false.
(C) ~q → ~p (D) q → ~p 30. The statement, ‘if it is raining then I will go to
23. When two statements are connected by logical college’ is equivalent to
connective ‘and’, then the compound (A) If it is not raining then I will not go to
statement is called college.
(A) conjunctive statement. (B) If I do not go to college, then it is not
(B) disjunctive statement. raining.
(C) negation statement. (C) If I go to college then it is raining.
(D) conditional statement. (D) Going to college depends on my mood.
4 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
31. The converse of the statement “If Sun is not 38. Every conditional statement is equivalent to
shining, then sky is filled with clouds” is (A) its contrapositive (B) its inverse
(A) If sky is filled with clouds, then the Sun (C) its converse (D) only itself
is not shining.
39. If p : Pappu passes the exam,
(B) If Sun is shining, then sky is filled with
q : Papa will give him a bicycle.
clouds
Then the statement ‘Pappu passing the exam,
(C) If sky is clear, then Sun is shining
implies that his papa will give him a bicycle’
(D) If Sun is not shining, then sky is not
can be symbolically written as
filled with clouds
(A) p → q (B) p ↔ q
32. Which of the following is the converse of the (C) p ∧ q (D) p ∨ q
statement ‘If Billu secures good marks, then
he will get a bicycle’? 40. The symbolic form of the statement ‘Since it
(A) If Billu will not get bicycle, then he will is raining the atmosphere is very cold’ is
secure good marks. (A) p → q (B) p ↔ q
(B) If Billu will get a bicycle, then he will (C) p ∧ q (D) p ∨ q
secure good marks.
41. Assuming the first part of each statement as p,
(C) If Billu will get a bicycle, then he will
second as q and the third as r, the statement
not secure good marks.
‘Candidates are present, and voters are ready to
(D) If Billu will not get a bicycle, then he
vote but no ballot papers’ in symbolic form is
will not secure good marks.
(A) (p ∨ q) ∧ ∼r (B) (p ∧ ~q) ∧ r
33. The contrapositive of the statement ‘If (C) (~p ∧ q) ∧ ∼r (D) (p ∧ q) ∧ ∼r
Chandigarh is capital of Punjab, then
Chandigarh is in India’, is 42. Assuming the first part of each statement as p,
(A) If Chandigarh is not in India, then second as q and the third as r, the statement ‘A
Chandigarh is not a capital of Punjab monotonic increasing sequence which is
(B) If Chandigarh is in India, then bounded above is convergent’ in symbolic
Chandigarh is capital of Punjab form is
(C) If Chandigarh is not capital of Punjab, (A) (p ∧ q) → r (B) (p ∨ q) → r
then Chandigarh is not capital of India (C) (p ∧ q) ↔ r (D) (p ∨ q) ↔ r
(D) If Chandigarh is capital of Punjab, then
43. Assuming the first part of each statement as p,
Chandigarh is not in India
second as q and the third as r, the statement ‘If
34. The connective in the statement “2 + 7 > 9 or A, B, C are three distinct points, then either
2 + 7 < 9” is they are collinear or they form a triangle’ in
(A) and (B) or symbolic form is
(C) > (D) < (A) p ↔ (q ∨ r) (B) (p ∧ q) → r
35. The connective in the statement “Earth (C) p → (q ∨ r) (D) p → (q ∧ r)
revolves round the Sun and Moon is a satellite
44. If d: Drunk, a: accident, translate the statement
of earth”, is
‘If the Driver is not drunk, then he cannot
(A) or (B) Earth
meet with an accident’ into symbols.
(C) Sun (D) and
(A) ∼a → ∼d (B) ∼d → ∼a
36. The converse of the statement “If x > y, then (C) ~d ∧ a (D) a ∧ ~d
x + a > y + a”, is
(A) If x < y, then x + a < y + a 1.2 Statement Pattern and Logical Equivalence:
(B) If x + a > y + a, then x > y Tautology, Contradiction, Contingency
(C) If x < y, then x + a > y + a
45. Statement ~p ↔ ~q ≡ p ↔ q is
(D) If x > y, then x + a < y + a
(A) a tautology (B) a contradiction
37. The statement “If x2 is not even then x is not (C) contingency (D) proposition
even”, is the converse of the statement
(A) If x2 is odd, then x is even 46. Given that p is ‘false’ and q is ‘true’ then the
(B) If x is not even, then x2 is not even statement which is ‘false’ is
(C) If x is even, then x2 is even (A) ~p → ~q (B) p → (q ∧ p)
(D) If x is odd, then x2 is even (C) p → ~q (D) q → ~p
5
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

47. When the compound statement is true for all 54. One of the negations of the statement ‘I will
its components then the statement is called have tea or coffee’ is wrong. Point it out.
(A) negation statement. (A) I will not have both tea and coffee.
(B) tautology statement. (B) I will neither have tea nor coffee.
(C) contradiction statement. (C) I won’t have any of tea or coffee.
(D) contingency statement.
(D) I will have none of tea and coffee.
1.3 Duality
55. The negation of ‘If it is Sunday then it is a
48. Dual of the statement (p ∧ q) ∨ ~q ≡ p ∨ ~q is holiday’ is
(A) (p ∨ q) ∨ ~q ≡ p ∨ ~q (A) It is a holiday but not a Sunday.
(B) (p ∧ q) ∧ ~q ≡ p ∧ ~q (B) No Sunday then no holiday.
(C) (p ∨ q) ∧ ~q ≡ p ∧ ~q (C) Even though it is Sunday, it is not a
(D) (~p ∨ ~q) ∧ q ≡ ~p ∧ q holiday,
(D) No holiday therefore no Sunday.
49. The dual of the statement “Manoj has the job
but he is not happy” is 56. The negation of the statement ‘The product
(A) Manoj has the job or he is not happy. of 3 and 4 is 9’, is
(B) Manoj has the job and he is not happy. (A) The product of 3 and 4 is not 12.
(C) Manoj has the job and he is happy. (B) The product of 3 and 4 is 12.
(D) Manoj does not have the job and he is
(C) It is false that the product of 3 and 4 is
happy.
not 9.
50. The dual of the statement ‘Mango and Apple (D) It is false that the product of 3 and 4 is
are sweet fruits’ is 9.
(A) Mango and Apple are not sweet fruits.
(B) Mango is sweet fruit but not apple. 57. The contrapositive of the statement ‘If 7 is
(C) Apple is sweet fruit but not mango. greater than 5, then 8 is greater than 6’, is
(D) Mango or Apple are sweet fruits. (A) If 8 is greater than 6, then 7 is greater
than 5.
1.4 Negation of compound statements
(B) If 8 is not greater than 6, then 7 is
51. ~[p ∨ (~q)] is equal to greater than 5.
(A) ~p ∨ q (C) If 8 is not greater than 6, then 7 is not
(B) (~p) ∧ q greater than 5.
(C) ~p ∨ ~p (D) If 8 is greater than 6, then 7 is not
(D) ~p ∧ ~q greater than 5.
52. Write Negation of ‘For every natural number 1.5 Switching circuit
x, x + 5 > 4’.
(A) ∀ x ∈ N, x + 5 < 4 58. Consider the circuit,
(B) ∀ x ∈ N, x − 5 < 4
(C) For every integer x, x + 5 < 4 p q
(D) There exists a natural number x, for
which x + 5 ≤ 4
53. One of the negations of the statement ‘Some
people are honest’ given below is incorrect. r
Point it out. Then, the current flow in the circuit is
(A) All are dishonest. (A) (p ∧ q) ∨ r
(B) All are not honest.
(B) (p ∧ q)
(C) None is honest.
(D) It is not true that, ‘Some people are (C) (p ∨ q)
honest’. (D) None of these

6 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
10. If p is false and q is true, then
SECTION - 2
(A) p ∧ q is true (B) p ∨ ∼q is true
1.1 Statement, Logical Connectives, Compound (C) q → p is true (D) p → q is true
Statements and Truth Table
11. Assuming the first part of the sentence as p
1. If p and q have truth value ‘F’ then and the second as q, write the following
(~p ∨ q) ↔ ~(p ∧ q) and ~p ↔ (p → ~q) statement symbolically:
respectively are ‘Irrespective of one being lucky or not, one
(A) T, T (B) F, F should not stop working’.
(C) T, F (D) F, T (A) (p ∧ ~p) ∨ q (B) (p ∨ ~p) ∧ q
2. Given ‘p’ and ‘q’ as true and ‘r’ as false, the (C) (p ∨ ~p) ∧ ~q (D) (p ∧ ~p) ∨ ~q
truth values of ~p ∧ (q ∨ ~r) and (p → q) ∧ r
respectively are 12. If first part of the sentence is p and the second
is q, the symbolic form of the statement ‘It is
(A) T, F (B) F, F
not true that Mathematics is not interesting or
(C) T, T (D) F, T
difficult’.
3. If p is true and q is false then (A) ∼(∼p ∧ q) (B) (∼p ∨ q)
(p → q) ↔ (~q → ~p) and (~p ∨ q) ∧ (~q ∨ p)
(C) (∼p ∨ ~q) (D) ∼(∼p ∨ q)
respectively are
(A) F, F (B) F, T 13. The symbolic form of the statement ‘It is not
(C) T, F (D) T, T true that intelligent persons are neither polite
4. Truth value of the statement ‘It is false that nor helpful’ is
3 + 3 = 33 or 1 + 2 = 12’ is (A) ~(p ∨ q) (B) ∼(∼p ∧ ∼q)
(A) T (B) F (C) ~(~p ∨ ~q) (D) ~(p ∧ q)
(C) both T and F (D) 54
14. Find out which of the following statements
5. Which of the following is logically equivalent have the same meaning:
to ~[p → (p ∨ ~q)]? i. If Seema solves a problem then she is
(A) p ∨ (~p ∧ q ) (B) p ∧ (~p ∧ q) happy.
(C) p ∧ (p ∨ ~q) (D) p ∨ (p ∧ ~q) ii. If Seema does not solve a problem then
6. If ∼q ∨ p is F then which of the following is she is not happy.
correct? iii. If Seema is not happy then she hasn’t
(A) p ↔ q is T (B) p → q is T solved the problem.
(C) q → p is T (D) p → q is F iv. If Seema is happy then she has solved
7. If p, q are true and r is false statement then the problem
which of the following is true statement? (A) (i, ii) and (iii, iv)
(A) (p ∧ q) ∨ r is F (B) i, ii, iii
(B) (p ∧ q) → r is T (C) (i, iii) and (ii, iv)
(C) (p ∨ q) ∧ (p ∨ r) is T (D) ii, iii, iv
(D) (p → q) ↔ (p → r) is T 15. Find out which of the following statements
8. If p is the statement ‘Sun rises in the West’, have the same meaning:
and q is any statement, state which one of the i. If Humpty sit on a wall then he will fall.
following is incorrect. ii. If Humpty falls then he was sitting on a
(A) (p and q), is always false. wall.
(B) (p → q), is always true. iii. If Humpty does not fall then he was not
(C) (∼p or q), is always true. sitting on the wall.
(D) depends on what q is. iv. If Humpty does not sit on a wall then he
9. Which of the following is true? does not fall.
(A) p ∧ ∼p ≡ T (A) (i, iv) and (ii, iii)
(B) p ∨ ∼p ≡ F (B) (i, ii) and (iii, iv)
(C) p → q ≡ q → p (C) i, ii, iii
(D) p → q ≡ (~q) → (∼p) (D) (i, iii) and (ii, iv)
7
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

16. Find which of the following statements 1.3 Duality


convey the same meanings?
i. If it is the bride’s dress then it has to be 24. Duals of the following statements are given.
red. which one is not correct?
ii. If it is not bride’s dress then it cannot be (A) (p ∨ q) ∧ (r ∨ s), (p ∧ q) ∨ (r ∧ s)
red. (B) [p ∨ (~q)] ∧ (~p), [p ∧ (~q)] ∨ (~p)
iii. If it is a red dress then it must be the (C) (p ∧ q) ∨ r, (p ∨ q) ∧ r
bride’s dress.
(D) (p ∨ q) ∨ s, (p ∧ q) ∨ s
iv. If it is not a red dress then it can’t be the
bride’s dress. 25. Which of the following statements is dual of
(A) (i, iv) and (ii, iii) the statement (p ∨ q) ∨ r?
(B) (i, ii) and (iii, iv) (A) (p ∧ q) ∧ r (B) (p ∨ q) ∧ r
(C) (i), (ii), (iii) (C) (p ∧ q) ∨ r (D) ~[(p ∨ q) ∨ r]
(D) (i, iii) and (ii, iv)
1.2 Statement Pattern and Logical Equivalence: 26. The dual of ‘(p ∧ t) ∨ (c ∧ ~q)’ where t is a
Tautology, Contradiction, Contingency tautology and c is a contradiction, is
(A) (p ∨ c) ∧ (t ∨ ~q)
17. The proposition p → ~(p ∧ ~q) is (B) (~p ∧ c) ∧ (t ∨ q)
(A) contradiction. (B) a tautology. (C) (~p ∨ c) ∧ (t ∨ q)
(C) contingency. (D) none of these
(D) (~p ∨ t) ∧ (c ∨ ~q)
18. The proposition (p → q) ↔ ( ∼p → ∼q) is a
1.4 Negation of compound statements
(A) tautology (B) contradiction
(C) contingency (D) None of these 27. The negation of the statement “If Saral Mart
does not reduce the prices, I will not shop
19. The statement (p ∧ q) → p is
there any more” is
(A) a contradiction. (B) a tautology.
(A) Saral Mart reduces the prices and still I
(C) either (A) or (B) (D) a contingency.
will shop there.
20. ∼(p ↔ q) is equivalent to (B) Saral Mart reduces the prices and I will
(A) (p ∧ ∼q) ∨ (q ∧ ∼p) not shop there.
(B) (p ∨ ∼q) ∧ (q ∨ ∼p) (C) Saral Mart does not reduce the prices
(C) (p → q) ∧ (q → p) and still I will shop there.
(D) None of these (D) Saral Mart does not reduce the prices or
I will shop there.
21. The proposition (p ∧ q) → (p ∨ q) is a
(A) tautology and contradiction. 28. Negation of the statement: “If Dhoni looses
(B) neither tautology nor contradiction. the toss then the team wins”, is
(C) contradiction. (A) Dhoni does not lose the toss and the
(D) tautology. team does not win.
22. Which of the following is a tautology? (B) Dhoni loses the toss but the team does
(A) p → (p ∧ q) not win.
(B) q ∧ (p → q) (C) Either Dhoni loses the toss or the team
wins.
(C) ∼(p → q) ↔ p ∧ ∼q
(D) Dhoni loses the toss iff the team wins.
(D) (p ∧ q) ↔ ∼q
23. Which of the following statement is a 29. Negation of the proposition (p ∨ q) ∧ (∼q ∧ r)
contingency. is
(A) (p ∧ ∼q) ∨ ∼(p ∧ ∼q) (A) (p ∧ q) ∨ (q ∨ ∼r)
(B) (p ∧ q) ↔ (∼p → ∼q) (B) (∼p ∨ ∼q) ∧ (∼q ∧ r)
(C) [p ∧ (p → ∼q)] → q (C) (∼p ∧ ∼q) ∨ (q ∨ ∼r)
(D) None of these (D) None of these
8 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
1.5 Switching circuit 32. If the symbolic form is
30. The switching circuit for the statement (p ∧ r) ∨ (~q ∧ ~r) ∨ (~p ∧ ~r), then switching
[p ∧ (q ∨ r)] ∨ (~p ∨ s) is circuit is:

q S2
(A) S′1
p p′ s
(A)
r S1′ S3

q p′ S′2
(B) S′3
p
r s S1 S3
q (B)
p S′2 S′3
(C) r
p′
S1′ S′3
s
q (C) S2 S3
S1
p
(D) r
S′1 S′2 S′3
p′

s′
S′1 S3
31. The simplified circuit for the following circuit
is
(D) S2 S′3
p q
HF011
S′1 S3
p′ q

33. The symbolic form of logic for the following


(A) circuit is:
p

S1 S2
(B) q S3
S′1
S′2
(C)
p q S′3
(A) (p ∨ q) ∧ (~p ∧ r ∨ ~q) ∨ ~r
q′ (B) (p ∧ q) ∧ (~p ∨ r ∧ ~q) ∨ ~r
(D) p (C) (p ∧ q) ∨ [~p ∧ (r ∨ ~q)] ∨ ~r
(D) (p ∨ q) ∧ [~p ∨ (r ∧ ~q)] ∨ ~rHF012
9
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

34. The simplified circuit for the following circuit 37. Simplified form of the switching circuit
is
S′1
S′1 S′2
S′2

S1 S3 S1 S2

S2
S′1 S2
(A)
S1
(A) S1′ S′2
(B)
S2 S2

S1′
(C)
S′1 (B)
S2
(D) (C)
S3 S1
35. For the symbolic form
(p ∨ q) ∧ [~p ∨ (r ∧ ~q)] the switching circuit S1
is: (D)
S1′ S′2
(A) S1 S′1
SECTION - 3
S2 S3 S′2 1.1 Statement, Logical Connectives, Compound
S1 Statements and Truth Table
(B) S′1
S2 S2 1. If p ⇒ (∼p ∨ q) is false, the truth values of p
S3 S′2
and q respectively, are [Karn. 02]
(A) F, T (B) F, F
(C) S1 S′1 S3 (C) T, T (D) T, F
2. If p → (q ∨ r) is false then the truth values of
p, q, r are respectively. [Karn. CET 1997]
S2 S′2
(A) T, F, F
(B) F, F, F
(D) S1 S′1 (C) F, T, F
(D) T, T, F
S3 S3 S′2 3. The contrapositive of (p ∨ q) → r is
36. The switching circuit [Karn. 1990]
(A) ∼r → ∼p ∧ ∼q
S1 S2 (B) ∼r → (p ∨ q)
(C) r → (p ∨ q)
S′1 (D) p → (q ∨ r)
S1 S′2 4. The converse of the contrapositive of p → q is
in symbolic form of logic, is: [Karn. CET 2005]
(A) (p ∧ q) ∨ (~p) ∨ (p ∧ ~q) (A) ∼p → q
(B) (p ∨ q) ∨ (~p) ∨ (p ∧ ~q) (B) p → ∼q
(C) (p ∧ q) ∧ (~p) ∨ (p ∧ ~q) (C) ∼p → ∼q
(D) (p ∨ q) ∧ (~p) ∨ (p ∧ ~q)019
(D) ∼q → p
10 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
1.2 Statement Pattern and Logical Equivalence: 10. The negation of q ∨ ∼(p ∧ r) is
Tautology, Contradiction, Contingency [Karn. CET 1997]
(A) ∼q ∧ ∼(p ∨ r) (B) ∼q ∧ (p ∧ r)
5. The logically equivalent statement of p ↔ q is
(C) ∼q ∨ (p ∧ r) (D) ∼q ∨ (p ∧ r)
[Karn. 2000]
(A) (p ∧ q) ∨ (q → p) (B) (p ∧ q) → ( p ∨ q) 1.5 Switching circuit
(C) (p → q) ∧ (q →p) (D) (p ∧ q) ∨ (p ∧ q)
11. When does the current flow through the
6. The proposition (p → ∼p) ∧ (∼p → p) is a following circuit. [Karn. CET 2002]
[MHT Asso. 2006], [Karn. 1997]
(A) Neither tautology nor contradiction q
(B) Tautology
(C) Tautology and contradiction
(D) Contradiction p r

7. (p ∧ ∼q) ∧ (∼p ∧ q) is a [Karn. 2003]


(A) Tautology q′
(B) Contradiction (A) p, q should be closed and r is open
(C) Tautology and a contradiction (B) p, q, r should be open
(D) Contingency (C) p, q, r should be closed
(D) none of these
8. The false statement in the following is
[Karn. CET 2002] 12. The following circuit represent symbolically
(A) p ∧ (∼p) is a contradiction in logic when the current flow in the circuit.
(B) p ∨ (∼p) is a tautology [Karn. CET 1999]
(C) ∼ (∼p) ↔ p is tautology
(D) (p → q) ↔ (∼q ⇒ ∼p) is a contradiction ~p q

1.4 Negation of compound statements


9. The negation of the statement given by p ~q
“He is rich and happy” is
(A) (∼p ∨ q) ∨ (p ∨ ∼q)
[MH-CET 2006]
(A) He is not rich and not happy (B) (∼p ∧ p) ∧ (∼q ∧ q)
(B) He is rich but not happy (C) (∼p ∧ ∼q) ∧ (q ∧ p)
(C) He is not rich but happy (D) (∼p ∧ q) ∨ (p ∧ ∼q)
(D) Either he is not rich or he is not happy

Answers Key to Multiple Choice Questions


Section 1
1. (D) 2. (D) 3. (A) 4. (C) 5. (D) 6. (C) 7. (D) 8. (D) 9. (D) 10. (C)
11. (C) 12. (A) 13. (A) 14. (A) 15. (A) 16. (B) 17. (B) 18. (A) 19. (A) 20. (B)
21. (A) 22. (C) 23. (A) 24. (D) 25. (B) 26. (B) 27. (C) 28. (C) 29. (A) 30. (B)
31. (A) 32. (B) 33. (A) 34. (B) 35. (D) 36. (B) 37. (B) 38. (A) 39. (A) 40. (A)
41. (D) 42. (A) 43. (C) 44. (B) 45. (A) 46. (A) 47. (B) 48. (C) 49. (A) 50. (D)
51. (B) 52. (D) 53. (B) 54. (A) 55. (C) 56. (D) 57. (C) 58. (A)
Section 2
1. (A) 2. (B) 3. (C) 4. (A) 5. (B) 6. (B) 7. (C) 8. (D) 9. (D) 10. (D)
11. (C) 12. (D) 13. (B) 14. (C) 15. (D) 16. (A) 17. (C) 18. (C) 19. (B) 20. (A)
21. (D) 22. (C) 23. (B) 24. (D) 25. (A) 26. (A) 27. (C) 28. (B) 29. (C) 30. (C)
31. (B) 32. (B) 33. (C) 34. (D) 35. (A) 36. (A) 37. (B)
Section 3
1. (D) 2. (A) 3. (A) 4. (C) 5. (C) 6. (D) 7. (B) 8. (D) 9. (D) 10. (B)
11. (C) 12. (D)
11
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

Hints to Multiple Choice Questions


Section 1 28. It is a property.
1. ‘Bombay is the capital of India’ is a statement. 30. r: It is raining, c: I will go to college.
The given statement is r → c ≡ ∼c → ∼r
2. ‘Two plus two is four’ is a statement.
31. Converse of p → q is q → p.
3. As value of ‘x’ is not defined.
4. It may be interesting for some person and may 32. Converse of p → q is q → p.
not be interesting for other. 33. Contrapositive of p → q is ∼q → ∼p.
5. Even though 2 = 3, is false, it is a statement in 34. The given statement is a disjunction.
logic with value F.
35. The given statement is a conjunction.
6. It is a true statement, since x = 3 ∈ N satisfies
36. Converse of p → q is q → p.
x + 5 = 8.
37. Converse of p → q is q → p.
7. ~(p ∨ q) ≡ ~p ∧ ~q
38. It is a property.
8. ~p: The sun has not set, ~q: The moon has not
risen, ‘or’ is expressed by ‘∨’ symbol. 39. Implies is indicated by → sign.
∴ ~p ∨ ~q 40. p: It is raining
9. ~p: Sita does not get promotion and ‘↔’ q: The atmosphere is very cold.
symbol indicates if and only if. 41. p: Candidates are present,
10. p: There are clouds in the sky, q: It is raining, q: Voters are ready to vote
‘and’ is expressed by ‘∧’ symbol. r: Ballot papers
∴ p ∧ ~q 42. (p and q) → r
11. ~p: He is not fat, ~w: He is not hard working, 43. p statement implies (q or r)
‘∨’ symbol indicates ‘or’.
44. (~d: Driver is not drunk) implies
12. ~p: Rohit is short, ‘or’ is expressed by ‘∨’ (~a: He cannot meet with an accident).
symbol and ‘and’ is expressed by ‘∧’ symbol. 45. Plain logic, both are equivalent.
13. Symbolic form is p ∧ ~q 46. Consider (A), ~p → ~q
14. Converse of p → q is q → p. i.e., ~F → ~T
i.e., T → F which is false.
15. Converse of p → q is q → p.
47. It is a property.
16. ~p: She is not beautiful, ‘∨’ indicates ‘or’.
48. It is a property.
17. ~p: Ram is not lazy, ~q: Ram does not fail in
49. p: Manoj has the job, q: he is not happy
the examination, ‘∨’ indicates ‘or’.
Symbolic form is p ∧ q.
18. It is a property. Its dual is p ∨ q.
19. p → q means Mathematics is interesting ∴ Manoj has the job or he is not happy.
implies Mathematics is difficult. 50. Dual of ‘and’ is ‘or’.
20. ~(p ∧ q) ≡ ~p ∨ ~q 51. ~[p ∨ (~q)] ≡ ~p ∧ ~(~q) ≡ (~p) ∧ q
21. p → q ≡ ~p ∨ q 52. Negation of Existential quantifier.
∴ ~(p → q) ≡ ~(~p ∨ q) ≡ ~(~p) ∧ ~q ≡ p ∧ ∼q 53. All are not honest means some can still be
22. It is a property. honest. Therefore, it is a wrong negation.
26. p → q ≡ ~q → ~p 54. I will not have both tea and coffee, means that,
I can’t have both but I can still have one of tea
27. It is a property. or coffee. Therefore, it is a wrong negation.
12 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
55. The given statement is ‘Sunday has to be a 7. (p ∨ q) ∧ (p ∨ r) ≡ (T ∨ T) ∧ (T ∨ F) ≡ T ∧ T
holiday’. Therefore its negation is ‘Even ≡T
though it is a Sunday, it is Not a holiday’.
8. ‘depends on what q is’ is incorrect.
56. The negation of the given statement is ‘It is Since p is false
false that the product of 3 and 4 is 9’. (A) (p and q), is always false for all q
57. Contrapositive of p → q is ~q → ~p (B) (p → q), is always true for all q,
(C) p is false, thus, ∼p is true,
58. Current in the upper part will flow only if both therefore, (∼p or q) is true for all q.
the switches p and q are closed. It is Hence, the options (A), (B), (C) are
represented by p ∧ q valid irrespective of what q is.
Current will flow in the circuit if switch p and 9. (∼q) → (∼p) is contrapositive of p → q and
q are closed or switch r is closed. It is both convey the same meaning.
represented by (p ∧ q) ∨ r.
∴ (A) is correct answer. 10. When p is false and q is true, then p ∧ q is
false, p ∨ ∼q is false, (∵ both p and ∼q are
Section 2 false) and q → p is also false, only p → q is
1. (~p ∨ q) ↔ ~(p ∧ q) and ~p ↔ (p → ~q) true.
∴ (~F ∨ F) ↔ ~(F ∧ F) and ~F ↔ (F → ~F) 11. p: One being lucky,
∴ (T ∨ F) ↔ ~F and T ↔ (F → T) q: One should stop working
∴ T ↔ T and T ↔ T
T and T 12. p: Mathematics is interesting.
q: Mathematics is difficult.
2. ~p ∧ (q ∨ ~r) and (p → q) ∧ r
13. p: Intelligent persons are polite.
∴ ~T ∧ (T ∨ ~F) and (T → T) ∧ F
q: Intelligent persons are helpful.
∴ F ∧ (T ∨ T) and (T ∧ F)
= F ∧ T and T ∧ F = F, F 14. p: Seema solves a problem
q: She is happy
3. (p → q) ↔ (~q → ~p) and (~p ∨ q) ∧ (~q ∨ p) i. p→q
∴ (T → F) ↔ (~F → ~T) and (~T ∨ F) ∧ (~F ∨ T) ii. ∼p → ∼q
∴ F ↔ (T → F) and (F ∨ F) ∧ (T ∨ T) iii. ∼q → ∼p
∴ F ↔ F and F ∧ T ⇒ T and F iv. q → p
4. p: 3 + 3 = 33, q: 1 + 2 = 12 (i) and (iii) have the same meaning, (ii) and
Truth values of both p and q is F. (iv) have the same meaning.
∴ ~(F ∨ F) ≡ ~F ≡ T 15. w: Humpty sit on a wall
5. ~[p → (p ∨ (~q))] f: Humpty will fall
≡ ~[~p ∨ (p ∨ (~q))] i. w→f ii. f→w
≡ p ∧ ~[p ∨ (~q)] iii. ∼f → ∼w iv. ∼w → ∼f
≡ p ∧ (~p ∧ q) (i) and (iii) have the same meaning, (ii) and
6. (iv) have the same meaning.
p q ∼q ∼q ∨ p p↔q p→q 16. i. b→r ii. ∼b → ∼r
T T F T T T iii. r → b v. ∼r → ∼b
T F T T F F (i) and (iv) are the same and (ii) and (iii) are
F T F F F T the same.
F F T T T T
17.
Alternate Method:
~ q ∨ p: F
p q ~q p ∧ ~q ~(p ∧ ~q) p → ~(p ∧ ~q)
∴ ~ q is F, p is F T T F F T T
i.e. q is T, p is F T F T T F F
∴ p→q≡F→T≡T F T F F T T
F F T F T T

13
Mathematical Logic
Std. XII: Triumph Maths TARGET Publications

18. 27. Let p: Saral Mart does not reduce the prices.
p q p→q ∼p ∼q ∼p→∼q (p→q)↔ q: I will not shop there any more.
(∼p→∼q) (~p ∨ q): Either Saral Mart reduces the prices
T T T F F T T or I will not shop there any more.
T F F F T T F
The negation of the given statement is
F T T T F F F
F F T T T T T (p ∧ ~q), given by
Saral Mart does not reduce the prices and still
19. (p ∧ q) → p
I will shop there.
≡ ∼ (p ∧ q) ∨ p
≡ (∼p ∨ ∼q) ∨ p 28. p: Dhoni looses the toss, q: The team wins
≡ (∼p ∨ p) ∨ ∼q ∼(p → q) ≡ p ∧ ∼q
≡ T ∨ ∼q ∴ Dhoni loses the toss but (and) the team does
≡T not win.
20. We know that, p ↔ q = (p → q) ∧ (q → p) 29. Negation of (p ∨ q) ∧ (∼q ∧ r) is
∴ ∼(p ↔ q) = ∼[(p → q) ∧ (q → p)] ∼[(p ∨ q) ∧ (∼q ∧ r)]
= ∼ (p → q) ∨ ∼(q → p) = ∼(p ∨ q) ∨ ∼(∼q ∧ r)
(By Demorgan’s Law) = (∼p ∧ ∼q) ∨ [∼(∼q) ∨ ∼r]
= (p ∧ ∼q) ∨ (q ∧ ∼p) = (∼p ∧ ∼q) ∨ (q ∨ ∼r)
(∵ ∼(p → q) = p ∧ ∼q)
31. (p ∧ q) ∨ (~p ∧ q)
21. ≡ (p ∨ ~p) ∧ q
p q p∧q p∨q (p ∧ q) → (p ∨ q) ≡T∧q
T T T T T ≡q
T F F T T 34. The Symbolic form is
F T F T T ≡ [(~p ∧ ~q) ∨ p ∨ q ] ∧ r
F F F F T
≡ [~(p ∨ q) ∨ (p ∨ q)] ∧ r
22. ≡T∧r
≡r
p q ∼q p→q ∼(p→q) p∧∼q ∼(p→q)↔(p∧∼q)
T T F T F F T 37. (~p ∧ ~q) ∨ (p ∧ q) ∨ (~p ∧ q)
T F T F T T T ≡ ~p ∧ (~q ∨ q) ∨ (p ∧ q)
F T F T F F T ≡ (~p ∧ T) ∨ (p ∧ q)
F F T T F F T ≡ ~p ∨ (p ∧ q)
23. ≡ (~p ∨ p) ∧ (~p ∨ q)
≡ T ∧ (~p ∨ q)
p q ∼p ∼q p∧q ∼p→ ∼ q (p∧q)↔(∼p→∼q)
≡ ~p ∨ q
T T F F T T T
T F F T F T F Section 3
F T T F F F T
1. p ⇒ (∼p ∨ q) is false mean p is true and
F F T T F T F
∼p ∨ q is false.
(p ∧ q) ↔ (∼p → ∼q) is contingency. ⇒ p is true and both ∼p and q are false.
∴ (B) is correct answer. ⇒ p is true and q is false.
24. Dual of (p ∨ q) ∨ s is (p ∧ q) ∧ s. 2. Since p → q is false, when p is true and q is
25. Dual of (p ∨ q) ∨ r is (p ∧ q) ∧ r. false.
∴ p → (q ∨ r) is false when p is true and q ∨ r is
26. Dual of ‘∨’ is ‘∧’ and of ‘t’ is ‘c’. false, when both q and r are false.
14 Mathematical Logic
TARGET Publications Std. XII: Triumph Maths
3. Contrapositive of (p ∨ q) → r is ∼r → ∼(p ∨ q)
i.e. ∼r → ∼p ∧ ∼q
4. Given p → q
Its contrapositive is ∼q → ∼p
and its converse is ∼p → ∼q
∴ (C) is correct answer.
5. We know, p ↔ q ≡ (p → q) ∧ (q → p)
6.
p ∼p p→∼p ∼p→p (p→∼p)∧(∼p→ p)
T F F T F
F T T F F
7. Contradiction.
8. p → q is logically equivalent to ∼q → ∼p
∴ (p → q) ↔ (∼q → ∼p) is tautology
But, it is given contradiction.
Hence, it is false statement.
9. Either he is not rich or he is not happy.
10. Negation of q ∨ ∼(p ∧ r) is ∼(q ∨ ∼(p ∧ r))
= ∼q ∧ ∼(∼(p ∧ r))
= ∼q ∧ (p ∧ r)
11. The current will be flow to the circuit if p, q, r
should be closed or p, q′, r should be closed.
∴ (C) is correct answer.
12. Let p : s1 is closed.
q: switch s2 is closed.
∼q : switch s2 is open
~p : switch s1 is open or
switch s1′ is closed.
The current can flow in the circuit iff either
s1′ and s2 are closed or s1 and s2′ are closed.
It is represented by (∼p ∧ q)∨ (p ∧ ∼q)

15
Mathematical Logic

También podría gustarte