Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Class Test, 2073

Set A

BSc CSIT/First Year/Second Semester


Subject: Discrete Mathematical Structure Full Marks: 20
Time: 60 minutes Pass Marks: 8

1. Explain the method of direct proof with an example. (4)

2. Prove by using mathematical induction that 3n < n! if n ≥ 6. (4)

3. Find the incidence matrix of the following graph: (4)

e2
a e1 b

e7 e6 e3
e

e4
e5
c d

What do the sums of the rows of this matrix indicate?

4. Find the adjacency matrix of this graph and mention the properties of this graph. (4)

5. What do you mean by a bipartite graph? Give an example of a bipartite and non-bipartite graphs.
(4)

********************
Class Test, 2073

Set B

BSc CSIT/First Year/Second Semester


Subject: Discrete Mathematical Structure Full Marks: 20
Time: 60 minutes Pass Marks: 8

1. Explain the method of proof by contradiction with an example. (4)

2. Prove using mathematical induction that


1 1 1 1
1+ + + ··· + 2 < 2 −
4 9 n n
for n ≥ 1. (4)

3. Find the adjacency matrix of the following graph: (4)

v2 e4 v4

e3 e5
e1 e2 e8
e6 v5 e7
v1 e9 v3

What do the sums of the rows and columns of this matrix indicate?

4. Find the incidence matrix of the above graph and mention the properties of this matrix. (4)

5. When are two graphs said to be isomorphic? Give an example each of isomorphic and non-
isomorphic pair of graphs. (4)

********************

You might also like