[Nov-13]

[EURCS-303A]
B.Tech. Degree Examination
Computer Science & Engineering
III SEMESTER
DISCRETE MATHEMATICAL STRUCTURES
(Effective from the admitted batch 2012–13)
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 the following is a tautology
{[ p → (q ∨ r )] ∧ (~ q) } → ( p → r ) 6
b) A type writer is used for 102 hours over a period of 12 days.
Show that on some pair of consecutive days, the type writer
was used for at least 17 hours 6
OR
2. a) Prove that for each positive integer n, the n th Fibonacci number
P P

n
7
F n is less than   6
4
R R

b) Show that for each integer n ≥ 5 ; 2n > n 2 6

UNIT-II
3. a) Find how many integers between 1 and 1000 are not divisible
by 2, 3, 5, or 7 6
b) Find the coefficient of X 23
in (1 + X + X )
5 9 10
6
 OR
4. a) Using generating functions solve:
a n − 7 a n −1 + 10a n − 2 = 0 with a 0 = 10 and a1 = 41 6
b) Solve:
an − 7 an=
/3 2n where=
n 3k and k ≥ 0 with
6
and a1 = 5 / 2
UNIT-III
5. a) Let X = { 1, 2, ……7} and R = { (x, y) | (x - y) is
divisible by 3}. Show that R is an equivalence relation 6
b) If R 1 and R 2 are two equivalence relations on a set A then show
R R R R

that R1  R2 is also an equivalence relation 6

OR
~
6. a) Show that if a relation R is Transitive, then R is also Transitive
R R

6
b) Let Z be the set of integers and let R be the relation called
“Congruence modulo 3” defined by R = {(x, y) | x ϵZ, and
y ϵZ,
and (x - y) is divisible by 3}. Determine the equivalence
classes generated by the elements of Z 6
UNIT-IV
7. a) State and prove the Euler’s formula for Planar graphs 6
b) State and prove the Grinberg Theorem 6
OR
8. a) Show that in a tree, the number of vertices is one more than
the number of edges 6
b) Find the chromatic number of (i) Tree (ii) cycle (iii) complete
graph K n R 6
R

UNIT-V
9. a) Show that, if every element is its own inverse, then the group
must be abelian 6
b) Every finite group of order n is isomorphic to a permutation of
group of degree n 6
 OR
10. a) Show that every subgroup of a cyclic group is normal 6
b) State the Extension Principle for Fuzzy sets 6

[3/III S/113]