Discrete Mathematics

Discrete Mathematics
(Solutions for Vol‐1_Classroom Practice Questions)
1. Logics  
 P.Q  Q  P  .R 
By distributive law
  
 P  Q  P  Q  .R
Propositional Logic By Demorgan’s law & commutative law
= 1 .R
01. Ans: (a) =R
Sol: ( (P  Q)  (P  Q)  P)
 ( P   Q)  ( P  Q)  P 04. Ans: (d)
(By Demorgan’s law) Sol: (a) L.H.S  A → (P  C)
 (( P   Q)  ( P  Q))  P   A  (P  C) E16
(By Associative law)  ( A  P)  C Associative law
 ( P  ( Q  Q))  P  (A   P) → C
(By Distributive law) E16 & Demorgan’s law
 ( P  T)  P = R.H.S
( Q  Q is a tautology)
(b) L.H.S = (P → C)  (Q → C)
  P  P (  P  T   P)
 ( P  C)  ( Q  C) By E16
T
 ( P   Q)  C Distributive law
 (P  Q) → C By E16
02. Ans: (c)
= R.H.S
Sol: (( P → Q)  ( P  Q))  R
 (T )  R ((P → Q)  ( PQ)) (c) A → (B→C)
 ~A (~B  C) By E16
R (T is a tautology)
 (~A ~B)  C By associative law
 (~B  ~A)  C By commutative law
03. Ans: (d)
 ~ B (~A  C) By associative law
Sol: In Boolean algebra notation, the given
 B → (A→C) By E16
formula can be written as
P.Q.R  Q.R   P.R  (d) When A is false and B is false, we have
 P.Q .R  Q  P .R LHS is true and RHS is false.
By associative law & distributive law  LHS  RHS
Boole’s contribution in logic firmly established the point of view that logic should use symbols
and the algebraic properties should be studied in logic

: 2 : Discrete Mathematics

05. Ans: (d) (C) R.H.S  (p → r)  (q → r)
Sol: The given compound proposition  (~p  r)  (~q  r)
 (p  q)  (p~q)  (~pq)  (~p~q) Equivalence
(Commutative law)  (~p  ~ q)  r)
Distributive law
 (p (q~q))  (~p (q~q))
 ~(p  q)  r
(Distributive law)
Demorgan's law
 (pF)  (~pF)
 (p  q) → r
 p ~p Equivalence
F = L.H.S
 The given formula is a contradiction. (D) When a is true, b is false and c is true;
the given formula has truth value false.
06. Ans: (d)  It is not a tautology
Sol: (A) R.H.S  (a → c)  (b → c)
07. Ans: (b)
 (~a  c)  (~b  c)
Sol: Case 1: When p is true, the given formula
Equivalence
becomes
 (~a  ~b)  (c  c)
(T → q)  (T → r)  (q → r )  T
By associative and commutative laws  q  r  (q  r )
 ~(a  b)  c (∵(c  c)  c)  (q  r) ~ (q  r)
F
 (a  b) → c Equivalence Case 2: When p is false, the given formula
= L. H. S becomes
 The given formula is a tautology {(F → q)  (F → r)  (q → r )F}
F
 The given statement formula is a
(B) R.H.S  (p → q)  (p → r)
contradiction.
 (~p  q)  (~p  r)
Equivalence 08. Ans: (d)
 ~p  (q  r) Sol: The truth table of a propositional function in
n variables contain 2n rows. In each row the
Distributive law
function can be true or false.
 p → (q  r)
By product rule, number of non equivalent
Equivalence propositional functions (different truth
tables) possible  2 2 
= L. H. S n
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

: 3 : CSIT‐Postal Coaching Solutions

09. Ans: (c) This argument is not valid, because when P
Sol: A set of connectives is said to be is false and Q is true, the premises are true
functionally complete, if equivalent form of but conclusion is false.
every statement formula can be written with
those connectives. 11. Ans: (a)
(a) {, } is functionally complete because Sol: Argument I
the other connectives can be expressed 1. ~p → (q → ~w) premise
by these two connectives. 2. ~s → q premise
3. ~t premise
(P  Q)   ( P   Q)
4. (~p  t) premise
(P→ Q)  ( P  Q)
5. ~p (3),(4),
(P ↔ Q)( ( P  Q) (QP))
disjunctive syllogism
(b) {, } is functionally complete
6. q → ~w (1), (5),
(P  Q)   ( P   Q)
modus ponens
(P → Q)   (P   Q)
7. (~s → ~w) (2), (6), transitivity
(P  Q)  (P   Q)  (Q   P) 8. (w → s) (7),
(c) The set {, } is not functionally contrapositive property
complete, because, we cannot express  Argument I is valid.
‘not’ operation using the connectives
 and  Argument II
We cannot derive the conclusion from the
(d) We have, (p  q)  (~p → q)
premises, by applying the rules of inference.
 {→, ~} is a functionally complete set. Further, when p, q, r, t and w has truth
values true, we have all the premises are true
10. Ans: (b)
but conclusion is false.
Sol: Argument I:
This argument is not valid, because it comes  Argument II is not valid
under fallacy of assuming the converse.
Argument II: 12. Ans: (d)
This argument is valid, by the rule of modus Sol: (a) The given formula is equivalent to the
tollens. following argument
Argument III: (1) (a  b) → c
Let P : It rains and Q : Erik is sick (2) (a  b)
In symbolic form the argument is  (a → c)
P→Q Proof:
P (3) a new premise to apply
Q conditional proof


(4) b (2), (3), modus ponens 13. Ans: (b)
(5) (a  b) (3), (4), conjunction Sol: From the truth table
(6) c (1), (5), modus ponens (x  y)  (x ~y)
 The argument is valid (c.p) (p  q)  ~(~p  ~q)
 ~(~p  q)
(b) The argument is
(1) ~ a  b  14. Ans: (d)
(2) b  c  Sol: If {(a → b) → (a → c)} has truth value
(3) c  d  false, then 'a' has truth value true, b has truth
 a  d  value true, and c has truth value false.
For these truth values, only the compound
(4) a new premise to apply C.P
proposition given in option (d) has truth
(5) ~ b (1), (4),
value true.
conjunctive syllogism(c.s)
(6) c (2), (5), D.S
15. Ans: (c)
(7) d (3), (6), M.P
Sol: Let us denote the formula by P → Q,
 The given argument is valid
Where P = (a  b) → c and Q = a → (b  c).
(conditional proof)
(a) Here Q is false only when a is true, b is
false, and c is false. For these truth
(c) The given formula is equivalent to the
values P has truth value true.
following argument
 (P → Q) has truth value false.
(1) a
 The given formula is not a tautology.
(2) (a  b)  (c  d)
(b) When a is true, b is true and c is false;
 (~b → c) (P → Q) has truth value true.
Proof:  The given formula is not a
(3) ~ b new premise to apply c.p contradiction
(4) (a  ~b) (1), (3), conjunction (c) The given formula is true in one case and
(5) ~(a → b) (4), E17 false in other cases
(6) (c  d) (2), (5), D.S  The given formula is a contingency.
(7) c (6), simplification
 The argument is valid (c.p) 16. Ans: (d)
Sol: (a) L. H. S   a  ( b  c) Equivalence
(d) When a is false, b is true and c is false,  ( a   b)  c Associativity
the given formula has truth value false.  (a  b) → c Equivalence
 It is not valid = R. H. S.


(b) L. H. S  (a  b) → ( c → d) 18. Ans: (d)
Equivalence Sol: (a) When p is true, q is false and r is true;
 (a  b   c) → d Equivalence the premises are true and conclusion is
= R. H. S false. Therefore, the argument is not
(c) L. H. S. = (a → (a  b)) = T valid.
R. H. S. =  a → (a →b) (b) When p is false and r is true, the
= a  ( a  b) premises are true and conclusion is
false.
= (a  a)  b
 The argument is not valid.
=Tb
(c) When p is true, q is true, r is true and s
=T
is false; then the given argument is not
L. H. S = R. H. S
valid
(d) When a is false and b is true
(d) The premises are true only when p is
We have L. H. S. = F and R. H. S. = T
true, q is true, r is true, s is false and t is
 Option (d) is not true because
true.
L. H. S.  R. H. S.
Whenever the premises are true, the
conclusion is also true.
17. Ans: (a)
 The argument is valid
Sol: The given formula is equivalent to the
following argument
19. Ans: (c)
1. ~ p→ (q→~w) Premise
Sol: Argument I is equivalent to the following
2. ~ s → q Premise
argument.
3. ~ (w→ t) Premise
{p → r, q → r, p  q}  r
4. (~ p  t) Premise
This argument is valid by the rule of
s
dilemma.
5. (w  ~ t) 3), Equivalence
 The given argument is also valid by
6. w 5), Simplification
Conditional proof (C.P).
7. ~t 5), Simplification
Argument II is equivalent to the following
8. ~p 4), 7)
argument
Disjunctive syllogism
{p → q, p → r, p}  (q  r)
9. (q → ~w) 1), 8) Modus ponens
10. ~q 9), 6) Modus tollens 1) p → q premise
11. s 2), 10) Modus tollens 2) p → r premise
The argument is valid 3) p new premise to apply (C.P)
Hence, the given statement is a tautology  (q  r)


4) q (1), (3), modus ponens 24. Ans: (c)
5) r (2), (3), modus ponens Sol: y x P(y, x) → y x P(x, y)
6) q  r (4), (5), conjunction  x y P(x, y) → y x P(x, y)
 Argument II is valid (Conditional Proof). ( x and y are dummy variables)
Which is valid as per the relationship
20. Ans: (a) diagram shown below
Sol: The given formula can be written as y x

x y
((a→b)  (c→d)  (b  d)) → (a  c)
x  y
This formula is valid, by the rule of P(x, y)
destructive dilemma.  y x x y
x  y  y x
First order Logic
The remaining options are not true as per the
21. Ans: (a) diagram.
Sol: To negate a statement formula we have to
replace x with x, x with x and negate 25. Ans: (d)
the scope of the quantifiers. Sol: The given formula is equivalent to
~{x {P(x)  ~Q(x)}} = x {P(x) → Q(x)} x {y (~)  z(~)}
(Use the equivalence  (P→Q) (P   Q)) By the rule of negation

 x {y()→ z(~)} ........ (1)
22. Ans: (c) (By equivalence)  Option (B) is true
Sol: x (B (x) → I (x))  x {z()→ y(~)} ........ (2)(from (1),
   [x (B(x) → I (x))] by contrapositive equivalence)
  (x (B(x)   I (x)))
 Option (A) is true
23. Ans: (a)  x (z(~)  y(~)}

Sol: To negate a statement formula we have to (from (2), equivalence)  Option (C) is true
replace x with x, x with x and negate  Options (A), (B) and (C) are equivalent to
the scope of the quantifiers. Use the the given formula.
equivalence  Option (D) is not true, because an
 (P  Q)  (P   Q) implication is not equivalent to its converse.


26. Ans: (d) (5) Q(a) (3),(4), M.P
Sol: S1 is true (6) x Q(x) (5) , U.S
Once we select any integer n, the integer  The given formula is valid (C.P)
m = 5 – n does exist and
(b) The statement need not be true.
n + m = n + (5 – n) = 5
Let c and d are two elements in the
S2 is true, because if we choose n=1 universe of discourse, such that P(c) is
the statement nm = m is true for any integer true and P(d) is false and Q(c) is false and
m. Q(d) is false.
S3 is false, for example, when m = 0 the Now, the L.H.S of the given statement is
statement is false for all n true but R.H.S is false.
S4 is false, here we cannot choose n = – m,  The given statement is not valid.
because m is fixed.
(c) x (P(x) Q(x))  (x P(x)  x Q(x))
27. Ans: (b) & (d)
Indirect proof:
Sol: (a) L.H.S  x (A (x)  B(x))
1) x (P(x)  Q (x)) Premise
 x ( A(x)  B(x)), E16
2)  (x P(x)  x Q (x))
 x  A(x)  x B(x), E23
New premise to apply Indirect proof
 x A(x)  x B(x), E16 3) x  P(x)  x Q(x)
= R.H.S (2), Demorgan’s law
(b) L.H.S  {x  A(x)  x B(x)) 4) x  P(x) (3), Simplification
 x ( A(x)  B(x)) 5) x  Q(x) (3), Simplification
x (A(x)  B(x) = R.H.S 6)  P (a) (4), E.S
But converse is not true
7)  Q (a) (5), U.S
 (b) is false
8) ( P (a)  Q (a)) (6), (7),Conjunction
(c) valid equivalence
9)  (P(a)  Q(a)) (8), Demorgan’s law
(d) not valid (converse is not true)
10) (P (a)  Q(a)) (1), U.S
28. Ans: (b) 11) F (9), (10),
Sol: (a) The given formula is valid by Conjunction
conditional proof, if the following  valid (Indirect proof)
argument is valid. S2: The argument is
(1) x { P(x) → Q(x) } 1) x y (P(x, y) → W (x, y))
(2)  x P(x) new premise to apply C.P 2)  W (a, b)
 x Q(x)   P(a, b)
Proof: (d) x{ P(x)  Q(x) } follows from
(3) P(a) → Q(a) (1) , U.S (x P(x)  x Q(x))
(4) P(a) (2), U.S
 The given statement is valid.


29. Ans: (c)
Sol: Consider
Argument I
1. x{p(x)  q(x)} premise
2. x[{~p(x)  q(x)} → r(x)] premise
3. {p(a)  q(a)} (1), universal specification
4. {~p(a)  q(a)} → r(a) (2), U. S.
5. ~r(a) new premise to apply C.P
6. ~{~p(a)  q(a)} (5), (4), disjunctive syllogism
7. { p(a)  ~q(a)} (6), demorgan’s law
8. { p(a)  q(a)}  {p(a)  ~ q(a)} (3), (7) conjunction
9. p(a)  {q(a)  ~q(a)} (8), distributive law
10. p(a)  F from (9)
11. p(a) from (10)
12. {~r(a) → p(a)} from (11),
13. x{~r(x) → p(x)} from (12), U.G
 The argument is valid (C.P)
Argument II
1. x[p(x) → {q(x)  r(x)}] premise
2. x{p(x)  s(x)} premise
3. p(a)  s(a) (2), E. S
4. p(a) (3), simplification
5. s(a) (3), simplification
6. p(a) → {q(a)  r(a)} (1), U.S
7. q(a)  r(a) (4), (6), modus ponens
8. r(a) (7), simplification
9. r(a)  s(a) (5), (8), conjunction
10. x{r (x)  s(x)} (9), E. G
 The argument is valid (C.P)


30. Ans: (d) S2 is equivalent to the following argument
Sol: The given statement can be represented by 1) x P(x) premise
S2. 2) x {P(x) → Q(x) premise
Further, S1  S2  S3  x Q(x)
 Option (d) is correct 3) x P(x) from (1) and (2),
by modus ponens,
31. Ans: (b) 4) x P(x) from (3)
Sol: S1 is equivalent to the following argument  S2 is valid
1) x P(x) premise S3:
2) x {P(x) → Q(x) premise 1) x P(x) premise
 x Q(x) 2) x Q(x) premise
Here, we cannot combine (1) and (2), to get  x {(P(x)  Q(x)
the conclusion, because in both the formulae (3) Q(a) (2), E.S.
existential quantifiers are used. (4) P(a) (1) U.S.
(5) P(a)  Q(a) (3), (4), conjunction
(6) x {P(x)  Q(x)} (5), U.G.
 S3 is valid
bn
32. Ans: (d)

Sol: I) Let D (x) : x is a doctor
C (x) : x is a college graduate
G (x) : x is a golfer
The given argument can be written as
1) x {D (x) → C (x)}
2) x {D(x)   G (x)}
 x {G (x)   C(x)}
3) {D (a)   G (a)} 2), Existential Specification
4) {D (a) → C(a)} 1), Universal Specification
5) D (a) 3), Simplification
6)  G (a) 3), Simplification
7) C (a) 4), 5), Modus ponens Conjunction
8) {C (a)   G (a)} 7), 6), Conjunction
9) x {G (x)   C(x)} 8), Existential Generalization
The argument is not valid


II) Let M (x) x is a mother
N (x) x is a male
P (x) : x is a politician
The given argument is
1) x {M(x) →  N (x)}
2) x {N (x)  P (x)}
x {P(x)   M (x)}
3) N (a)  P (a) 2), Existential Specification
4) M (a) →  N (a) 1), Universal Specification
5) N (a) 3), Simplification
6) P (a) 3), Simplification
7)  M (a) 4), 5), Modus tollens
8) {P (a)   M (a)} 6), 7), Conjunction
9) x{P (x)   M (x)} 8), Existential Generalization
 The argument is valid.
33. Ans: (b) S2: For x = –1, Q(x) is true and R(x) is true.
Sol: S1 is false. For x = 0. There is no integer y S2 is true
such that ‘0 is a divisor of y’ S3: For the integer x = 1, P(x) is false
S2 is true. If we choose, x = 1, then the P(x) → R(x) is true for integer
statement is true for any integer y S3 is true.
S3 is true. If we choose, x = 1, then the
statement is true for any integer y 35. Ans: (c)
S4 is false, because there is no integer y Sol: (a) When y = 2, the given statement is false
which is divisible by all integers. (b) When x = 2 the given statement is false
(c) Solving the equations
34. Ans: (b) 2x + y = 5 and x – 3y = –8
Sol: P(x): x2–7x + 10 = 0 we get x = 1 and y = 3
 x = 2, 5  The given statement is true
2
Q(x): x –2x – 3 = 0 (d) Solving the equations
 x = –1, 3 3x – y = 7 and 2x + 4y = 3
S1: For x = 3, Q (x) true and R(x) is false. 31 5
we get x  an y  
S1 is not true. 14 14
 The given statement is false


36. Ans: (b)
Sol: Argument I:
1. x A (x),
2. x{ A (x)  Q (x)
 x Q(x)
3. A(a) from (1), by existential specification
4. ~ {A (a)  Q (a)} from (2), by universal specification
5. (~ A (a)  ~ Q (a)) (4), demorgan’s law
6. ~ Q(a) from (2) and (5) by disjunctive syllogism.
 given argument is not valid.
Argument II:
1. {x {(P(x)  Q (x)) → R (x)},
2. x Q (x)}
x R(x)
3. {(P(a)  Q (a)) → R (a)}, from (1) by existential specification.
4. Q(a) from (2), by universal specification
5. P(a)  Q (a) from (4) by addition
6. R(a) from (3) and (5) by modus ponens
7. x R(x) from (6) by existential genralization
 Argument II is valid.
37. Ans: (d) (b) L.H.S  x {A(x)  W}

Sol: The given statement can be written as, x  {x A(x) }  x W
{R(x)  ~S(x)}  x A(x) → W
Now, ~[x {R(x)  ~S(x)}]
 x {~R(x)  S(x)} (c) x { A(x) → W}
 x {R(x) → S(x)}  x { A (x)  W} E16
 Option (d) is correct.  {x  A(x) }  W using (a)
 {x A(x) } →W E16
38. Ans: (c)
 R.H.S
Sol: (a) If x is not free then
x {W  A(x)}  W  x A(x) is
(d) valid refer derivation of option (c).
valid
Refer page 23 of material book.


2. Combinatorics 04. Ans: 86
Sol: n(ABCD)
= 42 +36 + 28 + 24 – 6 (12) +4 (8) 4
01. Ans: 2
= 86
Sol: {n(ABC)} = sum of the elements in all
the regions of the diagram.
05. Ans: (c)
= 33 – x
Sol: If n is even, then number of bit strings of
 n(ABC) = 31 = 33 – x
n
x=2 length n which are palindromes  2 2 .
 n( A BC) = 2 If n is odd, then number of bit strings of
n 1
11 3 11 – x B
A
2
length n which are palindromes  2 2
4 x
n
2–x 2
 Required number of bit strings  2  
.
C
06. Ans: 45
02. Ans: 600
Sol: By principle of inclusion and exclusion, Sol: For maximum number of points of
Number of integers divisible by 5 or 6 or 8 intersection, we have to draw 10 lines so that
= 200+ 166 + 125 – 33 – 25 – 41 + 8 no three lines are concurrent. In that case,
= 400 each point correspond to a pair of distinct
Required number of integers = 1000 – 400 straight lines.
= 600  Maximum number of points of
intersection = number of ways we can
03. Ans: (d)
choose two straight lines out of 10 straight
Sol:
Painters Electricians lines = C (10, 2) = 45
x
15 07. Ans: 1,13,322
z y
Sol: The number of 4-digit number = 4 = 24
Plumbers Each digit occur 6 times in every one of the
By the principle of inclusion and exclusion, 4 positions.
80 = 45+50+50–(x+15)–(y+15) –(z+15)+15 The sum of the digits = 17
 x + y + z = 35 Hence, sum of these 24 number = 6.(17)
Required number of candidates (1000 + 100 + 10 + 1) = 113322
= x + y + z + 15 = 50


08. Ans: 4096 Required number of integers
Sol: In a binary matrix of order 3  4 we have 12 = (9)(9)(9) + (8)(3)(9)(9)
elements. Each element we can choose in = 2673
2 ways.
By product rule, 12. Ans: 2940
Required number of matrices = 212 = 4096 Sol: Consider an integer with 5 digits.
Digit 3 can appear in 5 ways
09. Ans: 188
Sol: An English movie and a telugu movie can
be selected in (6)(8) = 48 ways
Each of the remaining digits we can choose
A telugu movie and a hindi movie can be
selected in (8).(10) = 80 ways in 7 ways.
A hindi movie and an English movie can be By product rule,
selected in (10)(6) = 60 movies Required number of integers
Required number of ways = 48 + 80 + 60 = (5)(4)(3)(7)(7) = 2940
= 188
13. Ans: 89
10. Ans: 738
Sol: Each Tennis match eliminates one player
Sol: Number of 1-digit integers = 9
and we have to eliminate 89 players.
Number of 2-digit integers with distinct
 We have to conduct 89 matches.
digits = (9) (9)
= 81
Number of 3-digit integers with distinct 14. Ans: 243
digits = (9).(9).(8) Sol: Each element of A can appear in the subsets
= 648 in 3 ways.
Required number of integers = 9+81+648
Case 1: The element appears in P but does
= 738
not appear in Q.
11. Ans: 2673 Case 2: The element appears in Q and does
Sol: Case(i): If the first digit is 6, then each of not appear in P.
the remaining digits we can choose in Case 3: The element does not appear in P
9 ways. and does not appear in Q.
Case(ii): If the first digit is not 6, then first By product rule,
digit we can choose in 8 ways, digit 6 can Required number of ways = 3n = 35
appear in 3 ways and each of the remaining = 243
digits we can choose in 9 ways.


15. Ans: 150 19. Ans: 1152
Sol: Required number of ways = Number of Sol: Consider 8 positions in a row marked
onto functions possible from persons to 1, 2, 3,….., 8.
Case 1: Boys can sit in odd numbered
rooms
positions in 4 ways and girls can sit in
= 35 – C(3, 1) 25 + C(3, 2) . 15
even numbered positions in 4 ways.
= 243 – 3 (32) + 3
Case 2: Boys can sit in even numbered
= 150 positions in 4 ways and girls can sit in odd
numbered positions in 4 ways.
16. Ans: P(10, 6) = 151200 Required number of ways
Sol: Required number of ways = 4.4 + 4.4 = 1152
= Number of ways we can map the 6
persons to 6 of the 10 books 20. Ans: 325
Sol: Number of signals we can generate using 1
= P(10,6)
flag = 5
= 151200
Number of signals we can generate using
two flags = P(5,2) = 5.4 = 20 and so on.
17. Ans: (a)
Required number of signals
Sol: The 3 women can speak as a group in = 5 + P(5,2) + P(5,3) + P(5,4) + P(5,5)
3 ways. = 325
The women group can speak with other
4 men in 5 ways. 21. Ans: 106
Sol: Each book we can give in 10 ways.
 Required number of ways
By product rule, required number of ways
= 5. 3 = 106
= 720
22. Ans: 243
18. Ans: 2880 Sol: Each digit of the integer we can choose in
Sol: First girls can sit around a circle in 4 3 ways.
ways. By product rule,
Now there are 5 distinct places among the Required number of integers = 35
= 243
girls, for the 4 boys to sit.
Therefore, the boys can sit in P(5, 4) ways.
23. Ans: 12600
By product rule, Sol: Required number of permutations
Required number of ways = 4.P(5, 4) 10
  12,600
= 2880 2.3.4


24. Ans: 210 30. Ans: 120
Sol: Required number of binary sequences Sol: The 3 zeros can appear in the sequence in
10 C(10,3) ways. The remaining 7 positions of
  210
6.4 the sequence can be filled with ones in only
one way.
25. Ans: 252 Required number of binary sequences
Sol: Required number of outcomes = C(10, 3).1 = 120
10
  252
5.5 31. Ans: 35
Sol: Consider a string of 6 ones in a row. There
26. Ans: 2520 are 7 positions among the 6 ones for placing
Sol: Required number of ways the 4 zeros. The 4 zeros can be placed in
10 C(7,4) ways.

3.2.5
= 2520 Required number of binary sequences
= C(7, 4) = C(7, 3)
27. Ans: 2520 = 35
Sol: Required number of ways 32. Ans: 252
= number of ordered partitions Sol: To meet the given condition, we have to
10 choose 5 distinct decimal digits and then
 = 2520
3.2.5 arrange them in descending order. We can
choose 5 distinct decimal digits in C(10,5)
28. Ans: 945 ways and we can arrange them in
Sol: Required number of ways = Number of descending order in only one way.
unordered partitions of a set in to 5 subjects Required number of ways = C(10,5).1 = 252
10
of same size 
(2.2.2.2.2).5 33. Ans: 2n(n–1)
= 945 Sol: We have 2n persons.
Number of handshakes possible with 2n
29. Ans: 600 persons = C(2n,2)
Sol: We can select 4 men in C(5, 4) ways. Those If each person shakes hands with only
4 men can be paired with 4 women in his/her spouse, then number of handshakes
P(5, 4) ways. possible
 Number of possible selections =n
= C(5, 4). P(5, 4) Required number of handshakes
= 5. (120) = 600 = C(2n, 2) – n = 2n(n –1)


34. Ans: 1092 38. Ans: 455
Sol: In a chess board, we have 9 horizontal lines Sol: To meet the given condition, let us put
and 9 vertical lines. A rectangle can be 1 ball in each box, The remaining 12 balls
formed with any two horizontal lines and we can distribute in V(4,12) ways.
any two vertical lines. Required number of ways = V(4,12).1
Number of rectangles possible = C(15,12) = C(15,3) = 455
= C(9,2). C(9,2) = (36)(36) = 1296
Number of squares in a chess board 39. Ans: 3003
= 12 + 22 + 32 +….+ 82 = 204 Sol: The number of solutions to the inequality is
Every square is also a rectangle. same as the number or solutions to the
Required number of rectangles which are equation
not squares = 1296 – 204 = 1092 x1 + x2 + x3 + x4 + x5 + x6 = 10
Where x6  0
35. Ans: 84 The required number of solutions = V(6,10)
Sol: Between H and R, we have 9 letters. We = C(15,10) = C(15,5) = 3003
can choose 3 letters in C(9, 3) ways and
then arrange them between H and R in 40. Ans: 10
alphabetical order in only one way. Sol: Let x1 = y1 + 3, x2 = y2 – 2, x3 = y3 + 4
Required number of letter strings = C(9,3).1 The given equation becomes
= 84 y1 + y2 + y3 = 3
Number of solutions to this equation
36. Ans: 210 = V(3, 3)
Sol: We can choose 6 persons in C(10, 6) ways = C(5, 3) = 10
We can distinct 6 similar books among the 6  Required number of solutions = 10
persons in only one ways
 Required number of ways 41. Ans: 63
= C(10, 6). 1 Sol: Let X1 = units digit, X2 = tens digit and
= C(10, 4) = 210 X3= hundreds digit
Number of non negative integer solutions to
37. Ans: 1001 the equation
Sol: Required number of ways = V(5,10) X1 + X2 + X3= 10 is
V(n,k) = C(n–1+k, k) V (3, 10) = C (12, 10) = C (12, 2) = 66
 V(5,10) = C(14,10) We have to exclude the 3 cases where
= C(14,4) Xi = 10 (i = 1, 2, 3)
= 1001 Required number of integers = 66 – 3 = 63


42. Ans: 1001 45. Ans: 10800
Sol: Let x1 = y1 + 2, x2 = y2 + 3, x3 = y3 + 4, Sol: The six symbols can be arranged in 6
x4 = y4 + 5 and x5 = y5 + 6 ways. To meet the given condition,
Let us put 2 blanks between every pair of
Required number of solutions = Number of
symbols.
non negative integer solutions to the
The number of ways we can arrange the
equation remaining two blanks = V(5, 2)
y1 + y2 + y3 + y4 + y5 = 10. = C(5 – 1 +2, 2) = 15
= V(5, 10) = C(5 –1 + 10, 10)  Required number of ways = 6 .(15)
= C(14, 10) = (720) .(15) = 10,800
= C(14, 4) = 1001
46. Ans: S1, S2, S5, S6
Sol: Average number of letters received by an
43. Ans: 10
410
Sol: To meet the given conditions, let us put 2 apartment  A 
50
books on each of the 4 shelves. Now we are
 8 .2
left with 2 books to distribute among the 4
Here, A  = 9 and A  = 8
shelves. Which ever way we distribute the
remaining books, the number of books on By pigeonhole principle, S1 and S2 are
any shelf cannot exceed 4. necessarily true.
 Required number of ways = V (4, 2) S5 follows from S1 and S6 follows from S2.
S3 and S4 need not be true.
= C(4 – 1 + 2, 2)
= C (5, 2) = 10
47. Ans: 97
Sol: If we have n pigeon holes, then minimum
44. Ans: (a) number of pigeons required to ensure that
Sol: This is similar to distributing n similar balls atleast (k+1) pigeons belong to same
in k numbered boxes, so that each box pigeonhole = kn + 1
contains atleast one ball. For the present example, n=12 and k+1= 9
If we put 1 ball in each of the k boxes, then Required number of persons = kn + 1
we are left with (n–k) balls to distribute in k = 8(12) +1 = 97
boxes.
Required number of ways = V(k, n – k) 48. Ans: 26
= C(k – 1 + n – k, n – k) Sol: By Pigeonhole principle,
= C(n – 1, k – 1) Required number of balls = kn + 1
= 5(5) + 1 = 26


49. Ans: 39 52. Ans: 7
Sol: The favorable colors to draw 9 balls of same Sol: If we divide a number by 10 the possible
color are green, white and yellow. remainders are 0, 1, 2, …, 9.
We have to include all red balls and all Here, we can apply pigeonhole principle.
green balls in the selection of minimum The 6 pigeonholes are
number of balls. For the favorable colors we
{0}, {5}, {1, 9}, {2, 8}, {3,7}, {4, 6}
can apply pigeonhole principle.
In the first two sets both x + y and x – y are
Required number of balls = 6 + 8 + (kn + 1) divisible by 10. In the remaining sets either
Where k +1 = 9 x + y or x – y divisible by 10.
and n=3 The minimum number of integers we have
6 + 8 + (8  3 + 1) = 39 to choose randomly is 7.
50. Ans: 4
53. Ans: 14
Sol: Suppose x  6,
Sol: Every positive integer ‘n’ can be written as,
Minimum number of balls required = kn +1=16
n = 2k m where ‘m’ is odd and k  0. Let us
where k + 1 = 6 and n = 3.
 5(3) + 1 = 16 call m the odd part.
Which is impossible If we treat the odd numbers 1, 3, 5, …, 25 as
x<6 pigeonholes then we have 13 pigeonholes.
Now, minimum number of balls required Every element in S has on odd part and
= x + (kn + 1) = 15 associated with one of the 13 pigeonholes.
where k + 1 = 6 and n = 2 The minimum value of k = 14
 x + 5(2) + 1 = 15
54. Ans: 6
x=4
Sol: For the difference to be 5, the possible
combinations are
51. Ans: 7
{1, 6}, {2, 7}, {3, 8}, {4, 9}, {5, 0}
Sol: For sum to be 9, the possible 2-element
subsets are{0,9}, {1, 8},{2, 7},{3, 6},{4, 5}
If we treat them as pigeonholes, then we
If we treat these subsets as pigeon holes,
then any subset of S with 6 elements can have 5 pigeonholes.
have at least one of these subsets. By pigeonhole principle, if we choose any 6
Since we need two such subsets, the integers in S, then the difference of the two
required value of k = 7. integers is 5.


55. Ans: 40 59. Ans: (i) 44 (ii) 76 (iii) 20
Sol: The distinct prime factors of 110 are 2, 5 (iv) 89 (v) 119 (vi) 0
and 11. Sol: (i) Number of ways we can put 5 letters, so
Required number of positive integers that no letter is correctly placed
 1 1 1 1 
= (110)  D 5  5    
 2 3 4 5 
 2  1
. 5  1
. 11  1 
 110  = 44
 2.5.11
(ii) Number of ways in which we can put 5
= 40 letters in 5 envelopes = 5
Number of ways we can put the letters
56. Ans: 48 so that no letter is correctly placed = D5
Sol: The distinct prime factors of 180 are 2, 3 Required number of ways = 5 – D5
and 5. = 120 – 44
Required number of +ve integers = 76
= (180) (iii)Number of ways we can put the 2 letters
 2  1
. 3  1
. 5  1 correctly = C(5,2) = 10
 180
 2.3.5   48 The remaining 3 letters can be wrongly
placed in D3 ways.
57. Ans: 288 Required number of ways = C(5,2) D3
Sol: The distinct prime factors of 323 are 17 and = (10) 2
19. = 20
Required number of positive integers (iv) Number of ways in which no letter is
= (323) correctly placed = D5
 17  1
. 19  1  Number of ways in which exactly one
 323  = 288
 17.19 letter is correctly placed = C(5,1) D4
Required number of ways
= D5 + C (5,1)D4
58. Ans: 265
= 44 +5 (9) = 89
Sol: Required number of 1 – 1 functions
(v) There is only one way in which we can
= number of derangements possible with put all 5 letters in correct envelopes.
6 elements Required number of ways = 5 –1= 119
 1 1 1 1 1  (vi) It is not possible to put only one letter in
 D 6  6     
 2 3 4 5 6  wrong envelope.
= 265 Required number of ways = 0


60. Ans: (i) 1936 (ii) 14400 63. Ans: (c)
Sol: (i) The derangements of first 5 letters in Sol: Let an = number of n-digit quaternary
first 5 places = D5 sequences with even number of zeros
Similarly, the last 5 letters can be Case 1: If the first digit is not 0, then we can
deranged in last 5 places in D5 ways. choose first digit in 3 ways and the
The required number of derangements remaining digits we can choose in an–1 ways.
= D5D5 = (44) (44) By product rule, number of quaternary
= 1936 sequences in this case is 3an–1.
(ii) Any permutation of the sequence in Case 2: If the first digit is 0, then the
which the first 5 letters are not in first 5
remaining digits should contain odd number
places is a derangement. The first 5
of zeros.
letters can be arranged in last 5 places in
Number quaternary sequences in this case is
5 ways. Similarly, the last 5 letters of
(an–1 – 4n–1)
the given sequence can be arranged in
 By sum rule, the recurrence relation is
first 5 places in 5 ways.
 an = 3an–1 + (4n–1 – an–1)
Required number of derangements
 an = 2an–1 + 4n–1
= 5. 5
= 14400
64. Ans: (d)
Sol: Case: (1) If the first square is not red then it
61. Ans: 4!.D4 = 216 can be colored in 2 ways and the remaining
Sol: First time, the books can be distributed in squares can be colored in an–1 ways.
4 ways. Case (2) If the first square is colored in red,
Second time, we can distribute the books in then second square can be colored in two
D4 ways.
ways and remaining squares can be colored
Required number of ways = 4.D4 = 216
in an–2 ways.
By sum rule, the recurrence relation is
62. Ans: (d)
an = 2 an–1 + 2 an–2
Sol: Given that an = 2 (an–1 + an–2 )
an = number of ways a path of length n is
covered 65. Ans: (a)
Case 1: In the first move, if the marker is Sol: Case 1: If the first digit is 1, then number of
moved 2 steps ahead, then the remaining bit strings possible with 3 consecutive
length can be covered in an–2 ways. zeros, is an–1.
Case 2: In the first move, if the marker is Case 2: If the first bit is 0 and second bit is
moved 3 steps ahead, then the remaining 1, then the number of bit strings possible
length can be covered in an–3 ways. with 3 consecutive zeros is an–2.


Case 3: If the first two bits are zeros and 68. Ans: 8617
third bit is 1, then number of bit strings with Sol: an = an–1+ 3(n2)
3 consecutive zeros is an–3 n = 1  a1= a0 + 3(12)
n = 2  a2= a1 + 3(22)
Case 4: If the first 3 bits are zeros, then = a0 + 3(12+22)
each of the remaining n–3 bits we can n = 3  a3 = a2 + 3(32)
choose in 2 ways. The number of bit strings = a0 + 3(12+ 22 +32)
with 3 consecutive zeros in this case is 2n–3. an = a0 + 3(12+ 22 + …+ n2)
 The recurrence relation for an is 1
= 7 + n (n+1) (2n +1)
an = an–1 + an–2 + an–3 + 2n–3. 2
1
a20 = 7 + (20) (21) (41) = 8617
66. Ans: (a) 2
Sol: Case(i): If the first bit is 1, then the required
number of bit strings is an–1 69. Ans: (b)
Sol: The characteristic equation is t2 – t – 1 = 0
Case(ii): If the first bit is 0, then all the
1 5
remaining bits should be zero t
2
The recurrence relation for an is
The solution is
an = an–1 + 1 n n
1 5  1 5 
a n  C1    C2 
  2 

67. Ans: (a)  2   
Sol: The recurrence relation is 1
Using the initial conditions, we get C1 =
an – an –1 = 2n – 2 ………… (1) 5
The characteristic equation is t – 1 = 0 1
and C2 = 
Complementary function = C1 . 1n 5
Here, 1 is a characteristic root with
multiplicity 1. 70. Ans: (d)
Let particular solution = (c n2 + d n) Sol: The recurrence relation can be written as
Substituting in (1), (E2 – 2E + 1) an = 2n+2
(cn2 + d n) – {c (n – 1)2 + d(n – 1 )} = 2n – 2 The auxiliary equation is
t2 – 2t + 1 = 0
n=1c+d=0 t = 1, 1
n=0–c+d=–2 C.F. = (C1 + C2n)
 c = 1 and d = –1 2 n 2  2n 
P.S. =  4
 P. S = n2 – n E  12  E  12 
The solution is
2n
an = C1 + n2 – n …………… (1) 4 = 2n+2
2  1 2
Using the initial condition, we get C1 = 1

Substituting C1 value in equation (1), we get  The solution is
2
 an = n – n + 2 an = C1 + C2n + 2n+2


71. Ans: 31250 73. Ans: (a)
Sol: Let b n  a 2n Sol: Required generating function
The given recurrence relation becomes = f(x) = 0 + x + 3x2 + 9x3 + 27x4+ …..
bn+1 – 5 bn = 0 = x(1 + 3x + 32 x2 + 33 x3 + ….. )
The solution is bn = 4 (5n) 
= x  3n x n  x.1  3x 
1
 an  2 5  n
n 0
 a12 = 31,250
74. Ans: (d)
72. Ans: (a) Sol: Required generating function
Sol: Replacing n by n+1, the given f(x) = 0 + 0 x + 1 x2 – 2x3 + 3x4 – 4x5 + . . .
relation can be written as = x2 (1 –2x + 3x2 – 4x3 + . . . )
an+1 = 4an + 3(n + 1) 2n+1 = x2(1 + x)–2 (Binomial theorem)
 (E – 4) an = 6 (n +1) 2n ……….(1)
The characteristic equation is
75. Ans: (c)
t–4=0t=4
Sol: The generating function is
complementary function = C14n
f(x) = 1 + 0.x + 1.x2 + 0.x3 + 1.x4+ ……. 
Let particular solution is
n
= 1 + (x2) + (x2)2 + ……. 
an = 2 (cn +d) where c and d are
= (1 – x2)–1
undetermined coefficients.
Substituting in the given recurrence relation,
we have 76. Ans: (a)
2n (c n + d) – 4 2n–1 {c(n –1)+d} = 3n2n Sol: (x4 + 2x5 + 3x6 + 4x7 +..…)5
 (c n +d) –2{c(n–1)+d} = 3n = x20 (1 + 2x + 3x2 + 4x3 +…..)5
Equating coefficients of n and constants on = x20. [(1 – x)–2]5
both sides, we get = x20 [1 – x]–10
c = –3 and d = –6 
 x 20  Cn  9, n x n
 Particular solution = 2n (–3n – 6) n 0
Hence the solution is Coefficient of x27 = C(16, 7)

n n
an = C14 –(3n + 6) 2 …………(2) = C(16, 9)
x = 0  4 = C1 – 6  C1 = 10
an = 10(4n) – (3n + 6) 2n


77. Ans: (b)
3. Graph Theory
Sol: Required number of ways =
Number of non negative integer solutions to
01. Ans: (a)
the equation
Sol: For any simple graph,
x1 + x2 + x3 = 15 where 1  x1, x2, x3  7
( G ) V  2 E   ( G ) V
= coefficient of x15 in the expansion of f(x)
where, f(x) = (x + x2 + ..... + x7)3  (G) (10)  2(16)
= x3 (1 + x + x2 + ..... + x6)3  (G)  3.2
1 x7 
3
 (G)  3
 x 
3

 1  x 
02. Ans: 19
= x3 (1 – 3x7 + 3x14 – x21) (1 – x)–3 Sol: By sum of degrees of regions theorem, if
= x3 – 3x10 + 3x17 – x24) degree of each vertex is k, then

n  1n  2 x n kV  2E

n 0 2
 4 V  2(38)
coefficient of x 15 
1314  3 6.7  
   V = 19
2  2 
= 91 – 63 = 28 03. Ans: (c)
Sol: If degree of each vertex is k,
kV  2E
 k V  2 (12)
24
 V  ( k = 1,2,3,4)
k
 V = 24 or 12 or 8 or 6
 only option (c) is possible.
04. Ans: (e)

Sol: (a) {2, 3, 3, 4, 4, 5}
Here, sum of degrees
= 21, an odd number.
 The given sequence cannot represent a
simple non directed graph


(b) {2, 3, 4, 4, 5} 07. Ans: 12
In a simple graph with 5 vertices, Sol: G is a tree
degree of every vertex should be  4. By sum of degrees theorem,
 The given sequence cannot represent n.1 + 2 (2) + 4. (3) + 3. (4) = 2 |E|
a simple non directed graph.  n + 28 = 2 (|v| – 1)
(c) {1, 3, 3, 4, 5, 6, 6} = 2 (n + 2 + 4 + 3 – 1)
Here we have two vertices with degree  n + 28 = 2n + 16
6. These two vertices are adjacent to all  n = 12
the other vertices. Therefore, a vertex
with degree 1 is not possible. 08. Ans: 8
Hence, the given sequence cannot Sol: G has 8 vertices with odd degree.
represent a simple non directed graph. For any vertex vG,
(d) {0, 1, 2,….., n –1}
Degree of v in G + degree of v in G = 8
Here, we have n vertices, with one
If degree of v in G is odd, then degree of v
vertex having degree n-1. This vertex is
in G is also odd. If degree of v in G is even,
adjacent to all the other vertices.
Therefore, a vertex with degree 1 is not then degree of v in G is also even.
possible. Number of vertices with odd degree in
Hence, the given sequence, cannot G=8
represent a simple non directed graph.
(e) A graph with the degree sequence 09. Ans: 27
{2, 3, 3, 3, 3} is shown below. Sol: By sum of degrees theorem, if degree of
each vertex is atmost K,
c
then K|V|  2 |E|
d b  5 (11)  2 |E|
 |E|  27.5
e a
 |E|  27
05. Ans: (S2) {6, 5, 5, 4, 3, 3, 2, 2, 2}
10. Ans: (d)
Sol: (a) Let G be any graph of the required type.
06. Ans: 8
Let p be the number of vertices of degree
Sol: By sum of degrees theorem,
3.
(5 + 2 + 2 + 2 + 1) = 2 |E| Thus, (12 – p) vertices are of degree 4.
 |E| = 7 Hence, according to sum of degrees
 Number of edges in G = 7 theorem,
|E(G)| + |E( G | = |E(K6)| 3p – 4(12 – p) = 56.
 7 + |E( G )| = C(6, 2) Thus, p = –8 (Which is impossible)
 |E( G )| = 8  Such a graph does not exist.


(b) Maximum number of edges possible in a 14. Ans: 7
simple graph with 10 vertices Sol: G is a star graph
C(10, 2) = 45   (G) = 2
(c) Maximum number of edges possible in a The graph G is shown below
92
bipartite graph with 9 vertices =   a b
4
= 20
 Such a graph does not exist. f
e c
(d) A connected graph with n vertices and
n–1 edges is a tree. A tree is a simple
graph. d
Here, the vertices a, b, c, d, e form a

11. Ans: (b)
complete graph
Sol: G is a simple graph with 5 vertices.
For any vertex v in G,   G  = 5
deg(v) in G + deg(v) in G = 4 Now,  (G) +  G  = 7
 The degree sequence G is
{4 – 3, 4 – 2, 4 – 2, 4 – 1, 4 – 0} 15. Ans: 3
= {1, 2, 2, 3, 4} Sol: Applying welch-powel's algorithm we can
= {4, 3, 2, 2, 1} see that 3 - colouring is possible
12. Ans: 455

Vertex d a b c e f g
Sol: Maximum number of edges possible with 6
Color C1 C2 C3 C3 C2 C2 C3
vertices is C(6, 2) = 15. Out of these edges,
we can choose 12 edges in C(15, 2) ways.
  (G)  3 ......... (1)
 Number of simple graphs possible
15.14.13 since, G has cycles of odd length,  (G)  3
= C(15, 12) = C(15, 3) = = 455 ......... (2)
1.2.3
From (1) and (2), we have  (G) = 3.
13. Ans: 20
Sol: Maximum number of edges possible
16. Ans: 2
n 2
 Sol: In the given graph, all the cycles are of even
  , where n = 10 = 25
4  length.
We have, |E(G)| + |E( G )| = |E(K10)|  G is a bipartite graph and every bipartite
 25 + |E( G )| = C(10, 2) graph is 2-colorable
 |E( G )| = 20  Chromatic number of G = 2.


17. Ans: 5 22. Ans: 4
Sol: G is a disconnected graph with two Sol: c
components, one component is the complete b d
graph K5 and the other component is the a i e
trivial graph with only an isolated vertex h f
 Chromatic number of G = 5 g
The graph has 9 vertices. The maximum

18. Ans: (b)
number of vertices we can match is 8.
Sol:  = n  2 n/2 + 2
A matching in which we can match 8
 = n – 2 n/2  + 4 vertices is { a – b, c – d, e – f, g – h}
 +  = 2n – 2 { n/2 + n/2  }  6  Matching number of the graph = 4
= 2n – 2n + 6 = 6
23. Ans: 2
19. Ans: (c) Sol: The given graph is K2,4
Sol: Chromatic number of Kn = n  Matching number = 2
If we delete an edge in K10, then for the two
vertices connecting that edge we can assign 24. Ans: 2
same color. Sol: The given graph is
 Chromatic number = 9
a b
20. Ans: (a)
c d e
Sol: Matching number of Km,n = minimum of
{m, n} f g
h
Here, G = K1, n–1
If we delete the edge {a,b} then the graph is
 Matching number of G = 1
a star graph. If we match a with b, then in
the remaining vertices we can match only
21. Ans: 13
two vertices.
Sol: A disconnected graph with 10 vertices and
 Matching number = 2
maximum number of edges has two
components K9 and an isolated vertex.
25. Ans: 3
9 Sol: Let us label the vertices of the graph as
Matching number of K 9     4
2 shown below
d c
 Matching number of G = 4
Chromatic number of G = 9 a b


There are 3 maximal matchings as given If n is odd, then a bipartite graph with
below maximum number of edges = km,n
{a–d, b–c}, {a–c, b–d} and { c–d} n 1 n 1
Where m = and n 
2 2
26. Ans: 3 Matching number of G
Sol: The given graph is n
 2 , if n is even
a =
 n  1 , if n is odd
b  2
d n 
c Matching number of G =  
2
The maximal matchings are
{a–b, c–d}, {a–c, b–d}, {a–d, b–c} 30. Ans: (a)
Sol: If G has n vertices and k components, then
27. Ans: 10
(n – k)  |E| 
n  k n  k  1
Sol: The graph has 3 maximal matchings, 2
6 matchings with one edge, and a matching  7  |E|  28
with no edges.
31. Ans: (d)
 Number of matchings = 10
Sol: If |E| < (n – 1), then G is disconnected
If E 
n  1n  2 , then G is connected.
28. Ans: 8
2
Sol: By sum of degrees theorem, then G may or may not be connected.
(5 + 2 + 2 + 2 + 2 + 1) = 2 |E|
 |E| = 7 32. Ans: (d)
Sol: The given graph is a complete graph K6,
 Number of edges in G = 7
with 6 vertices of odd degree.
|E(G)| + |E( G )| = |E(K6)|  G is not traversable
 7 + |E( G )| = C(6, 2)
33. Ans: 3
 |E( G )| = 8
Sol: d is the cut vertex of G
 vertex connectivity of G = 1
29. Ans: (a) G has no cut edge.
Sol: If n is even, then a bipartite graph with  (G)  2 ................. (1)
maximum number of edges is kn/2,n/2 By deleting the edges d – e and d – f, we can
n disconnect G.
 Matching number of G =
2  Edge connectivity = (G) = 2


34. Ans: 105 c is a cut vertex of the graph G.
Sol: If G is a simple graph with n vertices and k  vertex connectivity of G = K(G) = 1
components then E 
n  k n  k  1 G has no cut edge.
2
 Edge connectivity =  (G)  2 ….. (1)
Here n = 20 and k = 5
We have,  (G)   (G) = 2 …… (2)
 Maximum number of edges possible

20  5. 20  6  105 From (1) and (2), we have
2  (G) = 2
35. Ans: (a) 39. Ans: 2, 2

Sol: If G is any graph having p vertices and Sol: The graph G can be labeled as
p 1
G   , then G is connected. a g
2
(theorem) d e
c f
36. Ans: (b) b h

Sol: If a component has n vertices, then G has no cut edge and no cut vertex. By
maximum number of edges possible in that deleting the edges {d, e} and {b, h} we can
component disconnect G.
= C(n, 2)   (G) = 2
 The maximum number of edges possible By deleting the vertices b and d, we can
in G = C(5, 2) + C(6, 2) + C(7, 2) + C(8, 2) disconnect G.
= 10 + 15 + 21 + 28  K (G) = 2
= 74
40. Ans: 1 & 3
37. Ans: 9 Sol: The graph G can be labeled as
Sol: In a tree, each edge is a cut set.
a e
Number of edges in a tree with 10 vertices = 9
f
 Number of cut sets possible on a tree with b
d
h
10 vertices = 9 c g
The vertex d is a cut vertex of G.

38. Ans: 1, 2
 K (G) = 1
Sol: The graph can be labeled as
We have (G)   (G) = 3 ...... (1)
a e
G has no cut edge and by deleting any two
c edges of G we cannot disconnect G.
b d   (G) = 3


41. Ans: S1, S3 & S4  n 1 
Now |V(G1)|    1
Sol: S1: This statement is true.  2 
n 1
Proof: Similarly, | V(G 2 ) |
2
Suppose G is not connected G has atleast 2 Now, |V(G)|= |V(G1)|+ |V(G2)|
connected components.  |V(G)|  n +1
Let G1 and G2 are two components of G. Which is a contradiction
Let u and v are any two vertices in G G is connected.
We can prove that there exists a path S4: If G is connected, then the statement is
between u and v in G. true. If G is not connected, then the two
Case1: u and v are in different component vertices of odd degree should lie in the same
of G. component,
Now u and v are not adjacent in G. By sum of degrees of vertices theorem.
 u and v are adjacent in G  There exists a path between the 2
Case2: u and v are in same component G1 of vertices.
G. Take any vertex wG2.
Now u and v are adjacent to w in G. 42. Ans: S1, S2 & S4
 There exists a path between u and Sol: The graph G can be labeled as
v in G. Hence, G is connected. a d
S2: The statement is false. c

we can give a counter example. b e
c c
The number of vertices with odd degree is 0.
d a
 S1 and S2 are true
a b d b C is a cut vertex of G.
G G  Hamiltonian cycle does not exists.
By deleting the edges {a, c} and {c, e},
Here, G is connected and G is also there exists a Hamiltonian path
connected. a–b–c–d–e
S3: Suppose G is not connected
Let G1 and G2 are two connected 43. Ans: S1, S3 & S4
components of G. Sol: The graph G can be labeled as
Let vG1 e d
n 1  n 1  c
 deg(v)   (G )  
2  2 
a b


The number of vertices with odd degree = 2 46. Ans: 33
 Euler path exists but Euler circuit does Sol: If G has K components, then
not exist. |E|=|V|–K
There exists a cycle passing through all the  26 = | V | – 7
vertices of G.  | V | = 33
a – b – c – d – e – a is the Hamiltonian cycle
47. Ans: (b)
of G.
Sol: A 2-regular graph G has a perfect matching
The Hamiltonian path is a – b – c – d – e
iff every component of G is an even cycle.
S2 and S4 are true.
44. Ans: S1 & S2
Sol: The number of vertices with odd degree = 0 S1 need not be true. For example the
complete graph K2 has a perfect matching
 S1 and S2 are true.
but K2 has no cycle.
To construct Hamiltonian cycle, we have to
S3 need not be true. For example G can have
delete two edges at each of the vertices a
two components where each component is
and f. Then, we are left with 4 edges and 6
K2.
vertices.
 G has neither Hamiltonian cycle nor 48. Ans: 21
Hamiltonian path. Sol: In a simple graph with n vertices and K
components,
45. Ans: (b) n  k n  k  1
|E|>
Sol: S1 is false. We can prove it by giving a 2
counter example.  Required minimum number of edges
Consider the graph G shown below 
n  k n  k  1  21
a 2
d
Where n = 10 and k = 4
c
b e 49. Ans: (d)
‘e’ is a cut vertex of G. But, G has no cut Sol: G has exactly two vertices of odd degree.
edge Therefore, Euler path exists in G but Euler
S2 is false. We can prove it by giving a circuit does not exist.
counter example. In Hamiltonian cycle, degree of each vertex
For the graph K2 shown below, is 2. So, we have to delete 2 edges at vertex
‘d’ and one edge at each of the vertices ‘a’
a b
and ‘g’. Then we are left with 8 vertices and
The edge {a, b} is a cut edge. But K2 has no 6 edges. Therefore, neither Hamilton cycle
cut vertex. exists nor Hamiltonian path exists.


50. Ans: (b) 52. Ans: (a)
Sol: G has cycles of odd length Sol: Vertex connectivity of G = k(G)  (G)
Chromatic number of  (G)  3
G = (G)  3 ……(1) By sum of degrees theorem
For the vertices c and h we can use same
3| V |  2 | E |
color C1
 | E |  15
The remaining vertices from a cycle of
 Minimum number of edges necessary = 15
length 6.
A cycle of even length require only two
colors for its vertex coloring.
For vertices a, d and f we can apply same 4. Set Theory
color C2
For the vertices {b, e, g} we can use same
01. Ans: (c)
color C3
Sol: (a) A  (A  B) = A (Absorption law)
  (G) = 3
A perfect matching of the graph is  Option (a) is false
a–b, c – d, e –f, g – h (b) A  (AB) = A (Absorption law)
Matching number = 4  Option (b) is false
Hence, chromatic number of G (c) (AB)  (A B )
+ Matching number of G = 3 + 4 = 7 = A (B B ) Distribution law
=A
51. Ans: (c)  Option (c) is true
Sol: S1 need not be true. Consider the graph
02. Ans: (b)
Sol: If S = {} then
(a) P(S)  S = {}
Here, we have 6 vertices with degree 2,
 option (a) is false
but the graph is not connected.
(b) P(S) P(S) = {, {}}
S2 need not be true. For the graph given
 Option (b) is true
above, Euler circuit does not exist, because
(c) If S = {a, b} then
it is not a connected graph.
P(S)  S = 
A simple graph G with n vertices is  option (c) is false
n 1 (d) false
necessarily connected if (G)  .
2 Refer option (b)
 S3 is true.


03. Ans: (a) 05. Ans: (c)
Sol: Given that Sol: Let xX
ABS Case 1: If x is even number then it can
The venn-diagram is shown here appear in two ways i.e., either x  A – B
Here, each element of S can appear in 3 or x  B – A
ways Case 2: If x is odd number then it can
i.e., x  A or x  (B – A) or x  (S – B) appear in two ways i.e., xA  B or
In all 3 cases, A  B  S. 
x A  B 
By product rule, the 6 elements of S can
 By product rule, required number of
appear in 36 ways.
6
subsets = 2100
 Required number of ordered pairs = 3 =
729
06. Ans: (c)
Sol: If A  B = (AB)C
04. Ans: (a, c & d)
Sol: 
Then A  B =  
A I II III B But (AB)  A  B = U  
V
IV VI  (AssB) = U
VII
Where U is universal set
C
07. Ans: (d)

I, II,…….., VII are regions
Sol: (a) Let AB = A
(a) (A – B) – C = {I, IV} – {IV, V,VI, VIII}
= {I}  AB = A
(A – C)–B = {I, II, IV, V} – {IV, VII}  B=
= {I, II, V}
 Option (a) is false (b) (AB) B
(b) A–(BC) = (A–B) (A–C) is true by = A  (B  B)
Demorgan’s law =A
=A
(c) A–(B–C) = {I, II, IV, V} – {II, III} (c) A  C = B  C
= {I, IV, V} A=B (cancellation law)
A–(C–B) = {I, II, IV, V} – {IV, VII} (d) LHS = A  B = (A  B) – (A  B)
= {I, II, V} RHS = (A  B)  (A  B)
 Option (c) need not be true = (A  B)
(d) Similarly show that option (d) is not true  L.H.S  R.H.S


08. Ans: (c) 10. Ans: (a)
Sol: (A) Let A = {1}, B = {2}, C = {3} Sol: Suppose R is irreflexive and transitive but
Now (AB) = (BA) =  not anti symmetric.
But A  B Let a R b and b R a
 (A) is not true ( R is not anti symmetric)
(B) Let A = {1}, B = {2}, C = {1, 2} aRa ( R is transitive)
Now AC = BC = C  R is not irreflexive.
But A  B Which is a contradiction.
 (B) is not true  R is anti symmetric
(C) Let x  A.
Consider the two cases 11. Ans: (d)
Case1: x  C Sol: Let A = set of all +ve integers
(A) We have a – a = 0 = an even integers
 x  (A  C) ( x  (A  C))
aRa aA
 x  (B C) ( A  C = B C)
 x  B ……….(1)  R is not reflexive
(B) Let aR b
Case2: x C
 (a – b) is an odd positive integer
 x  (A C)
 (b – a) is an odd negative integer
 x  (B  C)
xB ( x  C) ………(2) bR a
A  B (Form (1) and (2))  R is not symmetric

(C) Let (aR b) and (bR c)
Similarly we can show that B  A.
 (a–b) and (b – c) are odd +ve integers
A=B
Hence, (C) is true Now, a – c = (a – b) + (b – c)
(D) Let A = {1, 2} = An even +ve integer
B = {2, 3} aRc
C = {1, 3}  R is not transitive
Here, A – C = {2} = B – C (D) Let (aR b)
But, B  C  (a – b) is an odd +ve integer
 (D) is not true  (b – a) is an even +ve integer
b R a
09. Ans: 126  R is asymmetric
Sol: Required number of multi sets = V(6, 4)
 R is antisymmetric
= C(6 – 1 + 4, 4)
= C(9, 4) = 126


12. Ans: (c) 15. Ans: (b)
Sol: R1 is not a function because, the element d Sol: Suppose R is symmetric
of A has no image in B  (a, b)  R and (b, a)  R
R2 is not a surjection, because the element 3  (a, a)  R which is impossible
in B is not mapped by any element of A. because R is irreflexive.
R3 is a surjection, because each element of
 R is not symmetric
B is mapped by atleast one element of A.
Suppose, R is not asymmetric
R4 is not a function, because the element a
 (a, b)  R and (b, a)  R
in A is mapped with two elements in B.
 (a, a)  R (By transitivity)
13. Ans: (a) which is impossible because R is irreflexive.
Sol: R = {(1, 1), (2, 2), (2, 3), (2, 4), (3, 2), (3,3),  R is asymmetric
(3, 4), (4, 2), (4, 3), (4, 4)}  R is anti-symmetric
R is an equivalence relation
[1] = {1}
16. Ans: (d)
[2] = {2, 3, 4}
Sol: (a) we have (a, b)R(a, b) a, bS because ab
[3] = {2, 3, 4}
= ba
[4] = {2, 3, 4}
 R is reflexive
14. Ans: (d) (b) Let (a, b) R (c, d)
Sol: (A) We have   P(S)  ad = bc
and (  ) =   cb = da
  is not related to   (c, d) R (a, b)
 R is not reflexive
 R is symmetric.
(B) R is not reflexive
(c) Let (a, b) R (c, d) adn (c, d) R (e, f)
(C) We have {1}  P(S)
 ad = bc and cf = de
and {1}  {1} = {1}  
a c c e
 {1} is related to 1   and 
b d d f
 R is not irreflexive
a e
(D) Let A R B  
b f
AB=
 af = be
BA=
BRA  (a, b) R (e, f)
 R is symmetric on P(A)  R is transitive
Let A = {1, 2}, B = {2, 3}, C = {3, 4} (d) R is not antisymmetric
R R R
Here A B and B C, but A B For ex. (1, 2) R (2, 4) and (2, 4) R (1, 2)
 R is not transitive.


17. Ans: (d) 21. Ans: (c)
Sol: Equivalence class of x = [x] Sol: The digraph for R is shown below
= {y | (x  y) is a rational number}
2
= set of all non zero relational numbers
1 3
18. Ans: 26
Sol: If A is set with n elements, then number of
n  n 1 4
asymmetric relations possible on A  3 2
We see that from vertex 1, we have paths to
The only relation which is symmetric and vertices 2, 3, 4 and 1.
asymmetric is the empty relation on A. From vertex 2, we have paths to vertices 1,
n  n 1
 Required number of relations  3 2
1 2, 3 and 4.
Where n = 3 From vertex 3, we have path to vertex 4.
3
= 3 –1 = 26  Transitive closure of R = {(1, 1), (1, 2),
(1, 3), (1, 4), (2,1), (2,1), (2,3), (2,4), (3, 4)}.
19. Ans: (c)
Sol: If R is antisymmetric, then (R  R–1)  A. 22. Ans: 392
Any subset of diagonal relation is Sol: Number of relations on A which are
symmetric, antisymmetric and transitive. symmetric or reflexive
But, (R  R–1) is not asymmetric, because n  n 1 n  n 1
diagonal pairs are not allowed in asymmetric  2 n n 1  2 2  2 2
relation. Where n = 3
= 26 + 26 – 23 = 120
20. Ans: (c)  Required number of relations
 2n  – 120 where n = 3
2
Sol: The equivalence class of 1 = [1] = {1, 2, 3}
[2] = {1, 2, 3} = 512 – 120 = 392
[3] = {1, 2, 3}
[4] = {4, 6} 23. Ans: (c)
[5] = {5} Sol: For a, b,  A
[6] = {4, 6} Let aRb
The partition of A with respect to R = set of  aRb and bRb ( R is reflexive)
all distinct equivalence classes of the  bR a (By definition of R)
elements of A  R is symmetric
= {{1, 2, 3}, {4, 6}, {5}} For any three elements a, b, c  A


Let aRb and bRc 26. Ans: (d)
R R
 c b and b a ( By definition of R and Sol: Let x, y, z be elements in a poset. If (xRz and
R is symmetric) zRy) then xRy.
R
a c (By definition of R)
In this case, there is no edge between x and
 R is an equivalence relation
y in the poset diagram even though x is
24. Ans: (c) related to y.

Sol: we have, a = a1 S1 is false and S2 is also false.
R
a a aN
 R is reflexive on N
27. Ans: 49
Let a R b and b R a
Sol: The maximal elements are {51, 52,....., 100}
 a  b K1 and b  a K 2 ....... (1)
 Number of maximal elements = 50
 b  b K1   K2
 b K1 K 2 (from (1))
Note: An element x is said to be maximal, if
 k1 k2 = 1
x is not related to any other element of the
 k1 = 1 and k2 = 1
a=b from (1) poset.
 R is antisymmtric.
Let a R b and b R c 28. Ans: (b)
ab K1
and b  c K2
....... (2) Sol: In the given lattice, y and x are upper and
 a  cK2   K2
 c K1K 2 lower bounds.
 a  c K3 where k3 = k1 . k2 For the elements b & c, b  c = y & bc = x
aRc  b and c complements of each other.
 R is transitive Similarly, a and c are complements of each
R is not symmetric. For example 8 R 2 but 2
R other.
8
R is not a total order. For example 2 R 3 and For the element c we have two
3R2 complements.
 only option (c) is correct.  The given lattice is not distributive.
In the given lattice, each element has atleast
25. Ans: 32
one complement.
Sol: The Hasse diagram of the poset is 4-cube.
Number of edges in n-cube = n.2n–1  The given lattice is a complemented
 Number of edges in the Hasse diagram = lattice.
4. 24–1 = 32 Hence, only S3 is false.


29. Ans: (A) complement of d = c
Sol: The Hasse diagram of the poset is shown complements of e = a
below. Since, each element has atleast one
The number of edges in the poset = 9 complement, the given Lattice is a
complemented Lattice.
72
In a distributive Lattice, each element has
24 36 atmost one complement.
12
Since, the element c has two complements,
the given Lattice is not a distributive
6 Lattice.
2 3
32. Ans: (d)
1 Sol: The greatest lower bound of c and d does not
In the poset, for every pair of elements lub
exist in the poset.
and glb exist
 The poset is not a lattice.
 The poset is a lattice.
30. Ans: (b) 33. Ans: (d)

Sol: For the given lattice, Sol: R is a partial order on A.
Complement of a = e
4
Complement of b = c
Complements of c are b and d 2 3
Complement of d = c
Complement of e = a 1
Since each element of L has a complement The Hasse diagram is a 2-cube.

in L, L is a complemented lattice.  [A; R] is a boolean algebra.
Since, the element c has two complements,
L is not a distributive lattice.
34. Ans: 9
Sol: D36 = {1, 2, 3, 4, 6, 9, 12, 18, 36}
31. Ans: (b)
Sol: Let us give the complements of each Let x be the complement of 4.
element. lub of 4 and x = l.c.m of 4 and x = 36
complement of a = e and glb of 4 and x = g.c.d of 4 and x = 1
complement of b = c x=9
complements of c are b and d


35. Ans: (d) 39. Ans: (c)
Sol: The Hasse diagram of the poset is shown Sol: Let f(a, b) = f(c, d)
below
 (2a – b, a – 2b) = (2c – d, c – 2d)
12
 2a – b = 2c – d and a – 2b = c – 2d
4 6
 a = c and b = d
2 3  (a, b) = (c, d)
1  f is 1 – 1
The elements 1 and 12 are complement of Let f(x, y) = (u, v)
each other.  (2x – y, x – 2y) = (u, v)
The elements 3 and 4 are complements of
 2x – y = u and x – 2y = v
each other.
2u  v u  2y
For the elements 2 and 6 complements do x and y 
3 3
not exist.
If u and v are any two real numbers, then
36. Ans: (b)  2u  v u  2 v 
R  ,  RxR 
Sol: If x y then x  y = y and x  y = x  3 3 
 only option (b) is true  f is onto
Hence, f is a bijection.
37. Ans: (d)
Sol: we have f(1) = f(2) = 50
 f is not one-to-one 40. Ans: (b)
In the co-domain, the integers 1, 2, 3...... 49 Sol: Let G = set of all odd integers.
are not mapped by any integers of the G is closed with respect to multiplication.
domain. Multiplication of odd integers is associative.
 f is not on-to 1 is identity element of G with respect to
multiplication.
38. Ans: (b)
Sol: Inverse of a functions exists iff f is a  G is a monoid w.r.t multiplication.
bijection. G is not a group w.r.t multiplication. For
Here, f is not a bijection 1
example, inverse of 3 =
for example f(1) = f(2) = a 3
 f is not 1 – 1 1
g is a bijection But  G.
3
 g–1 exists.


41. Ans: (a) 45. Ans: (b)
Sol: The identity element of the group (P(S), *) Sol: Let 'e' be the identity element of Z w.r.t. *
is . Now, a*e=a
a+e+1=a
Inverse of A = A  A  P(S)
 e = –1
Because, (A*A) =   A  P(S)
Let x be the inverse of –5
 Inverse of {1} = {1}  –5 * x = e
 –5 + x + 1 = –1
42. Ans: 54 x=3
Sol: Number of generators =  (81), where  is
Euler function. 46. Ans: (d)
Sol: Let a, b, c are any 3 integers.
 3 1
 81   54 3a . 3b = 3a+b  G  a, b,  Z
 3 
 Multiplication is a closed operation on G.
The elements of G are relational numbers
43. Ans: (a)
and multiplication of rational numbers is
Sol: Any group with 4 elements is abelian.
associative.
 The rows and columns of the table are
we have, 1 = 30  G and
identical
3a . 30 = 3a aZ
 First row is a b c d
 Identity element exists.
and second row is b d a c
In the composition table of a group, in each If n  Z then –n  Z.
row and each column the entries are distinct. For each element 3n  G we have 3–n  G
 The entry in the third row and third such that
column is c. 3n . 3–n = 30
Hence, the fourth column is d  Each element of G has inverse in G.
c Further, multiplication of rational numbers is
b commutative.
a  G is an abelian group w.r.t multiplication
44. Ans: 6 47. Ans: (c)

Sol: The identity element of the group is 1. Sol: (a) 2 * 6 = 12  S
* is not a closed operation on S
If x is inverse of 2, then 2 11 x = 1
(b) 1 * (–4) = |– 4 | = 4  S
x=6
* is not a closed operation on S


(C) a * b = (a + b2) S  a, b  S 5. Probability
 * is a closed operation on S
(D) 2 * 3 = 2 – 3 = –1  S
* is not a closed operation on S 01. Ans: (c)
Sol: Proof by contradiction:
48. Ans: (c) S1: Suppose, A and B are mutually exclusive
Sol: (a) The set {1, 4} is closed w.r.t. the given and independent
binary operation. P(A  B) = P(A) . P(B)
 It is subgroup of G 0 = P(A) . P(B)
(b) The set {1, 11} is closed w.r.t. the ( A and B are mutually exclusive)
given binary operation.  P(A) = 0 or P(B) = 0.
This is a contradiction, because A and B are
 It is a subgroup of G.
possible events.
(c) The set {1, 13} is not closed w.r.t. the
Hence, A and B are not independent.
given binary operation.
S2: Suppose A and B are independent and
 The set is not a subgroup of G.
mutually exclusive.
(d) The set {1, 14} is closed w.r.t. the given
binary operation. Then, P(A) . P(B) = P (A  B) = 0
 P(A) = 0 or P(B) = 0
 It is a sub group of G.
Which is a contradiction, because A and B
49. Ans: (b) are possible events.
Sol: We have Hence, A and B are not mutually exclusive.
a * b = g.c.d of {a, b} D12  a, bD12
02. Ans: (b)
 * is a closed operation on D12
Sol: Case 1: The first 5 cars sold are not
* is associative on D12
defective and 6th car is defective.
We have a * 12 = a  a
C8, 5 2
The identity element = 12 The Probability for this event  .
C10, 5 5
The inverse of any element in D12 except Case 2: The first 5 cars sold have one
12 does not exist.
defective car and 6th car sold is defective.
(D12;*) is a monoid but not a group.
The probability for this event
C8, 4. C2,1 1
 .
50. Ans: (d) C10, 5 5
Sol: The identity element = 6 The required probability
We have, 22 = 2 10 2 = 4 C8, 5 2 C8, 4. C2, 1 1
 .  .
C10, 5 5 C10, 5
3 2
2 = 2 10 2 = 410 2 = 8 5
24 = 23 10 2 = 6 1
  0.2
 2 is a generator 5


03. Ans: (c) 08. Ans: 0.295
Sol: Required probability  PA  B  Sol: Number of ways we can choose two socks
 P AB  from the bag = C (15, 2) = 105
= 1 – P (A  B) Number of ways we can choose 2 socks of
= 1 – {P(A) + P(B) – P(A  B)} same colour= C(4,2) + C(6,2)+ C(5,2) = 31
= 1 – { 0.25 + 0.5 – 0.14} 31
 Required probability =  0.295
= 0.39 105
04. Ans: 0.3

09. Ans: 0.14285
Sol: P{(A  B )  (B  A )}
Sol: Required probability
= P(A) + P(B) – 2P(A  B)
1 1 1
= 0.7 – 2(0.2)  3
 6  9  .....
2 2 2
= 0.3
1   1   1  
2
 3 
1        ........ 
05. Ans: 0.83 range 0.83 to 0.84
3
2  2  2  3 

Sol: A  BC = A  (AC  BC)
 
C 1 1
P(A  B ) = P(A) + P(A  B ) = + C C 1  1  1
 .  = 0.14285
2 3 8  1 7
1 
5  8
= = 0.83
6
10. Ans: (a)

06. Ans: (a)
Sol: We know that
Sol: P(A  B) = P(A) + P(B) – P(A  B)
P(A  B)  min. of {P(A), P(B)}
0.5 = P(A) + P(B) – P(A). P(B)
 0.5 = P(A) + P(A) – P(A) . P(A)  P(A  B)  0.25 ......... (1)
 P(A) = 0.2929 we have, P(A  B)  P(S)
 {P(A) + P(B) – P(A  B)}  1
07. Ans: (a)
 {0.25 + 0.8 – P(A  B)}  1
Sol: Number of bit strings of length 6 = 26 = 64
Number of substrings with atleast four ones  0.05  P(A  B) ........... (2)
= C(6, 4) + C(6, 5) + C(6, 6) From (1) and (2), we have
= 15 + 6 + 1 = 22 0.05  P(A  B)  0.25
22 11
Required probability  
64 32


11. Ans: 0.3956 range 0.39 to 0.4 13. Ans: 0.44 range 0.43 to 0.45
3
1 5 1 Sol: Let A = Event of getting a sum of 5 and
Sol: Anita's chances of winning are ,   . ,
6 6 6 B = Event of getting a sum of 8
6 9
5 1 5 1 The probability that a sum of 5 is rolled
  . ,   . , .........
6 6 6 6
before a sum of 8 is rolled = conditional
P(Anita winning game)
3 6 9 probability for a sum of 5, given that a sum
1 15 1 5 1 5
=     .   .   ........ of 5 or 8 has occurred
6 66 6 6 6 6
PA  A  B
1

= 1  x  x 2  x 3  ........
6
 = P(A| A  B) =
PA  B
1
1  5  PA  n A 
3 3
5 1 4 4
 1
here x =   = 1  x = 1     = = = =
6 6 6   6   PA  B n A   n B 4  5 9
1
1  125  1  216  = 0.44
= 1   =  
6  216  6  91 
36
= = 0.3956 14. Ans: 0.9677 range 0.96 to 0.97
91
Sol: Let A = Event that the family has atleast
12. Ans: 0.125 one girl
Sol: Let x1, x2 and x3 be the numbers on the 3
B = Event that the family has atleast one
dice.
Number of outcomes possible with 3 dice = boy
63 = 216 PA  B
Required probability = P(A|B) =
Number of outcomes in which sum is 10 = PB
number of non negative integer solutions to
the equation x1 + x2 + x3 = 10 where 1 ≤ xi ≤ P(B) = 1 – P(The family has no boy)
6 (i = 1, 2, 3) 5
1 31
= coefficient of x10 in the expansion of =1–   =
(x + x2 + ……+ x6)3 2 32
= (x + x2 +..+x6)3 = x3(1 + x + x2 +….. + x5)3  
P(AB)= 1– P A  B = 1–{P( A )+ P( B )}
 x3
1  x  6 3
1 1  15
1  x 3 =1–    =
 32 32  16
= x3(1 – 3x6 + 3x12 – x18) (1 – x)–3

 x 3  3x 9  3x15  x 21 

n  1n  2 . x n
  15 
 
16 30
n 0 2 Required probability =   = = 0.9677
10
Coefficient of x = 36 – 3(3) = 27  31  31
 
27  32 
Required probability   0.125
216


15. Ans: 0.333 (range 0.33 to 0.34) 18. Ans: 2525
Sol: Let A = one of the face is 4 Sol: Given that, E(X) = 50 and  = 5
and B = The faces are different numbers
2 = E(X2) – {E(X)}2
Number of cases favourable to AB
E(X2) = {E(X)}2 + 2
= n(A  B) = 10
= 2500 + 25 = 2525
Number of cases favourable to B
= n(B) = 30
19. Ans: (c)
 Required probability = P(A|B)
Sol: Let X be the number of heads in first 3
PA  B n A  B 10 1 throws. X has the following probability
   
PB n B 30 3 distribution.
16. Ans: (b) X 0 1 2 3

Sol: Let A = Die is actually a six and P(X) 1 3 3 1
B = The outcome of die is reported as 8 8 8 8
six.
Required probability = P (A|B) Required probability
1 3 11 33 33 11
.   .    .    .    . 
P(A  B) 6 4 3
   88 88 88 88
P(B) 1 3 5 1 8
.  . 5
6 4 6 4 
16
17. Ans: (d)
Sol: A mode of the distribution of a continuous 20. Ans: 280
random variable X, is the value of x where Sol: The probability density function of
the probability density function attains a
 1
for 2  x  8
relative maximum. X  f x    8  2
df 0 , otherwise
consider, 0
dx V= volume of the box = 10 X2
 2x e–bx – b x2 e–bx = 0
E(V) = E (10X2) = 10. E(X2)
 (2 – bx) x = 0
 10 x 2 .f x  dx
8
2
 x = 0 or x  2
b 8 1
2  10  x  . dx
Thus the mode of X is . 2 6
b
= 280


21. Ans: 0.416 (range 0.41 to 0.42) 24. Ans: 209
1 1 Sol: E(2X+ 1)2 = (2X+1)2. P(X)
P  X  
3 2
Sol: Required probability   = {2(–3)+1}2
1
+ {2(6) + 1}2
1
1 2 6 2
P  X  
3 3
1
1 + {2(9)+1}2.
2 3
 2x dx
1
 5 
 
= 209
36 5
 3
 
2
 1  12 25. Ans: 0.22 (range 0.21 to 0.23)
3  
 2x dx  3   x
1
Sol: P(X  30)   e 20 dx
3
30
= e–1.5 = 0.22
22. Ans: 0.4285 range 0.42 to 0.43
Sol: P(j dots turning up)  j
 P(j dots turning up) = kj where k is 26. Ans: 0.035 range 0.034 to 0.036
proportionality constant Sol: Probability of getting 2 heads, in first 9
P(S) = P(1) + P(2) + ....... + P(6) = 1 1
9
 k + 2k +........ + 6k = 1 tosses = C(9, 2) .  

2
1
k= Required probability
21 9
Required probability = P(1) + P(3) + P(5) 1 1 9
= C(9, 2).   .   = = 0.035
1 3 5 3  2   2  256
= + + = = 0.4285
21 21 21 7
27. Ans: 11
23. Ans: (b) Sol: Let X = number of bombs striking the target
Sol: If f(x) is a probability density function, then

Suppose n bombs are dropped.
 f x dx  1 .
 Probability of not destroying the target
completely = P(X < 2)
 f x dx  
 2
2 x 2 dx = 1
 1
= P(X = 0) + P(X = 1)
 f(x) is probability density function. n n
1 1 n 1
 gx dx   1 | x |dx
 1
    n   n
 1 2 2 2
1 1  x dx  0 1  x  dx
0 1
= Probability of destroying the target
 x2  
0
x2 
1
= 1 – P(X < 2)
=  x     x   = 3
 2  1  2 0  n 1
1  n 
 g(x) is not a probability density function.  2 


we have to find the positive integer n such Required probability = P(X  2)
that = 1 – P (X < 2)
 n 1 = 1 – {P(X = 0) + P(X = 1)}
1   n   0.9
 2  = 1 – (e– +  e–)
n 1 1 1 
1  0.99   1    log e 3  0.3005
2n 3 3 
2n
  n 1 30. Ans: (c)
100
Sol: Average number of errors per page
 2n  (100n + 100)
390
By trial method, 211  100(1 + 11) =  0.75
520
Hence, the required number of bombs = 11.
Expected number of errors in a random
sample of 5 pages = 5 (0.75)
28. Ans: (b)
= 3.75
Sol: For Poisson distribution, standard deviation
Let X = Number of errors in a sample of 5
  2 pages.
=4 X has poisson distribution with parameter 

e . k
= 3.75.
P(X = K)  K  0,1, 2,....
K e   .k
– –4 P( X  k )  (k  0,1, 2...)
P(X = 1) =  e = 4e k
P(X  1) = 1 –P(X < 1) Required probability = P(X=0) = e– = e–3.75
= 1 – P(X = 0) = 1 – e– = 1 – e–4
Required probability = P(X = 1) | (X  1) 31. Ans: 0.2615 range 0.25 to 0.27
PX  1 4e 4 Sol: Required probability = P(X  2 | X  4)

  P2  X  4
PX  1 1  e 4 =
PX  4 
4
 4
x . e  
e 14
P(2  X  4) = 
x 2 x
 1 1 1  17

= e  2 3 4  =
–1   e 1
29. Ans: (c) 24
0 . e   1 x . e  
4
Sol: P (X = 0)  
0 3 P(X  4) = x 0 x
1  1 1 1 1  65 1
    log e   = e–1 1     = e
3  1 2 3 4  24
  = loge 3 17
 Required probability = = 0.2615
65


32. Ans: (b) 35. Ans: 0.416 (range 0.41 to 0.42)
Sol: Let X = number of cashew nuts per biscuit. Sol: Let X represent the co-ordinate of the chosen
We can use Poisson distribution with mean point. The probability density function of X
2000
 2 is
1000
 1
e   . k , 0X2
P (X  k )  (k  0,1,2...) f x    2
k  0, otherwise
Required probability =P (X =0) 3
– –2
= e = e = 0.135 2 3 1 2
P  X     dx
3 2 2 2
3
33. Ans: (a)
Sol: f(x) is an even function. The probability 13 2 5
   
density function is symmetric about y axis. 2  2 3  12
Thus, the median of X = 0
36. Ans: 0.7
34. Ans: 0.1974 (range 0.19 to 0.20) Sol: The probability density function of
X4
Sol: The standard normal variable Z  1
  for 0  x  10
X  f x   10
X3  0 otherwise

4
 
X=2 Z
1 10 

P  X    7  P X 2  10  7X
X

4  
1 = P(X2 – 7X + 10  0)
X=4 Z
4 = P{(X – 5) (X – 2) 0}
Required probability = P(2 < X < 4)
= P(X  2 or X  5)
 1 1
 P   Z   = 1 – P(2  X  5)
 4 4
= 1   f x  dx
5
 1
 2 P 0  Z   2
 4
5 1
0.0987 = 2(0.0987)  1  dx
2 10
= 0.1974
3
 1  0.7
10
0.5
z
0 0.25


37. Ans: 0.2 (By symmetry of normal curve)
Sol: The area under normal curve is 1 and the = 0.5 – 0.4082
curve is symmetric about mean. = 0.0918
Expected number of students who
weigh less than 68 kgs = 300 × 0.0918
0.3
= 28
80 100 120 (iii) When X = 65, we have Z = –1
When X = 71, we have Z = +1
 P(100 < X < 120) = P(80 < X < 120)
Required probability = P(65< X < 71)
= 0.3
= Area under the normal curve to the
Now, P(X < 80) = 0.5 – P(80 < X < 120)
left of Z = – 1 and Z = +1
= 0.5 – 0.3 = 0.2
= 0.6826
(By Property of normal curve)
38. Ans: (i) 28 (ii) 28 (iii) 205
Expected number of students who
Sol: The parameters of normal distribution are
weighs between 65 and 71 kgs
 = 68 and  = 3
= 300 × 0.6826
Let X = weight of student in kgs
 205
X 
Standard normal variable = Z =

39. Ans: 0.393
(i) When X = 72, we have Z = 1.33
Sol: The probability density function of X is
Required probability = P(X > 72)
 e  x , x  0
= Area under the normal curve to the right f (x) = 
0 ,x 0
of Z = 1.33 5
= 0.5 – (Area under the normal curve P(X<5) =  f ( x ) dx
between Z = 0 and Z = 1.33) 0
5 x
= 0.5 – 0.4082 1
=  e 10 dx  0.393
= 0.0918 0
10
Expected number of students who weigh
greater than 72 kgs = 300 × 0.0918 = 28 40. Ans: (a)
1 1
(ii) When X = 64, we have Z = –1.33 Sol: Mean  0.5   = =2
 0.5
Required probability = P(X  64) The probability function of exponential
= Area under the normal curve to the distribution is f(x) = 2e–2x, x  0.
left of Z = – 1.33
P(X >
1
2


) = 1 2e 2 x dx =  e  2 x 
1
= 0.5 – (Area under the normal curve 2 2
between Z = 0 and Z = 1.33) = (0) – {–e–1} = e–1



41. Ans: (d) 1 1
44. Ans: k = 6, Mean = , Median = ,
1 x
1 2 2
Sol: The density function f(x) = e 5 1 1
5 Mode = and S.D =

2 2 5


We require P(x>8) = f ( x ) dx  e 8 / 5
8
Sol: we have  f (x) dx  1

= 0.2 1
 k(x  x ) dx  1
2
0
42. Ans: Mean = 34, Median = 35,
 x 2 1  x 3 1 
Modes = 35, 36 & SD = 4.14  k        1
 2 0  3 0 
 xi
Sol: Mean = = 34
n 1 1
 k   1
Median is the middle most value of the data  2 3
by keeping the data points in increasing  3 2
k =1k=6
order or decreasing order.  6 
 1
Mode = 36
 xf (x) dx   6(x  x 3 ) dx
2
Mean =
S.D = 4.14  0
1
x x 3 4
1 1  1
= 6    6    
43. Ans: 1.095 3 4 0 3 4 2
Median is that value ‘a’ for which
 x . PX  k 
5
Sol:  = Mean = k a
1 1
k 1
P( X  a ) =  6(x  x ) dx 
2
= 1(0.1) + 2(0.2) + 3(0.4) + 4(0.2) 2 0

2
 2 3

+ 5(0.1)  6 a  a   1
=3  2 3 2
1 1
P(X  2) = 0.1 + 0.2 = 0.3  3a2 –2a3 = 2  a =
2
P(X  3) = 0.1 + 0.2 + 0.4 = 0.7
Mode a that value at which f(x) is max/min
23  f(x) = 6x –6x2
 Median = = 2.5
2 f1(x) = 6 – 12x
Mode = The value of X at which P(X) is For max or min f1(x) = 0  6 – 12x = 0
1
maximum = 3  x = f11(x) = –12 f 11  1   12 < 0
5
2 2
Variance =  x . PX  k   
2
k
2
 maximum at x = 1/2
k 1  mode is 1/2
= 10.2 – 9 = 1.2 S.D = E( x 2 )  (E( x ))2
Standard deviation = 1.2 = 1.095 1

2 5


04. Ans: 324
6. Linear Algebra
Sol: Det Mr = 2r –1
Det M1 + Det M2 + ...... Det M18
01. Ans: 46656 = 1 + 3 + 5 + ..........+ 37
1 1 0 5 = 324
0 1 0 0
Sol: |A| =
5 2 3 5 05. Ans: –3
1  2 0 7 Sol: Given that |A|10 = 210
Expanding by second row  |A| =  2
1
5 0  –3 – 25 =  2
|A| = 5 3  5  3 = –27 or 3 = –23
1 0 7   = –3 or  =  233
1
Expanding by second column,

1 5 06. Ans: 8
|A| = 3 = 36
1 7 k
|adj A| = |A|3 = (36)3 = 46656

Sol: Given that A
n 1
n  72
Note: If A is n  n matrix, k k k
n–1
then |adj A| = |A|  k  k k  k  1 k  k = 72
2 2 2
k2 k2 k2  k 1
02. Ans: 625
C2  (C2 – C1), C3  C3 – C1
Sol: If A is n × n matrix,
k 0 0
then |adj (adj A)| | A |n 1
2
 k k 1
2
0 = 72
|A| = – 5 k 2
0 k 1
|adj (adj A)| = (–5)4 = 625
 k(k+1) = 72u
k=8
03. Ans: (b)
Sol: Here determinant of A = –8
1
–1adj A 07. Ans: (or) 0.5
A = 2
|A|
1 1 1
1
c= (cofactor of the element 6 in A) Sol: Given that  = 1 1  sin  1
8
1 1 1  cos 
1 2 3
=
8

.  131 
0 4
= –1
R2 – R1, R3 – R1


1 1 1 10. Ans: (c)
= 0 sin  1 Sol: Number of 2×2 determinants possible with
0 0 cos  each ,entry as 0 or 1 = 24 = 16.
= sin . cos  a b
sin 2 Let  =
= c d
2
If  > 0 then a = d = 1 and atleast one of the
1
 maximum value of  = entries b or c is 0.
2  The determinants whose value is +ve
08. Ans: 0 are
Sol: Given that 1 0 1 1 1 0
, and
cos x x 1 0 1 0 1 1 1
f(x) = 2 sin x x2 2x 3
 Required probability =
tan x x x 16
R2 R
applying and 3 11. Ans: 1
x x
Sol: If the vectors are linearly dependent, then
cos x x 1 1 t 0 0
f x  2 sin x
= x 2 1 1 t 0 0
x2 x
tan x 1 1 1 t
1 1
x  (1 – t)3 = 0
1 0 1 t=1
f x 
Lt = 2 0 2 =0
x 0 x 2
1 1 1 12. Ans: 1
Sol: If the vectors are linearly independent, then
09. Ans: (c) 1 1 0 1
Sol: In a symmetric matrix, the diagonal 1 0 0 1
0
elements are zero and aij = –aji for i  j. 1 1 0 t
Each element above the principal diagonal, 0 0 1 0
we can choose in 3 ways (0, 1, –1). Expanding by third column
Number of elements above the principal 1 1 1
n n  1  (–1) 1 0 1  0
diagonal =
2 1 1 t
 By product rule,
Required number of skew symmetric  (–1). (1 –(t–1)–1)  0
n  n 1 t1
matrices = 3 2
. 13. Ans: (c)


 1 2 5   1 2 5   1 1 0 0 0 
     0 1 1 0 0 
Sol:  2  4 a  4  ~  0 0 a  6   
 1  2 a 1  0 0 a  6 A ~  0 0 1 1 0 
     
 0 1 0 0  1
 0 0 0 1  1
 1 2 5
 
=  0 0 0  if a = –6 and Rank = 1 R4  R4 + R2
 0 0 0  1 1
  0
 0 1 1
0 0
 0 0 
If a  –6 then Rank of the matrix is 2 A~ 0 0 1 1 0 
 
 Option (c) is correct.  0 0 1 0  1
 0 0 0 1  1
14. Ans: (c) R4  R4 + R3

Sol: [A – AT] is a 33 skew-symmetric matrix  1 1 0 0 0
 0 1 1
 0 0 
 |A – AT| = 0
A ~  0 0 1 1 0
 (A)  3  
0 0 0 1  1
[A – AT] is not a zero matrix ( A AT)  0 0 0 1  1
Rank of [A – AT] is not zero. R5  R5 – R4

Further, rank of a skew-symmetric matrix  1 1 0 0 0
 0 1 1 0 0 
cannot be 1. 
A   0 0 1 1 0
 (A – AT) = 2  
0 0 0 1  1
 0 0 0 0 0 
15. Ans: 4
= Echelon form of A
 1 1 0 0 0
 0 0 1
 1 0   Rank of A = number of non-zero rows in
Sol: A   0  1 1 0 0 Echelon form of ‘A’ = 4
 
1 0 0 0  1
 0 0 0 1  1 16. Ans: (b)
R4  R4 + R1 Sol: The augmented matrix of the given system
 1 1 0 0 0 is
 0 0 1 1 0 
 1  1 2  1 1 
A ~  0 1 1 0 0  
  [A|B] = 1 0 1 1 0 
0 1 0 0  1
0  1 1  2  1
 0 0 0 1  1
R2 – R1
R2  R3


1  1 2  1 1   2 1 1 1
   
~ 0 1  1 2  1 ~  0  3 3 3
0  1 1  2  1  0 3  3 3
R3 + R2
R3 + R2
1  1 2  1 1 
   2 1 1 1
~ 0 1  1 2  1   
~  0  3 3 3
0 0 0 0  2
 0 0 0 6
Rank of coefficient matrix A = 2
Rank of [A|B] = 3 (A|B) = 3 and (A) = 2
 The system has no solution  The system has no solution when k = – 2
17. Ans: – 2 18. Ans: (d)

Sol: Let AX = B be the given system
 1 1 3 
If the system has no solution, then |A| = 0  
Sol: A =  5 2 6 
k 1 1   2  1  3
 
 1 k 1 0
1 1 k R2 – 5R1
R3 + 2R1
C1  C1 + C2 + C3
k2 1 1  1 1 3 
 
 k2 k 1 0 ~  0  3  9
k2 1 k
 0 1
 3 
R2 – R1, R3 – R1 3R3 + R2
k2 1 1 3 
1 1
 0 k 1 0  0  
~ 0  3  9
0 0 k 1 0 0 0 

 (k + 2) (k – 1)2 = 0
Here [A] = 2
 k = – 2, 1
when k = –2, the augmented matrix of the If B is a linear combination of columns of A,
system is then
 2 1 1 1 [A] = [A|B]
 
[A|B] =  1  2 1 1  The system has infinitely many solutions
 1 1  2 1
2R2 + R1, 2R3 + R1 19. Ans: (c)


Sol: If the system has non trivial solution, then Sol: Let the given system be AX = B
a b c The augmented matrix of the system =
b c a 0 1 1 1 6 
c a b  
[A|B] = 1 2 3 10
C1  C1 + C2 + C3 1 2   
abc b c R2 – R1, R2 – R1
 abc c a 0
1 1 1 6 
abc a b  
~ 0 1 2 4 
R2 – R1, R3 – R1 0 1   1   6
abc b c
R3 – R2
 0 cb a c 0
0 a b bc 1 1 1 6 
 
 (a + b + c) (a2 + b2 + c2 – ab – bc – ca) = 0 ~ 0 1 2 4 
0 0   3   6
 a + b + c = 0 or
a =b=c The system has unique solution if   3.
20. Ans: (b)

22. Ans: (c)
Sol: Let the given system be AX = B
1 3 1  2
The augmented matrix of the system 1 4 3  1
1 2  3 a Sol: A  
  2 3  4  7
= [A|B] = 2 3 3 b  
3 8 1  7
5 9  6 c 
Applying R2 – R1, R3 – 2R1, R4 – 3R1
R2 – 2R1
R3 – 5R1 1 3 1  2
0 1 2 1 
1 2  3 a  A~
  0  3  6  3 
~ 0  1 9 b  2a   
0  1 9 c  5a  0  1  2  1 
R3 – R2 Applying R3 + 3R2 and R4 + R2
1 2  3 a  1 3 1  2
  0 1 2 1 
~ 0  1 9 b  2a 
A~
0 0 0 c  b  3a  0 0 0 0
 
The system is inconsistent 0 0 0 0
if c – b – 3a  0 = Echelon form of A
 3a + b – c  0  Rank of A = 2
21. Ans: (c)


Number of linearly independent solutions = The eigen vectors for  = –5 are given by
n – k. [A + 5I] X = 0
Where n is the number of variables and k is
the rank of A 8 4   x  0 
      
= 4 – 2 = 2.  4 2   y  0 
 2x + y = 0
23. Ans: 2
Sol: The characteristic equation is 1
 X2 = c2  
|A – I| = 0   2
A real eigen value of A is  = 5 a+b=0
The eigen vectors for  = 5 are given by
[A – 5I] X = 0
25. Ans: (a)
0 0 0 1   x 1  0 
0 0 0 0   x 2  0 1 2
   Sol: Let A =  
0 0  3 1   x 3  0  0 2 
    
0 0 3  4   x 4  0  The eigen values of A are 1, 2
 x4 = 0, x3 = 0 The eigen vectors for  = 1 are given by
 [A] = 2 and n = 4=number of variables
[A – I] X = 0
 The number of linear independent eigen
vectors corresponding to  = 5 are 2. 0 2   x   0 
     
0 1   y   0 
24. Ans: 0 y=0
3 4 
Sol: Let a =   1 
4  3  X1 = c1  
The characteristic equation is 0 
|A – I| = 0 The eigen vectors for  = 2 are given by
3 4 [A – 2I] X = 0
 0
4 3
  1 2   x  0 
  = 5      
 0 0   y  0 
[A – 5I] X = 0  –x + y = 0
  2 4   x  0   2
        X2 = c2  
 4  8  y  0 1 
 x – 2y = 0
1   2
 2  The eigen vector pair is   and  
 X1 = c1   0  1 
1 


26. Ans: (c) 28. Ans: –6
Sol: If A is singular then 0 is an eigen value of A. Sol: The given matrix has rank 2
 The minimum eigen value of A is 0.  There are only 2 non zero eigen values
The eigen vectors corresponding to the eigen The characteristic equation is
value  = 0 is given by |A – I| = 0
[A – 0I]X = 0 1  0 0 0 1
3 5 2  x  0  0 1   1 1 0
 y   0  
 5 12 7     
0 1 1   1 0 =0
2 7 5  z  0 1 1 1 1   0
1 0 0 0 1 
Applying cross multiplication rule for first R1  R1 + R5 and
and second rows of A, we have R2  R2 + R3 + R4
x y z 2 0 0 0 2
  
11  11 11 0 3 3 3 0
x y z  0 1 1  1 0 =0
  
1 1 1 1 1 1 1  0
 The eigen vectors are 1 0 0 0 1 
1  (2 – ).(–3 – ).
X = k  1 1 0 0 0 1
 1  0 1 1 1 0
0 1 1  1 0 0
1 1 1 1  0
27. Ans: (b)
1 0 0 0 1 
Sol: Here, A is the elementary matrix obtained
  = 2, –3
given I3 with elementary operation R1  R3
 product of the non zero eigen values = –6
0 0 1 
29. Ans: 3
 A = 0 1 0
Sol: If  is eigen value then AX = X
1 0 0
4 1 2 1  1 
The characteristic equation is  17 2 1 
 2   2
   
|A – I| = 0 14  4 10 k  k 
 0 1  6 + 2k = 
 0 1  0  0 21 + k = 2
1 0   42 + 2k = 4
 (1 –  ) (  2 – 1) = 0   = 1, 1, –1  = 12 and k = 3


30. Ans: 3 33. Ans: 3
Sol: Sum of the eigen values = Trace of A = 14 2 0 1
 a + b + 7 = 14 ...... (i) Sol: Let A = 0 2 1
0 0 3
product of eigen values = |A| = 100
Here, A is upper triangular matrix
 10ab = 100
The eigen values are = 2, 2, 3
 ab = 10 .....(ii)
solving (i) & (ii), we have [A –2I]X = 0
 a = 5 and b = 2 0 0 1  x  0
 |a – b| = 3  0 0 1  y   0
0 0 1  z  0
31. Ans: 1  Here Rank of [A – 2I] = 1

Sol: Product of eigen values = |A| = 0  Number of Linearly independent eigen
vectors for  = 2 is n – r
3 4 2
=3–1=2
 9 13 7 0
For since,  = 3 is not a repeated eigen
6 9 x 4
value, there will be only one independent
R2 – 3R1, R3 + 2R1 eigen vector for  = 3.
3 4 2  The number of linearly independent eigen
 0 1 1 0 vectors of A = 3.
0 x 1 0
34. Ans: (d)
 3(1 – x) = 0
Sol: The characteristic equation is
x=1 (3 – 62 + 9 –4 ) = 0
|A|= product of the roots of the characteristic
32. Ans: (d) equation = 4
Trace of A = sum of the roots of
characteristic equation = 6
4 = 
 4 –  = 0 35. Ans: (b)
Sol: A is symmetric matrix.
 (3 –1) = 0
The eigen vectors of A are orthogonal.
  = 0, 1, –1  3 i For the given eigen vector, only the vector
  = 0, 1, –0.5(0.866)i given in option (b) is orthogonal.
 option (b) is correct.


36. Ans: (c)  Either ( –1) ( – 2) or ( –1) ( – 2)2 is
Sol: The characteristic equation is the minimal polynomial
(A – I) (A – 2I)
3 – 18 2 + 45  = 0
 4  6  6  3  6  6
  = 0, 3, 15
=  1 3 2   1 2 2  = O
The eigen vector for  = 15 are given by  3  6  5  3  6  6
[A –15I] X = 0  The minimal polynomial of A
 7  6 2   x  0  = ( – 1) ( – 2)
   6  8  4 
  y   0  = 2 –3 + 2
   
 2  4  12  z  0
LU Decomposition
x y z
   39. Ans: (b)
40  40 20
Sol: The coefficient matrix
x y z 4 5
  
2 2 1 A=  
12 14
 The eigen vectors for  = 15 are R2 – 3R1
2 4 5 
~  
X = k  2 (k  0) 0 1
 1  4 5 
U=  
0 1
37. Ans: (c)
40. Ans: (b)
Sol: The characteristic equation is 1 2 1
a  1 0 
Sol: A   2 3 3
1 a  1 0  3  10 2
0 1 a  R2 – 2R1
R3 + 3R1
 (a – ) [{(a – )2 –1} – (a – )] = 0 1 2 1 
 = a, a 2 ~ 0  1 1
0  4 5
38. Ans: 2 –3 + 2 R3 – 4R2

1 2 1
~ 0  1 1
5 6 6
0 0 1
1 4 2 =0
1 2 1
3 6 4
 U = 0  1 1
 ( –1) ( – 2)2 = 0 0 0 1


41. Ans: (a) 7. Calculus
 1  3 5
Sol: A   2  4 7 
 1  2 1  01. Ans: 1
1
R2 – 2R1 Sol: Put x = . Then y  0 as x  .
y
R3 + R1
 1 2 1
1  3 5  Given Lt = Lt  2   1  
 y y y
y 0
~ 0 2  3
0  5 6   1  2 y  y 2  1
= Lt  
5 y0
 y 
R3 + R2
2
1
1  3 5 
= Lt 2  2 y 
y 0
2 1  2y  y2
 
~ 0 2  3  (By L-Hospital's rule)
  3
0 0 2  =1

From the elementary operations used above,
02. Ans: 1
we can write
a x  xa
1
 0 0 Sol: Lt 
x a xx  aa
= –1
L= 2 1 0
 5  a x log a  a x a 1
 1 2 1  Lt = –1
  x  a x x 1  log x 
(By L' Hospital's Rule)

a a log a  a.a a 1
 = –1
a a 1  log a 
log a  1
 = –1
log a  1
 log a –1 = –log a – 1
 log a = 0
a=1


03. Ans: (a) 06. Ans: (d)
Sol: Given limit  tan x 
Sol: (A) Lt f x   Lt   = 1 = f(0)
 1  x 1  x 1  x 2 1  x 4 ........ 1  x 2 n  x 0 x 0
 x 
= Lt  
n 
 1 x   f(x) is continuous at x = 0
 1  x 2 n 1  5x 2  3x
= Lt  
1 (B) Lt f x   Lt
 x 0 x 0 2x
n 
 1 x  1 x
 10 x  3 
= Lt   (By L-Hospital's rule)
04. Ans: –2
x 0
 2 
3
 1  = = f(0)
Sol: Lt  sec x   [ –  form] 2

x  1  sin x 
2  f(x) is continuous at x = 0
1  sin x  cos x   0   1  x  1
= Lt    0 form (C) Lt f x   Lt  
x   cos x 1  sin x  

2
x 0 x 0
 x 
  cos x  sin x   1  x   1 
= Lt  
x    sin x  cos 2 x 

2
= Lt 

x 0 x 1  x  1


 
1
(by L' Hospital's Rule) = = f(0)
2
= –2
 f(x) is continuous at x = 0
 sin 2 x 
05. Ans: (c) (D) Lt f x   Lt  
x 0 x 0 1  cos x 
 
Sol: y = Lt tan x  (1 form)
tan 2 x
x
 2 sin x. cos x
4 = Lt
x 0 sin x
log y = Lt log tan x 
tan 2 x
x
 = 2  f(0)
4
 f(x) is not continuous at x = 0
Lt (tan 2x ). log(tan x ) 

x
4
07. Ans: (a)
 log tan x  
= Lt   Sol: Lt  f x   Lt  f x   f 2 = 3
 cot 2 x 
 x 2 x2
x
4
 The above function is continuous at x = 2
 cot x. sec 2 x 
= Lt   1, x  2
  2 cos ec 2 x  but f (x) = 
 2
x
4
 1, x  2
= –1  Lt  f  x   1 and Lt  f x   1
x 2 x2
 y = e–1
i.e. f(x) is not differentiable at x = 2


08. Ans: (d) 10. Ans: (c)
| x  3 |  | 2 | Sol: f1(x) = 2ax, x  1
Sol: f(1+) = Lt 
x 1 x 1 = 2x + a, x > 1
 x 32 Since, f(x) is differentiable at x = 1
= Lt = –1
x 1 x 1 f1(1–) = f(1+)
x 2 3x 13 2a = a + 2  a = 2
  2
f(1–) = Lt  4 2 4 Since, f(x) is continuous at x = 1
x 1 x 1 f(1–) = f(1+)
=
1
Lt 
x  1x  5 = –1 a+1=1+a+bb=0
4 x 1 x  1
11. Ans: (c)
 f is continuous and differentiable at x = 1
Sol: (a) Let f(x) = (x–2) in [1, 3]
| x  3 | 0
f(3+) = Lt  =1 Here, f(1)  f(3)
x3 x  3
 Roll's theorem is not applicable
 x  3 (b) Let f(x) = 1 – (1 – x)–1 in [0, 2]
f(3–) = Lt  = –1
x3 x  3 Here, f(x) is not continuous in [0, 2]
 f is not differentiable at x = 3  Roll's theorem is not applicable
However, Lt f ( x )  Lt | x  3 | 0  f (3) (c) Let f(x) = sin x in [0, ]
x3 x3
Here, f(x) is continuous in [0, ] and
 f is continuous at x = 3 differentiable in (0, ).
Further, f(0) = f()
09. Ans: (a)  Roll's theorem is applicable
Sol: If f(x) is continuous at x = 0, then (d) Let f(x) = Tan x in [0, 2]
Lt f ( x )  f (0) Here, f(x) is not continuous in [0, 2]
x 0
1
 Roll's theorem is not applicable
1 x  x
 Lt   = f(0)
x0 1  x
  12. Ans: 0.236
 1  x 1x  Sol: f(x) = x(x – 1) (x – 2)
 Lt  1
 = f(0) We have,
x 0 
 1  x x  f  (c) = 3c2 – 6c + 2, a = 0 and b = 1/2
e 1 Substituting in the given relation, we get
  f(0) 12c2 – 24c + 5 = 0
e
 c = 1.764 (or) 0.236
 f(0) = e–2 We have to choose c = 0.236, since it only
lies between 0 and 1/2.


13. Ans: 1.732 16. Ans: (b)
Sol: By Cauchy's mean value theorem b
Sol: f(x) = ax +
f d  f (3)  f (1) x

gd  g(3)  g(1) b
f (x) = a –
  x2
 3 1 2b
 –d =   f (x) =
 1  1 x3
 3  b
f (x) = 0  x =
 d= 3 a
b
At x = , f (x) > 0
14. Ans: 8 a
Sol: f(x) = 2x3 – 3x2 – 12x + 1
b
f1(x) = 6x2 – 6x – 12  f(x) has minimum at x =
a
f1(x) = 0  x = –1, 2 This is the only extremum (minimum in the
f11(x) = 12x – 6
interval (0, )).
f11(–1) = – 18, f11(2) = 18
b
f(x) has maximum at x = –1  The least value of f(x) occurs at x =
a
The maximum value of f(x) at x = –1
= f(–1) = 8
17. Ans: (c)
Further, At the end points of the given
x sin t
interval Sol: f(x) =  0 t
dt
 5   33
f(–2) = –3 and f    sin x
2 2 f (x) =
x
 The greatest value of f(x) = 8
f (x) = 0  x = n (n = 1, 2, 3..........)
x cos x  sin x
15. Ans: (c) f (x) =
x2
x3
Sol: f(x) = sin x – x +
f (n) =
1
cos n =
 1  0 n
3
n n
f (x) = cos x – 1 + x2
f  (n) > 0 if n is even
f (x) = – sin x+ 2x
and f (n) < 0 if n is odd
f(x) = – cos x + 2
 f(x) has maximum at x = n where n
f (0) = 0, f(0) = 0 and f (0) = 1  0
is odd
 f(x) has neither maximum nor minimum
Further f(x) has minimum at x = n where
at x = 0
n is even


18. Ans: (c)  
f(a+ b –x) = f   x 
Sol: Let g(x) = 3x4 + 8x3 – 18x2 + 60 2 
g1(x) = 12x3 + 24x2 – 36x 4
sin x
=
g1(x) = 0  x = –3, 0, 1 sin x  cos 4 x
4
5
g11(x) = 36x2 + 48x – 36

12
Let I = f ( x ) dx
g11(0) = –36 < 0 
12
 g(x) has a maximum at x = 0 5
cos 4 x

12
= dx
 f(x) has a minimum at x = 0 
cos 4 x  sin 4 x
12
g11(–3) > 0  g(x) has a minimum at x = –3 again
5
 f(x) has a maximum at x = –3 I=  f (a  b  x ) dx
12

11
g (1) > 0  g(x) has a minimum at x = 1 12
5
 f(x) has a maximum at x = 1 = sin 4 x


12
 dx
12
sin 4 x  cos 4 x
adding
19. Ans: (a) 5
4
2I =  dx 
12
Sol: f(x, y) = 2(x2 – y2) – x4 + y4 
12
12
consider fx = 4x – 4x3 = 0 
I=
 x = 0, 1, –1 6
fy = –4y + 4y3= = 0
 y = 0, 1, –1 21. Ans: (a)
r = fxy = 4 – 12x2
 sin 2kx 
Sol: Let I   dx
s = fxy = 0
0 sin x
t = fyy = –4 + 12y2
 sin 2k   x 
 dx (By properties
0 sin   x 
At (0,1), we have r > 0 and (rt – s2) > 0
 f(x, y) has minimum at (0,1) of definite integrals)
At (–1, 0), we have r < 0 and (rt – s2) >0
 sin 2kx 
  dx  I
0 sin x
 f(x, y) has a maximum at (–1, 0)
 2I = 0
20. Ans: 0.523 I=0
Sol: We have,
b b 22. Ans: (d)
 f ( x ) dx =  f (a  b  x ) dx
  x  a  | x  b |  dx
a a b
1 Sol:
a
Here, f(x) =
1  tan 4 x
 x  a   b  x   dx
b
4
=
cos x a
=
cos x  sin 4 x
4
= (b – a)2


23. Ans: 39 27. Ans: 1.5 (range 1.4 to 1.6)
 x  dx
10
Sol: Sol: The region bounded by the curves is shown
4
below
4 x  dx  5 x  dx  ........  9 x  dx
5 6 10
=
5 6 10
=  4
4 dx   5 dx  ........  
5 9
9 dx
= 4 + 5 +......+ 9 y=x+1 y = cos x
= 39
24. Ans: (a) 

–1 0

2
 x sin
4
Sol: x cos 6 x dx
0

 x  1 if  1  x  0
 y = f(x) =  
I   sin 6 x cos 4 x dx (property 9)
20 cos x if 0  x  2

2 The require area

= 2  sin 6 x cos 4 x dx (property 6) 
  x  1dx   2 cos x dx
0
20
1 0
 5.3.1.3.1   3
2
I    3
10.8.6.4.2 2  512 
2
25. Ans: 4
 x sin x  dx = k
2
Sol: 28. Ans: (a)
0
 2 Sol: Put x = sin t so that dx = cos t dt
  x sin x dx    x sin x dx = k
0 
t varies from 0 to /2.
 x  cos x  sin x    x cos x  sin x 2   k

0
/2
  – [–3] = k Given integral = 0
sin 4 t cos 4 t dt
k=4

3.1 3.1 .   3
.
26. Ans: (a) 8.6.4.2 2 256
Sol: Put x = 2 Sec t
dx = 2 Sec t tan t dt
29. Ans: 25.12
x=2t=0
4

x=4 t Sol: Volume = 
0
 y 2 dx
3
 4
1
Given integral   3 sin 2 t cos t dt = 
0
 x dx = 8 cubic units
4 0


1
12
sin t 03 
3 3
32
 


30. Ans: (d) 33. Ans: (a)
3
 dy 
2
1 x
 x  1
3
Sol: Length =  0
1    dx
 dx 
Sol:
1
2
dx at x =1
3
1 x
=  1  x dx Let f x  
0
x  12
3
2 3
 f x    as x  1
= 1  x  2
 0
3 
1
14 Choose g x  
= x  12
3
f x   1 x 2
Lt  Lt   x  1   2
31. Ans: (b)
x 1 gx  x 1  x  12

 3 3
1  1 

2
Sol: xe x dx 1 x  12   x  1 1

Let f x   xe  x
2
1 1
  
2 0
f  x    xe  x  f x 
2
3
Converges to 0  gx  dx is divergent

1
 f(x) is odd function  By comparison test, the given integral

 The value of the given integral is 0. also diverges.
34. Ans: (a)

32. Ans: (a)
2
x3  1
dx 1
Sol:  2  2 2
dx
0 x
1 1
( 2 is even function)
Sol:  2x
dx
1 x x 1
dx 1 x3 1
= 2 Lt   2 Let f(x) =
x 0 0 x 2x
1 f x    an x  2
(since is not defined)
x2 f x   x3  1 
Lt  Lt   2  x   9 finite 
 1
1 x 2 gx  x  2
 2x 
= 2 
 x 0 2 2
1
 gx   
2
 2 t  2 convergent
= 2{(–1) – (–)} 1 1 2x 1
= (Divergent)  By comparison test, the given integral

also diverges.


35. Ans: (d)

ex
Sol: 1 x 2 dx
ex
Let f x  
x2
1
Choose gx  
x2
We have 0  f(x)  g(x)  x  1

 gx  dx is known to be convergent.

1
 By compsssarison test, the given integral

also converges.

Discrete Mathematics

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Mathematics

Uploaded by

Copyright:

Available Formats

Discrete Mathematics

(Solutions for Vol‐1_Classroom Practice Questions)

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

Sol: The given formula can be written as y x

(Use the equivalence  (P→Q) (P   Q)) By the rule of negation

23. Ans: (a)  x (z(~)  y(~)}

32. Ans: (d)

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

37. Ans: (d) (b) L.H.S  x {A(x)  W}

where k + 1 = 6 and n = 2 The minimum value of k = 14

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

Using the initial condition, we get C1 = 1

Hence the solution is Coefficient of x27 = C(16, 7)

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

04. Ans: (e)

Here, the vertices a, b, c, d, e form a

12. Ans: 455

The graph has 9 vertices. The maximum

35. Ans: (a) 39. Ans: 2, 2

36. Ans: (b) b h

The vertex d is a cut vertex of G.

S2: The statement is false. c

07. Ans: (d)

A  B (Form (1) and (2))  R is not symmetric

diagonal pairs are not allowed in asymmetric  2 n n 1  2 2  2 2

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

24. Ans: (c) related to y.

30. Ans: (b) 33. Ans: (d)

Since each element of L has a complement The Hasse diagram is a 2-cube.

44. Ans: 6 47. Ans: (c)

04. Ans: 0.3

10. Ans: (a)

16. Ans: (b) X 0 1 2 3

 k + 2k +........ + 6k = 1 tosses = C(9, 2) .  

PX  1 4e 4 Sol: Required probability = P(X  2 | X  4)

between Z = 0 and Z = 1.33) = (0) – {–e–1} = e–1

= 1(0.1) + 2(0.2) + 3(0.4) + 4(0.2) 2 0

Expanding by second column,

|adj A| = |A|3 = (36)3 = 46656

14. Ans: (c) R4  R4 + R3

Rank of [A – AT] is not zero. R5  R5 – R4

17. Ans: – 2 18. Ans: (d)

20. Ans: (b)

31. Ans: 1  Here Rank of [A – 2I] = 1

38. Ans: 2 –3 + 2 R3 – 4R2

(By L' Hospital's Rule)

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

 f(x) has a maximum at x = 1 = sin 4 x

24. Ans: (a) 

Converges to 0  gx  dx is divergent

 f(x) is odd function  By comparison test, the given integral

34. Ans: (a)

= (Divergent)  By comparison test, the given integral

 gx  dx is known to be convergent.

 By compsssarison test, the given integral

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata

You might also like