Documente Academic
Documente Profesional
Documente Cultură
M201
Mathematics
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
ii)
iii) , given that y = 2 when x = 0
yw
1. Find P.I.
a)
2. Solve the following equations
a)
b)
c) , given that t = 0, x = 0 and =0
om
c) , given that are two linearly
independent solution of the corresponding homogenous equations.
d)
yw
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].
om
t.c
4. Determine the adjacency matrix of the following di-graph:
bu
yw
m
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
om
t.c
bu
yw
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
b)
c)
LAPLACE TRANSFORMS
F (t) = t, 0<t<c
2c t, c < t < 2c
om
sin 2t, < t1 < 2
Find L {F(t)}
t.c
INVERSE LAPLACE TRANSFORM
2. Evaluate
m
3. Show that
1. Solve