You are on page 1of 4

# MAY 2011 Master of Computer Application (MCA) – Semester 1 MC0063 – Discrete Mathematics – 4 Credits

(Book ID: B0676 and B0677)

Assignment Set – 1 (60 Marks)
Answer all Questions Answer the following : 1. Find the n th term of the following series (a) (c)
12 + 3 2 + 5 2 +

Each question carries TEN marks 6× 10 = 6

…….

(b)

1.4

+

4.7

+

7.10

+

……

1 2 .5

+

1 1 + + …….. 5 .8 8 .11

10 marks

4. (a) Let F be the field of real numbers and let V be the set of all sequences (a1, a2, ...,
an, ...) where ai ∈ F. Here equality, addition and scalar multiplication are defined component wise. Prove that V is a vector space over F.

lim (b) Let W = { (a1, a2, ..., an, ...) / n →∞ an = 0 }. Prove that W is a subspace of V.
10 marks 3. Write short notes on (a) Public key Cryptography (b) The R.S.A Cryptosystem 10 marks 4. Proove the given theorem as below: If S1 = { x1, x2, ….. xn} and S2 = {y1, y2, …. yn} are any two finite sets with n elements, then the lattices (P(S1), ⊆ ) and

(P(S2). (a) a = 0. Verify whether or not. Consequently the Hasse diagrams of these lattices may be drawn identically.5 and b = 0. ⊆ ) are isomorphic. Evaluate the following fuzzy logic formulas where a = 0.7.4 a ∨b 10 marks (b) a ∧b (c) (d) a → b 6. the following graphs are planar? (i) o o o (ii) f o a o b o o c o o o o e o d 10 marks . 10 marks 5.

a4. a1. 1 o a4 o o o a5 a1 o a3 o a2 o 0 i) ii) Is A is a distributive lattice What are the complements of a1 and a2 10 marks 2. a5. 1} given below. a2. a3. a-1 = 4 . (a) Identity e = 3. a (b) Identity e = 2 and the inverse of a i. a . Consider the lattice A = {0..e. a-1 = 9 .MAY 2011 Master of Computer Application (MCA) – Semester 1 MC0063 – Discrete Mathematics – 4 Credits (Book ID: B0676 and B0677) Assignment Set – 2 (60 Marks) Answer all Questions Each question carries TEN marks 1.

. b ∈H ⇒ab ∈H b) a ∈ H ⇒ a −1 ∈H 10 marks . then the probability that there are errors in exactly k coordinates is  n  k n −k  q p k 10 marks 6. Prove that a connected graph G is an Euler graph if and only if it can be decomposed into circuits. 10 marks 3. Prove that a non-empty subset H of a group G is a subgroup of G if and only if a) a. xn) is transmitted across a binary symmetric channel with probability p that no error will occur in each coordinate. x2. …. For any a and b in a Boolean algebra a ∨ b = a ∧b a ∧b = a ∨ b 10 marks 4. Prove the theorem as given below If a binary n-tuple (x1. 10 marks 5.