Heritage Institute of Technology

Solution Manual of MATH1201 (2023)

Group-B

Question 2.

(a) It is know that glucose level in blood of diabetic persons follows a nor-
mal distribution model with mean 106mg/100ml and standard deviation
8mg/100ml.
(i) Calculate the probability of a random diabetic person having a glucose
level less than 120mg/100ml.
(ii) What percentage of persons have a glucose level between 90 and
120mg/100ml?

(b) The distance (in kilometers) travelled by a cyclist in a day is a continuous

random variable X whose cumulative distribution function (c.d.f.) is given
by: 
0, x<0






x 3
F (x) =
 216 , 0 ≤ x < 6



1, x≥6


What is the average distance travelled by the cyclist? Further find the
standard deviation of the distance travelled by the cyclist from the average
distance.

1
Answer

(a)
 
X − 106 120 − 106
(i) P (X ≤ 120) = P ≤
8 8
= P (Z ≤ 1.75) = ϕ(1.75) = 0.9599

 
90 − 106 X − 106 120 − 106
(i) P (90 ≤ X ≤ 120) = P ≤ ≤
8 8 8
= P (−2 ≤ Z ≤ 1.75)

= ϕ(1.75) − (1 − ϕ(2))

= 0.9599 − (1 − 0.9772) = 0.9371. (1)

d
(b) The probability density function (p.d.f) of the random variable X is f (x) = dx (F (x)).

 x2 , 0 < x ≤ 6

72
=⇒ f (x) =

0, otherwise
R6 R6 3
Now, E(X) = 0 xf (x)dx = 0 x72 dx = 92
R6 R6 4
E(X 2 ) = 0 x2 f (x)dx = 0 x72 dx = 108
5
9 2
∴ V ar(X) = E(X 2 ) − (E(X))2 = 108


5 − 2 = 1.35
p √
=⇒ S.D = V ar(X) = 1.25 = 1.162.

Question 3.

(a) A random variable X follows a binomial distribution with mean 4 and stan-
√
dard deviation 2. Find the probability of assuming the non-zero values of
the variable.

(b) It is estimated that 50% of emails are spam emails. Some software has
been applied to filter these spam emails before they reach your inbox. Its
accuracy for detecting a spam mail is 99% of the spam emails (a spam email
detected as spam), and the probability for a false positive (a non-spam email
detected as spam) is 5%. Now if an an email is detected as spam, then what
is the probability that it is in fact a non-spam email?

2
Answer

(a) If the random variable X has the binomial distribution with parameter n and p, then
p
its mean is np and standard deviation is np(1 − p).

Therefore, np = 4 and np(1−p) = 2, solving which we get p = 1/2 n = 8. The pmf of X:

P (X = r) =n Cr pr (1 − p)n−r , r = 0, 1, 2, ..., n
1 0
Required probability = P (X ̸= 0) = 1 − P (X = 0) = 1 −8 C0 − 12 )8 = 1 − 1


2 (1 28

(b) A=spam emails

B= non-spam emails
S= spam
1
P (A) = 2 = P (B)
P (E|A) = 0.99, P (E|B) = 0.05
P (B)P (E|B) 1/2×0.05
P (B|E) = P (A)P (E|A)+P (B)P (E|B) = 1/2[0.99+0.05] = 0.048

Group-C

Question 4.

(a) Solve the following system of linear equations by the Gauss-Seidel method,
correct to 3 decimal places.

x + 4y − z = 6

x − y + 5z = 7

6x + y + 5z = 20

√
5
(b) Using Newton-Raphson method evaluate 3 correct upto four decimal places

Answer

(a) Re-arrange the system as

6x + y + 5z = 20

x + 4y − z = 6

x − y + 5z = 7

3
 as
|6| ≥ |1| + |1|; |4| ≥ |1| + |−1|; |5| ≥ |1| + |−1|

Hence the system is diagonally dominant.

xk = (20 − y (k−1) − z (k−1) )/6

y k = (6 − x(k) + z (k−1) )/4

z k = (7 − x(k) + y (k) )/5

k x y z
0 0 0 0
1 3.33333 0.66667 0.86667
2 3.07778 0.94722 0.97389
3 3.01315 0.99019 0.99541
4 3.0024 0.99825 0.99917
4 3.00008 0.99994 0.99997

Therefore
x = 3.000; y = 1.000; z = 1.000

correct to 3 decimal places.

√
(b) Let x = 5
3 or x5 − 3 = 0.
Now, let f (x) = x5 − 3, then f (1) = −2 < 0 & f (2) = 29 > 0; let’s take x0 = 1.

(5 − 1)x5n + 3 4x5 + 3
xn+1 = 4
= n4 .
5xn 5xn

x1 = 1.4; x2 = 1.276; x3 = 1.2471; x4 = 1.2457; x5 = 1.24573

√
5
x= 3 is 1.2457 correct upto 4 decimal places.

4
Question 5.

(a) Solve the following system of equations by Gauss-elimination method:

2x + 8y + 2z = 14

x + 6y − z = 13

2x − y + 2z = 5

dy
(b) Using Runge-Kutta method of fourth order, find y(1.4) for dx = 3x+y 2 , y(1) =
1 by taking h = 0.2.

Answer
 
2 8 2
 
(a) A = 1 6 −1
 
 
2 −1 2
Now the augmented matrix is given by
 
2 8 2 14
 
6 −1 13 
 
 1
 
2 −1 2 5

     
2 8 2 14 R2 −1/2R1 2 8 2 11 2 8 2 14
  −−−−−→   R −9/2R  
 3 2 
6 −1 13 R −R 0 2 −2 −−−− −→ 0 2 −2 6
   
1 6
 3 1 
−−−−−→
   
2 −1 2 5 0 9 9 −9 0 0 −9 18

Therefore, the solution is given by

z = −2, y = 1, x = 5

(b) y ′ = 3x + y 2 , y(1) = 1, h = 0.2, y(1.4) =?

k1 = hf (x0 , y0 ) = 0.2f (1, 1) = 0.8

h k1
k2 = hf (x0 + , y0 + ) = 1.052
2 2
h k2
k3 = hf (x0 + , y0 + ) = 1.1257
2 2
k4 = hf (x0 + h, y0 + k3 ) = 1.6238

5
 So y1 = y0 + 16 (k1 + 2k2 + 2k3 + k4 ) = 2.1299 = y(1.2).
Again

k1 = hf (x1 , y1 ) = 1.6273
h k1
k2 = hf (x1 + , y1 + ) = 2.5123
2 2
h k2
k3 = hf (x1 + , y1 + ) = 3.0734
2 2
k4 = hf (x1 + h, y1 + k3 ) = 6.2548

Hence y2 = y1 + 16 (k1 + 2k2 + 2k3 + k4 ) = 5.3056 = y(1.4).

Group-D

Question 6.

(a) A non-digraph G has 6 vertices each of degree 3 and remaining vertices have
degree less than 3. Find the minimum number of vertices G may have.

(b) Find the minimal spanning tree and its weight by Kruskal’s algorithm for
the following graph:

6
Answer

(a) Wrong question.

Correct question is: A non-digraph G has 6 vertices each of degree 3 and re-
maining vertices have degree less than 3. Given that there are 12 edges in
the graph, find the minimum number of vertices G may have.

Answer: Let the graph has n vertices, say v1 , v2 , ..., vn .

Let d(v1 ) = d(v2 ) = ... = d(v6 ) = 3 and rest vertices v7 , v8 , ..., vn . have degrees less than
3. Also, given that number of edges e = 12.
Therefore, ni=1 d(vi ) = 2e = 2 × 12 = 24.
P

Again, ni=1 d(vi ) = d(v1 ) + d(v2 ) + ... + d(v6 ) + d(v7 ) + ... + d(vn ) < 3 × 6 + 3(n − 6).
P

From the above two equations, we have 24 < 18 + 3n − 18, or 24 < 3n, or n > 8.
Thus, the graph has minimum 8 + 1 = 9 vertices.

(b) Count the number of vertices in the graph. The graph has 6 vertices, so the spanning
tree of this graph will contain 5 edges.
Step 1 : Discard the self-loops and parallel edges having higher weight and keep the
edges among them which have the smallest weight.

Step 2 : List the edges in a sequence of increasing weight as follows:

Edges: ab ad bc dc af ae fe ac be de df
Weight: 1 1 2 2 3 3 3 4 4 4 5

Step 3 : Select the edge bearing the smallest weight, i.e. ab.

7
Step 4 : Select the edge bearing the next smallest weight, i.e. ad.

Step 5 : Select the next edge bearing the next smallest weight, i.e. bc.

Step 6 : Next edge bearing the smallest weight is dc, but it will not be selected as it
creates a cycle. So, next we select the edge af .

8
 Step 7 : The next smallest weight edge is ae.

Now since this tree has 5 edges, so we stop our search technique, as this is the desired
minimal spanning tree with weight 1 + 1 + 2 + 3 + 3 = 10.

Question 7.

(a) If a simple graph has n vertices and 24 edges, find all possible values of n.

(b) Construct the graph whose incidence matrix is given as

e1 e2 e3 e4 e5
 
v1 1 0 0 1 1
 
v2  1 1 0 0 0
 
 
 
v3  0 1 1 0 0
 
v4 0 0 1 1 1

(c) Let T be a tree with 32 edges. Removal of one edge from T , two disjoint
trees T1 and T2 are obtained. If number of vertices of T1 is twice the number
of edges in T2 , find the number of edges in T1 and T2 .

Answer

(a) Let k be the degree of every vertex.

48
∴ Sum of the degrees of all vertices = nk. ∴ nk = 2 × 24 =⇒ n = k .
n(n−1)
Now, the maximum number of edges in a simple graph is 2 .

9
 n(n−1)
∴ 2 ≥ 24 =⇒ n(n − 1) ≥ 48 ———————————–(1).
If k = 1 =⇒ n = 48, then (1) is satisfied.
If k = 2 =⇒ n = 24, then (1) is satisfied.
If k = 3 =⇒ n = 16, then (1) is satisfied.
If k = 4 =⇒ n = 12, then (1) is satisfied.
If k = 5 =⇒ n ∈
/ Z.
If k = 6 =⇒ n = 8, then (1) is satisfied.
If k = 7 =⇒ n ∈
/ Z.
If k = 8 =⇒ n = 6, which does not satisfy (1).
∴ The possible values of n are 48, 24, 16, 12, 8.

(b) The graph of the incidence matrix is as follows:

(c) Wrong question.

The correct question is: Let T be a tree with 32 edges. On removal of one edge
from T , two disjoint trees T1 and T2 are obtained. If number of vertices of
T1 is twice the number of vertices in T2 , find the number of edges in T1 and T2 .

Answer: The number of edges in T = 32, so the number of vertices in T = 32 + 1 = 33.

Let n1 and n2 denote the number of vertices in T1 and T2 , then according to the ques-
tion, n1 = 2n2 .
Since n1 + n2 = 33, therefore 2n2 + n2 = 33 =⇒ n2 = 11, hence n1 = 22.
As we know that the number of edges in a tree is one less than the number of vertices

10
 in the tree, therefore, the number of edges in T1 and T2 is 21 and 10, respectively.

Group-E

Question 8.

d2 y dy
(a) Using Laplace transform solve the differential equation dt2
+ dt = sin 2t,
y(0) = 0, y ′ (0) = 1.
R1 dx
(b) Evaluate the integral 0 (1−x6 ) 16 .

Answer

(a) Taking Laplace transform both sides we get:

L{y ′′ (t)} + L{y ′ (t)} = L{sin 2t}
=⇒ s2 Y (s) − sy(0) − y ′ (0) + sY (s) − y(0) = 2
s2 +4
2
=⇒ s2 Y (s) − 1 + sY (s) = s2 +4
2 s2 +6
=⇒ s(s + 1)Y (s) = s2 +4
+1= s2 +4
s2 +6
=⇒ Y (s) = s(s+1)(s2 +4)
—————————————————- (1)
s2 +6
The partial fraction of s(s+1)(s2 +4)
is given by:
s2 +6 A B Cs+D
s(s+1)(s2 +4)
= s + s+1 + s2 +4

Equating the numerartors:

(s + 1)(s2 + 4)A + s(s2 + 4)B + (ss + s)(Cs + D) = s2 + 6
3
Putting s = 0 =⇒ 4A = 6 =⇒ A = 2

Putting s = −1 =⇒ −5B = 7 =⇒ B = − 75
1
Equating coefficients of s3 on both sides we get C = − 10 .
Equating coefficients of s2 on both sides we get D = − 25 .
Taking inverse Laplace both sides of (1) and using the partial fractions we get:
L−1 {Y (s)} = 32 L−1 { 1s } − 75 L−1 { s+1
1
}− 1 −1 s
10 L { s2 +4 } − 2 −1 2
10 L { s2 +4 }

=⇒ y(t) = 3
2 − 75 e−t − 1
10 cos 2t − 15 sin 2t.
1
(b) Putting the substitution, x6 = t =⇒ x = t 6
=⇒ 6x5 dx = dt

11
 dt dt
=⇒ dx = 6x5
= 5
6t 6

1
1 1
Z Z
dx dt
∴ 1 =
0 (1 − x6 ) 6 6 0 (1 − t) 16 t 56
1 1 −5
Z
1
= t 6 (1 − t)− 6 dt
6 0
1 1 − 1 −1
Z
5
= t 6 (1 − t)− 6 −1 dt
6 0
 
1 5
=B ,
6 6
1 Γ 16 Γ 65



=
6 Γ 16 + 65

1 Γ 16 Γ 65



=
6 Γ (1)
   
1 1
=Γ Γ 1−
6 6
1 π
=
6 sin π6
1 π
= 2π = .
6 3
(2)

Question 9.

t − 1,

1<t<2
(a) Express the function f (t) = in terms of unit step func-
3 − t,

2<t<3
tion, and hence find L{f (t)}.

(b) Evaluate L−1 { (s−4)

4s+5
2 (s+3) }.

(c) Find L{et sin t cos t}.

Answer

(a) The given function can be expressed as

f (t) = (t − 1){H(t − 1) − H(t − 2)} + (3 − t){H(t − 2) − H(t − 3)}.

12
 We have L{t} = 1
s2
and L{f (t − a)H(t − a)} = e−as F (s).

L{f (t)} = L{(t − 1){H(t − 1) − H(t − 2)}} + L{(3 − t){H(t − 2) − H(t − 3)}}

= L{(t − 1)H(t − 1)} − L{(t − 2 + 1)H(t − 2)} − L{(t − 2 − 1)H(t − 2)}

+ L{(t − 3)H(t − 3)}

= e−s L{t} − 2e−2s L{t} + e−3s L{t}

e−s 2e−2s e−3s
= − + 2
s2 s2 s
1 −s
= 2 (e − 2e−2s + e−3s ).
s

(b)
4s + 5 A B C
2
= + 2
+
(s − 4) (s + 3) s − 4 (s − 4) (s + 3)
A(s − 4)(s + 3) + B(s + 3) + C(s − 4)2
=
(s − 4)2 (s + 3)
∴ 4s + 5 = A(s − 4)(s + 3) + B(s + 3) + C(s − 4)2
Putting s = 4, we get, 7B = 21 =⇒ B = 3
Putting s = −3, we get, 49C = −7 =⇒ C = − 17
Equating the coefficients of s2 we get A + C = 0 =⇒ A = 17 .
4s+5 1 1 3 1 1
∴ (s−4)2 (s+3)
= 7 s−4 + (s−4)2
− 7 s+3

=⇒ L−1 { (s−4)
4s+5 1 −1
2 (s+3) } = 7 L
1
{ s−4 } + 3L−1 { (s−4)
1 1 −1
2 } − 7L
1
{ s+3 }
e4t e−3t
=⇒ L−1 { (s−4)
4s+5
2 (s+3) } = 7 + 3te4t − 7 .

(c) Let, f (t) = sin t cos t.

1
L{sin t cos t} = L{2 sin t cos t}
2
1
= L{sin 2t}
2
1 2
=
2 s2 + 4
1
= 2 = F (s)
s +4
We know that, L{et f (t)} = F (s − 1) (First shifting property)
1 1
=⇒ L{et sin t cos t} = (s−1)2 +4
= s2 −2s+5
.

13
 Heritage Institute of Technology

Solution Manual of MATH1201 (2022)

Group-B

Question 2.

(a) A random variable X has the following probability mass function:

x 0 1 2 3 4 5 6

P (X = x) k 3k 5k 7k 9k 11k 13k
(i) Find the value of k.
(ii) Obtain the distribution function F (x).
(iii) Find P (3 < x ≤ 5).

(b) Suppose that while answering a question in a multiple choice test, the prob-
ability that an examinee knows the answer is p and the probability that
he guesses the answer is 1 − p. Assuming that the probability of answering
1
question correctly is unity for an examinee who knows the answer and m
for the examinee who guesses, where m is the number of multiple choice
alternatives. Compute the probability that an examinee knows the answer
to a question, given that he has correctly answered it.

Answer
P
(a) (i) From the properties probability mass function we know that P (X = x) = 1
=⇒ k + 3k + 5k + 7k + 9k + 11k + 13k = 1
=⇒ 49k = 1
1
=⇒ k = 49
1
Obviously, P (X = x) ≥ 0 ∀x and k = 49

(ii) The distribution function F (x) of random variable X is given below

1
 


0, −∞ < x < 0
1, 0≤x<1



 49
4




 49 , 1≤x<2
9, 2≤x<0

49
F (x) = 16


 49 , 3≤x<4
 25



 49 , 4≤x<5
 36



 49 , 5≤x<6

1, x≥6
9 11 20
(iii) P (3 < x ≤ 5) = P (X = 4) + P (X = 5) = 49 + 49 = 49

(b) Let E1 ≡ examine knows the answer

E2 ≡ examine guess the answer
E3 ≡ examine answer correctly

1
P (E1 ) = p, P (E2 ) = 1 − p, P (A/E1 ) = 1, P (A/E2 ) = m
Required probability,

P (E1 )P (A/E1 )
P (E1 /A) =
P (E1 )P (A/E1 ) + P (E2 )P (A/E2 )
p mp
= 1 = 1 + (m − 1)p
p + (1 − p) m

Question 3.

(a) Suppose the temperature during May is normally distributed with mean
temperature 68◦ and standard deviation 6◦ . Find the probability that the
temperature during May is
(i) between 70◦ and 80◦
(ii) less than 60◦

(b) A community is concerned about its power supply for the coming winter.
There are three major sources of power supply, namely electricity, gas and
oil. The probabilities of shortages of electricity, gas and oil are estimated
to be 0.155, 0.1 and 0.2 respectively. Furthermore, assume that if there is
a shortage in the oil supply, the probability of an electrical power shortage
will be doubled. The shortage of gas may be assumed to be independent of
shortages of oil and electricity.

2
Answer
X−68
(a) z = 6 ∼ N (0, 1)

70 − 68 X − 68 80 − 68
(i) P (70◦ < X < 80◦ ) = P ( < < )
6 6 6
X − 68
= (0.33 < Z < 2.00), z = ∼ N (0, 1)
6
= 0.3479

X − 68 60 − 68
(ii) P (x ≤ 60) = P ( < ) = P (Z < −1.33)
6 6
= P (z ≥ 1.33) = 1 − ϕ(1.33) = 0.0918

(b) E = shortage of electricity

G = shortage of gas
O = shortage of oil

P(E) = 0.15, P(G) = 0.1, P(O) = 0.2, P(E/O) = 2P(E) = 0.30

P(EOG) = P(EO)P(G) = P(E/O)P(O)P(G) = 0.006

P(G+E) = P(G) + P(E) - P(GE) = P(G) + P(E) - P(G)P(E) = 0.235

P (EOG) 0.006
P(GO/E) = P (E) = 0.15 = 0.04

Group-C

Question 4.

(a) Find a positive real root of the equation x + ln x − 2 = 0, using bisection

method correct to two significant figures.

(b) Solve the following system of linear equations by matrix inversion method

x+y+z =9
2x − 3y + 4z = 13
3x + 4y + 5z = 40

3
Answer
(a) Let f (x) = x + ln x − 2. Now f (1) = −1 < 0 and f (2) = 0.69 > 0, so root lies between
[1, 2].

a+b
n a f (a) b f (b) x= 2 f (x)

1 1 -1 2 0.69 1.5 -0.09

2 1.5 -0.09 2 0.69 1.75 0.31

3 1.5 -0.09 1.75 0.31 1.625 0.11

4 1.5 -0.09 1.625 0.11 1.562 0.008

5 1.5 -0.09 1.562 0.008 1.531 -0.043

6 1.531 -0.043 1.562 0.008 1.5465 -0.017

Hence a root of the given equation by bisection method is 1.5 correct up to two signif-
icant figures.
 
1 1 1
 
(b) Let A = 2
 
 −3 4

 
3 4 5
Now,
   
1 1 1 1 0 0 ′
2 =R2 −2R1
1 1 0 0
1 1
 R−
 −−−−→
  
[A|I] = 2 −3 4 0 1 0 ′
  
 R3 =R3 −3R1
0 −5 2 −2 1 0
 −−−−−→
  
  
3 4 5 0 0 1 0 1 1 −3 0 1
 
1 0 7/5 3/5
1/5 0
R2′ =− 15 R2 
 
−−−−−→ 0

 1 −2/5 2/5 −1/5 0
 
0 1 2 −3 0 1
 
1 0 7/51/5 0 3/5
R1′ =R1 −R2 
−−−−−→  


R3′ =R3 −R2 
0 1 −2/5 2/5 −1/5 0
−−−−−→ 


0 0 12/5 −17/5 1/5 1

4
  
1 0 7/5 3/5 1/5 0
′
R1 =(5/12)R3 
 
−−−−−→ 0

 1 −2/5 2/5 −1/5 0

 
0 0 1 −17/12 1/12 5/12
 
R1′ =R1 − 75 R3 
1 0 0 31/12 1/12 −7/12
−−−−−→  


0
R2′ =R2 + 52 R3 
1 0 −1/6 −1/6 1/6

−−−−−→  
0 0 1 −17/12 1/12 5/12
 
 31/12 1/12 −7/12
 
Thus A−1 =  −1/6 −1/6 .
 
 1/6 

 
−17/12 1/12 5/12
      
x  31/12 1/12 −7/12  9  1
      
Now y  = A−1 b =  −1/6 −1/6  13 = 3. Hence x = 1, y =
      
   1/6    
      
z −17/12 1/12 5/12 40 5
3, z = 5.
Question 5.
(a) Find a root of the equation x sin x + cos x = 0, using Regula-Falsi method
correct upto 4 significant figures.

(b) Find the value of y(0.2) using Runge-Kutta method of fourth order with
dy 1
h = 0.1 given that dx = x+y , y(0) = 1.
Answer
(a) Let f (x) = x sin x + cos x. Now f (2) = 1.4024 > 0 and f (3) = −0.5666 < 0, so root lies
between [2, 3].

Hence a root of the given equation by Regula-Falsi method is 2.798 correct up to four
significant figures.
1
(b) Here f (x, y) = x+y , x0 = 0 and y0 = 1. Now

k1 = hf (x0 , y0 ) = 0.1f (0, 1) = 0.1

h k1
k2 = hf (x0 + , y0 + ) = 0.1f (0.05, 1.05) = 0.09091
2 2
h k2
k3 = hf (x0 + , y0 + ) = 0.1f (0.05, 1.04545) = 0.090129
2 2
k4 = hf (x0 + h, y0 + k3 ) = 0.1f (0.1, 1.09129) = 0.08394

5
 af (b)−bf (a)
n a f (a) b f (b) x= f (b)−f (a) f (x)

1 2 1.4024 3 -0.5666 2.7122 0.2198

2 2.7122 0.2198 3 -0.5666 2.7927 0.015

3 2.7927 0.2198 3 -0.5666 2.7981 0.0009

4 2.7981 0.0009 3 -0.5666 2.7984 0.0001

So y1 = y(0.1) = y0 + 61 (k1 + 2k2 + 2k3 + k4 ) = 1.09139.

Again

k1 = hf (x1 , y1 ) = 0.08393
h k1
k2 = hf (x1 + , y1 + ) = 0.1f (0.15, 1.13337) = 0.07792
2 2
h k2
k3 = hf (x1 + , y1 + ) = 0.1f (0.15, 1.13036) = 0.07810
2 2
k4 = hf (x1 + h, y1 + k3 ) = 0.1f (0.2, 1.16950) = 0.07302

Hence y2 = y(0.2) = y1 + 16 (k1 + 2k2 + 2k3 + k4 ) = 1.1696.

Group-D

Question 6.

(a) Show that there is no simple graph with 12 vertices and 28 edges in which
(i) the degree of each vertex is either 3 or 4.
(ii) the degree of each vertex is either 3 or 6.

(b) Using Dijkstra’s Algorithm find the shortest path and the length of the
shortest path between vertices A and D in the following graph.

6
Answer
(a) (i) Suppose there is a graph having p vertices each of degree 3. If each of the remaining
vertices are of degree 4, then the sum of the degrees of all the vertices of the graph is
3p + 4 × (12 − p) = 2 × 28
∴ p = 48 − 56 = −8 which is absurd. (ii) If each of the remaining vertices are of degree
6. then the sum of the degrees of all the vertices of the graph is 3p + 6 × (12 − p). By
the first theorem of Graph Theory, we have
3p + 6 × (12 − p) = 2 × 28
=⇒ p = 16 3 which is absurd as well.
hence, there is no simple graoh with 12 vertices and 28 edges satisfying conditions (i)
or (ii).

(b) The algorithm is given as:

A B C D E F G

0 ∞ ∞ ∞ ∞ ∞ ∞

× 1 3 ∞ ∞ ∞ ∞

× × 2 ∞ ∞ ∞ ∞

∞ ∞ 8 5 ∞ ∞ 3

× × × 15 5 ∞ ×

× × × 7 × 7 ×

Length along the shortest path is 7.

Shortest path A → B → C → E → D

Question 7.
n(n+1)
(a) Using graph theory, prove that 1 + 2 + 3 + ....n = 2

(b) Find by Prim’s algorithm a minimal spanning tree for the following graph:

7
 (c) Does there exist
 a simple
 graph with the given adjacency matrix? Justify

0 3 2
 
your answer. 3
 
 0 1
 
2 1 1

Answer

(a) Consider the complete graph with (n+1) vertices. Since it is complete, it has (n+1) C2 =
n(n+1)
2 edges. Suppose the vertices are labelled as 1, 2, 3, ....n + 1. There are n edges
joining vertex 1 with the remining n − 1 vertices other than vertex 1. Delete these
edges. There are n − 2 edges joining vertex 3 with the remaining n − 2 vertices other
than vertex 1 and 2. Delete these edges. Continue in this manner so that ultimately
n + (n − 1) + (n − 2) + (n − 3) + .... + 2 + 1 edges are deleted. These are clearly all the
edges of the graph.
Therefore, 1 + 2 + 3 + ....n = n(n+1)
2

(b) The given graph has 5 vertices so a minimal spanning tree has 4 edges.
Step- 1 The tabulated form of the weights of its edges are given below:
 
− 4 3 3 3 
 
4 − 2 ∞ 3 
 
 
 
 3 2 − 3 ∞
 
 
 
3 ∞ 3 − 2 
 
 
3 3 ∞ 2 −
Step- 2 Starting from v1 , the smallest entries in v1 row is either v3 or v4 or v5 . We
choose any one of them, say v3 to get

8
 Step- 3 Smallest entry in rows v1 and v3 is 2 which corresponds to v2 . We get

Step- 4 Smallest entry in rows v1 , v2 and v3 is 3 so we choose v4 and get

Step- 5 Smallest entry in rows v1 , v2 , v3 and v4 is 2 so we choose v5 and get

This is the required minimal spanning tree. Weight of this minimal spanning tree is
2 + 3 + 3 + 2 = 10

(c) No, there is loop present at v3 , hence a simple graph does not with the given adjacency
matrix.

9
 Group-D
Question 8.
(a) Using Laplace transform solve the following initial value problem.
d2 y dy
2
− 6 + 9y = t2 e3t , y(0) = 2, y ′ (0) = 6.
dt dt
R∞
(b) Find the Laplace transform of sint at . Hence show that 0 sint t dt = π
2
Answer
d2 y
(a) dt2
− 6 dy
dt + 9y = t e
2 3t

y ′′ (t) − 6y ′ (t) + 9y(t) = t2 e3t

Taking Laplace Transform on both sides, we obtain
L{y ′′ (t)} − 6L{y ′ (t)} + 9L{y(t)} = t2 e3t ,
s2 Y (s) − sy(0) − y ′ (0) − 6{sY (s) − y(0)} + 9Y (s) = 2
(s−3)3
2
∴ (s2 − 6s + 9)Y (s) − 2s − 6 + 12 = (s−3)3
2
∴ (s − 3)2 Y (s) = 2(s − 3) + (s−3)3
2 2
∴ Y (s) = s−3 + (s−3)5

L−1 {Y (s)} = L−1 { s−3

2
} + L−1 { (s−3)
2
5}

1 −1 4!
y(t) = 2e3t + 12 L { (s−3)5 }
1 4 −3t
y(t) = 2e3t + 12 t e
∞
(b) L sint at = s s2 +aa

R
2 ds
∞
= ss tan−1 as s = π2 − tan−1 as = cot−1 (s/a).
 

R∞
L sint at = 0 sint at e−st dt = cot−1 (s/2)
Put a = 1, s → 0.
R∞
∴ 0 sint t dt = π/2.
Question 9.
(a) Express the function F (t) = e−t , 0 < t < 2, = 0, t ≥ 2 in terms of unit step
function. Hence find L{F (t)}.
(b) Evaluate L−1 { s2 (s+1)
1
2} .

Answer
(a) F (t)e−t + (0 − e−t )H(t − 2)
∴ L(F (t)) = L(e−t ) − L(e−t H(t − 2))
= 1
s+1 − e−2s L(e−t H(t − 2)
= 1
s+1 − e−2s e−2 L(e−t )
1 e−2(s+1)
= s+1 − s+1

10
(b) We have L−1 { s12 } = t, L−1 { (s+1)
1
2 = te
−t }

R t −u
L−1 { s2 (s+1)
1
2 } = 0 ue (t − u)du
Rt
= 0 (ut − u2 )e−u du
= [(ut − u2 )(−e−u ) − (t − 2u)e−u + (−2)(−e−u )]t0
= te−t + 2e−t + t − 2
Check: L{te−t + 2e−t + t − 2}
1 2 1 2 s2 +2s2 (s+1)+(s+1)2 −2s(s+1)2 1
= (s+1)2
+ s+1 + s2
− s = s2 (s+1)2
= s2 (s+1)2 .

11
 Heritage Institute of Technology
Solution Manual of MATH1201 (2021)
Group-B
Question 2.
(a) Two bags contain 5 white, 3 black balls and 10 white, 3 black balls respectively. Two
balls are transferred at random from first bag to second bag and then a ball is drawn
at random from latter. The ball so drawn is found to be white in colour. Find the
probability that the transferred balls were both white.
(b) Suppose that an airplane engine will fail, when in flight, with probability 1 − p indepen-
dently from engine to engine; suppose that the airplane will make a successful flight if
at least 50 percent of its engines remain operative. For what values of p is a four-engine
plane preferable to a two-engine plane?
Answer
(a) Let A1 be the event of drawing 2 white balls, A2 be the event of drawing 2 black balls and A3 be
the event of drawing 1 black and 1 white balls.
Let X be the event of drawing a white ball from the second urn after the transfer.
5C
10
∴ P (A1 ) = 8 C2
2
= 28
3C
3
P (A2 ) = 8C
2
2
= 28 and
5C 3C
15
P (A3 ) = 1
8C= 28
2
1
.
We know, X = (X ∩ A1 ) ∪ (X ∩ A2 ) ∪ (X ∩ A3 ).
∴ P (X) = (X ∩ A1 ) + (X ∩ A2 ) + (X ∩ A3 ) = P (A1 )(X|A1 ) + P (A2 )(X|A2 ) + P (A3 )(X|A3 ).
12 C
Now, P (X|A1 ) = 15 C1
1
= 45 ,
10 C
2
P (X|A2 ) = 15 C
1
1
=
3 and
11 C
11
P (X|A3 ) = = 15
15 C
1
1
.
10 4 3
Hence, P (X) = 28 × 5 + 28 × 23 + 2815 11
× 15 = 21 28 .
10
P (A1 ∩X) P (A1 )P (X|A1 ) × 45 8
∴ P (A1 |X) = P (X) = P (X) = 21 = 21
28
28

(b) According to the problem statement the probability that one engine will be operative during the
flight is p. One four-engine plane will make a successful flight if 2 engine remain operative and One
two-engine plane will make a successful flight if 1 engine remain operative. Hence, one will prefer
a four-engine plane than a two-engine plane if

4
C2 p2 (1 − p)2 + 4 C3 p3 (1 − p) + 4 C4 p4 ≥ 2 C1 p(1 − p) + 2 C2 p2
=⇒ 6p2 (1 − p)2 + 4p3 (1 − p) + p4 ≥ 2p(1 − p) + p2
=⇒ 6p(1 − p)2 + 4p2 (1 − p) + p3 ≥ 2(1 − p) + p
=⇒ (p − 1)2 (3p − 2) ≥ 0
2
=⇒ p ≥ .
3

1
Question 3.

(a) A bowl contains 10 chips of which 8 are marked Rs.200 each and 2 are marked Rs.500
each. Let a person draw 3 chips at random from the bowl without replacement. If the
person is to receive the sum of resulting amounts marked on the drawn chips, find his
expectation.

(b) Assuming that the height distribution of a group is normally, find the mean and
standard deviation if 84% of the men have heights less than 65.2 inches and 68% have
heights lying between 62.8 and 65.2 inches.

Answer

(a) After 3 drawings the person may have the following combination of chips
200, 200, 200 200, 200, 500 200, 500, 500.
Let X be the random variable of the sum of amounts marked on the chips drawn by the person.
Hence, the spectrum of the random variable is {600, 900, 1200}.
8
Now, P (X = 600) = Probability of drawing three chips marked as Rs.200 = 10CC33 = 15
7
.
P (X = 900) = Probability of drawing two chips marked as Rs.200 and one chips marked as Rs.500
8 2
= C102CC3 1 = 15
7
.
P (X = 1200) = Probability of drawing one chips marked as Rs.200 and two chips marked as Rs.500
8 2
= C101CC3 2 = 15
1
.
7 7 1
Hence, E(X) = 600 × 15 + 900 × 15 + 1200 × 15 = 780.

(b) Let X ∼ N (µ, σ)

∴ Z = X−µ
σ ∼ N (0, 1).
Given that
84
P (X < 65.2) =
100
X −µ 65.2 − µ
=⇒ P (< < ) = 0.84
σ σ
 65.2 − µ 
=⇒ Φ = 0.84.
σ
and
68
P (62.8 < X < 65.2) =
100
62.8 − µ X −µ 65.2 − µ
=⇒ P ( << < ) = 0.68
σ σ σ
 65.2 − µ   62.8 − µ 
=⇒ Φ −Φ = 0.68
σ σ
 62.8 − µ 
=⇒ Φ = 0.16
σ

Hence, from standard normal table we have 65.2−µ

σ = 0.9 and 62.8−µ
σ = −0.9.
4
Solving these equations we get µ = 64 and σ = 3 .

2
 Group-C

Question 4.

(a) Solve the following system of equations by the Gauss-Seidel iteration method, correct
to 3 significant figures.

6x + 15y + 2z = 72
x + y + 54z = 110
27x + 6y − z = 85

(b) Find the iterative formula for finding √1 where N is a real number, using Newton-
N
Raphson formula. Hence find √1 , correct upto 4 places of decimals.
14

Answer

(a) Since the given system is not diagonally dominant, so we re-arrange the system to make it diagonally
dominant as

27x + 6y − z = 85
6x + 15y + 2z = 72
x + y + 54z = 110

such that |27| ≥ |6| + |−1|; |15| ≥ |6| + |2|; |54| ≥ |1| + |1| holds.
Now the Gauss- Seidel iterative formula is given by

xk+1 = (85 − 6y (k) + z (k) )/27

y k+1 = (72 − 6x(k+1) − 2z (k) )/15
z k+1 = (110 − x(k+1) − y (k+1) )/54

n x y z

1 3.148 3.541 1.913

2 2.432 3.572 1.926

3 2.426 3.573 1.926

4 2.425 3.573 1.926

Hence, x = 2.42; y = 3.57; z = 1.93 corrected to 3 significant figures.

(b) Let x = √1 or x2 − 1
=0
N N

Let f (x) = x2 − N1
Then f ′ (x) = 2x
Now the Newton-Raphson Formula is given by
 
f (xn ) 1 1
xn+1 = xn − ′ = xn +
f (xn ) 2 N xn

3
 Here N = 14, Let x0 = √1 = 0.25
16
   
1 1 1 1
x1 = x0 + = 0.25 + = 0.2678
2 14x0 2 14 × 0.25
 
1 1
x2 = x1 + = 0.267261
2 14x1
 
1 1
x3 = x2 + = 0.267261
2 14x2
1
∴ √ = 0.2673,
14

Question 5.

(a) The current i in an electric circuit is given by i = 10e−t sin(2πt) , where t is in seconds.
Using Regula-Falsi method, find the minimum value of t correct to four decimal places
for i= 2amp.
dy √
(b) Use modified Euler’s method to find y(0.4), for dx = x + | y|, y(0) = 1, by taking h = 0.2.

Answer

(a) Let f (t) = 10e−t sin(2πt) − 2. Now f (0) = −2 < 0 and f ( 41 ) = f (0.25) = 5.788 > 0, so the vaue of
t lies between [0, 0.25].

af (b)−bf (a)
n a b x= f (b)−f (a) f (x)

1 0 0.25 0.0642 1.6813

2 0 0.0642 0.0349 0.0995

3 0 0.0349 0.0332 0.0048

4 0 0.0332 0.0331 0.0002

5 0 0.0331 0.0331

Hence a root of the given equation by Regula-Falsi method is 0.0331.

√
(b) Here f (x, y) = x + | y|, x0 = 0 , y0 = 1 and h = 0.2.
(0)
y1 = y0 + hf (x0 , y0 ) = 1 + 0.2f (0, 1) = 1.2, from Euiler’s formula
Now by modified Euler’s Formula,

(1) h
y1 = y0 + [f (x0 , y0 ) + f (x1 , y1 (0))] = 1.2295
2
(2) h
y1 = y0 + [f (0, 1) + f (0.2, 1.2295)] = 1 + 0.2(1.1544) = 1.2309
2
(3) h
y1 = y0 + [f (0, 1) + f (0, 2), 1.2309)] = 1.2309
2

4
 (0)
Again, y2 = y1 + hf (x1 , y1 ) = 1.2309 + 0.2f = 1.4927, from Euiler’s formula
Now by modified Euler’s Formula,

(1) hh 
(0)
i
y2 = y1 + f (x1 y1 ) + f x2 , y2 = 1.5240
2
(2) hh 
(1)
i
y2 = y1 + f (x1 y1 ) + f x2 , y2 = 1.5253
2
(3) hh 
(3)
i
y2 = y1 + f (x1 y1 ) + f x2 , y2 = 1.5253
2

Hence y(0.4) = 1.5253

Group-D

Question 6.
n(n+1)
(a) Prove that the number of pendant vertices in a binary tree is 2 , where n is the
number of vertices in the tree.

(b) By Dijkstra’s algorithm find the shortest path and the length of the shortest path from
vertex v2 and v5 in the following graph:

Figure 1: Caption

Answer

(a) Let x be the number of pendant vertices.

Then there are (n − 1 − x) non-pendant vertices of degree 3 are vertex of degree 2.
Therefore, 1.x + (n − 1 − x).3 + 2 = 2(n − 1)
or, x + 3n − 3 − 3x + 2 = 2n − 2
or, −2x = −n − 1
or, x = n+1
2 .

(b) We construct the following table:

5
 v1 v2 v3 v4 v5 v6 v7

Step-I ∞ 0 ∞ ∞ ∞ ∞ ∞

Step-II 1 × 7 ∞ ∞ ∞ ∞

Step-III × × 4 ∞ ∞ 4 5

Step-IV × × × 12 ∞ 4 5

Step-V × × × 12 11 × 5

Step-VI × × × 8 7 × ×

Step-VI × × × 8 × × ×

Step-VII × × × × × × ×

The shortest path is v5 → v7 → v1 → v2 .

Weight of the shortest path is 2 + 4 + 1 = 7

Question 7.

(a) If G be a bipartite graph with 22 vertices with partite sets P and Q where |P | = 12
and if every vertex of P has degree 3, while every vertex of Q has degree either 2 or
4, then how many vertices of G has degree 2?

(b) Does there exist a simple graph corresponding to following incidence matrix? Justify
your answer.
 
1 0 1 0
 
 
0 0 1 1
I(G) = 
 

 
1 1 0 0
 
 
0 0 0 1

Answer

(a) Here, |P | = 12, therefore, |Q| = 22 − 12 = 10

Let pi ∈ P and qi ∈ Q
By
P12Handshaking P10theorem,
i=1 d(p i ) + j=1 d(pj ) = 2e ........(1)
Since
P12 every vertex in P is of degree 3, so
i=1 d(pi ) = 3 × 12 = 36, which is the total number of edges in the graph.
Now, let Q has x vertices of degree 2 and (10 − x) vertices of degree 4.
Again by Handshaking theorem,
3 ∈ 12 + x ∈ 2 + (10 − x) ∈ 4 = 2 ∈ 36
36 + 2x + 40 − 4x = 72
x = 2. Therefore G has 2 vertices of degree 2.

6
  
1 0 1 0
 
 
0 0 1 1
(b) The incidence matrix is: I(G) = 
 

 
1 1 0 0
 
 
0 0 0 1
No, there does not exist any simple graph corresponding to the given incidence matrix.
Because in an incidence matrix, every column has to contain two 1’s, as every edge is incident with
exactly two vertices. But in the given matrix, the edge e2 is only incident to the vertex v3 . That
means e2 is a self-loop incident to v3 . Since, self-loop cannot be taken into consideration, we cannot
have a simple graph here.

Group-E

Question 8.
R∞ sin3 t sin3 t
(a) Evaluate 0 t dt by finding the Laplace Transform of F (t) = t .

R∞ 1√

(b) Show that 0 (1+x) x
dx = π

Answer
3
(a) Let sin3 t = 4 sin t − 14 sin 3t
3 1
Therefore, L{sin3 t} = L{sin t} − L{sin 3t}
4 4
3 1 1 3
= −
4 s2 + 1 4 s2 + 9
(1)
3 R∞ 3 1  
Now, L{ sint t } = s 1 3 3 −1 s − 1 tan−1 s ]∞
4 s2 +1 − 4 s2 +9 ds = [ 4 tan 4 3 s
= 34 − 14 π2 − 34 tan−1 s + 41 tan−1 3s

= π4 − 34 tan−1 s + 41 tan−1 3s

R∞
We know that, L{F (t)} = 0 F (t)e−st dt
3 R∞ 3
Therefore,L{ sint t } = 0 sint t e−st dt
R∞ 3 3
Taking limit s → 0 in above, we get 0 sint t dt = lim s → 0L{ sint t }
= lim s → 0 π4 − 43 tan−1 s + 14 tan−1 3s = Π4


R∞ 3
Hence, 0 sint t dt = Π4

R∞ 1 
(b) Let, I = 0 √
(1+x) x
dx
R ∞ x− 12
= 0 (1+x) dx
Comparing the above integration with Beta function,
R∞ xm−1
β(m, n) = 0 (1+x) m+n dx

We get, m = 21 , n = 21 .

Γ( 1 )Γ( 1 ) √ √
π π
Therefore, β 12 , 12 = 2Γ(1) 2 = 1 = π.
R∞ 1 
Hence, 0 (1+x) x
√ dx = π.

7
Question 9.
1
(a) Find the inverse Laplace Transform of (s2 +2s+5)2
by convolution Theorem.
π
π pπ

tanp θdθ =
R
(b) Show that 2
0 2 sec 2 where − 1 < p < 1.

Answer
     
(a) L−1 1
s2 +2s+5
= L−1 1
(s+1)2 +4
= e−t L−1 1
s2 +4
= 21 e−t sin 2t = F (t), (say).
Using, Convolution theorem,
L−1 1
= (F ∗ F )(t)
s2 +2s+5
Rt Rt
= 0 F (t − u)F (u)du = 14 0 e−(t−u) sin 2(t − u)e−u sin 2udu
Rt
= 14 e−t 0 12 (cos 2(t − 2u) − cos2t) du
= 81 e−t [ sin 2(t−2u)
−4 − u sin 2t]t0
= 18 e−t 14 sin 2t − t sin 2t + 14 sin 2t


1 −t
= 16 e (1 − 2t) sin 2t

π
tanp θdθ
R 2
(b) Let, I = 0
π
sinp θ cos−p θdθ
R 2
= 0
 
−p+1
= 12 β p+1
2 , 2

1 Γ(
p+1
)Γ( −p+1 )
= 2
2 2
Γ(1)
p+1
Since, −1 < p < 1 therefore, 0 < 2 < 1 or 0 < α < 1.

Therefore,
p+1
I = 12 Γ(α)Γ(1 − α), whereα = 2

1 π


= 2 sin απ

1 π
= 2 sin( p+1 )π
2

π 1
= 2 cos ( pπ )
2
π pπ

= 2 sec 2

Therefore,
R π2 p π pπ

0 tan θdθ = 2 sec 2