Chapter-wise Suggestion Paper

M201

Mathematics

EXACT EQUATION AND INTEGRATION FACTOR

1. Solve the following equation

i)
ii)
2. Show that the equation is exact and its particular

om
solution when x = 0, y = 1 is
3. Show that is an integrating factor of the equation and
hence solve the equation. t.c
LINEAR AND BERNOULLIs EQUATION

1. Solve the following equation

i)
bu

ii)
iii) , given that y = 2 when x = 0
yw

iv) Reduce the equation to a linear equation and

hence solve it.
v) , given that when
m

ODE of 1st Order and Higher Degree

1. Solve the following equations and find the singular solution

a)
b)
c)
2. Reduce the following equations into Claurauts Form and hence obtain the general solution
a)
b)
D - OPERATOR METHOD SOLUTION

1. Find P.I.
a)
2. Solve the following equations
a)
b)
c) , given that t = 0, x = 0 and =0

METHOD OF VARIATION PARAMETERS

1. Solve the following equation

a)
b)

om
c) , given that are two linearly
independent solution of the corresponding homogenous equations.

CAUCHY EULER EQUATION

t.c
1. Solve the following equation
a)
bu
b)
c) given that when

d)
yw

GRAPH, DI-GRAPH & ITS FUNDAMENTAL

1. A simple graph with n number of vertices and k number of components can have maximum
m

number of edges.

2. Draw a graph; if possible, with the following propertion [Give explanation where the graph is not
possible].

i) Five vertices each of degree 4.

ii) Five vertices each of degree 2.
iii) Simple graph has 7 edges, 9 vertices each of degree at least 1.
iv) Simple graph, six vertices having degree 5, 5, 4, 2, 2, 2.
v) Simple graph, six vertices having degree 5, 5, 4, 2, 1, 1.
3. a) Examine whether the following two graphs are isomorphic
 b) Draw the dual of the graph.

om
t.c
4. Determine the adjacency matrix of the following di-graph:
bu
yw
m

MATRIX REPRESENTATION OF GRAPH

1. Find the graph or di-graphs whose adjacency matrices are given below. Find which one of these
are di-connected.
 a)

b)

om
SHORTEST PATH AND DIJKSTRAS ALGORITHM

1. Applying Dijkstras Algorithm, find the shortest path from the vertex v1 to v4 in the following
simple graph:
t.c
bu
yw
m

2. Apply Dijkstras algorithm to determine a shortest path between a to z in the following graph

TREE AND SPANNING TREE

1. Prove that a graph G has a spanning tree if and only if G is connected.

2. Find the minimal spanning tree by Kruskals Algorithm from the following graph G :
 3. Find by Prims algorithm a minimal spanning tree from the following graph

om
t.c
bu
yw

CUT SET & CUT-VERTICES

1. Let T be a tree which has at least three vertices. Prove that there is a cut vertices v of T such that
every vertex adjacent to v1 except for possibly one, has degree 1.
m

2. Prove that a simple graph has no cut vertices if and only if for any two given edges a circuit can
be formed that should contain these two edges.

IMPROPER INTEGRAL

1. Evaluate the improper integral

a) , a, b > 0

b)

c)
LAPLACE TRANSFORMS

1. a) Let F (t) = t, 0<t<

t, < t <2

where F (t) = F (t + 2); find L { F (t) }.

Draw its graph.

b) Find L { F (t) } where

F (t) = t, 0<t<c

2c t, c < t < 2c

2. If F (t) = sint t1, 0 < t <

om
sin 2t, < t1 < 2

sin 3t, t > 2,

Find L {F(t)}
t.c
INVERSE LAPLACE TRANSFORM

1. Using Convolution theorem, verify that

bu
yw

2. Evaluate
m

3. Show that

SOLUTION OF ODE USING LAPLACE TRANSFORM

1. Solve

2. Find the solution of the differential equation