Vidyalankar

S.E. Sem. III [CMPN]

Discrete Structures & Graph Theory
Time : 3 Hrs.] Prelim Question Paper [Marks : 100

N.B. : (1) Question No. 1 compulsory.

(2) Answer any four out of remaining six questions.

1. (a) Prove that ((A  B)  A)  (B  A)  A  B. [4]

(b) Show that 72n + (23n  3) (3n  1) is divisible by 25 for all natural number n. [6]
(c) It is known that at the University 60% of Professors play tennis, 50% of them play bridge, [6]
70% jog, 20% play tennis and bridge, 30% play tennis and jog and 40% play bridge and
jog. If someone claimed that 20% of the Professors jog and play bridge and tennis, would
you believe this claim ? Why ?
(d) Verify that the proposition p   (p  q) is a tautology. [2]
(e) Prove using laws of logic [2]
[(p  q)  (p  ~ q)]  q = p  q

2. (a) Find matrix relation and relation diagraph. [6]

A = {1, 2, 3, 4, 5} = B; aRb iff b is multiple of a.
Find in degree and outdegree of each vertex.
(b) State the properties of relations. [6]
(c) Which of the following relations on the set of real numbers are equivalence relations [4]
(i) aRb if a  b  0
(ii) aRb if | a | = | b |
(d) Define the following terms : [4]
(i) Groupoid
(ii) SemiGroup
(iii)Monoid
(iv) Abelian Group

3. (a) Let {A1, A2, …….,Ak} be the partition of a set A. We define a binary relation ‘R’ on ‘A’ [4]
such that the ordered pair (a, b)  R; iff a and b are in the same block of the partition; show
that R is an equivalence relation.
(b) Let A = {a1, a2, a3, a4, a5} and let R be a relation on A whose matrix is : [10]
1 0 0 1 0 
0 1 0 0 0
 
MR =  0 0 0 1 1 
 
1 0 0 1 0 
 0 1 0 0 1 
Find out transitive closure of R using Warshall’s algorithm.
(c) Let f : R  R be a function defined by f(x) = 2x  3. Prove that it is bijective hence find [6]
inverse.

4. (a) Prove that if 7 colours are used to paint 50 bicycles, then 8 of them must have same colour. [4]
(b) Let Z+ be a set of positive integers and a relation R defined on Z+ by aRb iff a | b then prove [4]
that R is a partial order relation and (Z+, 1) is poset.
(c) Consider the partial order of divisibility on set A. Draw Hasse diagram of the poset and [4]
determine which poset are linearly ordered.
(i) A = {1, 2, 3, 5, 6, 10, 15, 30}
(ii) A = {1, 2, 3, 4, 5, 6, 10, 12, 15, 30, 60}
(2) Vidyalankar : S.E.  DS

(d) Show whether the following lattice shown in figure is distributive or not ? 1 [4]

b d

a c

0
(e) Prove that if a and b are elements in a bounded distributive lattice and has a complement a then [4]
a  (a  b ) = a  b
a  (a  b ) = a  b

5. (a) Show that the following two graphs are not isomorphic even though the necessary [6]
conditions are satisfied.
V10 V9 U10 U9

V1 V2 V3 V4 V5 V6 V7 U1 U2 U3 U4 U5 U6 U7
V11 V8 U11 U8
G2
G1
(b) (i) Does there exist a graph which is both Eulerian as well as Hamiltonian ? Give an [2]
example of a graph which is neither Eulerian nor Hamiltonian.
(ii) Show that if T, V0 is a rooted tree, then V0 has indegree zero. [2]
(c) Show that maximum number of vertices in a binary tree of height n is 2n + 11. [4]
(d) Prove that additive group of complex numbers (C, +) is isomorphic to multiplicative group [6]
of +ve reals (R +, .) under the mapping f(a + ib) = 2a . 3b.

6. (a) Prove that G = {X = a  b 2 ; a, b  Q and x  0} forms an abelian group with respect to [6]
multiplication.
(b) For the cyclic group of order 8 with generator a, find the quotient group corresponding to [4]
the subgroups generated by a2 and a4 respectively.
(c) Show that (I, , ) is a commutative ring with unity where the operations  and  are [10]
defined as follows
a  b = a + b 1
a  b = a + b  ab
 a, b  I i.e. a set of integer.

7. (a) Consider (2, 6) encoding function e : B2  B6 defined as [4]

e (00) = 000000 e (01) = 011110
e (10) = 101010 e (11) = 111000
(i) Find the minimum distance (ii) How many error can ‘e’ detect ?
 1 0 0 
0 1 1
1 1 1 
(b) Let H = 1 0 0  be a parity check matrix. Determine (3, 6) group code eH :B  B .
3 6
[8]
 
0 1 0
 0 0 1 
(c) Determine the sequence whose recurrence relation is an = 4a n 1  5a n 2 with a1 = 2 & a2 = 6. [4]
(d) Find the solution to the recurrence relation [4]
an = 3an1 3an2 an3
with initial conditions a0 = 1, a1 = 2 and a2 = 1.
