Professional Documents
Culture Documents
Discrete Mathematics
Discrete Mathematics
1. Logics
P.Q Q P .R
By distributive law
P Q P Q .R
Propositional Logic By Demorgan’s law & commutative law
= 1 .R
01. Ans: (a) =R
Sol: ( (P Q) (P Q) P)
( P Q) ( P Q) P 04. Ans: (d)
(By Demorgan’s law) Sol: (a) L.H.S A → (P C)
(( P Q) ( P Q)) P A (P C) E16
(By Associative law) ( A P) C Associative law
( P ( Q Q)) P (A P) → C
(By Distributive law) E16 & Demorgan’s law
( P T) P = R.H.S
( Q Q is a tautology)
(b) L.H.S = (P → C) (Q → C)
P P ( P T P)
( P C) ( Q C) By E16
T
( P Q) C Distributive law
(P Q) → C By E16
02. Ans: (c)
= R.H.S
Sol: (( P → Q) ( P Q)) R
(T ) R ((P → Q) ( PQ)) (c) A → (B→C)
~A (~B C) By E16
R (T is a tautology)
(~A ~B) C By associative law
(~B ~A) C By commutative law
03. Ans: (d)
~ B (~A C) By associative law
Sol: In Boolean algebra notation, the given
B → (A→C) By E16
formula can be written as
P.Q.R Q.R P.R (d) When A is false and B is false, we have
P.Q .R Q P .R LHS is true and RHS is false.
By associative law & distributive law LHS RHS
Boole’s contribution in logic firmly established the point of view that logic should use symbols
and the algebraic properties should be studied in logic
: 2 : Discrete Mathematics
05. Ans: (d) (C) R.H.S (p → r) (q → r)
Sol: The given compound proposition (~p r) (~q r)
(p q) (p~q) (~pq) (~p~q) Equivalence
(Commutative law) (~p ~ q) r)
Distributive law
(p (q~q)) (~p (q~q))
~(p q) r
(Distributive law)
Demorgan's law
(pF) (~pF)
(p q) → r
p ~p Equivalence
F = L.H.S
The given formula is a contradiction. (D) When a is true, b is false and c is true;
the given formula has truth value false.
06. Ans: (d) It is not a tautology
Sol: (A) R.H.S (a → c) (b → c)
07. Ans: (b)
(~a c) (~b c)
Sol: Case 1: When p is true, the given formula
Equivalence
becomes
(~a ~b) (c c)
(T → q) (T → r) (q → r ) T
By associative and commutative laws q r (q r )
~(a b) c (∵(c c) c) (q r) ~ (q r)
F
(a b) → c Equivalence Case 2: When p is false, the given formula
= L. H. S becomes
The given formula is a tautology {(F → q) (F → r) (q → r )F}
F
The given statement formula is a
(B) R.H.S (p → q) (p → r)
contradiction.
(~p q) (~p r)
Equivalence 08. Ans: (d)
~p (q r) Sol: The truth table of a propositional function in
n variables contain 2n rows. In each row the
Distributive law
function can be true or false.
p → (q r)
By product rule, number of non equivalent
Equivalence propositional functions (different truth
tables) possible 2 2
= L. H. S n
x y y x
First order Logic
The remaining options are not true as per the
21. Ans: (a) diagram.
Sol: To negate a statement formula we have to
replace x with x, x with x and negate 25. Ans: (d)
the scope of the quantifiers. Sol: The given formula is equivalent to
~{x {P(x) ~Q(x)}} = x {P(x) → Q(x)} x {y (~) z(~)}
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
30. Ans: (d) S2 is equivalent to the following argument
Sol: The given statement can be represented by 1) x P(x) premise
S2. 2) x {P(x) → Q(x) premise
Further, S1 S2 S3 x Q(x)
Option (d) is correct 3) x P(x) from (1) and (2),
by modus ponens,
31. Ans: (b) 4) x P(x) from (3)
Sol: S1 is equivalent to the following argument S2 is valid
1) x P(x) premise S3:
2) x {P(x) → Q(x) premise 1) x P(x) premise
x Q(x) 2) x Q(x) premise
Here, we cannot combine (1) and (2), to get x {(P(x) Q(x)
the conclusion, because in both the formulae (3) Q(a) (2), E.S.
existential quantifiers are used. (4) P(a) (1) U.S.
(5) P(a) Q(a) (3), (4), conjunction
(6) x {P(x) Q(x)} (5), U.G.
S3 is valid
bn
33. Ans: (b) S2: For x = –1, Q(x) is true and R(x) is true.
Sol: S1 is false. For x = 0. There is no integer y S2 is true
such that ‘0 is a divisor of y’ S3: For the integer x = 1, P(x) is false
S2 is true. If we choose, x = 1, then the P(x) → R(x) is true for integer
statement is true for any integer y S3 is true.
S3 is true. If we choose, x = 1, then the
statement is true for any integer y 35. Ans: (c)
S4 is false, because there is no integer y Sol: (a) When y = 2, the given statement is false
which is divisible by all integers. (b) When x = 2 the given statement is false
(c) Solving the equations
34. Ans: (b) 2x + y = 5 and x – 3y = –8
Sol: P(x): x2–7x + 10 = 0 we get x = 1 and y = 3
x = 2, 5 The given statement is true
2
Q(x): x –2x – 3 = 0 (d) Solving the equations
x = –1, 3 3x – y = 7 and 2x + 4y = 3
S1: For x = 3, Q (x) true and R(x) is false. 31 5
we get x an y
S1 is not true. 14 14
The given statement is false
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 11 : CSIT‐Postal Coaching Solutions
36. Ans: (b)
Sol: Argument I:
1. x A (x),
2. x{ A (x) Q (x)
x Q(x)
3. A(a) from (1), by existential specification
4. ~ {A (a) Q (a)} from (2), by universal specification
5. (~ A (a) ~ Q (a)) (4), demorgan’s law
6. ~ Q(a) from (2) and (5) by disjunctive syllogism.
given argument is not valid.
Argument II:
1. {x {(P(x) Q (x)) → R (x)},
2. x Q (x)}
x R(x)
3. {(P(a) Q (a)) → R (a)}, from (1) by existential specification.
4. Q(a) from (2), by universal specification
5. P(a) Q (a) from (4) by addition
6. R(a) from (3) and (5) by modus ponens
7. x R(x) from (6) by existential genralization
Argument II is valid.
4 x
n
2–x 2
Required number of bit strings 2
.
C
06. Ans: 45
02. Ans: 600
Sol: By principle of inclusion and exclusion, Sol: For maximum number of points of
Number of integers divisible by 5 or 6 or 8 intersection, we have to draw 10 lines so that
= 200+ 166 + 125 – 33 – 25 – 41 + 8 no three lines are concurrent. In that case,
= 400 each point correspond to a pair of distinct
Required number of integers = 1000 – 400 straight lines.
= 600 Maximum number of points of
intersection = number of ways we can
03. Ans: (d)
choose two straight lines out of 10 straight
Sol:
Painters Electricians lines = C (10, 2) = 45
x
15 07. Ans: 1,13,322
z y
Sol: The number of 4-digit number = 4 = 24
Plumbers Each digit occur 6 times in every one of the
By the principle of inclusion and exclusion, 4 positions.
80 = 45+50+50–(x+15)–(y+15) –(z+15)+15 The sum of the digits = 17
x + y + z = 35 Hence, sum of these 24 number = 6.(17)
Required number of candidates (1000 + 100 + 10 + 1) = 113322
= x + y + z + 15 = 50
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 13 : CSIT‐Postal Coaching Solutions
08. Ans: 4096 Required number of integers
Sol: In a binary matrix of order 3 4 we have 12 = (9)(9)(9) + (8)(3)(9)(9)
elements. Each element we can choose in = 2673
2 ways.
By product rule, 12. Ans: 2940
Required number of matrices = 212 = 4096 Sol: Consider an integer with 5 digits.
Digit 3 can appear in 5 ways
09. Ans: 188
Digit 4 can appear in 4 ways
Sol: An English movie and a telugu movie can
Digit 5 can appear in 3 ways
be selected in (6)(8) = 48 ways
Each of the remaining digits we can choose
A telugu movie and a hindi movie can be
selected in (8).(10) = 80 ways in 7 ways.
A hindi movie and an English movie can be By product rule,
selected in (10)(6) = 60 movies Required number of integers
Required number of ways = 48 + 80 + 60 = (5)(4)(3)(7)(7) = 2940
= 188
13. Ans: 89
10. Ans: 738
Sol: Each Tennis match eliminates one player
Sol: Number of 1-digit integers = 9
and we have to eliminate 89 players.
Number of 2-digit integers with distinct
We have to conduct 89 matches.
digits = (9) (9)
= 81
Number of 3-digit integers with distinct 14. Ans: 243
digits = (9).(9).(8) Sol: Each element of A can appear in the subsets
= 648 in 3 ways.
Required number of integers = 9+81+648
Case 1: The element appears in P but does
= 738
not appear in Q.
11. Ans: 2673 Case 2: The element appears in Q and does
Sol: Case(i): If the first digit is 6, then each of not appear in P.
the remaining digits we can choose in Case 3: The element does not appear in P
9 ways. and does not appear in Q.
Case(ii): If the first digit is not 6, then first By product rule,
digit we can choose in 8 ways, digit 6 can Required number of ways = 3n = 35
appear in 3 ways and each of the remaining = 243
digits we can choose in 9 ways.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 14 : Discrete Mathematics
15. Ans: 150 19. Ans: 1152
Sol: Required number of ways = Number of Sol: Consider 8 positions in a row marked
onto functions possible from persons to 1, 2, 3,….., 8.
Case 1: Boys can sit in odd numbered
rooms
positions in 4 ways and girls can sit in
= 35 – C(3, 1) 25 + C(3, 2) . 15
even numbered positions in 4 ways.
= 243 – 3 (32) + 3
Case 2: Boys can sit in even numbered
= 150 positions in 4 ways and girls can sit in odd
numbered positions in 4 ways.
16. Ans: P(10, 6) = 151200 Required number of ways
Sol: Required number of ways = 4.4 + 4.4 = 1152
= Number of ways we can map the 6
persons to 6 of the 10 books 20. Ans: 325
Sol: Number of signals we can generate using 1
= P(10,6)
flag = 5
= 151200
Number of signals we can generate using
two flags = P(5,2) = 5.4 = 20 and so on.
17. Ans: (a)
Required number of signals
Sol: The 3 women can speak as a group in = 5 + P(5,2) + P(5,3) + P(5,4) + P(5,5)
3 ways. = 325
The women group can speak with other
4 men in 5 ways. 21. Ans: 106
Sol: Each book we can give in 10 ways.
Required number of ways
By product rule, required number of ways
= 5. 3 = 106
= 720
22. Ans: 243
18. Ans: 2880 Sol: Each digit of the integer we can choose in
Sol: First girls can sit around a circle in 4 3 ways.
ways. By product rule,
Now there are 5 distinct places among the Required number of integers = 35
= 243
girls, for the 4 boys to sit.
Therefore, the boys can sit in P(5, 4) ways.
23. Ans: 12600
By product rule, Sol: Required number of permutations
Required number of ways = 4.P(5, 4) 10
12,600
= 2880 2.3.4
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 15 : CSIT‐Postal Coaching Solutions
24. Ans: 210 30. Ans: 120
Sol: Required number of binary sequences Sol: The 3 zeros can appear in the sequence in
10 C(10,3) ways. The remaining 7 positions of
210
6.4 the sequence can be filled with ones in only
one way.
25. Ans: 252 Required number of binary sequences
Sol: Required number of outcomes = C(10, 3).1 = 120
10
252
5.5 31. Ans: 35
Sol: Consider a string of 6 ones in a row. There
26. Ans: 2520 are 7 positions among the 6 ones for placing
Sol: Required number of ways the 4 zeros. The 4 zeros can be placed in
10 C(7,4) ways.
3.2.5
= 2520 Required number of binary sequences
= C(7, 4) = C(7, 3)
27. Ans: 2520 = 35
Sol: Required number of ways 32. Ans: 252
= number of ordered partitions Sol: To meet the given condition, we have to
10 choose 5 distinct decimal digits and then
= 2520
3.2.5 arrange them in descending order. We can
choose 5 distinct decimal digits in C(10,5)
28. Ans: 945 ways and we can arrange them in
Sol: Required number of ways = Number of descending order in only one way.
unordered partitions of a set in to 5 subjects Required number of ways = C(10,5).1 = 252
10
of same size
(2.2.2.2.2).5 33. Ans: 2n(n–1)
= 945 Sol: We have 2n persons.
Number of handshakes possible with 2n
29. Ans: 600 persons = C(2n,2)
Sol: We can select 4 men in C(5, 4) ways. Those If each person shakes hands with only
4 men can be paired with 4 women in his/her spouse, then number of handshakes
P(5, 4) ways. possible
Number of possible selections =n
= C(5, 4). P(5, 4) Required number of handshakes
= 5. (120) = 600 = C(2n, 2) – n = 2n(n –1)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 16 : Discrete Mathematics
34. Ans: 1092 38. Ans: 455
Sol: In a chess board, we have 9 horizontal lines Sol: To meet the given condition, let us put
and 9 vertical lines. A rectangle can be 1 ball in each box, The remaining 12 balls
formed with any two horizontal lines and we can distribute in V(4,12) ways.
any two vertical lines. Required number of ways = V(4,12).1
Number of rectangles possible = C(15,12) = C(15,3) = 455
= C(9,2). C(9,2) = (36)(36) = 1296
Number of squares in a chess board 39. Ans: 3003
= 12 + 22 + 32 +….+ 82 = 204 Sol: The number of solutions to the inequality is
Every square is also a rectangle. same as the number or solutions to the
Required number of rectangles which are equation
not squares = 1296 – 204 = 1092 x1 + x2 + x3 + x4 + x5 + x6 = 10
Where x6 0
35. Ans: 84 The required number of solutions = V(6,10)
Sol: Between H and R, we have 9 letters. We = C(15,10) = C(15,5) = 3003
can choose 3 letters in C(9, 3) ways and
then arrange them between H and R in 40. Ans: 10
alphabetical order in only one way. Sol: Let x1 = y1 + 3, x2 = y2 – 2, x3 = y3 + 4
Required number of letter strings = C(9,3).1 The given equation becomes
= 84 y1 + y2 + y3 = 3
Number of solutions to this equation
36. Ans: 210 = V(3, 3)
Sol: We can choose 6 persons in C(10, 6) ways = C(5, 3) = 10
We can distinct 6 similar books among the 6 Required number of solutions = 10
persons in only one ways
Required number of ways 41. Ans: 63
= C(10, 6). 1 Sol: Let X1 = units digit, X2 = tens digit and
= C(10, 4) = 210 X3= hundreds digit
Number of non negative integer solutions to
37. Ans: 1001 the equation
Sol: Required number of ways = V(5,10) X1 + X2 + X3= 10 is
V(n,k) = C(n–1+k, k) V (3, 10) = C (12, 10) = C (12, 2) = 66
V(5,10) = C(14,10) We have to exclude the 3 cases where
= C(14,4) Xi = 10 (i = 1, 2, 3)
= 1001 Required number of integers = 66 – 3 = 63
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 17 : CSIT‐Postal Coaching Solutions
42. Ans: 1001 45. Ans: 10800
Sol: Let x1 = y1 + 2, x2 = y2 + 3, x3 = y3 + 4, Sol: The six symbols can be arranged in 6
x4 = y4 + 5 and x5 = y5 + 6 ways. To meet the given condition,
Let us put 2 blanks between every pair of
Required number of solutions = Number of
symbols.
non negative integer solutions to the
The number of ways we can arrange the
equation remaining two blanks = V(5, 2)
y1 + y2 + y3 + y4 + y5 = 10. = C(5 – 1 +2, 2) = 15
= V(5, 10) = C(5 –1 + 10, 10) Required number of ways = 6 .(15)
= C(14, 10) = (720) .(15) = 10,800
= C(14, 4) = 1001
46. Ans: S1, S2, S5, S6
Sol: Average number of letters received by an
43. Ans: 10
410
Sol: To meet the given conditions, let us put 2 apartment A
50
books on each of the 4 shelves. Now we are
8 .2
left with 2 books to distribute among the 4
Here, A = 9 and A = 8
shelves. Which ever way we distribute the
remaining books, the number of books on By pigeonhole principle, S1 and S2 are
any shelf cannot exceed 4. necessarily true.
Required number of ways = V (4, 2) S5 follows from S1 and S6 follows from S2.
S3 and S4 need not be true.
= C(4 – 1 + 2, 2)
= C (5, 2) = 10
47. Ans: 97
Sol: If we have n pigeon holes, then minimum
44. Ans: (a) number of pigeons required to ensure that
Sol: This is similar to distributing n similar balls atleast (k+1) pigeons belong to same
in k numbered boxes, so that each box pigeonhole = kn + 1
contains atleast one ball. For the present example, n=12 and k+1= 9
If we put 1 ball in each of the k boxes, then Required number of persons = kn + 1
we are left with (n–k) balls to distribute in k = 8(12) +1 = 97
boxes.
Required number of ways = V(k, n – k) 48. Ans: 26
= C(k – 1 + n – k, n – k) Sol: By Pigeonhole principle,
= C(n – 1, k – 1) Required number of balls = kn + 1
= 5(5) + 1 = 26
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 18 : Discrete Mathematics
49. Ans: 39 52. Ans: 7
Sol: The favorable colors to draw 9 balls of same Sol: If we divide a number by 10 the possible
color are green, white and yellow. remainders are 0, 1, 2, …, 9.
We have to include all red balls and all Here, we can apply pigeonhole principle.
green balls in the selection of minimum The 6 pigeonholes are
number of balls. For the favorable colors we
{0}, {5}, {1, 9}, {2, 8}, {3,7}, {4, 6}
can apply pigeonhole principle.
In the first two sets both x + y and x – y are
Required number of balls = 6 + 8 + (kn + 1) divisible by 10. In the remaining sets either
Where k +1 = 9 x + y or x – y divisible by 10.
and n=3 The minimum number of integers we have
6 + 8 + (8 3 + 1) = 39 to choose randomly is 7.
50. Ans: 4
53. Ans: 14
Sol: Suppose x 6,
Sol: Every positive integer ‘n’ can be written as,
Minimum number of balls required = kn +1=16
n = 2k m where ‘m’ is odd and k 0. Let us
where k + 1 = 6 and n = 3.
5(3) + 1 = 16 call m the odd part.
Which is impossible If we treat the odd numbers 1, 3, 5, …, 25 as
x<6 pigeonholes then we have 13 pigeonholes.
Now, minimum number of balls required Every element in S has on odd part and
= x + (kn + 1) = 15 associated with one of the 13 pigeonholes.
x + 5(2) + 1 = 15
54. Ans: 6
x=4
Sol: For the difference to be 5, the possible
combinations are
51. Ans: 7
{1, 6}, {2, 7}, {3, 8}, {4, 9}, {5, 0}
Sol: For sum to be 9, the possible 2-element
subsets are{0,9}, {1, 8},{2, 7},{3, 6},{4, 5}
If we treat them as pigeonholes, then we
If we treat these subsets as pigeon holes,
then any subset of S with 6 elements can have 5 pigeonholes.
have at least one of these subsets. By pigeonhole principle, if we choose any 6
Since we need two such subsets, the integers in S, then the difference of the two
required value of k = 7. integers is 5.
an 2 5 n
n 0
a12 = 31,250
74. Ans: (d)
72. Ans: (a) Sol: Required generating function
Sol: Replacing n by n+1, the given f(x) = 0 + 0 x + 1 x2 – 2x3 + 3x4 – 4x5 + . . .
relation can be written as = x2 (1 –2x + 3x2 – 4x3 + . . . )
an+1 = 4an + 3(n + 1) 2n+1 = x2(1 + x)–2 (Binomial theorem)
(E – 4) an = 6 (n +1) 2n ……….(1)
The characteristic equation is
75. Ans: (c)
t–4=0t=4
Sol: The generating function is
complementary function = C14n
f(x) = 1 + 0.x + 1.x2 + 0.x3 + 1.x4+ …….
Let particular solution is
n
= 1 + (x2) + (x2)2 + …….
an = 2 (cn +d) where c and d are
= (1 – x2)–1
undetermined coefficients.
Substituting in the given recurrence relation,
we have 76. Ans: (a)
2n (c n + d) – 4 2n–1 {c(n –1)+d} = 3n2n Sol: (x4 + 2x5 + 3x6 + 4x7 +..…)5
(c n +d) –2{c(n–1)+d} = 3n = x20 (1 + 2x + 3x2 + 4x3 +…..)5
Equating coefficients of n and constants on = x20. [(1 – x)–2]5
both sides, we get = x20 [1 – x]–10
c = –3 and d = –6
x 20 Cn 9, n x n
Particular solution = 2n (–3n – 6) n 0
1 x7
3
(G) 3
x
3
1 x
02. Ans: 19
= x3 (1 – 3x7 + 3x14 – x21) (1 – x)–3 Sol: By sum of degrees of regions theorem, if
= x3 – 3x10 + 3x17 – x24) degree of each vertex is k, then
n 1n 2 x n kV 2E
n 0 2
4 V 2(38)
coefficient of x 15
1314 3 6.7
V = 19
2 2
= 91 – 63 = 28 03. Ans: (c)
Sol: If degree of each vertex is k,
kV 2E
k V 2 (12)
24
V ( k = 1,2,3,4)
k
V = 24 or 12 or 8 or 6
only option (c) is possible.
If E
n 1n 2 , then G is connected.
28. Ans: 8
2
Sol: By sum of degrees theorem, then G may or may not be connected.
(5 + 2 + 2 + 2 + 2 + 1) = 2 |E|
|E| = 7 32. Ans: (d)
Sol: The given graph is a complete graph K6,
Number of edges in G = 7
with 6 vertices of odd degree.
|E(G)| + |E( G )| = |E(K6)| G is not traversable
7 + |E( G )| = C(6, 2)
33. Ans: 3
|E( G )| = 8
Sol: d is the cut vertex of G
vertex connectivity of G = 1
29. Ans: (a) G has no cut edge.
Sol: If n is even, then a bipartite graph with (G) 2 ................. (1)
maximum number of edges is kn/2,n/2 By deleting the edges d – e and d – f, we can
n disconnect G.
Matching number of G =
2 Edge connectivity = (G) = 2
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 28 : Discrete Mathematics
34. Ans: 105 c is a cut vertex of the graph G.
Sol: If G is a simple graph with n vertices and k vertex connectivity of G = K(G) = 1
components then E
n k n k 1 G has no cut edge.
2
Edge connectivity = (G) 2 ….. (1)
Here n = 20 and k = 5
We have, (G) (G) = 2 …… (2)
Maximum number of edges possible
20 5. 20 6 105 From (1) and (2), we have
2 (G) = 2
10 vertices = 9 c g
c c
The number of vertices with odd degree is 0.
d a
S1 and S2 are true
a b d b C is a cut vertex of G.
G G Hamiltonian cycle does not exists.
By deleting the edges {a, c} and {c, e},
Here, G is connected and G is also there exists a Hamiltonian path
connected. a–b–c–d–e
S3: Suppose G is not connected
Let G1 and G2 are two connected 43. Ans: S1, S3 & S4
components of G. Sol: The graph G can be labeled as
Let vG1 e d
n 1 n 1 c
deg(v) (G )
2 2
a b
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 30 : Discrete Mathematics
The number of vertices with odd degree = 2 46. Ans: 33
Euler path exists but Euler circuit does Sol: If G has K components, then
not exist. |E|=|V|–K
There exists a cycle passing through all the 26 = | V | – 7
vertices of G. | V | = 33
a – b – c – d – e – a is the Hamiltonian cycle
47. Ans: (b)
of G.
Sol: A 2-regular graph G has a perfect matching
The Hamiltonian path is a – b – c – d – e
iff every component of G is an even cycle.
S2 and S4 are true.
44. Ans: S1 & S2
Sol: The number of vertices with odd degree = 0 S1 need not be true. For example the
complete graph K2 has a perfect matching
S1 and S2 are true.
but K2 has no cycle.
To construct Hamiltonian cycle, we have to
S3 need not be true. For example G can have
delete two edges at each of the vertices a
two components where each component is
and f. Then, we are left with 4 edges and 6
K2.
vertices.
G has neither Hamiltonian cycle nor 48. Ans: 21
Hamiltonian path. Sol: In a simple graph with n vertices and K
components,
45. Ans: (b) n k n k 1
|E|>
Sol: S1 is false. We can prove it by giving a 2
counter example. Required minimum number of edges
Consider the graph G shown below
n k n k 1 21
a 2
d
Where n = 10 and k = 4
c
b e 49. Ans: (d)
‘e’ is a cut vertex of G. But, G has no cut Sol: G has exactly two vertices of odd degree.
edge Therefore, Euler path exists in G but Euler
S2 is false. We can prove it by giving a circuit does not exist.
counter example. In Hamiltonian cycle, degree of each vertex
For the graph K2 shown below, is 2. So, we have to delete 2 edges at vertex
‘d’ and one edge at each of the vertices ‘a’
a b
and ‘g’. Then we are left with 8 vertices and
The edge {a, b} is a cut edge. But K2 has no 6 edges. Therefore, neither Hamilton cycle
cut vertex. exists nor Hamiltonian path exists.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 31 : CSIT‐Postal Coaching Solutions
50. Ans: (b) 52. Ans: (a)
Sol: G has cycles of odd length Sol: Vertex connectivity of G = k(G) (G)
Chromatic number of (G) 3
G = (G) 3 ……(1) By sum of degrees theorem
For the vertices c and h we can use same
3| V | 2 | E |
color C1
| E | 15
The remaining vertices from a cycle of
Minimum number of edges necessary = 15
length 6.
A cycle of even length require only two
colors for its vertex coloring.
For vertices a, d and f we can apply same 4. Set Theory
color C2
For the vertices {b, e, g} we can use same
01. Ans: (c)
color C3
Sol: (a) A (A B) = A (Absorption law)
(G) = 3
A perfect matching of the graph is Option (a) is false
a–b, c – d, e –f, g – h (b) A (AB) = A (Absorption law)
Matching number = 4 Option (b) is false
Hence, chromatic number of G (c) (AB) (A B )
+ Matching number of G = 3 + 4 = 7 = A (B B ) Distribution law
=A
51. Ans: (c) Option (c) is true
Sol: S1 need not be true. Consider the graph
02. Ans: (b)
Sol: If S = {} then
(a) P(S) S = {}
Here, we have 6 vertices with degree 2,
option (a) is false
but the graph is not connected.
(b) P(S) P(S) = {, {}}
S2 need not be true. For the graph given
Option (b) is true
above, Euler circuit does not exist, because
(c) If S = {a, b} then
it is not a connected graph.
P(S) S =
A simple graph G with n vertices is option (c) is false
n 1 (d) false
necessarily connected if (G) .
2 Refer option (b)
S3 is true.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 32 : Discrete Mathematics
03. Ans: (a) 05. Ans: (c)
Sol: Given that Sol: Let xX
ABS Case 1: If x is even number then it can
The venn-diagram is shown here appear in two ways i.e., either x A – B
Here, each element of S can appear in 3 or x B – A
ways Case 2: If x is odd number then it can
i.e., x A or x (B – A) or x (S – B) appear in two ways i.e., xA B or
In all 3 cases, A B S.
x A B
By product rule, the 6 elements of S can
By product rule, required number of
appear in 36 ways.
6
subsets = 2100
Required number of ordered pairs = 3 =
729
06. Ans: (c)
Sol: If A B = (AB)C
04. Ans: (a, c & d)
Sol:
Then A B =
A I II III B But (AB) A B = U
V
IV VI (AssB) = U
VII
Where U is universal set
C
1 3
18. Ans: 26
Sol: If A is set with n elements, then number of
n n 1 4
asymmetric relations possible on A 3 2
We see that from vertex 1, we have paths to
The only relation which is symmetric and vertices 2, 3, 4 and 1.
asymmetric is the empty relation on A. From vertex 2, we have paths to vertices 1,
n n 1
Required number of relations 3 2
1 2, 3 and 4.
Where n = 3 From vertex 3, we have path to vertex 4.
3
= 3 –1 = 26 Transitive closure of R = {(1, 1), (1, 2),
(1, 3), (1, 4), (2,1), (2,1), (2,3), (2,4), (3, 4)}.
19. Ans: (c)
Sol: If R is antisymmetric, then (R R–1) A. 22. Ans: 392
Any subset of diagonal relation is Sol: Number of relations on A which are
symmetric, antisymmetric and transitive. symmetric or reflexive
But, (R R–1) is not asymmetric, because n n 1 n n 1
relation. Where n = 3
= 26 + 26 – 23 = 120
20. Ans: (c) Required number of relations
2n – 120 where n = 3
2
Sol: The equivalence class of 1 = [1] = {1, 2, 3}
[2] = {1, 2, 3} = 512 – 120 = 392
[3] = {1, 2, 3}
[4] = {4, 6} 23. Ans: (c)
[5] = {5} Sol: For a, b, A
[6] = {4, 6} Let aRb
The partition of A with respect to R = set of aRb and bRb ( R is reflexive)
all distinct equivalence classes of the bR a (By definition of R)
elements of A R is symmetric
= {{1, 2, 3}, {4, 6}, {5}} For any three elements a, b, c A
2 3
32. Ans: (d)
1 Sol: The greatest lower bound of c and d does not
In the poset, for every pair of elements lub
exist in the poset.
and glb exist
The poset is not a lattice.
The poset is a lattice.
1 f is 1 – 1
The elements 1 and 12 are complement of Let f(x, y) = (u, v)
each other. (2x – y, x – 2y) = (u, v)
The elements 3 and 4 are complements of
2x – y = u and x – 2y = v
each other.
2u v u 2y
For the elements 2 and 6 complements do x and y
3 3
not exist.
If u and v are any two real numbers, then
36. Ans: (b) 2u v u 2 v
R , RxR
Sol: If x y then x y = y and x y = x 3 3
only option (b) is true f is onto
Hence, f is a bijection.
37. Ans: (d)
Sol: we have f(1) = f(2) = 50
f is not one-to-one 40. Ans: (b)
In the co-domain, the integers 1, 2, 3...... 49 Sol: Let G = set of all odd integers.
are not mapped by any integers of the G is closed with respect to multiplication.
domain. Multiplication of odd integers is associative.
f is not on-to 1 is identity element of G with respect to
multiplication.
38. Ans: (b)
Sol: Inverse of a functions exists iff f is a G is a monoid w.r.t multiplication.
bijection. G is not a group w.r.t multiplication. For
Here, f is not a bijection 1
example, inverse of 3 =
for example f(1) = f(2) = a 3
f is not 1 – 1 1
g is a bijection But G.
3
g–1 exists.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 39 : CSIT‐Postal Coaching Solutions
41. Ans: (a) 45. Ans: (b)
Sol: The identity element of the group (P(S), *) Sol: Let 'e' be the identity element of Z w.r.t. *
is . Now, a*e=a
a+e+1=a
Inverse of A = A A P(S)
e = –1
Because, (A*A) = A P(S)
Let x be the inverse of –5
Inverse of {1} = {1} –5 * x = e
–5 + x + 1 = –1
42. Ans: 54 x=3
Sol: Number of generators = (81), where is
Euler function. 46. Ans: (d)
Sol: Let a, b, c are any 3 integers.
3 1
81 54 3a . 3b = 3a+b G a, b, Z
3
Multiplication is a closed operation on G.
The elements of G are relational numbers
43. Ans: (a)
and multiplication of rational numbers is
Sol: Any group with 4 elements is abelian.
associative.
The rows and columns of the table are
we have, 1 = 30 G and
identical
3a . 30 = 3a aZ
First row is a b c d
Identity element exists.
and second row is b d a c
In the composition table of a group, in each If n Z then –n Z.
row and each column the entries are distinct. For each element 3n G we have 3–n G
The entry in the third row and third such that
column is c. 3n . 3–n = 30
Hence, the fourth column is d Each element of G has inverse in G.
c Further, multiplication of rational numbers is
b commutative.
a G is an abelian group w.r.t multiplication
3
1 ........
05. Ans: 0.83 range 0.83 to 0.84
3
2 2 2 3
Sol: A BC = A (AC BC)
C 1 1
P(A B ) = P(A) + P(A B ) = + C C 1 1 1
. = 0.14285
2 3 8 1 7
1
5 8
= = 0.83
6
1 1 15
1 x 3 =1– =
32 32 16
= x3(1 – 3x6 + 3x12 – x18) (1 – x)–3
x 3 3x 9 3x15 x 21
n 1n 2 . x n
15
16 30
n 0 2 Required probability = = = 0.9677
10
Coefficient of x = 36 – 3(3) = 27 31 31
27 32
Required probability 0.125
216
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 43 : CSIT‐Postal Coaching Solutions
15. Ans: 0.333 (range 0.33 to 0.34) 18. Ans: 2525
Sol: Let A = one of the face is 4 Sol: Given that, E(X) = 50 and = 5
and B = The faces are different numbers
2 = E(X2) – {E(X)}2
Number of cases favourable to AB
E(X2) = {E(X)}2 + 2
= n(A B) = 10
= 2500 + 25 = 2525
Number of cases favourable to B
= n(B) = 30
19. Ans: (c)
Required probability = P(A|B)
Sol: Let X be the number of heads in first 3
PA B n A B 10 1 throws. X has the following probability
PB n B 30 3 distribution.
b 8 1
2 10 x . dx
Thus the mode of X is . 2 6
b
= 280
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 44 : Discrete Mathematics
21. Ans: 0.416 (range 0.41 to 0.42) 24. Ans: 209
1 1 Sol: E(2X+ 1)2 = (2X+1)2. P(X)
P X
3 2
Sol: Required probability = {2(–3)+1}2
1
+ {2(6) + 1}2
1
1 2 6 2
P X
3 3
1
1 + {2(9)+1}2.
2 3
2x dx
1
5
= 209
36 5
3
2
1 12 25. Ans: 0.22 (range 0.21 to 0.23)
3
2x dx 3 x
1
Sol: P(X 30) e 20 dx
3
30
= e–1.5 = 0.22
22. Ans: 0.4285 range 0.42 to 0.43
Sol: P(j dots turning up) j
P(j dots turning up) = kj where k is 26. Ans: 0.035 range 0.034 to 0.036
proportionality constant Sol: Probability of getting 2 heads, in first 9
P(S) = P(1) + P(2) + ....... + P(6) = 1 1
9
1 1 x dx 0 1 x dx
0 1
= Probability of destroying the target
x2
0
x2
1
= 1 – P(X < 2)
= x x = 3
2 1 2 0 n 1
1 n
g(x) is not a probability density function. 2
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 45 : CSIT‐Postal Coaching Solutions
we have to find the positive integer n such Required probability = P(X 2)
that = 1 – P (X < 2)
n 1 = 1 – {P(X = 0) + P(X = 1)}
1 n 0.9
2 = 1 – (e– + e–)
n 1 1 1
1 0.99 1 log e 3 0.3005
2n 3 3
2n
n 1 30. Ans: (c)
100
Sol: Average number of errors per page
2n (100n + 100)
390
By trial method, 211 100(1 + 11) = 0.75
520
Hence, the required number of bombs = 11.
Expected number of errors in a random
sample of 5 pages = 5 (0.75)
28. Ans: (b)
= 3.75
Sol: For Poisson distribution, standard deviation
Let X = Number of errors in a sample of 5
2 pages.
=4 X has poisson distribution with parameter
e . k
= 3.75.
P(X = K) K 0,1, 2,....
K e .k
– –4 P( X k ) (k 0,1, 2...)
P(X = 1) = e = 4e k
P(X 1) = 1 –P(X < 1) Required probability = P(X=0) = e– = e–3.75
= 1 – P(X = 0) = 1 – e– = 1 – e–4
Required probability = P(X = 1) | (X 1) 31. Ans: 0.2615 range 0.25 to 0.27
k(x x ) dx 1
2
0
42. Ans: Mean = 34, Median = 35,
x 2 1 x 3 1
Modes = 35, 36 & SD = 4.14 k 1
2 0 3 0
xi
Sol: Mean = = 34
n 1 1
k 1
Median is the middle most value of the data 2 3
by keeping the data points in increasing 3 2
k =1k=6
order or decreasing order. 6
1
Mode = 36
xf (x) dx 6(x x 3 ) dx
2
Mean =
S.D = 4.14 0
1
x x 3 4
1 1 1
= 6 6
43. Ans: 1.095 3 4 0 3 4 2
Median is that value ‘a’ for which
x . PX k
5
Sol: = Mean = k a
1 1
k 1
P( X a ) = 6(x x ) dx
2
Note: If A is n n matrix, k k k
n–1
then |adj A| = |A| k k k k 1 k k = 72
2 2 2
k2 k2 k2 k 1
02. Ans: 625
C2 (C2 – C1), C3 C3 – C1
Sol: If A is n × n matrix,
k 0 0
then |adj (adj A)| | A |n 1
2
k k 1
2
0 = 72
|A| = – 5 k 2
0 k 1
|adj (adj A)| = (–5)4 = 625
k(k+1) = 72u
k=8
03. Ans: (b)
Sol: Here determinant of A = –8
1
–1adj A 07. Ans: (or) 0.5
A = 2
|A|
1 1 1
1
c= (cofactor of the element 6 in A) Sol: Given that = 1 1 sin 1
8
1 1 1 cos
1 2 3
=
8
. 131
0 4
= –1
R2 – R1, R3 – R1
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 50 : Discrete Mathematics
1 1 1 10. Ans: (c)
= 0 sin 1 Sol: Number of 2×2 determinants possible with
0 0 cos each ,entry as 0 or 1 = 24 = 16.
= sin . cos a b
sin 2 Let =
= c d
2
If > 0 then a = d = 1 and atleast one of the
1
maximum value of = entries b or c is 0.
2 The determinants whose value is +ve
08. Ans: 0 are
Sol: Given that 1 0 1 1 1 0
, and
cos x x 1 0 1 0 1 1 1
f(x) = 2 sin x x2 2x 3
Required probability =
tan x x x 16
R2 R
applying and 3 11. Ans: 1
x x
Sol: If the vectors are linearly dependent, then
cos x x 1 1 t 0 0
f x 2 sin x
= x 2 1 1 t 0 0
x2 x
tan x 1 1 1 t
1 1
x (1 – t)3 = 0
1 0 1 t=1
f x
Lt = 2 0 2 =0
x 0 x 2
1 1 1 12. Ans: 1
Sol: If the vectors are linearly independent, then
09. Ans: (c) 1 1 0 1
Sol: In a symmetric matrix, the diagonal 1 0 0 1
0
elements are zero and aij = –aji for i j. 1 1 0 t
Each element above the principal diagonal, 0 0 1 0
we can choose in 3 ways (0, 1, –1). Expanding by third column
Number of elements above the principal 1 1 1
n n 1 (–1) 1 0 1 0
diagonal =
2 1 1 t
By product rule,
Required number of skew symmetric (–1). (1 –(t–1)–1) 0
n n 1 t1
matrices = 3 2
. 13. Ans: (c)
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 51 : CSIT‐Postal Coaching Solutions
1 2 5 1 2 5 1 1 0 0 0
0 1 1 0 0
Sol: 2 4 a 4 ~ 0 0 a 6
1 2 a 1 0 0 a 6 A ~ 0 0 1 1 0
0 1 0 0 1
0 0 0 1 1
1 2 5
= 0 0 0 if a = –6 and Rank = 1 R4 R4 + R2
0 0 0 1 1
0
0 1 1
0 0
0 0
If a –6 then Rank of the matrix is 2 A~ 0 0 1 1 0
Option (c) is correct. 0 0 1 0 1
0 0 0 1 1
log a 1
= –1
log a 1
log a –1 = –log a – 1
log a = 0
a=1
cos x sin x 1 x 1
= Lt
x sin x cos 2 x
2
= Lt
x 0 x 1 x 1
1
(by L' Hospital's Rule) = = f(0)
2
= –2
f(x) is continuous at x = 0
sin 2 x
05. Ans: (c) (D) Lt f x Lt
x 0 x 0 1 cos x
Sol: y = Lt tan x (1 form)
tan 2 x
x
2 sin x. cos x
4 = Lt
x 0 sin x
log y = Lt log tan x
tan 2 x
x
= 2 f(0)
4
f(x) is not continuous at x = 0
Lt (tan 2x ). log(tan x )
x
4
07. Ans: (a)
log tan x
= Lt Sol: Lt f x Lt f x f 2 = 3
cot 2 x
x 2 x2
x
4
The above function is continuous at x = 2
cot x. sec 2 x
= Lt 1, x 2
2 cos ec 2 x but f (x) =
2
x
4
1, x 2
= –1 Lt f x 1 and Lt f x 1
x 2 x2
y = e–1
i.e. f(x) is not differentiable at x = 2
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 60 : Discrete Mathematics
08. Ans: (d) 10. Ans: (c)
| x 3 | | 2 | Sol: f1(x) = 2ax, x 1
Sol: f(1+) = Lt
x 1 x 1 = 2x + a, x > 1
x 32 Since, f(x) is differentiable at x = 1
= Lt = –1
x 1 x 1 f1(1–) = f(1+)
x 2 3x 13 2a = a + 2 a = 2
2
f(1–) = Lt 4 2 4 Since, f(x) is continuous at x = 1
x 1 x 1 f(1–) = f(1+)
=
1
Lt
x 1x 5 = –1 a+1=1+a+bb=0
4 x 1 x 1
11. Ans: (c)
f is continuous and differentiable at x = 1
Sol: (a) Let f(x) = (x–2) in [1, 3]
| x 3 | 0
f(3+) = Lt =1 Here, f(1) f(3)
x3 x 3
Roll's theorem is not applicable
x 3 (b) Let f(x) = 1 – (1 – x)–1 in [0, 2]
f(3–) = Lt = –1
x3 x 3 Here, f(x) is not continuous in [0, 2]
f is not differentiable at x = 3 Roll's theorem is not applicable
However, Lt f ( x ) Lt | x 3 | 0 f (3) (c) Let f(x) = sin x in [0, ]
x3 x3
Here, f(x) is continuous in [0, ] and
f is continuous at x = 3 differentiable in (0, ).
Further, f(0) = f()
09. Ans: (a) Roll's theorem is applicable
Sol: If f(x) is continuous at x = 0, then (d) Let f(x) = Tan x in [0, 2]
Lt f ( x ) f (0) Here, f(x) is not continuous in [0, 2]
x 0
1
Roll's theorem is not applicable
1 x x
Lt = f(0)
x0 1 x
12. Ans: 0.236
1 x 1x Sol: f(x) = x(x – 1) (x – 2)
Lt 1
= f(0) We have,
x 0
1 x x f (c) = 3c2 – 6c + 2, a = 0 and b = 1/2
e 1 Substituting in the given relation, we get
f(0) 12c2 – 24c + 5 = 0
e
c = 1.764 (or) 0.236
f(0) = e–2 We have to choose c = 0.236, since it only
lies between 0 and 1/2.
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 61 : CSIT‐Postal Coaching Solutions
13. Ans: 1.732 16. Ans: (b)
Sol: By Cauchy's mean value theorem b
Sol: f(x) = ax +
f d f (3) f (1) x
gd g(3) g(1) b
f (x) = a –
x2
3 1 2b
–d = f (x) =
1 1 x3
3 b
f (x) = 0 x =
d= 3 a
b
At x = , f (x) > 0
14. Ans: 8 a
Sol: f(x) = 2x3 – 3x2 – 12x + 1
b
f1(x) = 6x2 – 6x – 12 f(x) has minimum at x =
a
f1(x) = 0 x = –1, 2 This is the only extremum (minimum in the
f11(x) = 12x – 6
interval (0, )).
f11(–1) = – 18, f11(2) = 18
b
f(x) has maximum at x = –1 The least value of f(x) occurs at x =
a
The maximum value of f(x) at x = –1
= f(–1) = 8
17. Ans: (c)
Further, At the end points of the given
x sin t
interval Sol: f(x) = 0 t
dt
5 33
f(–2) = –3 and f sin x
2 2 f (x) =
x
The greatest value of f(x) = 8
f (x) = 0 x = n (n = 1, 2, 3..........)
x cos x sin x
15. Ans: (c) f (x) =
x2
x3
Sol: f(x) = sin x – x +
f (n) =
1
cos n =
1 0 n
3
n n
f (x) = cos x – 1 + x2
f (n) > 0 if n is even
f (x) = – sin x+ 2x
and f (n) < 0 if n is odd
f(x) = – cos x + 2
f(x) has maximum at x = n where n
f (0) = 0, f(0) = 0 and f (0) = 1 0
is odd
f(x) has neither maximum nor minimum
Further f(x) has minimum at x = n where
at x = 0
n is even
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 62 : Discrete Mathematics
18. Ans: (c)
f(a+ b –x) = f x
Sol: Let g(x) = 3x4 + 8x3 – 18x2 + 60 2
g1(x) = 12x3 + 24x2 – 36x 4
sin x
=
g1(x) = 0 x = –3, 0, 1 sin x cos 4 x
4
5
g11(x) = 36x2 + 48x – 36
12
Let I = f ( x ) dx
g11(0) = –36 < 0
12
g(x) has a maximum at x = 0 5
cos 4 x
12
= dx
f(x) has a minimum at x = 0
cos 4 x sin 4 x
12
g11(–3) > 0 g(x) has a minimum at x = –3 again
5
f(x) has a maximum at x = –3 I= f (a b x ) dx
12
11
g (1) > 0 g(x) has a minimum at x = 1 12
5
x dx
10
Sol: Sol: The region bounded by the curves is shown
4
below
4 x dx 5 x dx ........ 9 x dx
5 6 10
=
5 6 10
= 4
4 dx 5 dx ........
5 9
9 dx
= 4 + 5 +......+ 9 y=x+1 y = cos x
= 39
x sin x dx = k
2
Sol: 28. Ans: (a)
0
2 Sol: Put x = sin t so that dx = cos t dt
x sin x dx x sin x dx = k
0
t varies from 0 to /2.
x cos x sin x x cos x sin x 2 k
0
/2
– [–3] = k Given integral = 0
sin 4 t cos 4 t dt
k=4
3.1 3.1 . 3
.
26. Ans: (a) 8.6.4.2 2 256
Sol: Put x = 2 Sec t
dx = 2 Sec t tan t dt
29. Ans: 25.12
x=2t=0
4
x=4 t Sol: Volume =
0
y 2 dx
3
4
1
Given integral 3 sin 2 t cos t dt =
0
x dx = 8 cubic units
4 0
1
12
sin t 03
3 3
32
ACE Engineering Publications Hyderabad|Delhi|Bhopal|Pune|Bhubaneswar| Lucknow|Patna|Bengaluru|Chennai|Vijayawada|Vizag |Tirupati | Kukatpally| Kolkata
: 64 : Discrete Mathematics
30. Ans: (d) 33. Ans: (a)
3
dy
2
1 x
x 1
3
Sol: Length = 0
1 dx
dx
Sol:
1
2
dx at x =1
3
1 x
= 1 x dx Let f x
0
x 12
3
2 3
f x as x 1
= 1 x 2
0
3
1
14 Choose g x
= x 12
3
f x 1 x 2
Lt Lt x 1 2
31. Ans: (b)
x 1 gx x 1 x 12
3 3
1 1
2
Sol: xe x dx 1 x 12 x 1 1
Let f x xe x
2
1 1
2 0
f x xe x f x
2
3
dx 1 x3 1
= 2 Lt 2 Let f(x) =
x 0 0 x 2x
1 f x an x 2
(since is not defined)
x2 f x x3 1
Lt Lt 2 x 9 finite
1
1 x 2 gx x 2
2x
= 2
x 0 2 2
1
gx
2
2 t 2 convergent
= 2{(–1) – (–)} 1 1 2x 1