[Nov-13]

[EURIT-303]
B.Tech. DEGREE EXAMINATION
Information Technology
III SEMESTER
DISCRETE MATHEMATICAL STRUCTURES
(Effective from the admitted batch 2007–08)
Time: 3 Hours Max.Marks: 60
----------------------------------------------------------------------------------------------------
Instructions: Each Unit carries 12 marks.
Answer all units choosing one question from each unit.
All parts of the unit must be answered in one place only.
Figures in the right hand margin indicate marks allotted.
----------------------------------------------------------------------------------------------------
UNIT-I
1. a) Show that
((P ∨ Q) ∧ ¬ (¬P∧(¬Q∨¬R))) ∨ (¬P ∧ ¬Q) ∨ (¬P∧¬R) is a
tautology 6
b) obtain principal disjunctive and conjunctive normal forms of
(Q→P) ∧ (7P∧Q) 6
OR
2. a) Show that R ∧ (P ∨ Q) is a valid conclusion from the premises
P ∨ Q, Q → R, P → M, and 7M 6
S
b) Show that ⇒ (7Q ∧ (P → Q)) → 7P 6
UNIT-II
3. a) Given S={1,2,3,4,5,6,7,8,9,10} and a relation R on S where
R={<x, y >/ x+y = 10} what are the properties of the relation R? 6
b) Let R denote a relation on the set of ordered pairs of positive
integers such that <x,y> R<u,v> iff xv = yu. Show that R is on
equivalence relation 6
 OR
4. a) Show that there are only five distinct Hasee diagrams for
partially ordered sets that contain three elements 6
 x/2 , when x is even
b) Show that the function f ( x) = 
( x − 1) / 2 when x is odd
is primitive recursive 6
UNIT-III
5. a) Consider the set B ={0,1} and the operations + and x on B
given by

+ 0 1 x 0 1
0 0 1 0 0 0
1 1 0 1 0 1
Show that (B, +, x) is an algebraic system 6
b) For any commutative monoid <M, *>, the set of idempotent
elements of M forms a submonoid 6
OR
6. a) If every element in a group is its own inverse, then show that
the group is abelian 6
b) Show that, every finite group of order n is isomorphic to a
permutation group of degree n 6
UNIT-IV

1 − x 4 − x 7 + x11
7. a) Find the coefficient of x 12 in 6
(1 − x)5
P P

b) If {Fn}∞n=0 is a Fibonacci sequence, show that

F02 + F12 + F22 + ....... + Fn 2 =
Fn . Fn+1 6

OR
8. a) Find the form of a particular solution to
a n – 4 a n-1 + 4a n-2 = 2 n + 7.4 n
R R R R R R P P P P 6
b) Solve the recurrence relation
a n -5a n-1 + 6a n-2 = 0 for n ≥ 2, a 0 = 1, a 1 = -2
R R R R R R R R R R 6
 UNIT-V
9. a) Prove that a simple non-directed graph G is a tree if and only if
G is connected and contains no cycles 6
b) Prove that the following graphs are isomorphic: 6

OR
10. a) Find a Hamiltanian cycle in the following graph 6

b) What is the chromatic number of a cycle and a tree 6

[7/III S/113]