Q.

1(a) Prove by mathematical induction :

1 1 1 n
1.3 + 3.5 + (2n – 1) (2n + 1) = (2n + 1) for n  1
(3 Marks)
Ans. :
1 1 1
Given, + + .... +
1.3 3.5 (2n – 1) (2n + 1)
n
= for n  1
(2n + 1)
Step 1 : Put n = 1
1
LHS =
3
1
RHS =
3
LHS = RHS
∴ It is true for n = 1
Step 2 : Assume that it is true for n = K
1 1 1 k
+ +........ + = ...(1)
1.3 3.5 (2k – 1) (2k + 1) (2k + 1)
Step 3 : Prove that it is true for n = k + 1
Put n = k + 1
1 1 1
= + + ..... +
1.3 3.5 (2(k + 1) – 1) (2(k + 1)+ 1)
1 1 1
= + + .... +
1.3 3.5 (2k – 1) (2k + 1)
1
+
(2(k + 1) – 1) (2(k + 1) + 1)
From (1)
k 1
= +
2k + 1 (2k + 2 – 1) (2k + 2 + 1)
2
k 2k + 3k + 1
= +
2k + 1 (2k + 1) (2k + 3)
2
k(2k + 3) + 1 2k + 3k + 1
= =
(2k + 1) (2k + 3) (2k + 1) (2k + 3)
(2k + 1) (k + 1) k+1
= =
(2k + 1) (2k + 1) 2k + 3
k k+1
= + ...Hence proved
2k + 1 2(k + 1) + 1

Q. 1(b) Define the following with examples :

(i) Uncountable infinite set
(ii) Countable infinite set (3 Marks)
Ans. :
(i) Uncountable infinite set : A set which is not countably infinite, is called as uncountable infinite set.
Ex. : Set R of all positive real numbers less than 1 that can be represented by decimal of the form 0.
(ii) Countable infinite set : An infinite set which is countable is called as countable infinite set.
+
Ex. : Set of positive integer Z .

Q. 1(c) If R = { (a, b), (b, a), (b, c), (c,d),(d,a) }

be a relation on the set A = {a, b, c, d }. Find the transitive closer of R using Warshall’s algorithm.
(6 Marks)
Ans. :
R = {(a, b), (b, a), (b, c), (c, d), (d, a)}
And A = {a, b, c, d}

 
0 1 0 0

MR =
1 0 1 0
=w
0 1
0
0 0

1 0 0 0
For a  (b, a) (a, b) = (b, b)
(d, a) (a, b) = (d, b)

 
0 1 0 0

∴ wa 
1 1 1 0

0 0 0 1

1 1 0 0
For b  (a, b) (b, a) = (a, a)
(a, b) (b, c) = (a, c)

 
1 1 1 0

∴ wb =
1 1 1 0

0 0 0 1

1 1 0 0
For c  (b, c) (c, d) = (b, d)

 
1 1 1 0

∴ wc =
1 1 1 1

0 0 0 1

1 1 0 0
For d  (c, d) (d, a)  (c, a)

 
1 1 1 0

∴ wd =
1 1 1 1

1 0 0 1

1 1 0 0
∴ R* = {(a, a), (a, b), (a, c), (b, a), (b, b),
(b, c), (b, d), (c, a), (c, d), (d, a), (d, b)}

Q. 2(a) Let A= { a, b, c, d} and B = { 1, 2, 3 }

Determine whether the relation R from A to B is a function. Justify. If it is function give the range :
(i) R = [ (a, 1), (b, 2), (c, 1), (d, 2) ]
(ii) R = [ (a, 1), (b, 2), (a, 2), (c, 1), (d, 2) ]
(4 Marks)
Ans. :
A = {a, b, c, d} and B = {1, 2, 3}
(i) R = {(a, 1), (b, 2), (c, 1), (d, 2)}


 Fig. 3-Q. 2(a)

R : A  B is a function as all element from domain are mapped into B.

Domain = {a, b, c, d},
range = {1, 2}
(ii) R = {(a, 1), (b, 2), (a, 2), (c, 1), (d, 2)}
R : A  B is not a function as elements of domain are mapped to multiple element in B
a  1, a  2

Fig. 4-Q. 2(a)

Q. 2(b) The following is the Hasse diagram of the poset : { (a, b, c, d, e,), < } Is it a lattice ? Justify.
(2 Marks)

Fig. 2-Q. 2(b)

Ans. : It is a lattice.
There exist lub and glb for each pair
For example :
lub (b, e) = b lub (c, d) = a

and
glb (b, e) = e glb (c, d) = e

Q. 2(c) In a class of 80 students, 50 students know English, 55 know French and 46 know German language,
37 students know English and French, 28 students know French and German, 25 know English and
German, 7 students know none of the languages. Find out :
(i) How many students know all the 3 languages ?
(ii) How many students know exactly 2 languages ?
(iii) How many students know only one language ?
(6 Marks)
Ans. :
|U| = 80
E  Set of students that knows = |E| = 50 English
F  Set of students that knows French = |F| = 55
G  Set of students that knows = |G| = 46 German
––––––– –––––––
||EFG|=7|EFG|=|U|–|E  F  G |
= 80 – 7 = 73
| E  F | = 37, |E  G| = 7, |G  F| = 28
 

Fig. 1 - Q. 2(c)

(i) Students that knows all 3 languages

= |E  F  G| = 13
(ii) Students that knows exactly 2 languages
= 13 + 25 + 16 = 54
(iii) Students that knows exactly 1 language
= 0+2+5=7
Q. 3(a) A bag contains 6 red and 8 green balls
(i) If one ball is drawn at random, then what is the probability of the ball being green?
(ii) If two balls are drawn at random, then what is the probability that one is red and other is green?
(6 Marks)
Ans. :
8
(i) Probability of one ball drawn is green =
14
(ii) Probability of 2 balls drawn are green and red
6 5 15
=  =
14 13 91

Q. 3(b) Determine which of the graphs below represents Eulerian circuit, Eulerian path, Hamiltonian circuit and
Hamiltonian path. Justify your answer.
(4 Marks)

Fig. 5-Q. 3(b)

Ans. :

Fig. 6-Q. 3(b)

(1) Eulerian path does exist as few vertices are having even degree and vertex 4 and 7 are having degree 3 i.e. odd
degree
(2) Eulerian circuit does not exist as all vertices are not having even degree.

Fig. 7-Q. 3(b)

(1) Euler path does not exist as 1 vertex is having odd degree.
(2) Euler circuit does not exist as all vertices does not have even degree.
Q. 3(c) Define the graph Kn and Kmn. (2 Marks)
Ans. : Kn Graph :
It is a graph called as complete graph a simple undirected graph in which every pair of distinct vertices is connected
by a unique edge. It is denoted by Kn where n is number of vertices.
Example K5 :

Fig. 8 -Q. 3(c)

All vertices are connected to each other.

Kmn Graph :

It is complete bipartite graph where vertex of the first set is connected to every vertex of other set. It is denoted by
Kmn where m is number of vertices in first set and n is number of vertices in other set.
Example K2,3

Fig. 9 -Q. 3(c)

Q. 4(b) Use Dijkstra’s algorithm to find the shortest path between a and z. (6 Marks)

Fig. 10-Q. 4(b)

Ans. :
P = {} T={a, b, c, d, e, f, g, z}
(i) v = a P = {a} T={b, c, d, e, f, g, z}
∴ L(a) = 0
L(b) = min {L(b), L(a) + w(a, b)}
= min {, 0 + 2} = 2
L(c) = 4, L(d) = 5, L(e) = , L(f) = ,
L(g) = , L(z) = 
(ii) v = c P = {a, c} T={b, d, e, f, g, z}
L(b) = min{L(b), L(c) + w(b, c)}
= min {2, 4 + 1} = 2
L(d) = 5, L(e) = , L(f) = 4, L(g) = , L(z) = 
(iii) v = f p = {a, c, f} T = {b, d, e, g, z}
L(b) = 2, L(d) = 5, L(e) = 6, L(g) = 8, L(z) = 11.
(iv) v = b p = {a, c, f, b} T = {d, e, g, z}
L(d) = 5, L(e) = 5 L(g) = 8 L(z) = 11
(v) v = d, p = {a, c, f, b, d} T = {e, g, z}
 L(e) = 5, L(g) = 7, L(z) = 11
(vi) v = e P = {a, c, f, b, d, e} T = {g, z}
L(g) = 7 L(z) = 8
(vii) v = g p = {a, c, f, b, d, e, g} T = {z}
L(z) = 8
∴ Minimum distance = 8
And Minimum path = a – d – g – z

Q. 5(a) Find maximum flow in the transport network using labeling procedure. Determine the corresponding
min cut. (7 Marks)

Fig. 11-Q. 5(a)

Ans. :

Fig. 12-Q. 5(a)

Edge bd is saturated after step (ii) so we connot travel through bg.

(i)

Fig. 13-Q. 5(a)

(ii)

Fig. 14-Q. 5(a)

(iii)

Fig. 15-Q. 5(a)

(iv)
 

Fig. 16-Q. 5(a)

(v)

Fig. 17-Q. 5(a)

(vi)

Fig. 18-Q. 5(a)

(vii)

Fig. 19-Q. 5(a)

Q. 5(b) Define :
(i) Forest
(ii) Height of a tree
(iii) Ordered tree
(iv) Properties of tree (4 Marks)
Ans. :
(i) Forest : A forest is a disjoint unior of trees.

Fig. 20-Q. 5(b)

(ii) Height of a tree : The length of the longest downward path to a leaf from root mode.
Example

Fig. 21-Q. 5(b)

(iii) Ordered tree : Tree in which the order of sub trees is significant.
Example : Binary search tree is a ordered tree because left subtree always have values less than root and eight subtree has
values greater than root.
(iv) Properties of trees : There is one and only one path between every pair of vertices. A tree with n vertices has n – 1
edges. A graph is a tree if and only if it is minimally connected. A graph G with n vertices,
n – 1 edges and no circuits is connected and it is a tree.
Q. 6(a) Give the stepwise construction of minimum spanning tree using Prim’s algorithm for the following
graph. Obtain the total cost of minimum spanning tree. (6 Marks)

Fig. 22-Q. 6(a)

Ans. :

Fig. 23-Q. 6(a)

Total cost = 16

Q. 6(b) Explain fundamental system of cutsets with suitable examples. (4 Marks)

Ans. : Fundamental system of cutsets :
A fundamental cut set is a cut set that contains only one branch of a tree.
There can be multiple fundamental cut sets.
Example




Fig.24- Q. 6(b)
 Fundamental cut sets w.r.t. T1
{e1} , {e2} , {e4}
Q. 6(c) Explain binary tree, binary search tree and ordered tree with suitable examples. (3 Marks)
Ans. : Binary Tree :
A binary tree is a tree which is rooted and in which each vertex has at most 2 children
Example

Fig. 25 - Q. 6(c)

a, b, e are having 2 children.

Binary search tree :
A binary tree is called as binary search tree if left subtree contains nodes less than root and right subtree contains
nodes greater than root.
Example

Fig. 26 - Q. 6(c)

15 has 10 in left subtree and 18 in right subtree.

10 has 9 in left and 12 in right
Ordered tree :
Tree in which order of subtrees i.e. left subtree right subtree is significant.
Example
Binary search tree is an ordered tree as left subtree has values less than root and right subtree has values greater than
root.

Q. 7(a) Consider the binary relation * defined on the set :

A = { a, b, c, d }
by the following table. Fill the empty cell.
(2 Marks)
* e a b c
e e a b c
a a b c e
b
c
Ans. :
A = {a, b, c, d}
* e a b c
e e a b c
a a b c e
b b c e a
c c e a b
Q. 7(b) Prove that : ((a + b 2) + *) where a, b  R is integral domain. (6 Marks)
Ans. :
(a + b 2 ) + (c + d 2 )= (a + c) + (b + d) 2
(a + b 2 ) + (c + d 2 )=(ac + 2bd) + (bc + ad) 2
∴ it is commutative ring with unit element 1.
Let (a + b 2 ) + (c + d 2 ) = 0
 ac + 2bd = 0 ...(1)
and bc + ad = 0 ...(2)
Suppose a = 0 then bd = bc = 0
Either b = 0 or d = c = 0
if a = 0 a + b 2 = 0 or c + d 2 = 0
Let a  0 multiply (1) by d
∴ acd + 2bd
2
= 0 ...(3)
∴ ad = – bc as bc = – da from (1)
Put ad = – bc in (3)
2 2 2 2
– bc + 2bd = 0  b(2d – c ) = 0
2 2
c = 2d only if e = d = 0
∴ a + b 2 = 0 or c + d 2 = 0
∴ It is an integral domain.

Q. 7(c) Define Normal Subgroup and rings with example. (5 Marks)

Ans. : Normal Subgroup :
A subgroup H of a group G is normal subgroup it gH = Hg for all g in G i.e. sets of left and right cosets coincide
Ex. : Commutator subgroup is a normal subgroup
Rings :
A ring is an abelian group with a second operation that is associative, is distributive over the abelian group operation
and has an identify element.
Ex. : (z4, + , X) is a ring
Q. 8(a) Let R = { 0, 60, 120, 180, 240, 300 }
And * is a binary operation so that a and b in R,
a * b is overall angular rotation corresponding to successive rotations by a and then b. Show that (R ,
*) is a group. (6 Marks)
Ans. :
R = {0, 60, 120, 180, 240, 300}
(i) Closure property : a = 60, b = 180
then a * b = 60 + 100 = 240  R
(ii) Associative property :
a * (b * c) = (a * b) * c
120 * (180 * 60) = (120 * 180) * 60
360 = 360
0 = 0 Hence associative
(iii) Identify element :
a * 0 = a
120 * 0 = 120 Hence exist
(iv) Inverse element :
a * b = 0  0 * 0 = 0 or 60 * 300 = 300
So inverse of 0 is 0 and 60 is 300
Hence from i, ii, iii and iv (R, *) is a Group.
Q. 8(b) Let A = {0, 1}. Is A closed under :
(i) Multiplication
(ii) Addition (3 Marks)
Ans. :
A = {0, 1}
(i) A is closed under multiplication because 0  1 = 0 and 0  0 = 0 and 1  1 = 1 all results fall in A.
(ii) A is closed under addition as 0 + 1 = 1, 0 + 0 = 0,
1 + 1 = 0 falls under A.

Q. 8(c) Explain Isomorphism and Automorphism.

(4 Marks)
Ans. : Isomorphism
In mathematics isomorphism is a homomorphism that admits inverse.
Group isomorphism is a homomorphism if and only if it is bijective.
x
Ex. : f(x) = e holds isomorphism
Automorphism :
An automorphism is an isomorphism whose source and target coincide.
It is, in some cases a symmetry of the object and a way of mapping the object to itself while preserving all of its
structure.
In set theory , an arbitrary permutation of the elements of a set X is an automorphism.