[April-18]

[EMA-208]
B.Tech. Degree Examination
CSE, EEE & IT
IV SEMESTER
DISCRETE MATHEMATICAL STRUCTURES
(Effective from the admitted batch 2015–16)
Time: 3 Hours Max.Marks: 60
--------------------------------------------------------------------------------------- ---------------
Instructions: Each Module carries 12 marks.
Answer all modules choosing one question from each module.
All parts of the module must be answered in one place only.
Figures in the right hand margin indicate marks allotted.
------------------------------------------------------------------------------------------------------
MODULE-I
1. a) Prove that for any three proportions
p,q,r [(pvq) r] [(pr)(qr] 6
b) Consider the following argument: 6
I will get grade A in this course or I will not graduate
If I do not graduate, I will join the army
I got grade A.
Therefore, I will not join the army
Is this a valid argument?
OR
2. a) Define (i) Tautology (ii) Disjunctive normal form (iii) conjunctive
normal form 6
b) Explain the rules of Inference 6
MODULE –II
3. a) Find solution of the recurrence relation an  3an1  3an2  an3
with initial conditions a0  1, a1  2, a2  1 6
b) Solve the recurrence relation an  an1  f (n) for n  1 by
substitution method 6
OR
4. a) If F0, F1, F2,........ are Fibonacci numbers prove that
n

F
i o
i
2
 Fn xFn1 for all positive integer n 6

b) If L(n)=Ln is the Lucas function, prove that

n n
 1 5   1 5  6
Ln      
 2   2 
 MODULE -III
5. a) Let G be the set of all non-zero real numbers and let axb= ½ ab.
Show that <G,*> is an abelian group 6
b) Prove that a group G is belian if and only if (ab)-1=a-1b-1 for all
a,bG 6
OR
6. a) State and prove Lagrange’s theorem for finite groups 6
b) H is a sub group of G if and only if, for all ab-1H 6
MODULE -IV
7. a) Prove that the number of edges in a simple graph of order n(>,2)
n(n  1)
cannot exceed 6
2
b) Prove that the two graphs shown below are isomorphic 6

OR
8. a) Define chromatic number? Explain four colour problem 6
b) What are Planer graphs? Explain with examples 6
MODULE -V
9. a) Show that a tree with n vertices has (n-1) edges 6
b) Prove that any given edge of a connected graph G is a branch of
some spanning tree of G 6
OR
10. Using Kruskal’s algorithm, obtain a minimal tree for the graph given
below 12

[3,5,7/II S/118]