August 2010

Subject Code : MC0063 Assignment No: 01

Subject Name: Discrete Mathematics
Marks: 60
Credits : 4 Bk Id B0676 and B0677

Answer the following: Each question carries 10 Marks.

1. If A {x / x 2  5x  6 }
, B = {2, 4}, C = {4, 5} find
(i)(A  B )
(B  C )
(ii)(B  A )
(C  B )
(iii) A (A  B )

2. Using mathematical induction prove that

n(n  1)(2n  1)
12  2 2  3 2  .....  n 2 
6

3. Prove that the number of partitions of n in which no integer occurs more than
twice as a part is equal to the number of partitions of n into parts not divisible by
3.

4. Prove that if S contains more than two elements, then there exist f, gA(S),
such that
f g g f

5. Prove that a  b(modm )and a  b(mod n )

if and only if
a  b(modlcm(m,n ))

6. Construct a grammar for the language

L {x / x {a ,b }

,the number of a ' s in x is a multiple of 3 }
 August 2010

Subject Code : MC0063 Assignment No: 02

Subject Name: Discrete Mathematics
Marks: 60
Credits : 4 Bk Id B0676 and B0677

Answer the following: Each question carries 10 Marks.

1. Determine the number of integers between 1 to 250 that are divisible by any of
the integers 2, 3, 5 and 7.

2. Solve the recurrence relation a n  2a n 1  a n 2 , n  2 , given a0 = 3, a1 = – 2

using the generating function.

3. Prove that “If L is a distributive lattice, then it is a modular lattice”

4. Prove that for any a and b in a Boolean algebra,

(i) a  b  a  b (ii) a  b  a  b

5. Explain the concept turing machine with example.

6. The generator matrix for an encoding function E : Z 23  Z 26 is given by

 1 0 0 1 1 0
 
G   0 1 0 0 1 1
 0 0 1 1 0 1
 