18103216

(Pages:4) Reg. NO.. a 58 ****

Name...
B.Sc. DEGREE
(C.B.C.S.) EXAMINATION, JUNE 2018
Second Semester
Complementary Course
MM2CMT03-Mathematics-DISCRETE MATHEMATICS-II
(2017 Admissions only)
[Common to Computer Science M I and B.C.A.]
Time: Three Hours
Maximum:80 Marks
Part A
Answer any ten questións.
Each question carries 2 marks.
1. Find the number of edges in a graph with 10 vertices ?

2. Is bipartite ? Why?
3. Draw a graph with adjacency matrix:

o 1 1
|1 0 0
1 0 1

4. Show that an undirected graph is a tree if and only if there is a unique simple path between the
vertices.
6. Define a spanning tree of a graph. Also, show that a simple graph is connected if it has a spanning
tree

6. What is the ordered rooted tree that represents theexpression (*+)T2+(*-»)/3)?

. Find the values of the Boolean funetion represented by F (x, y, 2)=*y +Z.

. Find the sum of products expansion of the Boolean function f (, y,z)=(x+ 2) y.

. Write the dual of the Boolean expression +x.0+ 7.l

Turn over
 18103216

matrix.
1 0 and skew symmetric
symmetric matrix
10. IeSS2 3 on
sum of a
matrix:
11. Find the characteristic equation of the

1011
2 13

[1 0 1
1 3.
12. Find the rank of the matrix 3 1 4
(10 x 2 = 20 marks)

Part B

Answer any six questions.

Each question carries 5 marks.

Prove that an undirected graph has an even number of vertices of odd degree.
13.
one of two different colors
simple graph is bipartite ifand only ifit is possible assign
to
14. Prove that a
two adjacent vertices are assigned the same colour.
to each vertex of the graph so that no

15. How many non-isomorphic simple graphs are there with three vertices?
Draw all of them.

has
nd-1) internal
16. Show that a full m-ary tree with " leaves ds(m-1) vertices and (-1)/(m-1)

vertices
17. Using Huffman coding, encode the following symbols with the frequencies listed

A B C D E F

0.08 0.10 0.12 0.15 0.20 0.35

18. Show that aù + y~ + z = +y + jz + x.

19. Show that (v y=Enù and (xny=7v5.

 3
59
18103216

2 3 21
20. Reduce the matrix A =|2 -2 1 3 to normal form and also find the rank
0 4 of A.

21. Solve x+y+2 =4

2x-y+2z =5

x+y-2 =2 using Cramer's rule.

(6 x5 30 marks)
Part C

Answer any two questions.

Each question carries 15 marks.
22. (a) Determine whether the following graphs are isomorphic or not ? Justify:

H K

(6) Write an algorithm to find an Euler circuit in a graph having an euler circuit.

Z3. (a) Write an algorithm to find a spanning tree from a connected graph.

chessboard that two

(b) Consider the problem : "How is queens can be placed on an n xn so no

ne another". Explain how back tracking be used to solve the problem.

queens can attack

Turn over
 18103216

and characteristic
vectors of the matrix
24. (a) Determine the characteristic roots

2 2 1

22
(b) Verify Caylay Hamilton theorem for the matrix :

1 1 2
A3 1
2 81

Hence or otherwise find A".

25. (a) Design a circuit for a fixture controlled by three switches.

(b) Construct a circuit that produce the output (* + y +2) 3jz.

(2x 15 = 30 marks)