Discrete Mathematics

(Classroom Practice Booklet Solutions)

1. Logic By associative law & distributive law

 
 P.Q  Q  P  .R 
Propositional Logic
By distributive law
01. Ans: (a)   
 P  Q  P  Q  .R

Sol: ( (P  Q)  (P  Q)  P) By Demorgan’s law & commutative law

 ( P   Q)  ( P  Q)  P = 1 .R
(By Demorgan’s law) =R
 (( P   Q)  ( P  Q))  P
04. Ans: (d)
(By Associative law)
Sol: (a) L.H.S  A  (P  C)
 ( P  ( Q  Q))  P
  A  (P  C) E16
(By Distributive law)
 ( A  P)  C Associative law
 ( P  T)  P
 (A   P)  C
( Q  Q is a tautology)
E16 & Demorgan’s law
  P  P (  P  T   P)
= R.H.S
T
(b) L.H.S = (P  C)  (Q  C)

02. Ans: (c)  ( P  C)  ( Q  C) By E16

Sol: (( P  Q)  ( P  Q))  R  ( P   Q)  C Distributive law

 (T )  R ((P  Q)  ( PQ))  (P  Q)  C By E16

R (T is a tautology) = R.H.S

(c) A  (BC)
03. Ans: (d)  ~A (~B  C) By E16
Sol: In Boolean algebra notation, the given  (~A ~B)  C By associative law
formula can be written as  (~B  ~A)  C By commutative law
P.Q.R  Q.R   P.R   ~ B (~A  C) By associative law
 P.Q .R  Q  P .R  B  (AC) By E16
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

(d) When A is false and B is false, we have (d) We have, (p  q)  (~p q)
LHS is true and RHS is false.  {, ~} is a functionally complete set.
 LHS  RHS
07. Ans: (b)
05. Ans: (d)
Sol: Argument I:
Sol: The truth table of a propositional function in
This argument is not valid, because it comes
n
n variables contain 2 rows. In each row the
under fallacy of assuming the converse.
function can be true or false.
Argument II:
By product rule, number of non equivalent
This argument is valid, by the rule of modus
propositional functions (different truth
tollens.
tables) possible  2 2 
n

Argument III:

06. Ans: (c) Let P : It rains and Q : Erik is sick

Sol: A set of connectives is said to be In symbolic form the argument is

functionally complete, if equivalent form of PQ

every statement formula can be written with P

those connectives. Q
(a) {, } is functionally complete because This argument is not valid, because when P
the other connectives can be expressed is false and Q true, the premises are true but
by these two connectives. conclusion is false.
(P  Q)   ( P   Q)
08. Ans: (d)
(P Q)  ( P  Q)
Sol: (a) The given formula is equivalent to the
(P  Q)( ( P  Q) (QP))
following argument
(b) {, } is functionally complete
(1) (a  b)  c
(P  Q)   ( P   Q)
(2) (a  b)
(P  Q)   (P   Q)
 (a  c)
(P  Q)  (P   Q)  (Q   P)
Proof:
(c) The set {,} is not functionally (3) a new premise to apply
complete, because, we cannot express conditional proof
‘not’ operation using the connectives (4) b (2), (3), modus ponens
 and 
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 :3: CSIT‐Postal Coaching Solutions

(5) (a  b) (3), (4), conjunction  It is not valid

(6) c (1), (5), modus ponens
09. Ans: (b)
 The argument is valid (c.p)
Sol: From the truth table
(b) The argument is
(x  y)  (x  ~y)
(1) ~ a  b 
(2) b  c  (p  q)  ~(~p  ~q)
(3) c  d   ~(~p  q)
 a  d 
10. Ans: (d)
(4) a new premise to apply C.P
Sol: If {(a  b)  (a  c)} has truth value
(5) ~ b (1), (4),
false, then 'a' has truth value true, b has truth
conjunctive syllogism(c.s)
value true, and c has truth value false.
(6) c (2), (5), D.S
For these truth values, only the compound
(7) d (3), (6), M.P
proposition given in option (d) has truth
 The given argument is valid
value true.
(conditional proof)

(c) The given formula is equivalent to the 11. Ans: (c)

following argument Sol: Let us denote the formula by P → Q,
(1) a Where P = (a  b) → c and Q = a → (b  c).
(2) (a  b)  (c  d) (a) Here Q is false only when a is true, b is
false, and c is false. For these truth
 (~b  c)
values P has truth value true.
Proof:
 (P → Q) has truth value false.
(3) ~ b now premise to apply c.p
(4) (a  ~b) (1), (3), conjunction  The given formula is not a tautology.

(5) ~(a  b) (4), E17 (b) When a is true, b is true and c is false;
(P → Q) has truth value true .
(6) (c  d) (2), (5), D.S
(7) c (6), simplification  The given formula is not a

 The argument is valid (c.p) contradiction

(c) The given formula true in one case and
(d) When a is false, b is true and c is false,
false in other cases
the given formula has truth value false.
 The given formula is a contingency.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 :4: Discrete Mathematics

12. Ans: (b) 14. Ans: (d)

Sol: We have Sol: (a) L. H. S   a  ( b  c) Equivalence
(p ↔ q)  (p → q)  (q → p)  ( a   b)  c Associativity
 (~ p  q)  (~ q  p)  (a  b) → c Equivalence
 Option (b) is true . = R. H. S.
(b) L. H. S  (a  b) → ( c → d)
13. Ans: (a)
Equivalence
Sol: Argument I
 (a  b   c) → d Equivalence
1. ~p → (q → ~w) premise
= R. H. S
2. ~s → q premise
(c) L. H. S. = (a → (a  b)) = T
3. ~t premise
R. H. S. =  a → (a →b)
4. (~p  t) premise
= a  ( a  b)
5. ~p (3),(4),
= (a  a)  b
disjunctive syllogism
=Tb
6. q → ~w (1), (5),
modus ponens =T

7. (~s → ~w) (2), (6), transitivity L. H. S = R. H. S

8. (w → s) (7), (d) When a is false and b is true

contrapositive property We have L. H. S. = F and R. H. S. = T

 Argument I is valid.  Option (d) is not true because

L. H. S.  R. H. S.
Argument II
15. Ans: (a)
We can not derive the conclusion from the
Sol: The given formula is equivalent to the
premises, by applying the rules of inference.
following argument
Further, when p, q, r, t and w has truth
1. ~ p→ (q→~w) Premise
values true, we have all the premises are true
2. ~ s → q Premise
but conclusion is false.
3. ~ (w→ t) Premise
 Argument II is not valid
4. (~ p  t) Premise
s

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

 :5: CSIT‐Postal Coaching Solutions

5. (w  ~ t) 3), Equivalence 17. Ans: (c)

6. w 5), Simplification Sol: If (p  q) is a contradiction, then p and q
7. ~t 5), Simplification have different truth values.
8. ~p 4), 7) S1 is valid, because (p  q) has truth value
Disjunctive syllogism false.
9. (q → ~w) 1), 8) Modus ponens S2 is valid, because (p  q) is true
10. ~q 9), 6) Modus tollens S3 is not valid, because when p is true and q
11. s 2), 10) Modus tollens is false,S3 has truth value false.
The argument is valid S4 has truth value ‘true’, in both the cases,
Hence, the given statement is a tautology i.e., {p true and q false} or {p false and q
true}
16. Ans: (d)
 S4 is valid.
Sol: (a) When p is true, q is false, and r is true;
the premises are true and conclusion is 18. Ans: (c)
false. Therefore, the argument is not Sol: Argument I is equivalent to the following
valid. argument.
(b) When p is false and r is true, the {p → r, q → r, p  q}  r
premises are true and conclusion is This argument is valid by the rule of
false. dilemma.
 The argument is not valid.  The given argument is also valid by
(c) When p is true, q is true, r is true, and s Conditional proof (C.P).
is false; then the given argument is not
Argument II is equivalent to the following
valid
argument
(d) The premises are true only when p is
{p → q, p → r, p}  (q  r)
true, q is true, r is true, s is false and t is
true. 1) p → q premise
Whenever the premises are true, the 2) p → r premise
conclusion is also true. 3) p new premise to apply (C.P)

 The argument is valid  (q  r)

4) q (1), (3), modus ponens

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

 :6: Discrete Mathematics

5) r (2), (3), modus ponens 23. Ans: (d)

6) q  r (4), (5), conjunction Sol: (a) valid (see Relationship diagram in

 Argument II is valid (Conditional Proof). material book)

(b) valid (see Relationship diagram in
19. Ans: (a) material book)
Sol: The given formula can be written as (c) valid (see Relationship diagram in
((ab)  (cd)  (b  d))  (a  c) material book)
This formula is valid, by the rule of (d) not valid (see Relationship diagram in
destructive dilemma. material book)

First order Logic 24. Ans: (d)

Sol: S1 is true
20. Ans: (a)
Once we select any integer n, the integer
Sol: To negate a statement formula we have to
m = 5 – n does exist and
replace x with x, x with x and negate n + m = n + (5 – n) = 5
the scope of the quantifiers.
S2 is true, because if we choose n=1
~{x {P(x)  ~Q(x)}} = x {P(x)  Q(x)}
the statement nm = m is true for any integer
(Use the equivalence m.
 (P  Q)  (P   Q)) S3 is false, for example, when m = 0 the
statement is false for all n
21. Ans: (c)
S4 is false, here we can not choose n = – m,
Sol: x (B (x)  I (x))
because m is fixed.
   [x (B(x)  I (x))]
  (x (B(x)   I (x))) 25. Ans: (b) & (d)
Sol: (a) L.H.S  x (A (x)  B(x))
22. Ans: (a)
 x ( A(x)  B(x)), E16
Sol: To negate a statement formula we have to
 x  A(x)  x B(x), E23
replace x with x, x with x and negate
 x A(x)  x B(x), E16
the scope of the quantifiers. Use the
= R.H.S
equivalence
 (P  Q)  (P   Q)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 :7: CSIT‐Postal Coaching Solutions

(b) L.H.S  {x  A(x)  x B(x)) (c) x (P(x) Q(x))  (x P(x)  x Q(x))
 x ( A(x)  B(x))
Indirect proof:
x (A(x)  B(x) = R.H.S
1) x (P(x)  Q (x)) Premise
But converse is not true
2)  (x P(x)  x Q (x))
 (b) is false
New premise to apply Indirect proof
(c) valid equivalence
3) x  P(x)  x Q(x)
(d) not valid (converse is not true)
(2), Demorgan’s law
26. Ans: (b) 4) x  P(x) (3), Simplification
Sol: (a) The given formula is valid by 5) x  Q(x) (3), Simplification
conditional proof, if the following 6)  P (a) (4), E.S
argument is valid. 7)  Q (a) (5), U.S
(1) x { P(x)  Q(x) } 8) ( P (a)  Q (a)) (6), (7),Conjunction
(2)  x P(x) new premise to apply C.P 9)  (P(a)  Q(a)) (8), Demorgan’s law
 x Q(x) 10) (P (a)  Q(a)) (1), U.S
Proof: 11) F (9), (10),
(3) P(a)  Q(a) (1) , U.S Conjunction
(4) P(a) (2), U.S  valid (Indirect proof)
(5) Q(a) (3),(4), M.P S2: The argument is
(6) x Q(x) (5) , U.S 1) x y (P(x, y)  W (x, y))
 The given formula is valid (C.P) 2)  W (a, b)
(b) The statement need not be true.   P(a, b)
Let c and d are two elements in the
(d) x{ P(x)  Q(x) } follows from
universe of discourse, such that P(c) is
(x P(x)  x Q(x))
true and P(d) is false and Q(c) is false and
 The given statement is valid.
Q(d) is false.
Now, the L.H.S of the given statement is
true but R.H.S is false.
 The given statement is not valid.

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

 :8: Discrete Mathematics

27. 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)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 :9: CSIT‐Postal Coaching Solutions

28. Ans: (d) 3) x P(x) from (1) and (2),

Sol: The given statement can be represented by by modus ponens,
S2. 4) x P(x) from (3)
Further, S1  S2  S3  S2 is valid
 Option (d) is correct
S3:
1) x P(x) premise
29. Ans: (b)
Sol: S1 is equivalent to the following argument 2) x Q(x) premise

1) x P(x) premise  x {(P(x)  Q(x)

2) x {P(x)  Q(x) premise (3) Q(a) (2), E.S.

(4) P(a) (1) U.S.
 x Q(x)
(5) P(a)  Q(a) (3), (4), conjunction
Here, we cannot combine (1) and (2), to get
the conclusion, because in both the formulae (6) x {P(x)  Q(x)} (5), U.G.

existential quantifiers are used.  S3 is valid

S2 is equivalent to the following argument

1) x P(x) premise
2) x {P(x)  Q(x) premise
 x Q(x)

30. 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
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 10 : Discrete Mathematics

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.

31. Ans: (b) 32. Ans: (b)

Sol: S1 is false. For x = 0. There is no integer y
Sol: P(x): x2–7x + 10 = 0
such that ‘0 is a divisor of y’
 x = 2, 5
S2 is true. If we choose, x = 1, then the
Q(x): x2 –2x – 3 = 0
statement is true for any integer y
 x = –1, 3
S3 is true. If we choose, x = 1, then the
S1) For x = 3, Q (x) true and R(x) is false.
statement is true for any integer y
S1 is not true.
S4 is false, because there is no integer y
S2) For x = –1, Q(x) is true and R(x) is true.
which is divisible by all integers.
S2 is true
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 11 : CSIT‐Postal Coaching Solutions

S3) For the integer x = 1, P(x) is false we get x = 1 and y = 3

P(x) → R(x) is true for integer  The given statement is true
S3 is true. (d) Solving the equations
3x – y = 7 and 2x + 4y = 3
33. Ans: (c) 31 5
we get x = and y = 
Sol: (a) When y = 2, the given statement is false 14 14
(b) When x = 2 the given statement is false  The given statement is false
(c) Solving the equations
2x + y = 5 and x – 3y = –8

34. 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.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 12 : Discrete Mathematics

35. Ans: (b)

Sol: (a) 1.  x {P(x)  Q(x)} Premise
2.  x ~Q(x) Premise
3. ~Q(a) (2) Existential Specification (E.S)
4. {P(a)  Q(a)} (1), Universal Specification (U.S)
5. P(a) (3), (4), Disjunctive Syllogism (D.S)
6.  x P(x) (5), Existential Generalization (E.G)
 The argument is not valid

(b) 1.  x ~P(x) Premise

2.  x {P(x)  Q(x)} Premise
3. ~P(a) (1), E.S
4. P(a)  Q(a) (2), U.S
From (3) and (4) we cannot derive the conclusion ~Q(a)
 The argument is not valid

(c) 1.  x {P(x)  Q(x)} Premise

2.  x Q(x) Premise
3. P(a)  Q(a) (1), U.S
4. Q(a) (2), U.S
From (3) and (4), we cannot derive the conclusion.
 The argument is not valid

(d) 1.  x P(x) Premise

2.  x ~{P(x)  Q(x)} Premise
3. ~{P(a)  Q(a)} (2), E.S
4. P(a) (1), U.S
5. ~Q(a) (3), (4), Conjunctive Syllogism
6.  x ~Q(x) (5), E.G
 The argument is valid

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

 : 13 : CSIT‐Postal Coaching Solutions

36. Ans: (c)

Sol: (a) If x is not free then
x {W  A(x)}  W  xA(x) is valid
Refer page 14 of material book.
(b) L.H.S  x {A(x)  W}
 {x A(x) }  x W
 x A(x)  W
(c) x { A(x)  W}
 x { A (x)  W} E16
 {x  A(x) }  W using (a)
 {x A(x) } W E16
 R.H.S
(d) valid refer derivation of option (c).

2. Combinatorics 02. Ans: (a)

Sol: n(BPC) = n(B) + n(P) + n(C) – n(BP)
01. Ans: 2 –n(PC) – n(BC) + n(BPC)
Sol:  34 = 14 +21 +13 –n(BP) –n(PC)
{n(A  B  C)} = sum of the elements in all – n(BC) +3
the regions of the diagram.
 n(B  P) + n(PC) +n(BC) = 17
= 33 – x
Number of students received awards in
 n(A  B  C) = 31 = 33 – x exactly two subjects = 17 – 3 – 3 – 3
x=2 =8
 n( A  B  C) = 2
03. Ans: (a)
A 11 3 11 – x B Sol: Number of students received awards in only
2
4 x
one subject = 34 – 8–3
2–x
= 23
C
Option (a) is correct.

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

 : 14 : Discrete Mathematics

04. Ans: (d)  85 = 42 + 42 + 36 – n(F  G)

Sol: – n(G S) – n(F S) + 4
e b f P
M
c
a
d  n(F  G) + n(G  S) + n(F  S) = 39
g
 (x + 4) + (y + 4) + (z + 4) = 39
C
Given:
 x + y + z = 27
50
a+b+c+d= Number of students who can speak
100
atleast two languages = x + y + z +4
40
b + c +d = = 31
100
III. Number of students who can speak
50 40
p. m. c = a =  exactly two languages = x + y + z = 27
100 100
1 IV. Number of students who can speak only
=
10 one of the 3 languages
p + m + c = (a+b+c+d+e+f+g)+(b+c+d)+2a =a+b+c
75 40 20 27 = 85 –(x + y + z + 4)
=   =
100 100 100 20 = 85 – 31 = 54

06. Ans: (d)

07. Ans: 18
Sol: I. Number of students who can speak
Sol: n(3  5) = Number of integers divisible by
atleast one language = 100 – (number of
3 and 5
students who can speak none of the 3
= Number of integers divisible by
languages)
L.C.M of 3 and 5
= 100 – 15 = 85
300
= = 20
II. 15
G F
a x b n(3  5  7) = Number of integers in the set
y 4 z divisible by L.C.M of {7, 3, 5}

c = Number of integers in the set

15 S divisible by 105 = 2
100
Required number of integers = 20 – 2
n (F  G  S) = n(F) + n(G) + n(S)
= 18
– n (F  G) – n(G S) – n(F  S)
+ n (F  G  S)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 15 : CSIT‐Postal Coaching Solutions

08. Ans: 4096 11. Ans: 2673

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

14. Ans: 243

Sol: Each element of A can appear in the subsets
in 3 ways.

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

 : 16 : Discrete Mathematics

Case 1: The element appears in P but does 18. Ans: 2880

not appear in Q. Sol: First girls can sit around a circle in 4
Case 2: The element appears in Q and does ways.
not appear in P. Now there are 5 distinct places among the
Case 3: The element does not appear in P girls, for the 4 boys to sit.
and does not appear in Q. Therefore, the boys can sit in P(5, 4) ways.
By product rule, By product rule,
n 5
Required number of ways = 3 = 3 = 243 Required number of ways = 4.P(5, 4)
= 2880
15. Ans: 150
Sol: Required number of ways = Number of onto 19. Ans: 1152
functions possible from persons to rooms Sol: Consider 8 positions in a row marked
= 35 – C(3, 1) 25 + C(3, 2) . 15 1, 2, 3,….., 8.
= 243 – 3 (32) + 3 Case 1: Boys can sit in odd numbered
= 150 positions in 4 ways and girls can sit in
even numbered positions in 4 ways.
16. Ans: P(10,6) = 151200
Case 2: Boys can sit in even numbered
Sol: Required number of ways
positions in 4 ways and girls can sit in odd
= Number of ways we can map the 6
numbered positions in 4 ways.
persons to 6 of the 10 books
= P(10,6) Required number of ways

= 151200 = 4.4 + 4 4 = 1152

17. Ans: (a) 20. Ans: 325

Sol: The 3 women can speak as a group in Sol: Number of signals we can generate using 1

3 ways. flag = 5

The women group can speak with other Number of signals we can generate using
two flags = P(5,2) = 5.4 = 20 and so on.
4 men in 5 ways.
Required number of signals
 Required number of ways
= 5 + P(5,2) + P(5,3) + P(5,4) + P(5,5)
= 5. 3
= 325
= 720
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 17 : CSIT‐Postal Coaching Solutions

21. Ans: 106 27. Ans: 2520

Sol: Each book we can give in 10 ways. Sol: Required number of ways
By product rule, Required number of ways = number of ordered partitions
= 106 10
= = 2520
3.2.5
22. Ans: 243
Sol: Each digit of the integer we can choose in 28. Ans: 945

3 ways. Sol: Required number of ways = Number of

By product rule, unordered partitions of a set in to 5 subjects

Required number of integers = 35 10

of same size =
(2.2.2.2.2).5
= 243
= 945
23. Ans: 12600
Sol: Required number of permutations 29. Ans: 600

10 Sol: We can select 4 men in C(5, 4) ways. Those

=  12,600
2.3.4 4 men can be paired with 4 women in
P(5, 4) ways.
24. Ans: 210
 Number of possible selections
Sol: Required number of binary sequences
= C(5, 4). P(5, 4)
10
=  210 = 5. (120) = 600
6.4

30. Ans: 120

25. Ans: 252
Sol: The 3 zeros can appear in the sequence in
Sol: Required number of outcomes
C(10,3) ways. The remaining 7 positions of
10
=  252 the sequence can be filled with ones in only
5.5
one way.
26. Ans: 2520 Required number of binary sequences
Sol: Required number of ways = C(10,3).1 = 120
10
= 31. Ans: 35
3.2.5
= 2520 Sol: Consider a string of 6 ones in a row. There
are 7 positions among the 6 ones for placing
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 18 : Discrete Mathematics

the 4 zeros. The 4 zeros can be placed in Number of rectangles possibles

C(7,4) ways. = C(9,2). C(9,2) = (36)(36) = 1296
Number of squares in a chess board
Required number of binary sequences
= 12 + 22 + 32 +….+ 82 = 204
= C(7,4) = C(7,3)
Every square is also a rectangle.
= 35
Required number of rectangles which are
32. Ans: 252 not squares = 1296 – 204 = 1092
Sol: To meet the given condition, we have to
35. Ans: 84
choose 5 distinct decimal digits and then
Sol: Between H and R, we have 9 letters. We
arrange them in descending order. We can
can choose 3 letters in C(9,3) ways and then
choose 5 distinct decimal digits in C(10,5)
arrange them between H and R in
ways and we can arrange them in
alphabetical order in only one way.
descending order in only one way.
Required number of letter strings = C(9,3).1
Required number of ways = C(10,5).1 = 252
= 84
33. Ans: 2n(n–1)
36. Ans: 210
Sol: We have 2n persons.
Sol: We can choose 6 persons in C(10, 6) ways
Number of handshakes possible with 2n
We can distinct 6 similar books among the 6
persons = C(2n,2)
persons in only one ways
If each person shakes hands with only
his/her spouse, then number of handshakes  Required number of ways

possible = C(10, 6). 1

=n = C(10, 4) = 210

Required number of handshakes

37. Ans: 1001
= C(2n, 2) – n = 2n(n –1)
Sol: Required number of ways = V(5,10)

34. Ans: 1092 V(n,k) = C(n–1+k, k)

Sol: In a chess board, we have 9 horizontal lines  V(5,10) = C(14,10)

and 9 vertical lines. A rectangle can be = C(14,4)

formed with any two horizontal lines and = 1001

any two vertical lines.

ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 19 : CSIT‐Postal Coaching Solutions

38. Ans: 455 V (3, 10) = C (12, 10) = C (12, 2) = 66

Sol: To meet the given condition, let us put We have to exclude the 3 cases where
1 ball in each box, The remaining 12 balls Xi = 10 (i = 1, 2, 3)
we can distribute in V(4,12) ways. Required number of integers = 66 – 3 = 63
Required number of ways = V(4,12).1
42. Ans: 1001
= C(15,12) = C(15,3) = 455
Sol: Let x1 = y1 + 2, x2 = y2 + 3, x3 = y3 + 4,
39. Ans: 3003 x4 = y4 + 5 and x5 = y5 + 6
Sol: The number of solutions to the inequality is Required number of solutions = Number of
same as the number or solutions to the non negative integer solutions to the
equation equation
x1 + x2 + x3 + x4 + x5 + x6 = 10 y1 + y2 + y3 + y4 + y5 = 10.
Where x6  0 = V(5, 10) = C(5 –1 + 10, 10)
The required number of solutions = V(6,10) = C(14, 10)
= C(15,10) = C(15,5) = 3003 = C(14, 4) = 1001

40. Ans: 10 43. Ans: 10

Sol: Let x1 = y1 + 3, x2 = y2 – 2, x3 = y3 + 4 Sol: To meet the given conditions, let us put 2
The given equation becomes books on each of the 4 shelves. Now we are
y1 + y2 + y3 = 3 left with 2 books to distribute among the 4
Number of solutions to this equation shelves. Which ever way we distribute the
= V(3, 3) remaining books, the number of books on
= C(5, 3) = 10 any shelf cannot exceed 4.
 Required number of solutions = 10  Required number of ways = V (4, 2)
= C(4 – 1 + 2, 2)
41. Ans: 63 = C (5, 2) = 10
Sol: Let X1 = units digit, X2 = tens digit and
X3= hundreds digit 44. Ans: (a)
Number of non negative integer solutions to Sol: This is similar to distributing n similar balls
the equation in k numbered boxes, so that each box
X1 + X2 + X3= 10 is contains atleast one ball.

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

 : 20 : Discrete Mathematics

If we put 1 ball in each of the k boxes, then 47. Ans: 97

we are left with (n–k) balls to distribute in k Sol: If we have n pigeon holes, then minimum
boxes. number of pigeons required to ensure that
Required number of ways = V(k, n – k) atleast (k+1) pigeons belong to same
= C(k – 1 + n – k, n – k) pigeonhole = kn + 1
= C(n – 1, k – 1) For the present example, n=12 and k+1= 9
Required number of persons = kn + 1
45. Ans: 84
= 8(12) +1 = 97
Sol: Required number of ways = Number of non
negative integer solutions to the equation, 48. Ans: 26
x1 + x2 + x3 + x4 = 10 Sol: By Pigeonhole principle,
where xi  1 (i = 1, 2, 3, 4) Required number of balls = kn + 1
This is equivalent to number of non = 5(5) + 1 = 26
negative integer solutions to the equation.
49. Ans: 39
x1 + x2 + x3 + x4 = 6
Sol: The favourable colors to draw 9 balls of
 Required number of ways = V(4, 6)
same color are green, white and yellow.
Where V(n, k) = C(n – 1 + k, k)
We have to include all red balls and all
 V(4, 6) = C(9, 6) = C(9, 3) = 84
green balls in the selection of minimum
46. Ans: S1, S2, S5, S6 number of balls. For the favourable colors
Sol: Average number of letters received by an we can apply pigeonhole principle.
410 Required number of balls = 6 + 8 + (kn + 1)
apartment = A =
50
Where k +1 = 9
 8 .2
and n=3
Here, A  = 9 and A  = 8
6 + 8 + (8  3 + 1) = 39
By pigeonhole principle, S1 and S2 are
necessarily true. 50. Ans: 4
S5 follows from S1 and S6 follows from S2. Sol: Suppose x  6,
S3 and S4 need not be true. Minimum number of balls required = kn +1=16
where k + 1 = 6 and n = 3.
 5(3) + 1 = 16
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 21 : CSIT‐Postal Coaching Solutions

Which is impossible 53. Ans: 14

x<6 Sol: Every positive integer ‘n’ can be written as,
Now, minimum number of balls required n = 2k m where ‘m’ is odd and k  0. Let us
= x + (kn + 1) = 15 call m the odd part.
where k + 1 = 6 and n = 2 If we treat the odd numbers 1, 3, 5, …, 25 as
 x + 5(2) + 1 = 15 pigeonholes then we have 13 pigeonholes.
x=4 Every element in S has on odd part and
associated with one of the 13 pigeonholes.
51. Ans: 7 The minimum value of k = 14
Sol: For sum to be 9, the possible 2-element
subsets are{0,9}, {1, 8},{2, 7},{3, 6},{4, 5} 54. Ans: 6
If we treat these subsets as pigeon holes, Sol: For the difference to be 5, the possible
then any subset of S with 6 elements can combinations are {1, 6}, {2, 7}, {3, 8},
have at least one of these subsets. {4, 9}, {5, 0}.
Since we need two such subsets, the If we treat them as pigeonholes, then we
required value of k = 7. have 5 pigeonholes.
By pigeonhole principle, if we choose any 6
52. Ans: 7 integers in S, then the difference of the two
Sol: If we divide a number by 10 the possible integers is 5.
remainders are 0, 1, 2, …, 9.
Here, we can apply pigeonhole principle. 55. Ans: 40
The 6 pigeonholes are Sol: The distinct prime factors of 110 are 2, 5
{0}, {5}, {1,9}, {2,8}, {3,7}, {4,6} and 11.
In the first two sets both x + y and x – y are Required number of +ve integers
divisible by 10. In the remaining sets either = (110)
x + y or x – y us divisible by 10.  2  1
. 5  1
. 11  1 
= 110  
The minimum number of integers we have  2.5.11

to choose randomly is 7. = 40

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

 : 22 : Discrete Mathematics

56. Ans: 48 (ii) Number of ways in which we can put 5

Sol: The distinct prime factors of 180 are 2, 3 letters in 5 envelopes = 5
and 5. Number of ways we can put the letters
Required number of +ve integers so that no letter is correctly placed = D5
= (180) Required number of ways = 5 – D5
 2  1
. 3  1
. 5  1  = 120 – 44
= 180   = 48
 2.3.5  = 76

(iii)Number of ways we can put the 2 letters

57. Ans: 288
correctly = C(5,2) = 10
Sol: The distinct prime factors of 323 are 17 and
The remaining 3 letters can be wrongly
19.
placed in D3 ways.
Required number of +ve integers
Required number of ways = C(5,2) D3
= (323)
= (10) 2
 17  1
. 19  1 
= 323  = 288 = 20
 17.19 
(iv) Number of ways in which no letter is
58. Ans: 265 correctly placed = D5
Sol: Required number of 1 – 1 functions Number of ways in which exactly one
= number of derangements possible with letter is correctly placed = C(5,1) D4
6 elements Required number of ways
 1 1 1 1 1  = D5 + C (5,1)D4
= D6 = 6     
 2 3 4 5 6 
= 44 +5 (9)
= 265
= 89

59. Ans: (i) 44 (ii) 76 (iii) 20 (v) There is only one way in which we can

(iv) 89 (v) 119 (vi) 0 put all 5 letters in correct envelopes.

Sol: (i) Number of ways we can put 5 letters, so Required number of ways = 5 –1

that no letter is correctly placed = 119

 1 1 1 1  (vi) It is not possible to put only one letter in

= D5 = 5    
 2 3 4 5  wrong envelope.
= 44 Required number of ways = 0

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

 : 23 : CSIT‐Postal Coaching Solutions

60. Ans: (i) 1936 (ii) 14400 The solution is bn = 4 (5n)

Sol: (i) The derangements of first 5 letters in  an  2 5   n

first 5 places = D5
 a12 = 31,250
Similarly, the last 5 letters can be
deranged in last 5 places in D5 ways. 63. Ans: (a)
The required number of derangements Sol: The recurrence relation is
= D5D5 = (44) (44) an – an –1 = 2n – 2 ………… (1)
= 1936 The characteristic equation is t – 1 = 0
(ii) Any permutation of the sequence in Complementary function = C1 . 1n
which the first 5 letters are not in first 5 Here, 1 is a characteristic root with
places is a derangement. The first 5 multiplicity 1.
letters can be arranged in last 5 places in Let particular solution = (c n2 + d n)
5 ways. Similarly, the last 5 letters of Substituting in (1),
the given sequence can be arranged in (cn2 + d n) – {c (n – 1)2 + d(n – 1 )} = 2n – 2
first 5 places in 5 ways. n=1c+d=0
Required number of derangements n=0–c+d=–2
= 5. 5  c = 1 and d = –1
= 14400  P. S = n2 – n
The solution is
61. Ans: 4!.D4 = 216
an = C1 + n2 – n …………… (1)
Sol: First time, The books can be distributed in
Using the initial condition, we get C1 = 1
4 ways.
Substituting C1 value in equation (1), we get
Second time, we can distribute the books in
 an = n2 – n + 2
D4 ways.
Required number of ways = 4 D4 = 216 64. Ans: (b)
Sol: Case 1: If the first digit is 1, then the
62. Ans: 31250
remaining digits we can choose in an–1 ways
Sol: Let b n  a 2n
Case 2: If the first digit is 0 and second digit
The given recurrence relation becomes is 1, then the remaining digits we can choose
bn+1 – 5 bn = 0 in an–2 ways.

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

 : 24 : Discrete Mathematics

Case 3: If the first two digits are zeros, then  1n   1n 

= 2 2   2  2 
each of the remaining digits should be 1.  E  5E  6   1  5(1)  6 
 By sum rule, =1
The recurrence relation for an is The solution is
an = an–1 + an–2 +1 an = C1 3n + C2 2n + 1
Using initial conditions, we get
65. Ans: (c)
C1= 2 and C2 = 0
Sol: Let an = number of n-digit quaternary
 an = 2 (3n) + 1
sequences with even number of zeros
Now, a100 = 2 (3100) + 1
Case 1: If the first digit is not 0, then we can
choose first digit in 3 ways and the 67. Ans: (d)
remaining digits we can choose in an–1 ways. Sol: Case: (i) If the first square is not red then it
By product rule, number of quaternary can be colored in 2 ways and the remaining
sequences in this case is 3an–1. squares can be colored in an–1 ways.
Case 2: If the first digit is 0, then the Case (ii) If the first square is colored in red,
remaining digits should contain odd number then second square can be colored in two
of zeros. ways and remaining squares can be colored
Number quaternary sequences in this case is in an–2 ways.
n–1
(an–1 – 4 ) By sum rule, the recurrence relation is
 By sum rule, the recurrence relation is an = 2 an–1 + 2 an–2
 an = 3an–1 + (4n–1 – an–1) an = 2 (an–1 + an–2 )
n–1
 an = 2an–1 + 4
68. Ans: 8617
66. Ans: (a) Sol: an = an–1+ 3(n2)
Sol: The given recurrence relation is n = 1  a1= a0 + 3(12)
(E2 – 5E + 6) an = 2. n = 2  a2= a1 + 3(22)
The characteristic equation is t2 – 5t + 6 = 0 = a0 + 3(12+22)
 t = 3, 2 n = 3  a3 = a2 + 3(32)
Complementary function = C1. 3n + C2. 2n = a0 + 3(12+ 22 +32)

Particular solution =
2 an = a0 + 3(12+ 22 + …+ n2)
E  5E  6
2

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

 : 25 : CSIT‐Postal Coaching Solutions

1 71. Ans: (a)

=7+ n (n+1) (2n +1)
2 Sol: Case 1: If the first digit is 1, then number of
1 bit strings possible with 3 consecutive
a20 = 7 + (20) (21) (41) = 8617
2
zeros, is an–1.
Case 2: If the first bit is 0 and second bit is
69. Ans: (b)
1, then the number of bit strings possible
Sol: The characteristic equation is t2 – t – 1 = 0
with 3 consecutive zeros is an–2.
1 5
t Case 3: If the first two bits are zeros and
2
third bit is 1, then number of bit strings with
The solution is
n n 3 consecutive zeros is an–3
1 5  1 5 
a n  C1    C2 
  2 
 Case 4: If the first 3 bits are zeros, then
 2   
each of the remaining n–3 bits we can
1
Using the initial conditions, we get C1 = choose in 2 ways. The number of bit strings
5
with 3 consecutive zeros in this case is 2n–3.
1
and C2 =   The recurrence relation for an is
5
an = an–1 + an–2 + an–3 + 2n–3.
70. Ans: (d)
Sol: The recurrence relation can be written as 72. Ans: (a)

(E2 – 2E + 1) an = 2n+2 Sol: Replacing n by n+1, the given

The auxiliary equation is relation can be written as

t2 – 2t + 1 = 0 an+1 = 4an + 3(n + 1) 2n+1

t = 1, 1  (E – 4) an = 6 (n +1) 2n ……….(1)

C.F. = (C1 + C2n) The characteristic equation is

 2n  t–4=0t=4
2 n2
P.S. =  4
E  12  E  12  complementary function = C14n
Let particular solution is
2n
4 = 2n+2 an = 2n(cn +d) where c and d are
2  12

undetermined coefficients.
 The solution is Substituting in the given recurrence relation,
n+2
an = C1 + C2n + 2 we have

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

 : 26 : Discrete Mathematics

2n (c n + d) – 4 2n–1 {c(n –1)+d} = 3n2n 75. Ans: 4

 (c n +d) –2{c(n–1)+d} = 3n Sol: Let a = 1 + x, b = 2 + y, c = 3 + z,
Equating coefficients of n and constants on and d = 4 + w
both sides, we get The transformed system is
c = –3 and d = –6 x + y + z + w = 7 where 0  x, y, z, w  2
 Particular solution = 2n (–3n – 6) The generating function
Hence the solution is f(x) = ( 1 + x + x2)4
an = C14n –(3n + 6) 2n …………(2) 1  x3 
4

=  
x = 0  4 = C1 – 6  C1 = 10  1 x 
an = 10(4n) – (3n + 6) 2n = (1 – 4 x3 + 6x6 – x9) (1 – x)–4


73. Ans: (a) = (1 – 4x3 + 6x6 – x9)  C(n  3, n) x

n 0
n

Sol: Case(i): If the first bit is 1, then the required

Required number of solutions = Coefficient
number of bit strings is an–1
of x7 in f(x)
Case(ii): If the first bit is 0, then all the
= C (10, 3) –4 C (7, 3) + 6 C (4, 1)
remaining bits should be zero
= 120 – 140 + 24 = 4
The recurrence relation for an is
an = an–1 + 1 76. Ans: (a)
Sol: Required generating function
74. Ans: (b)
= f(x) = 0 + x + 3x2 + 9x3 + 27x4+ …..
Sol: an = an–1 + (n–1)
= x(1 + 3x + 32 x2 + 33 x3 + ….. )
n = 2  a2 = a1 + 1 = 1

= x  3n x n  x.1  3x 
1
n = 3  a3 = a2 + 2 = 1 + 2
n 0

n = 4  a4 = a3 + 3 = 1 + 2 + 3
. 77. Ans: 861
. Sol: The generating function for the given
. equation is
an = 1 + 2 + ……… + n – 1 F (X) = (X + X2 + X3 + X4 + X5 + X6)4
n n  1 The coefficient of X15 in F(X) is the answer
=
2 in our problem

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

 : 27 : CSIT‐Postal Coaching Solutions

F (X) = X4 (1 + X + …+ X5)4 80. Ans: 85

 1  X6 
4 Sol: The generating functions for the problem is
 X 4

 1 X  f(x) = (x + x2 + x3 + x4)4

= X4 (1–X6)4 (1–X)–4 = x4(1 + x + x2 + x3)4

4
4 10 16 22 28 1 x 4 
= (X – 4X + 6X – 4X + X ).
= x  1  x 
4
  
 C (n  3, n) X n

n 0 = x4(1 – x4)4 (1 – x)–4

Coefficient of X15 = C (14, 3) – 4 C (8, 3) = x4(1 – 4x4 + 6x8 – 4x12 + x16) (1 – x)–4
= 140 = (x4 – 4 x8 + 6x12 – 4x16 + x20)


78. Ans: (d)  Cn  3, n  x

n 0
n

Sol: Required generating function

The required number of solutions
f(x) = 0 + 0 x + 1 x2 – 2x3 + 3x4 – 4x5 + . . .
2 2 3 = coefficient of x12 in f(x)
= x (1 –2x + 3x – 4x + . . . )
= C(11, 3) – 4 C(7, 3) + 6
= x2(1 + x)–2 (Binomial theorem)
= 31
79. Ans: (a)
81. Ans: (c)
Sol: (x4 + 2x5 + 3x6 + 4x7 +..…)5
Sol: The generating function is
= x20 (1 + 2x + 3x2 + 4x3 +…..)5
f(x) = 1 + 0.x + 1.x2 + 0.x3 + 1.x4+ ……. 
20 –2 5
= x . [(1 – x) ]
= 1 + (x2) + (x2)2 + ……. 
20 –10
= x [1 – x]
= (1 – x2)–

 x 20  Cn  9, n x n
n 0

27
Coefficient of x = C(16, 7)
= C(16, 9)

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

 : 28 : Discrete Mathematics

= 21, an odd number.

3. Graph Theory
 The given sequence cannot represent a
01. Ans: (a) simple non directed graph
Sol: For any simple graph, (b) {2, 3, 4, 4, 5}
( G ) V  2 E   ( G ) V In a simple graph with 5 vertices,

 (G) (10)  2(16) degree of every vertex should be  4.

 (G)  3.2  The given sequence cannot represent

 (G)  3 a simple non directed graph.

(c) {1, 3, 3, 4, 5, 6, 6}
02. Ans: 19 Here we have two vertices with degree
Sol: By sum of degrees of regions theorem, if 6. These two vertices are adjacent to all
degree of each vertex is k, then the other vertices. Therefore, a vertex
kV  2E with degree 1 is not possible.

 4 V  2(38) Hence, the given sequence cannot

represent a simple non directed graph.
 V = 19
(d) {0, 1, 2,….., n –1}

03. Ans: (c) Here, we have n vertices, with one

Sol: If degree of each vertex is k, vertex having degree n-1. This vertex is
adjacent to all the other vertices.
kV  2E
Therefore, a vertex with degree 1 is not
 k V  2 (12) possible.
Hence, the given sequence, cannot
24
 V  ( k = 1,2,3,4) represent a simple non directed graph.
k
(e) A graph with the degree sequence
 V = 24 or 12 or 8 or 6 {2, 3, 3, 3, 3} is shown below.
c
 only option (c) is possible.
d b
05. Ans: (e)
e a
Sol: (a) {2, 3, 3, 4, 4, 5}
Here, sum of degrees

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

 : 29 : CSIT‐Postal Coaching Solutions

06. Ans: 8 09. Ans: 27

Sol: Here, degree of each vertex is  3 Sol: By sum of degrees theorem, if degree of
By sum of degrees theorem, each vertex is atmost K,
3|V|2|E| then K|V|  2 |E|
 3| V |  2(12)  5 (11)  2 |E|
 |V|8  |E|  27.5
 The minimum number of vertices G can  |E|  27
have = 8
10. Ans: (d)
07. Ans: 12 Sol: (a) Sum of the degree of the vertices
Sol: G is a tree = 15(5) = 75 = An odd number.
By sum of degrees theorem,  The graph is not a simple graph
n.1 + 2 (2) + 4. (3) + 3. (4) = 2 |E| (b) Maximum number of edges possible in a
 n + 28 = 2 (|v| – 1) simple graph with 10 vertices
= 2 (n + 2 + 4 + 3 – 1) C(10, 2) = 45
 n + 28 = 2n + 16 (c) Sum of the degrees = 2n – 1

 n = 12 = An odd number
 The graph is not simple graph
08. Ans: 8 (d) A connected graph with n vertices and
Sol: G has 8 vertices with odd degree. n–1 edges is a tree. A tree is a simple
For any vertex vG, graph.
Degree of v in G + degree of v in G = 8
11. Ans: 2
If degree of v in G is odd, then degree of v
Sol: In the graph, all the cycles are of even
in G is also odd. If degree of v in G is even,
length.
then degree of v in G is also even.
 G is a bipartite graph.
Number of vertices with odd degree in
Chromatic number of any bipartite graph is
G=8
2.

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

 : 30 : Discrete Mathematics

12. Ans: 2 The graph has 9 vertices. The maximum

Sol: In the given graph, all the cycles are of even number of vertices we can match is 8.
length. A matching in which we can match 8
 G is a bipartite graph and every bipartite vertices is { a – b, c – d, e – f, g – h}
graph is 2-colorable  Matching number of the graph = 4
 Chromatic number of G = 2.
17. Ans: 2
13. Ans: 5 Sol: The given graph is K2,4
Sol: G is a disconnected graph with two  Matching number = 2
components, one component is the complete
graph K5 and the other component is the 18. Ans: 2

trivial graph with only an isolated vertex Sol: The given graph is
a b
 Chromatic number of G = 5
c d e
14. Ans: (b)
f h
Sol:  = n  2 n/2 + 2 g

 = n – 2 n/2  + 4 If we delete the edge {a,b} then the graph is

 +  = 2n – 2 { n/2 + n/2  }  6 a star graph. If we match a with b, then in

= 2n – 2n + 6 = 6 the remaining vertices we can match only

two vertices.
15. Ans: (c)
 Matching number = 2
Sol: Chromatic number of Kn = n
If we delete an edge in K10, then for the two 19. Ans: 3
vertices connecting that edge we can assign Sol: Let us label the vertices of the graph as
same color. shown below
 Chromatic number = 9 d c

16. Ans: 4 c a b
Sol: b d There are 3 maximal matchings as given
a i e below
h f
{a–d, b–c}, {a–c, b–d} and { c–d}
g
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 31 : CSIT‐Postal Coaching Solutions

20. Ans: 3 Matching number of G

Sol: The given graph is n
a  2 , if n is even
=
b
 n  1 , if n is odd
 2
d
c
n 
The maximal matchings are Matching number of G =  
2
{a–b, c–d}, {a–c, b–d}, {a–d, b–c}
24. Ans: 1, 2
21. Ans: 10
Sol: The graph can be labeled as
Sol: The graph has 3 maximal matchings,
6 matchings with one edge, and a matching a e
with no edges.
c
 Number of matchings = 10 b d

22. Ans: 3 c is a cut vertex of the graph G.

Sol: G is a complete graph on 7 vertices.  vertex connectivity of G = K(G) = 1

n  G has no cut edge.

 Matching number of Kn =  
2  Edge connectivity =  (G)  2 ….. (1)

 Matching number of K7 = 3 We have,  (G)   (G) = 2 …… (2)

From (1) and (2), we have
23. Ans: (a)  (G) = 2
Sol: If n is even, then a bipartite graph with
maximum number of edges is kn/2,n/2 25. Ans: 2, 2
n Sol: The graph G can be labeled as
 Matching number of G =
2 a g
If n is odd, then a bipartite graph with d e
c f
maximum number of edges = km,n
n 1 n 1 b h
Where m = and n 
2 2 G has no cut edge and no cut vertex. By
deleting the edges {d, e} and {b, h} we can
disconnect G.

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

 : 32 : Discrete Mathematics

  (G) = 2 Case2: u and v are in same component G1 of

By deleting the vertices b and d, we can G. Take any vertex wG2.
disconnect G. Now u and v are adjacent to w in G.
 K (G) = 2  There exists a path between u and

v in G. Hence, G is connected.
26. Ans: 1 & 3
Sol: The graph G can be labeled as S2: The statement is false.
we can give a counter example.
a e
b f h
d d c a c
c g

a b d b
The vertex d is a cut vertex of G.
G G
 K (G) = 1
Here, G is connected and G is also
We have (G)   (G) = 3 ...... (1)
connected.
G has no cut edge and by deleting any two
S3: Suppose G is not connected
edges of G we cannot disconnect G.
Let G1 and G2 are two connected
  (G) = 3
components of G.

27. Ans: S1, S3 & S4 Let vG1

Sol: S1: This statement is true. n 1  n 1 

 deg(v)   (G )  
2  2 
Proof:
Suppose G is not connected G has atleast 2  n 1 
Now |V(G1)|    1
connected components.  2 
Let G1 and G2 are two components of G.
n 1
Similarly, | V(G 2 ) |
Let u and v are any two vertices in G 2
We can prove that there exists a path
Now, |V(G)|= |V(G1)|+ |V(G2)|
between u and v in G.
Case1: u and v are in different component  |V(G)|  n +1

of G. Which is a contradiction
Now u and v are not adjacent in G. G is connected.
 u and v are adjacent in G
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 33 : CSIT‐Postal Coaching Solutions

S4: If G is connected, then the statement is There exists a cycle passing through all the
true. If G is not connected, then the two vertices of G.
vertices of odd degree should lie in the same a – b – c – d – e – a is the Hamiltonian cycle
component, of G.
By sum of degrees of vertices theorem. The Hamiltonian path is a – b – c – d – e
 There exists a path between the 2
30. Ans: S1 & S2
vertices.
Sol: The number of vertices with odd degree = 0
28. Ans: S1, S2 & S4  S1 and S2 are true.
Sol: The graph G can be labeled as To construct Hamiltonian cycle, we have to
delete two edges at each of the vertices a
a d
and f. Then, we are left with 4 edges and 6
c vertices.
b e
 G has neither Hamiltonian cycle nor
The number of vertices with odd degree is 0.
Hamiltonian path.
 S1 and S2 are true
C is a cut vertex of G. 31. Ans: (B)
 Hamiltonian cycle does not exists. Sol: S1 is false. We can prove it by giving a
By deleting the edges {a, c} and {c, e}, counter example.
there exists a Hamiltonian path Consider the graph G shown below
a–b–c–d–e a d

c
29. Ans: S1, S3 & S4 b e
Sol: The graph G can be labeled as ‘e’ is a cut vertex of G. But, G has no cut
e d edge

c
S2 is false. We can prove it by giving a
counter example.
a b
For the graph K2 shown below,
The number of vertices with odd degree = 2 a b
 Euler path exists but Euler circuit does The edge {a, b} is a cut edge. But K2 has no
not exist. cut vertex.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 34 : Discrete Mathematics

32. Ans: 33 In Hamiltonian cycle, degree of each vertex

Sol: If G has K components, then is 2. So, we have to delete 2 edges at vertex
|E|=|V|–K ‘d’ and one edge at each of the vertices ‘a’
 26 = | V | – 7 and ‘g’. Then we are left with 8 vertices and
 | V | = 33 6 edges. Therefore, neither Hamilton cycle
exists nor Hamiltonian path exists.
33. Ans: (b)
Sol: A 2-regular graph G has a perfect matching 36. Ans: (b)
iff every component of G is an even cycle. Sol: G has cycles of odd length

S2 and S4 are true. Chromatic number of

S1 need not be true. For example the G = (G)  3 ……(1)
complete graph K2 has a perfect matching For the vertices c and h we can use same
but K2 has no cycle. color C1
S3 need not be true. For example G can have The remaining vertices from a cycle of
two components where each component is length 6.
K2. A cycle of even length require only two
colors for its vertex coloring.
34. Ans: 21 For vertices a, d and f we can apply same
Sol: In a simple graph with n vertices and K color C2
components, For the vertices {b, e, g} we can use same
|E|>
n  k n  k  1 color C3
2
  (G) = 3
 Required minimum number of edges
A perfect matching of the graph is
=
n  k n  k  1 = 21
2 a–b, c – d, e –f, g – h

Where n = 10 and k = 4 Matching number = 4

Hence, chromatic number of G
35. Ans: (d) + Matching number of G = 3 + 4
Sol: G has exactly two vertices of odd degree. =7
Therefore, Euler path exists in G but Euler
circuit does not exist.

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

 : 35 : CSIT‐Postal Coaching Solutions

37. Ans: (c) By sum of degrees theorem,

Sol: S1 need not be true. Consider the graph 3|V|  2 |E|
 |E|  13.5
 |E|  14

Here, we have 6 vertices with degree 2, 4. Set Theory

but the graph is not connected.
S2 need not be true. For the graph given 01. Ans: (c)

above, Euler circuit does not exist, because Sol: (a) A  (A  B) = A (Absorption law)

it is not a connected graph.  Option (a) is false

(b) A  (A  B) = A (Absorption law)
A simple graph G with n vertices is
 Option (b) is false
n 1
necessarily connected if (G)  .
2 (c) (A  B)  (A  B )

 S3 is true. = A  (B  B ) Distribution law

=A
38. Ans: (a)  Option (c) is true
Sol: Vertex connectivity of G = k(G)  (G)
 (G)  3 02. Ans: (b)

By sum of degrees theorem Sol: If S = {} then

3| V |  2 | E | (a) P(S)  S = {}

 | E |  15  option (a) is false

 Minimum number of edges necessary = 15 (b) P(S)  P(S) = {, {}}

 Option (b) is true
39. Ans: (b) (c) If S = {a, b} then
Sol: Here, G is a complete graph with k+1
P(S)  S = 
vertices.
 option (c) is false
 Number of edges = C(k+1, 2)
(d) false
Refer option (b)
40. Ans: 14
Sol: If vertex connectivity of G is 3, then degree
of each vertex in G is  3.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 36 : Discrete Mathematics

03. Ans: (c) 05. Ans: (c)

Sol: If |A| = 3 then Sol: Let xX
|A|  |A| = 9 Case 1: If x is even number then it can
|P(A  A)| = 29 appear in two ways i.e., either x  A – B
= 512 or x  B – A
Case 2: If x is odd number then it can
04. Ans: (a, c & d)
appear in two ways i.e., xA  B or
Sol:
A I II III B

x A  B 
V
IV VI  By product rule, required number of
VII subsets = 2100
C

06. Ans: (c)

I, II,…….., VII are regions Sol: If A  B = (A  B)C
(a) (A – B) – C = {I, IV} – {IV, V,VI, VIII}

Then A  B =  
= {I}
A – (C–B) = {I, II, IV, V} – {IV, VII}
But (A  B)  A  B = U 
= {I, II, V}  (A  B) = U

 Option (a) is false Where U is universal set

(b) A–(B  C) = (A–B)  (A–C) is true by

07. Ans: (d)
Demorgan’s law
Sol: (a) Let AB = A
(c) A–(B–C) = {I, II, IV, V} – {II, III}
 AB = A
= {I, IV, V}
 B=
A–(C–B) = {I, II, IV, V} – {IV, VII}
(b) (AB) B
= {I, II, V}
= A  (B  B)
 Option (c) need not be true
=A
(d) Similarly show that option (d) is not true
=A
(c) A  C = B  C
A=B (cancellation law)

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

 : 37 : CSIT‐Postal Coaching Solutions

(d) LHS = A  B = (A  B) – (A  B) 09. Ans: 686

RHS = (A  B)  (A  B) Sol: A symmetric relation on A with exact
= (A  B) 4 ordered pairs can be in one of the
 L.H.S  R.H.S following 3 ways.
i) The relation may contain 4 diagonal
08. Ans: (c) pairs. We can choose 4 diagonal pairs
Sol: S1) Let A = {1}, B = {2}, C = {3} in C(7, 4) ways.
Now (AB) = (BA) =  ii) The relation may contain 2 diagonal
But A  B pairs and 2 non-diagonal pairs.
 S1 is not true Number of symmetric relations in this
S2) Let A = {1}, B = {2}, C = {1, 2} case is C(7, 2). C(21, 1)
Now AC = BC = C iii) The relation may contain 4 non-
But A  B diagonal pairs.

 S2 is not true Number of symmetric relations in this

S3) Let x  A. case is C(21, 2)

Consider the two cases  By sum rule,

Case1: x  C Required number of symmetric relations

= C(7, 4) + C(7, 2) . C(21, 1) + C(21, 2)
 x  (A  C) ( x  (A  C))
= 35 + 441 + 210
 x  (B C) ( A  C = B C)
= 686
 x  B ……….(1)
Case2: x C 10. Ans: (d)
 x  (A C) Sol: Case 1:
 x  (B  C) If the relation R contains only diagonal
xB ( x  C) ………(2) pairs, then R is symmetric and transitive but
A  B (Form (1) and (2)) not irreflexive.
Similarly we can show that B  A. Case 2:

A=B If the relation R contains some non diagonal

Hence, S3 is true pairs

Let (a, b)  R

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

 : 38 : Discrete Mathematics

 (b, a)  R ( R is symmetric) Let x R y

Now (a, b)  R and (b, a)  R  g. c. d of (x, y) = 1
 (a, a)  R ( R is transitive)  g. c. d. of (y, x) = 1
 R is not irreflexive. yRx
Options (a) & (b) need not be true, for  R is symmetric
example. If A = {1, 2, 3} then the relation R is not transitive,
R = {(1, 2), {2, 1), (1, 1), (2, 2)} is For example g. c. d. of (2, 3) = 1
symmetric and transitive but neither and g. c. d. of (3, 4) = 1
reflexive nor irreflexive. but g. c. d. of (2, 4)  1
Option (b) need not be true for example.
If A = {1, 2, 3}, then the relation 13. Ans: (c)

R= {(1,1), (2, 2), (3, 3)} is symmetric, Sol: Let A = {1, 2, 3} and

transitive and not irreflexive. R = {(1, 2), (2, 2)}

S = {(2, 1), (3, 3)}
11. Ans: (c) R  S = {(1, 2), (2, 1), (2, 2) (3, 3)}
Sol: We have, a divides a aA Here, R and S are anti-symmetric relations
aRa a A on A, But (R  S) is not anti-symmetric.
 R is reflexive  (R  S) need not be anti-symmetric.
Let a R b Any subset of anti-symmetric relation is also
 a is a divisor of b or b is a divisor of a anti-symmetric, and (R  S)  R.
 b is a divisor of a or a is a divisor of b  (R  S) is anti-symmetric
bRa Hence, only option (c) is true.
 R is a symmetric
14. Ans: (D)
R is not transitive, for examples 2 R 6 and 6
Sol: (a) R is not reflexive.
R 3, but 2 is not related to 3.
For example, –1 is not related to –1.
Hence, R is a compatibility relation on A.
i.e., (–1, –1)  R
12. Ans: (c) (b) R is not irreflexive.
Sol: We have, g.c.d of (x, x) = x For example, 1 is related to 1.
 R is not reflexive i.e., (1, 1)  R

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

 : 39 : CSIT‐Postal Coaching Solutions

(c) R is not symmetric. 16. Ans: (a)

For example, –1 is related to 1 but 1 is Sol: Symmetric closure of
not related to –1. R = {(2, 1), (1, 2), (3, 2), (2, 3)}
(d) R is anti-symmetric. Transitive Symmetric closure of R = A  A
i.e., If (a R b and b R a) then
17. Ans: (d)
(a = b)  a, b  A
Sol: [2] = {x | (2 – x) is divisible by 4}
i.e., For any two integers.
= {4k + 2 | k is integer}
If {a = | b | and b = | a |} then a = b
= {…– 10, –6, –2, 2, 6, 10, 14, ….}
15. Ans: (d)  [2] = [–6]
Sol: Two positive integers a and b are relatively
prime, if g. c. d of a and b is 1. 18. Ans: (d)

i) R is not reflexive. For example Sol: |a – a|  2 aZ

g. c. d. of {2, 2} = 2  a is not related to a aZ

 2 is not related 2  R is irreflexive

ii) Let a R b Let a R b

 g. c. d. of {a, b} = 1  |a – b| = 2

 g. c. d. of {b, a} = 1  |b – a| = 2

bRa  b R a  R is symmetric

 R is symmetric
19. Ans: (b)
iii) R is not transitive.
R R
Sol: S = {1, 2, 3, 4, 6, 9, 12, 18, 36}
For example, 2 3 and 3 4 but 2 is not
(a) R is a partial order on any set of
related 4.
positive integers.
iv) R is not anti-symmetric.
 Option (a) is true
For example (2 R 3) and (3 R 2)
(b) In the set S, 2 and 3 are not comparable.
v) R is not irreflexive.
Therefore R is not a total order on S.
For example (1, 1)  R
(c) R is not symmetric. For example 2 is a
1R1
divisor of 4, then 4 is not a divisor of 2.
 R is not an equivalence relation

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

 : 40 : Discrete Mathematics

(d) R is a partial order. Therefore R is Number of partial orders of type A = 6

reflexive and transitive. Number of partial orders of type B = 3
Number of partial orders of type C =3
20. Ans: (c)
Number of partial orders of type D = 6
Sol: If S is any set of positive integers, then R is
Number of partial orders of type E = 1
R partial order on S.
Required number of partial orders
 [A; R] is a poset
= 6 + 3 + 3 + 6 + 1 = 19
The greatest lower bound of 2 and 3 does
not exist. 23. Ans: 3
[A ; R] is not a lattice. Sol: The partial orders are
In the poset all the prime numbers are R1= {(1, 1), (2, 2), (1, 2)}
minimal elements of A with respect to R. R2 = {(1, 1), (2, 2), (2, 1)}
R3 = {(1, 1), (2, 2)}
21. Ans: 10
Sol: The Hasse diagram is 24. Ans: (a)
24
Sol: D24 = {1, 2, 3, 4, 6, 8, 12, 24}
8 12
The Hasse diagram of the poset is given
4 6 below

3 24
2
8 12
1
Number of edges = 10 4 6

2 3
22. Ans: 19
1
Sol: The possible Hasse diagrams are
3 3 S1: Number of edges in the Hasse diagram is
2 3
10.
2
2  S1 is true
1 1 1
B C S2: If a and b are complement of each other,
A
then
Join of a and b = I = 24
E
D and Meet of a and b = O = 1

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

 : 41 : CSIT‐Postal Coaching Solutions

Here Join of 2 and 12 = 12  I 28. Ans: (c)

 Complement of 2  12 Sol: The join of d and g = h = Upper bound.
S3: Join of 3 and 8 = 24 = I The meet of d and g = c  Lower bound
Meet of 3 and 8 = 1 = O Complement of d  g
 Complement of 3 = 8
29. Ans: (d)
S4: Join of 4 and 6 = 12  I
Sol: The Hasse diagram is
Meet of 4 and 6 = 2  O
24
 Complement of 4  6
8 6

25. Ans: (b)

4
Sol: S = {1, 3, 9, 27, 81, 243} 2
(S, *) is a totally ordered set. A totally
1
ordered set is always a distributive lattice but
If we delete the element 1, the resulting sub-
not a Boolean algebra
lattice is not distributive.
26. Ans: (c)  The given lattice is not distributive.
Sol: The Hasse diagram of the poset is For the element 2, there is no complement.
24  The given lattice is not a complemented
lattice.
8
6 30. Ans: 17
4
Sol: The Hasse diagram is shown below.
D60 = {1, 2, 3, 4, 5, 6, 10, 12, 15, 30, 60}
2
The poset is a lattice, because for every pair 60
12 30
of elements lub and glb exist.
4 6 15
10
27. Ans: (a)
3 5
Sol: We have 385 = 5.7.11 2

= A product of distinct prime numbers 1

 [D385; |] is a Boolean algebra Number of edges in the diagram = 17

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

 : 42 : Discrete Mathematics

31. Ans: 232 33. Ans: 1

4
Sol: Number of functions possible on A = 4 Sol: The only equivalence relation on A which is
Number of functions which are either 1-1 or also a surjection is the diagonal relation on
on-to A.
= 4 + 4 –4 = 24
34. Ans: (b)
 Required number of functions = 44 – 24
Sol: Given that f = f–1
= 232
we have (f o f–1) x = x
32. Ans: (c)  (f o f)x = x ( f = f–1)
Sol: Let f (a,b) = f (c,d)  f(f(x)) = x
 (a+b, a–b) = (c+d, c–d)  f(1+kx) = x
 a+b = c+d ……(1)  1+ k(1+kx) = x
a – b = c – d ……..(2)  1 + k + k2x = x
Adding (1) and (2), we get a = c  k=–1
Subtracting (2) from (1), we get b = d
 (a,b) = (c,d) 35. Ans: (a)

f is one-to-one Sol: (f o g) (x) = f{g(x)}

Let f (a,b) = (c, d)  2x 

= f  =x
 (a+b, a–b) = (c,d)  x 1 

 a+b = c and a–b =d And (g o f)x = g{f(x)}

cd cd  x 
 a= and b = g  =x
2 2 x 2

For each (c,d) B But (f o g) = IB and (g o f) = IA

We have,  (f o g)  (g o f)

cd cd
(a,b) =  ,   B such that 36. Ans: (d)
 2 2 
Sol: (a) Let (g o f) a = (g o f) b
f(a,b) = (c,d)
 g{f(a)} = g(f(b)}
 f is on-to.
 f(a) = f(b) ( g is 1–1)
Hence, f is a bijection.
 a=b ( f is 1–1)
 (g o f) is 1–1
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 43 : CSIT‐Postal Coaching Solutions

(b) Let c  C (d) The set {1, 8} is closed with respect to

Since g is on-to, then exists an element 8. Therefore, it is a sub group.
bB, such that
38. Ans: 1
g(b) = c ………(i)
Sol: Let e be the identity element.
Since f is on-to, there exists an element
 a * e = a  a A
aA, such that
 2 ae = a
f(a) = b ……..(ii)
1
From (i) and (ii), we have e 
2
To each element cC, there exists an
1
element aA, such that Let b = inverse of
4
(g o f) a = c 1
b* =e
 (g o f) is on-to 4
1 1
(c) If (g o f) is 1–1, then f is also 1–1.  2b =
4 2
Otherwise g is not a function.
 b=1
(d) If (gof) is on-to then f need not be on-to. 1
 Inverse of =1
A 
 B 
 C
f g
4
a1  b1  c1
39. Ans: (c)
a2  b2  c2
Sol: Order of the cyclic group = 10
b3 ↗
Number of generators in G =(10)= Number
Here (gof) is on-to, but f is not on-to. of positive integers which are less than 10
and coprime to 10 = 4
37. Ans: (c)
Sol: (a) We have, 4 9 7 = 1 = Identity element 40. Ans: (c)
 Inverse of 4 = 7 Sol: (a) The set {1, 4} is closed w.r.t. the given
(b) The set {1, 4, 7} is closed with respect binary operation.

to 9. Therefore it is a sub group of G.  It is subgroup of G

(c) We have, 2 9 8 = 7  Identity element (b) The set {1, 11} is closed w.r.t. the

 Inverse of 2  8 given binary operation.

 It is a subgroup of G.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 44 : Discrete Mathematics

(c) The set {1, 13} is not closed w.r.t. the 43. Ans: (c)
given binary operation. Sol: {1,3} is closed with respect to *
 The set is not a subgroup of G.  {1,3} is a group.
(d) The set {1, 14} is closed w.r.t. the given
44. Ans: (c)
binary operation.
Sol: (a*b)2 = (a*b)*(a*b)
 It is a sub group of G.
= a*(b*b)*a
41. Ans: (c) = (a*a)*(b*b) (∵ G is abelian)
Sol: We have (A*B)  P(S) A,B  P(S) = a2 * b2
 * is a closed operation.
The symmetric difference operation * is 45. Ans: (a)

associative. Sol: Let e be the identity element

The empty set   P(S) and  is identity a * e = a + e – ae = a

element.  e(1–a) = 0  xQ–{1}

We have A-1 = A  A  P(S) e=0

(P(S),*) is a group.
46. Ans: (b)

42. Ans: (c) Sol: a * a–1 = e

Sol: From the table  a + a–1 – aa–1 = 0

b*b=b a
 a–1 =
a 1
 b is identity element
 The second row is a b c and 47. Ans: (a)
The second column is a b c Sol: (a) 2 13 7 = 1 (e is identity element)
rd
Now c cannot appear in the first row and 3
 inverse of 2 = 7
column.
 a * a = c and a * c = b 48. Ans: (b)
 The first row is c a b Sol: We have

 Third row is b c a a * b = g.c.d of {a, b} D12  a, bD12

 * is a closed operation on D12
* is associative on D12

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

 : 45 : CSIT‐Postal Coaching Solutions

We have a * 12 = a  a 52. Ans: (d)

The identity element = 12 Sol: (a) sum and product of any two even
The inverse of any element in D12 except numbers are also even.
12 does not exist. Further, addition and multiplication
(D12;*) is a monoid but not a group. operations are associative.
 (A, .) and (A, +) are semi-groups.
49. Ans: (c) Sum of 2 odd numbers is always even.
Sol: Let e be the identity element.
 + is not a closed operation on B.
a*e=a  aR
 (B, +) is not a semi-group.
a+e+2=a
 e = –2 53. Ans: (a)
We have, a * a–1 = e Sol: f(x + y) = 2x+y = 2x. 2y = f(x). f(y)

 a + a–1 + 2 = –2  f is homomorphism.

 a–1 = (–4 –a) Further f(x) = 2x is a bijection.

 Inverse of 2 = (–4 –2) = –6  f is an isomorphism.

50. Ans: (d) 5. Probability

Sol: We have x * y = xy N
01. Ans: (c)
 * is a closed operation
Sol: Four numbers can be selected out of 40 in
(a*b)*c = ab  c = a b   c
= abc
40
C4 = 37 × 38 × 65 ways.
a*(b*c) = a * b = a b 
c
c

E: Event that the four numbers are

 * is not associative on N.
consecutive.
Hence, (N, *) is not a semi-group.
Favourable cases to E: (1 2, 3,4), (2,3,4,5),
51. Ans: (d) (3,4,5,).......(37,38,39,40) whose number is
Sol: The identity element = 6 37

We have, 22 = 2 10 2 = 4 37 1
 P(E) = 40
=
C4 2470
23 = 22 10 2 = 410 2 = 8
24 = 23 10 2 = 6  Required probability = PE 

 2 is a generator = 1 – P(E)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 46 : Discrete Mathematics

1 04. Ans: (b)

= 1
2470 Sol: Let
2469 A = The event that 5 appears in first throw
=
2470
B = The event that sum is 6
The cases favourable to B are
02. Ans: (c)
{(5, 5, 6), (5, 6, 5), (6, 5, 5), (4, 6, 6),
Sol: The sample space is a square whose sides
(6, 4, 6), (6, 6, 4)}
are unit segments of the coordinate axes.
The figure whose set of points correspond to A  B = {(5, 5, 6), (5, 6, 5)}
2
the outcomes favourable to the event y  x
is bounded by the graphs of the function and Required probability = P(A|B)

y2 = x, y = 0 and x = 1 is shown below. n A  B 2 1

= = =
n B 6 3
C(0, 1) B(1, 1)

05. Ans: (a)

Sol: The total number of five digit numbers
O(0, 0) A(1, 0) formed by 1, 2, 3, 4 and 5 (without
repetition) = 5 = 120
Required Probability = area of the shaded
A number is divisible by 4 if the last two
1 2
region = 0
x dx 
3
digit number (i.e., tens and unit place) is
divisible 4.
03. Ans: (c)  The last two digit number must be:
Sol: Let x  S. Then either 12, 24, 32 and 52 (4 cases). With last two
x  P, x  Q, or x  P, x  Q, or x  P, digits fixed, the other three places can be
x  Q or x  P, x  Q. Out of the above arranged in 3(=6) ways.
four cases, three cases are favourable to the
 The number of favourable cases = 3 × 4
event P  Q = .
20
= 24
3
 The required probability =  
4 24 1
 Probability = =
120 5

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

 : 47 : CSIT‐Postal Coaching Solutions

06. Ans: (c) 08. Ans: 0.4

a b  Sol: If A and B are independent then
Sol: Let A    where a, b, c and d
c d  P(A  B) = P(A). P(B) = 0.16 ....... (1)
can take values 0 or 1.
By Addition theorem of probability
4
 Total number of such matrices = 2 = 16
P(A  B) = P(A) + P(B) – P(A  B)
Let E be the event that A is non singular.
 0.64 = P(A) + P(B) – 0.16
 det A  0.
 P(A) + P(B) = 0.8 ....... (2)
i.e., atleast one of the two numbers a & d is
From (1) & (2), we get
zero or atleast one of the two numbers b & c
P(A) = P(B)
is zero.
= 0.4
The matrices whose determinants are non
zero are: 09. Ans: (a)
Sol: We have
 1 0  1 0   1 1
 ,  ,   18 1
 0 1  1 1   0 1 P(A) = P(B) = P(C) = =
16 2
P(A  B) = P(A  C) = P(B  C)
 0 1   0 1 1 1 
 ,  ,  
 1 0   1 1 1 0  9
=
36
6 3 1
 P(E) = = =
16 8 4
1
07. Ans: (d) Thus P(A  B) = = P(A) P(B)
4
Sol: Total number of triangles that can be formed
1
P(A  C) = = P(A)P(C)
by using the vertices of a regular hexagon = 4
6
C3  20. 1
P(B  C) = = P(B)P(C)
Among these, there are only two equilateral 4

triangles. which indicates that A, B, and C are pair

2 wise independent. However, since the sum
 Required probability =
20
of two numbers is even,
1
 1
10 {A  B  C) =  and P(A) P(B) P(C) =
8
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 48 : Discrete Mathematics

 P(A  B  C)  P(A)P(B)P(C) By Total theorem of probability P(W)=

which shows that A, B, and C are not W W W
= P(E1) P  + P(E2) P  +P(E3) P 
independent.  E1   E2   E3 
1 2 13 1 4
10. Ans: 0.46 =      
3 5 35 3 5
Sol: Let
9 3
A2 = event that the number is divisible by 2 = =
15 5
A3 = event that the number is divisible by 3
A5 = event that the number is divisible by 5 12. Ans: (a)
Sol: Let A, B and C denote events of a bolt
Then the required probability
manufactured by A, B and C.
= P{(A3  A5) | A2}
Let D be the event of the drawn bolt is
A2 A3 defective.
27 13 14
3 By Total theorem of probability P(D)
7 3
D D D
7 = P(A) P  + P(B) P  +P(C) P 
A5 A B C

U 25  5  35  4  40  2 
=      
nA 3  A 5   A 2  100  100  100  100  100  100 
=
n A 2 
69
=
23 2000
= = 0.46
50

13. Ans: (c)

11. Ans: (c)
Sol: E : Correct diagnosis
Sol: Let E1, E2, E3 be the events of selecting urns
E : Wrong diagnosis
U1, U2, U3 respectively and W be the event
D : Event of death.
of the drawn ball is white.
60 3 2
PE  
1
P(E1) = P(E2) = P(E3) = P(E) = = ,
3 100 5 5
 D  70 7  D  80 4
P    , P   =
 E  100 10  E  100 5

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

 : 49 : CSIT‐Postal Coaching Solutions

By Baye's theorem, E

PE 3  P 
 E3 
E =
Required probability = P  E
PE j  P 
3
D  E 
j1  j
D
PE  P 
1
= E 1
D D 2
P(E)P   PE  P  =
1 1 1 1 1
E E     1
3 4 6 8 2
3 7 24
 =
= 5 10 29
3 7 2 4
  
5 10 5 5
15. Ans: (c)
21 Sol: Let Ej be the event that the bag contains
=
37 j number of red balls (j = 1, 2, 3, 4)
1
 P(Ej) = (j = 1, 2, 3, 4)
14. Ans: (b) 4
Sol: Let E1 bet the event of guessing, E2 the Let E be the event of drawing a red ball.
event of copying and E3 the event of E 1  E  2  E 3
P   , P   , P  
knowing the answer.  E1  4  E2  4  E3  4
1 1
 P(E1) = , P(E2) = , P(E3)  E  4
3 6 P   = 1
 E4  4
1 1 1
= 1   =
3 6 2  By Baye's theorem,
Let E be the event of writing correct answer.  E 
PE 4  P 
E 1  E  1 E 
P 4    E4 
P   , P   (Given) E
 E  4
 E1  4  E2  8  P E j  P  
E 
j1  j
 E
P   1 1
 E3  1
= 4
By Baye's theorem, 11 2 3 4
    
44 4 4 4
E 
Required probability = P 3 
 E 2
=
5
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 50 : Discrete Mathematics

16. Ans: (d) 1

C=
Sol: E1: Event of letter coming from LONDON. 6

E2: Event of the letter coming from Expected demand = E (D)

4
CLIFTON.   d. P (D  d)
d 1
E: Event of two consecutive letters ON.
2 2 4  2 
1  1   2    3    4  
P(E1) = P(E2) = .  6   6   8   18 
2
 19 
Word LONDON consists of 5 pairs of  
9
consecutive letters

(LO, ON, ND, DO, ON) out of which there 18. Ans: 5

are 2 ON's. Sol: Let X = Amount the player wins in rupees

CLIFTON consists of 6 pairs of consecutive The probability distribution for X is given

letters below

(CL, LI, IF, FT, TO, ON) out of which there

Number of heads 0 1 2
is only one 'ON'. X x 1 3

E 1 2 1
PE1  P  P(X)
4 4 4
E 
 P 1    E1 
E E  E 
PE1  P   PE 2  P  For the game to be fair we have to find x,
 E1   E2 
so that E(X) = 0
1 2
 1 2 1
= 2 5  x.   + 1.   + 3.   =0
1 2 1 1 4 4 4
  
2 5 2 6 x=5
12
=  Number of rupees, the player has to lose,
17
if no heads occur = 5.
17. Ans: (c)
19. Ans: (b)
 2d  4
Sol: Total probability =  C   = 1 Sol: P (X is even) = P (X = 2) + P (X = 4 )
d 1  d 
+ P (X = 6) + ….
4 2
 C (2 + 2 + + )=1 1 1 1
3 3  2
 4  6  .......
2 2 2
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 51 : CSIT‐Postal Coaching Solutions

1  1 1 
2 3 0 1
1
 2 1        .......    x 2 (1  x ) dx   x 2 (1  x ) dx 
2   2   2  6
 1 0

1 1
1  1 1 Variance of X = E (X2) –(E (X))2 =
 1    6
4  4 3

22. Ans: (a)

20. Ans: 0.62857 Range(0.62 to 0.63)
Sol: Required probability
Sol: Let E1 = The selected reader is reading only
5 5
one news papers 1 1
= C(10,5).   .   .1
2 2
E2 = The selected reader is reading atleast
10
one of the newspapers C5
=
210
The Venn diagram for the given data is

23. Ans: (c)

A B
.9 .6 .6 Sol: If the person is one step away, then we have
.2
.3 .2 two cases:

.7 Case1: 6 forward steps and 5 backward

.65
C
or
Case2: 6 backward steps and 5 forward.
Required probability = P(E1|E2)
PE1  E 2  P E1  Required Probability
= 
P(E 2 ) P E 2  = C(11,6)(0.4)6 + C(11,5)(0.6)6 (0.4)5
0.22 = C(11,5) (0.4)5 (0.6)5 (0.4 +0.6)
 = 0.62857
0.35
= 462 × (0.24)5

21. Ans: (b)

24. Ans: (d)
Sol: Here f (x) is an even function

Sol: E1 = Event of writing good book
E (X)   x. f ( x ) dx  0 E2 = Event of not writing a good book

E = Probability of publication
( x f(x) is an odd function)
1 E 2

P(E1) = P(E2) = , P   ,
E (X 2 )   x 2 f ( x ) dx 2  E1  3


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

 : 52 : Discrete Mathematics

 E  1 Required probability
P  
 E2  4 E
P ( A ) P 
A A
P(E) = P(E  E1) + P(E  E2) P  
E
  PA  P  E  E E
   PB P   PC  P 
1 2 1 1 A  B C
= .  .
2 3 2 4
1 3
11 
= 3 8 27 9
24 = = 
1 3 1 4 1 2 75 25
    
X denote the number of books published. 3 8 3 9 3 9
Required probability =
P(X = 1) + P(X = 2) 26. Ans: (b)
2 Sol: Let X = Number of times we have to toss a
11 13  11 
= C1   2 C 2  
2

24 24  24  pair of dice.
2 P = probability of getting 7 in one throw
11 13  11 
= 2     1
24 24  24  =
6
407
= q=1–P
576
= probability of not getting 7 in one throw
25. Ans: (a) 5
=
1 6
Sol: P(A) = P(B) = P(C) =
3 q6 = probability of not getting a 6 in
E = Event of getting 2 heads and 1 tail 6 throws

E 1 1 3

2
P (X  6) = Probability that it take less than
P   3 C 2     
A 2 2 8 6 tosses to get a 7
2 6
E  2 1 4 5
P   3 C 2      =1–  
B  3 3 9 6
2 Required probability = P (X > 6)
E 1  2 2
P   3 C 2     
C 3  3 9   5  6   5  6
= 1  1       
  6    6 

 0.335

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

 : 53 : CSIT‐Postal Coaching Solutions

27. Ans: 7 29. Ans: 0.122

Sol: The probability of missing the target is Sol: We view the number of misprints on one
q = 1 – p = 0.7. Hence the probability that n page as the number of successes in a
missiles miss the target is (0.7)n. Thus, we sequence of Bernoulli trials. Here n = 300
seek the smallest n for which 1
since there are 300 misprints, and p = ,
1 – (0.7)n > 0.90 or 500

equivalently (0.7)n < 0.10 the probability that a misprint appears on a

given page. Since p is small, we use the
Compute
Poisson approximation to the binomial
(0.7)1 = 0.7, (0.7)2 = 0.49, (0.7)3
distribution with  = np = 0.6.
= 0.343,
(0.7)4 = 0.240, (0.7)5 We have
= 0.168 P(0misprint) = f(0; 0.6)
(0.7)6 = 0.118, (0.7)7
=
0.60 e 0.6 = e–0.6 = 0.549
= 0.0823 0!

Thus, atleast 7 missiles should be fired. P(1 misprint) = f(1; 0.6)

28. Ans: (b) =

0.61 e 0.6 = (0.6) (0.549)
1!
Sol: Let X = number of accidents between 5 P.M
= 0.329
and 6 P.M.
Required probability
For Poisson distribution,
= 1 – (0.549 + 0.329)
= np = (1000) (0.0001) = 0.1
= 0.122
e   .x
P(X= x) = (x = 0, 1, 2,……..)
x
30. Ans: 0.1353
Required Probability = P(X  2)
Sol: Given that  = 900 vehicles/hour
= 1 – P(X < 2)
= 1 vehicle/ 4 sec = 2 vehicles/8 sec
= 1 – {P(X = 0) + P(X = 1)}
Probability for k vehicles in a time gap of 8
= 1 – e–0.1 (1 + 0.1)
k e  
= 0.0045 seconds = P(X = k) =
k!

Required probability = P(X = 0) = e– = e–2

= 0.1353
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 54 : Discrete Mathematics

31. Ans: (c) Therefore,

Sol: The area under normal curve is 1 and the Required Probability = NP (X  149.5)
curve is symmetric about mean. = NP(Z  0.82) = 0.5000 + (0.82)
= 0.5000 + 0.2939
0.3 = 0.7939

80 100 120
33. Ans: 2
 P(100 < X < 120) = P(80 < X < 120)  z2
1
Sol: f z   e 2
is the probability density
= 0.3 2
Now, P(X < 80) = 0.5 – P(80 < X < 120) function of Normal Distribution
= 0.5 – 0.3 = 0.2 
  f z  dz  1

32. Ans: 0.7939
 The value of given integral
Sol: This is a binomial experiment B(n, p) with

n = 3500, p = 0.04, and q = 1 – p  2  f z  dz
= 0.96. 

Then  = np = (3500) (0.04) = 140, =2

2 = npq = (3500)(0.04) (0.96) 34. Ans: 0.3085

Sol: Let X = diameter of cable in inches
= 134.4,
mean =  = 0.80
 = 134.4 = 11.6
Standard deviation =   0.0004 = 0.02
Let X denote the number of people with
Alzheimer's disease. X
The standard normal variable Z =

We seek BP(X < 150) or, approximately,
0.81  0.80 1
NP (X  149.5). (BP denote Binomial When X = 0.81, Z = =
0.02 2
Probability and NP denote Normal
Required probability = P (X > 0.81)
Probability)
1
We have 149.5 in standard units = P(Z > )
2

=
149.5  140 =1 – (Area under the normal curve to the left
11.6
of Z = 0.5)
= 0.82
= 1 – 0.6915 = 0.3085

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

 : 55 : CSIT‐Postal Coaching Solutions

35. Ans: (i) 28 (ii) 28 (iii) 205 (iii) When X = 65, we have Z = –1
Sol: The parameters of normal distribution are When X = 71, we have Z = +1
 = 68 and  = 3 Required probability = P(65< X < 71)
Let X = weight of student in kgs = Area under the normal curve to the
X  left of Z = – 1 and Z = +1
Standard normal variable = Z =
 = 0.6826
(By Property of normal curve)
(i) When X = 72, we have Z = 1.33
Expected number of students who
Required probability = P(X > 72)
weighs between 65 and 71 kgs
= Area under the normal curve to the right
= 300 × 0.6826
of Z = 1.33
= 0.5 – (Area under the normal curve  205
between Z = 0 and Z = 1.33)
36. Ans: (b)
= 0.5 – 0.4082
Sol: If X has uniform distribution in [a, b] then
= 0.0918
Expected number of students who weigh (b  a ) 2
variance =
12
greater than 72 kgs = 300 × 0.0918 = 28
[3a  (a )]2 16a 2 4a 2
=  
12 12 3
(ii) When X = 64, we have Z = –1.33
37. Ans: (b)
Required probability = P(X  64)
Sol: Let X be a uniformly distributed random
= Area under the normal curve to the
variable defined on [a, b].
left of Z = – 1.33
ab
Mean is = 1  a + b = 2 ……. (1)
= 0.5 – (Area under the normal curve 2
between Z = 0 and Z = 1.33)
Variance is
b  a 2 = 1
 b – a = 2 …..(2)
(By symmetry of normal curve) 12 3
= 0.5 – 0.4082 On solving, we get a = 0, b = 2
= 0.0918 1
 The PDF of f(x) is = ,axb
Expected number of students who ba

weigh less than 68 kgs = 300 × 0.0918 =

1
,0x2
2
= 28
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 56 : Discrete Mathematics

1 1 5
1 1 1
P(X < ) 2 f x dx =  2 dx  P(X<5) =  f ( x ) dx
2 0 0 2 4 0

5 x
1
38. Ans: (c) = 0 10 e 10 dx  0.393
1
Sol: f(x) = , –2  X  2
4
40. Ans: (a)
1
|X–1|  1 1
2 Sol: Mean  0.5   = =2
 0.5
 1  1 
=  X  1   2     X  1  2  The probability function of exponential
 2  2 
distribution is f(x) = 2e–2x, x  0.
1
|X–1| 
2 P(X >
1
2
)=

 2e
1
2 x

dx =  e  2 x 

1
2
2
 1 3 
=  -1  X   +   X  3
 2 2  = (0) – {–e–1} = e–1

 1
P | X - 1 |   41. Ans: (d)
 2
1
1 x
 1 3  Sol: The density function f(x) = e 5
= P  - 1  X   + P   X  3 5
 2 2 



We require P(x>8) = f ( x ) dx  e 8 / 5
1

 f x dx   f x dx
3
= 2
3
1 8
2

1 = 0.2
1 31
= 2
1 4
dx  3 dx
2 4
42. Ans: Mean = 34, Median = 35,
Modes = 35, 36 & SD = 4.14
11 3
=  1 3    xi
42 2 Sol: Mean = = 34
n
3
= Median is the middle most value of the data
4
by keeping the data points in increasing
39. Ans: (b) order or decreasing order.
Sol: The probability density function of X is Mode = 36
 e  x , x  0 S.D = 4.14
f (x) = 
0 ,x 0

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

 : 57 : CSIT‐Postal Coaching Solutions

 a2 a3  1
43. Ans: (b)  6   
 2 3 2
Sol: Mean = xiPi = 3
1 1
Variance = x p 2
i i   2 = 10.2 – 9 = 1.2  3a2 –2a3 = 2  a =
2

1 1 Mode a that value at which f(x) is max/min

44. Ans: k = 6, Mean = , Median = ,
2 2
 f(x) = 6x –6x2
1 1
Mode = and S.D = f1(x) = 6 – 12x
2 2 5

For max or min f1(x) = 0  6 – 12x = 0
Sol: we have  f (x) dx  1

 x=
1
2
1
1
 k(x  x ) dx  1
2
f11(x) = –12 f 11    12 < 0
0 2

 x 2 1  x 3 1  1
 maximum at x =
 k        1 2
 2 0  3 0 
1
 mode is
1 1 2
 k   1
 2 3
S.D = E( x 2 )  (E( x ))2
 3 2
k =1 1
 6  
2 5
k=6
 1
6. Linear Algebra
Mean = 


xf ( x ) dx  6( x 2  x 3 ) dx
0

1 01. Ans: (b)

 x3 x4  1 1  1
= 6    6    
3 4 0 3 4  2 Sol: Given that P is 10×5 matrix.

Median is that value ‘a’ for which Q is 5×20 matrix

1
P( X  a ) = and R is 20×10 matrix
2
a
1 Now PQR is 10×10 matrix. Total number
 6(x  x ) dx 
2

0
2
of elements in PQR = 100. Here, we can

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

 : 58 : Discrete Mathematics

find the product PQR only in two ways i.e.,  The minimum number of multiplication
(PQ)R and P(QR) because PQ  QP. operations to find PQR= 1500.
So, to find the product matrix PQR first we
02. Ans: (d)
find PQ and then find (PQ)R (or) we, first
Sol: Giving that
find QR and then find P(QR).
(I – A + A2 – ....+ (–1)nAn) = O ........ (i)
For the product (PQ)10×20 multiplying by A–1

Number of elements in PQ = 200. A–1 – I + A – A2 + ....+ (–1)n–1An–1 = 0

To compute each element of the matrix PQ, ...... (ii)

we require ‘5’ multiplications. Adding (i) & (ii), we get

A–1 + (–1)nAn = O
 Number of multiplications = 200×5
 A–1 = (–1)(n–1). An
= 1000
03. Ans: (b)
For the product [(PQ)R]10×10
Sol: Here determinant of A = –8
Number of elements in (PQ) R = 100
adj A
To compute each element of the matrix A–1 =
|A|
(PQ)R, we require 20 multiplications.
1
 Number of multiplications = 10020 c= (cofactor of the element 6 in A)
8
= 2000
1 2 3
Hence, the total number of multiplication =
8

.  131 
0 4
= –1

operations to find the product [(PQ)R]1010

= 1000+2000 04. Ans: 324
= 3000 Sol: Det Mr = 2r –1
Det M1 + Det M2 + ...... Det M18
Similarly, if we find the product
= 1 + 3 + 5 + ..........+ 37
[P(QR)]10×10 by above method, the total
= 324
number of multiplication operations to find
the product [P(QR)]10×10 = 1000 + 500 05. Ans: –3
= 1500 Sol: Given that |A|10 = 210
 |A| =  2

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

 : 59 : CSIT‐Postal Coaching Solutions

 –3 – 25 =  2 1
 maximum value of  =
 3 = –27 or 3 = –23 2
1
  = –3 or  =  233 08. Ans: 0
Sol: Given that
06. Ans: 8
cos x x 1
k
f(x) = 2 sin x x 2 2x
Sol: Given that A n  72
n 1 tan x x x
k k k R2 R
applying and 3
 k  k k  k  1 k  k = 72
2 2 2
x x
k2 k2 k2  k 1
cos x x 1
C2  (C2 – C1), C3  C3 – C1 f x  2 sin x
= x 2
x2 x
k 0 0 tan x
1 1
 k k 1
2
0 = 72 x
k 2
0 k 1
1 0 1
f x 
 k(k+1) = 72u Lt = 2 0 2 =0
x 0 x 2

k=8 1 1 1

1 09. Ans: (d)

07. Ans:
2 Sol: In a symmetric matrix, the diagonal
1 1 1 elements are zero and aij = –aji for i  j.
Sol: Given that  = 1 1  sin  1 Each element above the principal diagonal,
1 1 1  cos 
we can choose in 3 ways (0, 1, –1).
Number of elements above the principal
R2 – R1, R3 – R1
n n  1
diagonal =
1 1 1 2
= 0 sin  1  By product rule,
0 0 cos  Required number of skew symmetric
n  n 1
= sin . cos 
matrices = 3 2
.
sin 2
=
2
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 60 : Discrete Mathematics

3 Expanding by third column

10. Ans:
16
1 1 1
Sol: Number of 2×2 determinants possible with  (–1) 1 0 1  0
1 1 t
each entry as 0 or 1 = 24 = 16.
 (–1). (1 –(t–1)–1)  0
a b
Let  = t1
c d

If  > 0 then a = d = 1 and atleast one of the 13. Ans: (c)

entries b or c is 0.  1 2 5   1 2 5 
   
 The determinants whose value is +ve Sol:  2  4 a  4  ~  0 0 a  6 
 1  2 a 1  0 0 a  6
are    

 1 2 5
1 0 1 1 1 0  
, and =  0 0 0  if a = –6 and Rank = 1
0 1 0 1 1 1  0 0 0
 
3 If a  –6 then Rank of the matrix is 2
 Required probability =
16
 Option (c) is correct.

11. Ans: 1
14. Ans: (d)
Sol: If the vectors are linearly dependent, then
Sol: The characteristic equation is
1 t 0 0
|A – I| = 0
1 1 t 0 0
 (2 – 4) (2 + 4) = 0
1 1 1 t
3
 4 = 16
 (1 – t) = 0
By Caley Hamilton's Theorem
t=1
A4 = 16I

12. Ans: 1
Sol: If the vectors are linearly independent, then
1 1 0 1
1 0 0 1
0
1 1 0 t
0 0 1 0

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

 : 61 : CSIT‐Postal Coaching Solutions

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

 1 1 0 0 0 R3 + R2
 0 1 1 0 0 

A~ 0 0 1 1 0  1  1 2  1 1 

0  1
  
0 0 1 ~ 0 1  1 2  1 
 0 0 0 1  1
0 0 0 0  2
R4  R4 + R3 Rank of coefficient matrix A = 2

 1 1 0 0 0 Rank of [A|B] = 3
 0 1 1 0 
 0  The system has no solution
A ~  0 0 1 1 0
 
0 0 0 1  1 17. Ans: (c)
 0 0 0 1  1
Sol: Let the given system be AX = B
R5  R5 – R4 The augmented matrix of the system

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

 : 62 : Discrete Mathematics

1 0 0 0 0  1 1 3 
   
0 1 0 1 0 ~  0  3  9
= [A|B] =   0 1
1 1 0 0 0  3 
 
0 0 0 1 1
3R3 + R2
R3 – R1
1 1 3 
 
1 0 0 0 0 ~ 0  3  9
  0 0
0 1 0 1 0 0 
~  
0 1 0 0 0
  Here [A] = 2
0 0 0 1 1
If B is a linear combination of columns of A,
R3 – R2
then [A] = [A|B]
1 0 0 0 0
   The system has infinitely many solutions
0 1 0 1 0
~ 
0 0 0  1 0
  19. Ans: (c)
0 0 0 1 1
Sol: If the system has non trivial solution, then
R4 + R3 a b c
1 0 0 0 0 b c a 0
  c a b
0 1 0 1 0
~ 
0 0 0  1 0
  C1  C1 + C2 + C3
0 0 0 0 1
abc b c
 abc c a 0
Here [A] = 3 and
abc a b
[A|B] = 4
R2 – R1, R3 – R1
 The system has no solution.
abc b c
18. Ans: (d)  0 cb a c  0
0 a b bc
 1 1 3 
 
Sol: A =  5 2 6 
  2  1  3  (a + b + c) (a2 + b2 + c2 – ab – bc – ca) = 0
 

R2 – 5R1  a + b + c = 0 or

R3 + 2R1
a =b=c
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 63 : CSIT‐Postal Coaching Solutions

20. Ans: (b) 1 1 1 6 

 
Sol: Let the given system be AX = B ~ 0 1 2 4 
The augmented matrix of the system 0 1   1   6

1 2  3 a R3 – R2
 
= [A|B] = 2 3 3 b 1 1 1 6 
5 9  6 c   
~ 0 1 2 4 
0 0   3   6
R2 – 2R1
The system has unique solution if   3.
R3 – 5R1

1 2  3 a  22. Ans: (d)

  Sol: If the system has non trivial solution then
~ 0  1 9 b  2a 
0  1 9 c  5a  1 k 1
k 3 k 0
R3 – R2 3 1 1

1 2  3 a   1(k – 3) + k.2k + (k–9) = 0

 
~ 0  1 9 b  2a   2k2 + 2k – 12 = 0
0 0 0 c  b  3a 
 k = 2, –3

The system is inconsistent

23. Ans: 2
if c – b – 3a  0
Sol: The characteristic equation is
 3a + b – c  0
|A – I| = 0

21. Ans: (c) A real eigen value of A is  = 5

Sol: Let the given system be AX = B The eigen vectors for  = 5 are given by
The augmented matrix of the system = [A – 5I] X = 0

1 1 1 6  0 0 1 
0  x 1  0 
  0 0 0 0   x  0 
[A|B] = 1 2 3 10    2   
1 2    0 0 3 1   x 3  0 
     
0 0 3  4  x 4  0 
R2 – R1, R2 – R1
 x4 = 0, x3 = 0
 [A] = 2 and n = 4=number of variables

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

 : 64 : Discrete Mathematics

 The number of linear independent eigen 25. Ans: (a)

vectors corresponding to  = 5 are 2. 1 2 
Sol: Let A =  
0 2 
24. Ans: 0 The eigen values of A are 1, 2
3 4  The eigen vectors for  = 1 are given by
Sol: Let a =  
4  3 [A – I] X = 0
The characteristic equation is
0 2   x   0 
     
|A – I| = 0 0 1   y   0 
3 4 y=0
 0
4 3
1 
 X1 = c1  
  = 5
0 
The eigen vectors for  = 5 are given by
[A – 5I] X = 0 The eigen vectors for  = 2 are given by
 2 4   x  0  [A – 2I] X = 0
    y   0 
 4  8       1 2   x  0 
     
 x – 2y = 0  0 0   y  0 

 2  –x + y = 0
 X1 = c1  
1   2
 X2 = c2  
The eigen vectors for  = –5 are given by 1 
[A + 5I] X = 0 1   2
 The eigen vector pair is   and  
8 4   x  0  0  1 
      
 4 2   y  0  26. Ans: (c)
 2x + y = 0 Sol: If A is singular then 0 is an eigen value of A.
 The minimum eigen value of A is 0.
1
 X2 = c2  
  2 The eigen vectors corresponding to the eigen

a+b=0 value  = 0 is given by

[A – 0I]X = 0
3 5 2  x  0 
 5 12 7   y   0 
   
2 7 5  z  0
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 65 : CSIT‐Postal Coaching Solutions

The characteristic equation is

Applying cross multiplication rule for first
and second rows of A, we have |A – I| = 0

x y z 1  0 0 0 1
  
11  11 11 0 1   1 1 0
 0 1 1   1 0 =0
x y z
   1 1 1 1   0
1 1 1
1 0 0 0 1 
 The eigen vectors are
R1  R1 + R5 and R2  R2 + R3 + R4
1
2 0 0 0 2
X = k  1
0 3 3 3 0
 1   =0
0 1 1  1 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
1 0 0 0 1
0 0 1  0 1 1 1 0
 A = 0 1 0 0 1 1  1 0 0
1 0 0 1 1 1 1  0
1 0 0 0 1 
The characteristic equation is   = 2, –3
|A – I| = 0  product of the non zero eigen values = –6

 0 1
29. Ans: 3
 0 1  0  0
1 0  Sol: If  is eigen value then AX = X
4 1 2 1  1 
 (1 –  ) (  2 – 1) = 0   = 1, 1, –1 
 17 2 1  2   2
   
14  4 10 k  k 
28. Ans: –6
Sol: The given matrix has rank 2  6 + 2k = 

 There are only 2 non zero eigen values 21 + k = 2

 42 + 2k = 4
 = 12 and k = 3
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 66 : Discrete Mathematics

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
product of eigen values = |A| = 100 0 0 3

 10ab = 100 Here, A is upper triangular matrix

 ab = 10 .....(ii) The eigen values are = 2, 2, 3
solving (i) & (ii), we have The eigen vectors for  = 2 are given by
 a = 5 and b = 2 [A –2I]X = 0
 |a – b| = 3 0 0 1  x  0
 0 0 1  y   0
31. Ans: 1 0 0 1  z  0
Sol: Product of eigen values = |A| = 0  Here Rank of [A – 2I] = 1
3 4 2  Number of Linearly independent eigen
 9 13 7 0
vectors for  = 2 is n – r
6 9 x 4
=3–1=2
R2 – 3R1, R3 + 2R1
For since,  = 3 is not a repeated eigen
3 4 2
 0 1 1 0 value, there will be only one independent
0 x 1 0 eigen vector for  = 3.

 3(1 – x) = 0  The number of linearly independent eigen

x=1 vectors of A = 3.

32. Ans: (d) 34. Ans: (d)

Sol: The characteristic equation is Sol: The characteristic equation is
4 =  (3 – 62 + 9 –4 ) = 0
 4 –  = 0 |A|= product of the roots of the characteristic

 (3 –1) = 0 equation = 4

Trace of A = sum of the roots of
  = 0, 1, –1  3 i
characteristic equation = 6
  = 0, 1, –0.5(0.866)i

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

 : 67 : CSIT‐Postal Coaching Solutions

35. Ans: (b) 37. Ans: (c)

Sol: A is symmetric matrix. Sol: The characteristic equation is
The eigen vectors of A are orthogonal. a  1 0
For the given eigen vector, only the vector 1 a  1 0
given in option (b) is orthogonal. 0 1 a 

 option (b) is correct.

 (a – ) [{(a – )2 –1} – (a – )] = 0

36. Ans: (c)  = a, a 2

Sol: The characteristic equation is
38. Ans: 2 –3 + 2
3 – 18 2 + 45  = 0
Sol: The characteristic equation is
  = 0, 3, 15
5 6 6
The eigen vector for  = 15 are given by 1 4 2 =0
3 6 4
[A –15I] X = 0
 ( –1) ( – 2)2 = 0
 7  6 2   x  0   Either ( –1) ( – 2) or ( –1) ( – 2)2 is

   6  8  4   y   0 
    the minimal polynomial
 2  4  12  z  0
(A – I) (A – 2I)
x y z  4  6  6  3  6  6
  
40  40 20
=  1 3 2   1 2 2  = O
x y z  3  6  5  3  6  6
  
2 2 1  The minimal polynomial of A

 The eigen vectors for  = 15 are = ( – 1) ( – 2)

= 2 –3 + 2
2
X = k  2 (k  0)
 1 

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

 : 68 : Discrete Mathematics

LU Decomposition 41. Ans: (a)

 1  3 5
Sol: A   2  4 7 
39. Ans: (b)
Sol: The coefficient matrix  1  2 1 
4 5 R2 – 2R1
A=  
12 14
R3 + R1
R2 – 3R1 1  3 5 
~ 0 2  3
4 5 
~   0  5 6 
0 1
5
R3 + R2
4 5  2
U=  
0 1 1  3 5 
 
~ 0 2  3 
40. Ans: (b)   3
0 0 2 

1 2 1

Sol: A   2 3 3
From the elementary operations used
 3  10 2
above, we can write
R2 – 2R1
R3 + 3R1 1 0 0

L= 2 1 0
1 2 1   5 
~ 0  1 1   1 2 1
 
0  4 5

R3 – 4R2

1 2 1
~ 0  1 1
0 0 1

1 2 1
 U = 0  1 1
0 0 1

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

 : 69 : CSIT‐Postal Coaching Solutions

03. Ans: 7
7. Calculus
1
1
  5 n  n
01. Ans: 1 n 

Sol: Lt 7 n  5n  n
 Lt 7 1    
n   7 
 
1
Sol: Put x = . Then y  0 as x  . =7
y
 Lt r n  0, | r |  1
 1 2 1  n   
Given Lt = Lt  2   1  
y 0
 y y y

 1  2 y  y 2  1 04. Ans: –2
= Lt  
y0
 y   1 
Sol: Lt  sec x  

x  1  sin x 
2
1
= Lt 2  2 y 
y0
2 1  2y  y2 1  sin x  cos x   0 
= Lt    0 form
x   cos x 1  sin x  

=1 2

1  cos x  sin x 
02. Ans: 1 = Lt  
x    sin x  cos 2 x 

2
a x  xa
Sol: Lt  = –1 (by L' Hospital's Rule)
x a xx  aa
= –2
a x log a  a x a 1
 Lt = –1
x  a x x 1  log x 
05. Ans: 1
(By L' Hospital's Rule)  e x  esin x  0 
Sol: Lt 
x  0 x  sin x
  0 form
 
a a log a  a.a a 1
 = –1
a a 1  log a   e x  esin x . cos x 
= Lt  
x 0
 1  cos x 
log a  1
 = –1 (by L' Hospital's Rule)
log a  1
= 1 (applying L' Hospital's Rules two times)
 log a –1 = –log a – 1

 log a = 0

a=1

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

 : 70 : Discrete Mathematics

06. Ans: (a)  sin x 

 Lt   Lt sin x  0
sin 2x  a sin x x 0
 x  x 0
Sol: Lt b
x 0 x3 log y = 0
By L' Hospital's rule  y = e0 = 1
2 cos 2x  a cos x
Lt b
x 0 3x 2 1
08. Ans:
2+a=0 ( b is finite) 2
 a=–2 Sol: Lt  f ( x )  Lt  f ( x )  f (0)
x 0 x 0

By L' Hospital's rule

Lt f ( x )  Lt  f (0  h )  Lt  f  h 
x  0
 4 sin 2 x  2 sin x h 0 h 0
Lt b
x 0 6x
1  ph  1  ph
= Lt 
again, by L' Hospital's rule h 0 h

Lt
 8 cos 2 x  2 cos x
b 1  ph   1  ph 
x 0 6
= Lt 
h 0 
 h 1  ph  1  ph 
b=–1 2p
2p
= Lt  =
 a = – 2 & b = –1 h 0 1  ph  1  ph 2

=p
07. Ans: 1
tan x 20   1  1
1 Now f(0) = =
Sol: Lt  
x 0 x
 
0
02 2
 
1
1
tan x p=
Let y  Lt   2
x 0
x
Taking Logarithms on both sides 09. Ans: (d)
1 | x  3 |  | 2 |
log y  Lt tan x log   ……… 1 (0  ) Sol: f(1+) = Lt
x 0
x x 1 x 1

 log x   x 32

 Lt   = Lt = –1
x 0 cot x  x 1 x 1

By L' Hospital's rule x 2 3x 13

  2
f(1–) = Lt  4 2 4
1 x 1 x 1
 Lt x
x 0  cos 2 x
=
1
Lt 
x  1x  5 = –1
4 x 1 x  1
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
 : 71 : CSIT‐Postal Coaching Solutions

 f is continuous and differentiable at x = 1 12. Ans: (c)

| x  3 | 0 Sol: (a) Let f(x) = (x–2) in [1, 3]
f(3+) = Lt  =1
x3 x  3 Here, f(1)  f(3)
 x  3  Roll's theorem is not applicable
f(3–) = Lt  = –1
x3 x  3 (b) Let f(x) = 1 – (1 – x)–1 in [0, 2]
 f is not differentiable at x = 3 Here, f(x) is not continuous in [0, 2]
Lt f ( x )  Lt | x  3 | 0  f (3)  Roll's theorem is not applicable
x3 x3

 f is continuous at x = 3 (c) Let f(x) = sin x in [0, ]

Here, f(x) is continuous in [0, ] and
10. Ans: (a) differentiable in (0, ).
Sol: If f(x) is continuous at x = 0, then Further, f(0) = f()
Lt f ( x )  f (0)  Roll's theorem is applicable
x 0

1 x  x
1 (d) Let f(x) = Tan x in [0, 2]
 Lt   = f(0)
x0 1  x
  Here, f(x) is not continuous in [0, 2]

 1  x 1x   Roll's theorem is not applicable

 Lt  1
 = f(0)
x 0 
 1  x x  13. Ans: (d)
e 1 Sol: Here, f(x) is neither continuous nor
  f(0)
e differentiable in the interval [–1, +1].
–2
 f(0) = e  Option (d) is correct.

11. Ans: (c) 14. Ans: 1.732

1
Sol: f (x) = 2ax, x  1 Sol: By Cauchy's mean value theorem
= 2x + a, x > 1 f d  f (3)  f (1)

f1(1–) = f(1+) gd  g(3)  g(1)

(  since f(x) is differentiable at x = 1)  

 3 1
2a = a + 2  a = 2  –d =  
 1  1
f(1–) = f(1+) ( f(x) is continuous at x = 1)  3 
a+1=1+a+bb=0
 d= 3

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

 : 72 : Discrete Mathematics

15. Ans: (d) 18. Ans: (c)

1 Sol: y = a log |x| + bx2 + x
Sol: Let f(x) = x x

 dy 
1    0
1  log x   dx  x  1
f(x) = x x
 x 2 
 – a –2b + 1 = 0 ........... (1)
f(x) = 0  x=e
 dy 
Further f(e) < 0    0
 dx  x  2
 f(x) has maximum at x = 0
a
1   4b  1  0 ............... (2)
2
The maximum value = f(e) = e e

1
solving (1) & (2), we have a = 2, b =
16. Ans: 0.785 2

Sol: Let y = f(x)

19. Ans: 2
1  x 
= tan 1  Sol: f1(x) = 6x2 – 18 ax + 12a2
1  x 
= 6(x –a) (x –2a)
1
f(x) =

1  x2   f(x) = 0  x = a or 2a
If x1 = a then x2 = 2a
f(x) has no stationary points.
x2 = x12  2a = a2  a = 0 or 2

Further f(0) = and f(1) = 0
4 Clearly f has a local maximum at x = 2 and a
 local minimum at x = 4
 The maximum value of y =
4
20. Ans: 5
17. Ans: (b) Sol: z = 2 + 2 = ( + )2 – 2
Sol: f(t) = (t – 2)2 (t – 1) = a2 – 2a + 6
f(t) = 0 = (a –1)2 + 5  5
 t = 1, 2 z is least iff a = 1
2
f(t) = (t –2) + 2(t – 1) (t –2) least value of z = [z]a=1
f(1) = 1 and f(2) = 0 =5
 f(t) has a minimum at t = 1

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

 : 73 : CSIT‐Postal Coaching Solutions

21. Ans: (a) again

2 2 4 4
Sol: f(x, y) = 2(x – y ) – x + y 5

I=  f (a  b  x ) dx
12
3 
consider fx = 4x – 4x = 0 12

 x = 0, 1, –1 5
sin 4 x
= 
12
 dx
fy = –4y + 4y3= = 0 12
sin x  cos 4 x
4

 y = 0, 1, –1 adding
5
r = fxy = 4 – 12x2 4
2I =  dx 
12

s = fxy = 0 12
12

t = fyy = –4 + 12y2 
I=
At (0,1), we have r > 0 and (rt – s2) > 0 6

 f(x, y) has minimum at (0,1)

23. Ans: 6.28
At (–1, 0), we have r < 0 and (rt – s2) >0
Sol: On substituting x = 7 sin2  + 3 cos2 ,
 f(x, y) has a maximum at (–1, 0)
We get 7 – x = 4 cos2 ,

22. Ans: 0.523 x –3 = 4 sin2  and dx=8 sin  cos  d.

Sol: We have, Also x  3    0

b b 
 a
f ( x ) dx =  f (a  b  x ) dx
a
and x  7   
2
1 The given integral becomes
Here, f(x) =
1  tan 4 x 

cos x 4
 I = 8. 
0
2
cos 2  d
=
cos x  sin 4 x
4
= 2 = 6.28

 
f(a+ b –x) = f   x  24. Ans: 16.15
2 
4
Sol: Put 1 +x = t2
sin x
=
then I   t 2  1 . t. 2t dt
2 2
sin x  cos 4 x
4
1
5 2

t  2t  t  dt = 2 t7  25t  t3 
7 5 3

12 2
Let I =  f ( x ) dx 2 6 4 2

12 1
 1
5
cos 4 x 1696
 =
12
=  dx
12
cos 4 x  sin 4 x 105

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

 : 74 : Discrete Mathematics

25. Ans: 39 28. Ans: (a)

 x  dx
10 0
Sol: 0
4 Sol:  sin hx dx  cos hx



 x  dx   x  dx  ........   x  dx
5 6 10
= 0
4 5 9
e x  ex

5 6 10
2
=  4
4 dx   5 dx  ........  
5 9
9 dx 

= 4 + 5 +......+ 9 2  e   e  
  
2  2 
= 39
e
1 0   
26. Ans: (a) 2


 x sin
4
Sol: x cos 6 x dx 29. Ans: 8
0
Sol: Y


I   sin 6 x cos 4 x dx (property 9) y = |x|
20

2
 y = 4 – |x|
= 2
20 sin 6 x cos 4 x dx (property 6)
–4 0 2 4
X

 5.3.1.3.1   3
2
I     On solving the two curves in the first
10.8.6.4.2 2  512
Quadrant, we get x = 2. Therefore, the area
27. Ans: 4 bounded by the curves is

 x sin x  dx = k
2
= 2  4  x  dx   x dx 
2 2
Sol:
0  0 0 
 2
  0
x sin x dx  

 x sin x dx = k  x 2 2
  x 2 2

= 2  4 x      
 2 0  2 0 
 x  cos x  sin x 0   x cos x  sin x 2  k  

  – [–3] = k = 2(8 –2 – 2)
= 8 sq. units
k=4

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

 : 75 : CSIT‐Postal Coaching Solutions

30. Ans: 25.12 34. Ans: (a)

4 3
Sol: Volume =   y 2 dx
Sol: 
1  x2
dx at x =1
x  12
0
1
4
= 
0
 x dx = 8 cubic units
1 x2
f x   f x    as x  1
x  12
31. Ans: (d)
1 1 x
2 gx   
Sol: Length = 
3  dy 
1    dx x  12  1
2

0
 dx  x 1  
2

 x
3
=  1  x dx f x  1 x
 x  1  2
2
0 Lt 
3
x 1 gx  x  12

2
= 1  x 2 
3
3 3
3 0 1  1 
1 x  12   x  1 1
14
=
3 1 1
  
2 0
32. Ans: (b)
 35. Ans: (a)
 x e dx  0 f x   xe
2 2
x x
Sol: 2
x3  1

Sol:  2x
dx at x = 2 point of infinite
(0 dx) f  x    xe x2
  f x 
1

f x    an x  2
Converges to 0
f x  x 3  1
Lt   2  x  9 finite
33. Ans: (a) x  2 g x  2x
1 dx 1 dx 1 2 2
  2 2 1 2
Sol:
1 x 2 0 x
(
x2
is even function)
 gx   
1 1 2x
 2 t  2 convergent
1

dx 1 1
= 2 Lt   2 (since 2 is not defined)
x 0 0 x x 36. Ans: (d)
1
 1 
ex
= 2 
 x 0
Sol: 1 x 2 dx
= 2{(–1) – (–)}  
1
= (Divergent)  gx  dx   x
1 1
2
dx  1

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