Ceb-nect kta--6271.

)( °gait)
/4/2-1/r
54 rt4 char
QP Code : 5253
( 3 hours) Total Marks: BO
N. B.
1.Question No 1.1s compulsory
2.Solve any THREE questions out of remaining five questions
3.Assumption made should be clearly stated
4.Figure to the right indicates full marks

/ (a) Show that if any.seven points are chosen in a regular hexagon whose sides are of 1 5 ,
unit, then two of them must be no further apart than 1 unit.
(b) Determine the number of edges in a graph with 6 nodes, 2 nodes of degree 4 and 4
nodes of degree 2. Draw two such graphs.
(c) 2 is divisible by 43 i ,CI 5
(d) Draw the Hasse diagram of 060. Also find whether it is a lattice.
6<5
2. (a) Define infective, sudective and bijective functions. If f: R —0 R and g:R defined by 6
f(x) = x + 2 and g (x) = x 2 . Find i)f g 0 f )g of og

(b) It was found that in a class, 60 students are passed in English, 6,Q,$' Science and 50 in 8.
Mathematics. It was also found that 30 students passed in both 4gIish and Science, 15
students passed in both English and Mtheinfities :aijd24jfbdeni5 passed in both
Mathematics and Science, 10 students passed in. all threcs bjects. If there are 150
students in the class, find
How Many students passed in at least °pa t.
(10 How many students passed in Eng. lish on
(iii) How many students failed in all three subjects?
\-\N
(c) Let S = {1,2,3,4,5) and A = S S.Define töfollowirrg relation R on A -: 6
(a, b) R (c, d) if and only if ad = bc. Sho41at R is an equivalence relation and
compute A/R.
r17.9
- 3 (a) If 11 people are chosen from a set =(1, 2, 3, .... • 20), then one of them is multiple 4
of other
4.11
(b) If f: A --) B and If g: B —0C accooth one-one and onto„ then (go fyl = ri 0
Nv
(c) Determine whether the w Hasse diagram represents a lattice 6

0
a
(T x'
(d)od, *) is an Abelian group, then for all a, b E G show that (a * = an + bn.
_k(use mathematical induction).

c-, MD-Con. 11522-15.

[TURN OVER

SZS
 2 QP Code : 5253
4 (a) Let G = (1, 2, 3, 4, 5, 6). Prove that (G, X 7)
is a finite Abelian group with respect to 6
multiplication modulo 7.

(b) 1 0• 0
1 1 0 7
Let H = 0 1 1
1 0 0 be parity check matrix, 3-6
0 1 0
0 0 1

Determine the group code ell : B 2 -4 ,\J

(c) Find the generating functions for the following sequence
I) 0, 0, 0,1, 2, 3, 4, 5, 6, 7, . 7
. ii) 6, —6, 6, —6, 6, —6, 6, — • • •

(a) if function f is an isomorphism from semigroup (S, * ) to (T,

n prove that 5
f-1 is an isomorphism from (T, * ' ) to (5, *)
C7)
(b)
- and 9, i.e., L1 = {1, 2,4)
Consider the chain of divisors of 4 L2 =- (1,3,9)
0\4

II 2
\ .\
• / • 1
L2
Find the Hasse diagram of L1 X L2
(C) Show that the set G =
f4, fs where the functions are defined by 8
fi(x) = x f2(x) = 1— x f3 (x) =
.4(x) = fs(x) = fs(x)= 2. 1
is a group under composition Of fun a-. Frame the composition table,
6 (a) Determine whether following ras are isomorphic
A
r\> 1

e (Th

(b) Solve ,t99oliowing recurrence relation:

7
n — San _i + 6an_2 = 2n with initial conditions Cip = —1 and al= 1
&C
• 110w that (—tqA(p
1 /4,
(c)
q)) p is a tautology 5
0

EVID-Con. 11522-15.
 t
I
PaperlSubjectCode:50903/DiscreteStructuresaffi
s esryW) CodFU reK) 5 ltzo/s . _
'-:&ruq{#-;;;,";v)a-u')a,riP,44ffi
-
),,t.R,, ."i,;r,,f.--
N.B (tlQuestion No.l is compulsory. i" , . : _). .":,5'*$'="i
(2) Solve any three questbns out of remaining five questions.
(3) Assumptions made should be clearly stated.
(4) Figures to the right indicate full marks.

Q.l (a) Two dice are rolled, find the probability that the sum is
(DEqual to I (if Equal to 4 (ii) Less than 13
,,r,,

(b) Use the laws of logic to show that

t(p--q) ^ -ql * -p is a tautology

Q.2(a)

t6M

[8M]

Q.3 [6M]

t tg(D)

I6A4
!, ,,-:i --- .'r" ,.,
'g(*)
"i'i..:,:l:
f(x) =r+2; =x -2 and h(x) =3x for x6 p ,Where R: Set of real numbers. Find t8M
,lg f;.; 6. 9 (f 0, (g . g) ,(f h),(h. g),(h . f) ,(f h e)
" " " "

tii,p'linaryghtieq,'1gtr$= {(a, b) l(a, c)e Rand (c, b) e Rfor some c} Show that if R is
,Ieht1bli;then,S'irs also an equivalence rehtion. I6M]

[TURN OVER

3B3D34E0699A l DDs 542688407 13334 A2

 F

(b) Determine the generating fi.*rction

of the numeric fi,rction ar,wher€:.
(, dr= 3r+4*l ,r )0
(0 or= 5 , r)0

Q.5

\, a,_ ,, I "..

ti.. ,,.r
(c) Find the greatest lower bound ,
and:liat-r.;urxler bowa..of
boqrd ,of tfre
::t .,

jt
/).whei;7;iil;#;,ri.aitii
,

they exists in the poset

1z+,

Q.6

,: "1'
I6M]

[8M]

' i '.. _.'-

.."1.: ::\,".'r'
,,;i:'..';l'
*.,.:i'
,',..\i'

383D34E0699A I DDss426 88407 t 3334A2

 Paper / Subject Code: 50903 / Discrete Structures

r. E - GAYdai -ee',,ry chd.! Ua; noae$g*fu;

(3 hrs)
''i
1) Question no.lis compulsory. ' '.
2l solve anyTHREE questions outof remaining FlvEquestions.
3) All questions carry equal marks as indicated byfigurestothE,,fight,..
4l Assume appropriate datawheneverrequired. State allgssumpiiOhs,'iieir'l;:,' ,.,' ,,
ri

Q.1a) Prove using Mathematical lnduction

b) Find the generatingfunction forthe followingfiniiesequences, '. ' ,' - '.

, -r;:

i|7,2,3,4,...ii,)2,2,2,2,2.':-.
c)LetA={1,4,7,t3}andRF{{1,4),(4,7I,(7,4l,(1,13)}

b) Prove that setG= ft;Z,3;'4;5,6).is afinitg,abelian gr:oup jf'orderSWtrt, r"rpectto multiplication

c) A travet companV surveybd, i[rs travelers,

to learn how much:of theiir travel is taken with an
Airplane, aTrain oraCar. Thefollowingdata iskngwn;makp aGonrpletev.nn Diagramwithall
the data. The numb"rof p.e.optelwnort-ew was t30z r'n.'"rluii;io."ol. *no both flewand
used a tqaih,waseoi,,ffie"p.upte,wnn'us.C.''.Ji'*iEa ;;i+igt,n number. Those who ftew but
didn'tdiiVe,game,to a,total of'ssE:rhoserwhb drove,but dld,::hot use a train totaled 1097.
There
werq:610neonf e who used bo.th trains and cJrs,:The,ngmber of people who used
eith era car or
a train or'bo$r, was 20so:1laitli; 4el people used non" ot*,"re
..'. Find out how many people drove
but uqed neilher: atrain norah airplanp, and also, how many people were in
the entire survey,
. '
'1 | ,1 (ogMl
.''''..'.''..''.''''.'''''''
...1
:.......
,]83,),pievu I
(l t, (-ip''', q )) and + ii,,, o -t Q are logicallyequivalentbydevetopinga
'''.'.]..serie1of'logicale9uirn|e'nces.'.'
' ,, U).C,ons!!;1$!;!,g,_S!,eroupie'ncgdingfunction definedby (O8Ml
..']'...'...',9{000}=0o'0oo
..'i.",'..,',a{S1Q)=01OQX' e(01t)=91111
' ,' : e(ioo)=toolr e.(101)=tQ1g1

'
''. ,i" 'Decdd€.thq, fOllQwinq words relative to a maximum likelyhood decoding function.
"-"- "
_. , ., , i)'$00t.,,,,,1,i)-0't0io "iiii oorrr
,'
,
ll :c) MentigSl.gll the:-etements of set Dm also specify R on D:o os aRb if a I b. Mention Domain and
...: ,
'.' , ',. ' Rangeof R'Expfai,rtiftherelationisEquivalenceRelationoraPartiallyOrderedRelation. lf itis
, ,a'Par.tially Or:dbred Relation, draw its Hasse Diagram. (08 Ml

8297 E7 67DF52OAD89 I CFF85OB6C5EDE4

r Paper / subject code: 50903 / Discrete structures

€.5' iis,ny'n*
g *{ao)
Q.a a) Explain Extended pigeonhole Principle. How manyfriends mustyou hage toguar:antee
thatat
leastfiveofthemwilIhavebirthdaysinthesamemonth. (@r'M,
b) Define Euler Path and Hamiltonian path.
i)DetermineEulerCycleandpathingraphshownin(a) ..t.,
ii) Determine Hamiltonian cycre and path in graph shown in:1b1, ' .
'-,1
1l i

C d E
. .' ' ,... .]

c) ln agroup of 6 boys and 4girls, fourchildren are to be selected. ln howrr;hv,Uifr"rentwiVi can

theybeselectedsuchthatatleastoneboyshouldbethere?'
: r": :
, . :
,

Q.5 a) Let G be a group. Prove that thi'iueniitiullement e is unigue. , ':' ' '.
,.f', ,
'l: ,iil*f
b) A pack contains 4 bl.ue, 2 re! and 3 black.pens, rf z p.ns'ale dr,awn
ai ,iooo, fr;;';il. pack,
, NOT replaced and then another pen is drawn. WfrCt iithe:,probabilitrT
of drawing 2 blue pens

c) LetAbeasetofintegers,tetRbearelationonAXAdefinedby(a,b)ntiOt ifandonlyifa+d=b+c
Prove that R is an equivalence Relation.

Q'6 a) Define reflexive closure and symmetr,iciclosuie of a r:etation. Also fini reftexive and symmetric

b) Let H=.' . '' ' "'

f 'Q ;Q
0'' L. 1
r,1 ''1
;l,.','''..'
,.fi.9'.o-
g:,1,."0
0: 0' '1
:,...j .::,' L...
Be a parity check matrix.:Determine the group code es 83)86 (o8M)
c) Determine if following graphs G1 and G2 dr€ isomorphic or not. {08M}

ffi a

.G1 G2

B.297 E7 67DF52OADB9 I CFFSsOB 6C5EDE4

 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

4)
3)
2)
1)

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

module 7
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7

Find (f O f -1 )(x)
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

Use pigeonhole Principle.

( P  Q )  ( Q   P )
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC

corresponding Venn Diagram.

Question no.1 is compulsory.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

e(01)=01110 e(11)=11011
e(00)=00000 e(10)=10101
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

i) 11110 ii) 10011 iii) 10100

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

of these will be greater than 3000?

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Q.1 a) Prove using Mathematical Induction

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
1 2 + 2 2 + 3 2 + ... + n 2 = n (n + 1) (2n + 1)/ 6

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
(3 hrs)

58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
b) Let A = {a,b,c}. Draw Hasse Diagram for (p(A), ⊆)

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

d) Let f : R O R, where f(x) = 2x – 1 and f-1 (x) = (x+1)/2

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 1 of 2
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

b) Consider the (2,5) group encoding function defined by

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Solve any three questions out of remaining five questions.

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
All questions carry equal marks as indicated by figures to the right.

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

Q.3 a) Construct Truth Table and check if the following statement is tautology.
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

Assume appropriate data whenever required. State all assumptions clearly.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
c) Let A={1,2,3,4,5}. A relation R is defined on A as aRb iff a<b. Compute R2 and R ∞

6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

Decode the following words relative to a maximum likelihood decoding function.

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
Q.2 a) Define Distributive Lattice. Check if the following diagram is a Distributive lattice or not.

C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53

A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83
Max. Marks: 80

(08 M)
(08 M)
(04 M)
(08 M)
(08 M)
(04M)
(05M)
(05M)
(05M)

(04 M)
(05M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?
Q.4 a) A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of
c) How many four digits can be formed out of digits 1,2,3,5,7,8,9 if no digit is repeated twice? How many
b) Prove that set G = {1,2,3,4,5,6} is a finite abelian group of order 6 with respect to multiplication

c) Find the number of positive integers not exceeding 100 that are not divisible by 5 or 7. Also draw

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 /circuit.
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

degree 2.
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

MR=
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

members and 8 students.

D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

reminder of ab divided by n

0
1
1
0

c) Let A = {1, 2, 3, 4, 5}, and let

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

0
0
0
1
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6

0
0
1
0
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

0
0
0
1
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

i) Construct table for the operation ⨀ for n=4

ii) Show that (Zn, ⨀ ) is a semi group for any n
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 2 of 2
*******
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D

c) Determine if following graphs G1 and G2 are isomorphic or not.

95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

equivalence relation. Justify your answer. Find equivalence classes of A.

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83

(08M)
(08M)
(08M)
(08M)
(04M)

b) What is the solution of the recurrence relation an = -an-1 + 4an-2 + 4an-3 with a0=8, a1=6 and a2=26?
(04 M)
(08 M)

(08 M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
b) Find Transitive Closure of R represented by MR as follows using Warshall’s algorithm set {a,b,c,d}.

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

Q.6 a) How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of
c) In how many ways a committee of three faculty members and 2 students can be formed from 7 faculty

R = {(1, 1),(1, 3),(1, 4),(2, 2),(2, 5),(3, 1),(3, 3),(3, 4),(4, 1),(4, 3),(4, 4),(5, 2),(5, 5)} . Check if R is a
Q.5 a) Let Zn denote the set of integers {0,1,2,…n-1}. Let ⨀ be a binary operation on Zn such that a ⨀ b=
diagram has Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit and state the path
b) Define Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit. Determine if following

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

4)
3)
2)
1)

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

module 7
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7

Find (f O f -1 )(x)
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

Use pigeonhole Principle.

( P  Q )  ( Q   P )
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC

corresponding Venn Diagram.

Question no.1 is compulsory.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

e(01)=01110 e(11)=11011
e(00)=00000 e(10)=10101
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

i) 11110 ii) 10011 iii) 10100

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

of these will be greater than 3000?

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Q.1 a) Prove using Mathematical Induction

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
1 2 + 2 2 + 3 2 + ... + n 2 = n (n + 1) (2n + 1)/ 6

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
(3 hrs)

58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
b) Let A = {a,b,c}. Draw Hasse Diagram for (p(A), ⊆)

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

d) Let f : R O R, where f(x) = 2x – 1 and f-1 (x) = (x+1)/2

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 1 of 2
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

b) Consider the (2,5) group encoding function defined by

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Solve any three questions out of remaining five questions.

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
All questions carry equal marks as indicated by figures to the right.

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

Q.3 a) Construct Truth Table and check if the following statement is tautology.
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

Assume appropriate data whenever required. State all assumptions clearly.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
c) Let A={1,2,3,4,5}. A relation R is defined on A as aRb iff a<b. Compute R2 and R ∞

6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

Decode the following words relative to a maximum likelihood decoding function.

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
Q.2 a) Define Distributive Lattice. Check if the following diagram is a Distributive lattice or not.

C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53

A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83
Max. Marks: 80

(08 M)
(08 M)
(04 M)
(08 M)
(08 M)
(04M)
(05M)
(05M)
(05M)

(04 M)
(05M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?
Q.4 a) A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of
c) How many four digits can be formed out of digits 1,2,3,5,7,8,9 if no digit is repeated twice? How many
b) Prove that set G = {1,2,3,4,5,6} is a finite abelian group of order 6 with respect to multiplication

c) Find the number of positive integers not exceeding 100 that are not divisible by 5 or 7. Also draw

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 /circuit.
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

degree 2.
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

MR=
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

members and 8 students.

D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

reminder of ab divided by n

0
1
1
0

c) Let A = {1, 2, 3, 4, 5}, and let

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

0
0
0
1
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6

0
0
1
0
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

0
0
0
1
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

i) Construct table for the operation ⨀ for n=4

ii) Show that (Zn, ⨀ ) is a semi group for any n
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 2 of 2
*******
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D

c) Determine if following graphs G1 and G2 are isomorphic or not.

95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

equivalence relation. Justify your answer. Find equivalence classes of A.

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83

(08M)
(08M)
(08M)
(08M)
(04M)

b) What is the solution of the recurrence relation an = -an-1 + 4an-2 + 4an-3 with a0=8, a1=6 and a2=26?
(04 M)
(08 M)

(08 M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
b) Find Transitive Closure of R represented by MR as follows using Warshall’s algorithm set {a,b,c,d}.

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

Q.6 a) How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of
c) In how many ways a committee of three faculty members and 2 students can be formed from 7 faculty

R = {(1, 1),(1, 3),(1, 4),(2, 2),(2, 5),(3, 1),(3, 3),(3, 4),(4, 1),(4, 3),(4, 4),(5, 2),(5, 5)} . Check if R is a
Q.5 a) Let Zn denote the set of integers {0,1,2,…n-1}. Let ⨀ be a binary operation on Zn such that a ⨀ b=
diagram has Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit and state the path
b) Define Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit. Determine if following

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 t
I
PaperlSubjectCode:50903/DiscreteStructuresaffi
s esryW) CodFU reK) 5 ltzo/s . _
'-:&ruq{#-;;;,";v)a-u')a,riP,44ffi
-
),,t.R,, ."i,;r,,f.--
N.B (tlQuestion No.l is compulsory. i" , . : _). .":,5'*$'="i
(2) Solve any three questbns out of remaining five questions.
(3) Assumptions made should be clearly stated.
(4) Figures to the right indicate full marks.

Q.l (a) Two dice are rolled, find the probability that the sum is
(DEqual to I (if Equal to 4 (ii) Less than 13
,,r,,

(b) Use the laws of logic to show that

t(p--q) ^ -ql * -p is a tautology

Q.2(a)

t6M

[8M]

Q.3 [6M]

t tg(D)

I6A4
!, ,,-:i --- .'r" ,.,
'g(*)
"i'i..:,:l:
f(x) =r+2; =x -2 and h(x) =3x for x6 p ,Where R: Set of real numbers. Find t8M
,lg f;.; 6. 9 (f 0, (g . g) ,(f h),(h. g),(h . f) ,(f h e)
" " " "

tii,p'linaryghtieq,'1gtr$= {(a, b) l(a, c)e Rand (c, b) e Rfor some c} Show that if R is
,Ieht1bli;then,S'irs also an equivalence rehtion. I6M]

[TURN OVER

3B3D34E0699A l DDs 542688407 13334 A2

 F

(b) Determine the generating fi.*rction

of the numeric fi,rction ar,wher€:.
(, dr= 3r+4*l ,r )0
(0 or= 5 , r)0

Q.5

\, a,_ ,, I "..

ti.. ,,.r
(c) Find the greatest lower bound ,
and:liat-r.;urxler bowa..of
boqrd ,of tfre
::t .,

jt
/).whei;7;iil;#;,ri.aitii
,

they exists in the poset

1z+,

Q.6

,: "1'
I6M]

[8M]

' i '.. _.'-

.."1.: ::\,".'r'
,,;i:'..';l'
*.,.:i'
,',..\i'

383D34E0699A I DDss426 88407 t 3334A2

 Paper / Subject Code: 50903 / Discrete Structures

r. E - GAYdai -ee',,ry chd.! Ua; noae$g*fu;

(3 hrs)
''i
1) Question no.lis compulsory. ' '.
2l solve anyTHREE questions outof remaining FlvEquestions.
3) All questions carry equal marks as indicated byfigurestothE,,fight,..
4l Assume appropriate datawheneverrequired. State allgssumpiiOhs,'iieir'l;:,' ,.,' ,,
ri

Q.1a) Prove using Mathematical lnduction

b) Find the generatingfunction forthe followingfiniiesequences, '. ' ,' - '.

, -r;:

i|7,2,3,4,...ii,)2,2,2,2,2.':-.
c)LetA={1,4,7,t3}andRF{{1,4),(4,7I,(7,4l,(1,13)}

b) Prove that setG= ft;Z,3;'4;5,6).is afinitg,abelian gr:oup jf'orderSWtrt, r"rpectto multiplication

c) A travet companV surveybd, i[rs travelers,

to learn how much:of theiir travel is taken with an
Airplane, aTrain oraCar. Thefollowingdata iskngwn;makp aGonrpletev.nn Diagramwithall
the data. The numb"rof p.e.optelwnort-ew was t30z r'n.'"rluii;io."ol. *no both flewand
used a tqaih,waseoi,,ffie"p.upte,wnn'us.C.''.Ji'*iEa ;;i+igt,n number. Those who ftew but
didn'tdiiVe,game,to a,total of'ssE:rhoserwhb drove,but dld,::hot use a train totaled 1097.
There
werq:610neonf e who used bo.th trains and cJrs,:The,ngmber of people who used
eith era car or
a train or'bo$r, was 20so:1laitli; 4el people used non" ot*,"re
..'. Find out how many people drove
but uqed neilher: atrain norah airplanp, and also, how many people were in
the entire survey,
. '
'1 | ,1 (ogMl
.''''..'.''..''.''''.'''''''
...1
:.......
,]83,),pievu I
(l t, (-ip''', q )) and + ii,,, o -t Q are logicallyequivalentbydevetopinga
'''.'.]..serie1of'logicale9uirn|e'nces.'.'
' ,, U).C,ons!!;1$!;!,g,_S!,eroupie'ncgdingfunction definedby (O8Ml
..']'...'...',9{000}=0o'0oo
..'i.",'..,',a{S1Q)=01OQX' e(01t)=91111
' ,' : e(ioo)=toolr e.(101)=tQ1g1

'
''. ,i" 'Decdd€.thq, fOllQwinq words relative to a maximum likelyhood decoding function.
"-"- "
_. , ., , i)'$00t.,,,,,1,i)-0't0io "iiii oorrr
,'
,
ll :c) MentigSl.gll the:-etements of set Dm also specify R on D:o os aRb if a I b. Mention Domain and
...: ,
'.' , ',. ' Rangeof R'Expfai,rtiftherelationisEquivalenceRelationoraPartiallyOrderedRelation. lf itis
, ,a'Par.tially Or:dbred Relation, draw its Hasse Diagram. (08 Ml

8297 E7 67DF52OAD89 I CFF85OB6C5EDE4

r Paper / subject code: 50903 / Discrete structures

€.5' iis,ny'n*
g *{ao)
Q.a a) Explain Extended pigeonhole Principle. How manyfriends mustyou hage toguar:antee
thatat
leastfiveofthemwilIhavebirthdaysinthesamemonth. (@r'M,
b) Define Euler Path and Hamiltonian path.
i)DetermineEulerCycleandpathingraphshownin(a) ..t.,
ii) Determine Hamiltonian cycre and path in graph shown in:1b1, ' .
'-,1
1l i

C d E
. .' ' ,... .]

c) ln agroup of 6 boys and 4girls, fourchildren are to be selected. ln howrr;hv,Uifr"rentwiVi can

theybeselectedsuchthatatleastoneboyshouldbethere?'
: r": :
, . :
,

Q.5 a) Let G be a group. Prove that thi'iueniitiullement e is unigue. , ':' ' '.
,.f', ,
'l: ,iil*f
b) A pack contains 4 bl.ue, 2 re! and 3 black.pens, rf z p.ns'ale dr,awn
ai ,iooo, fr;;';il. pack,
, NOT replaced and then another pen is drawn. WfrCt iithe:,probabilitrT
of drawing 2 blue pens

c) LetAbeasetofintegers,tetRbearelationonAXAdefinedby(a,b)ntiOt ifandonlyifa+d=b+c
Prove that R is an equivalence Relation.

Q'6 a) Define reflexive closure and symmetr,iciclosuie of a r:etation. Also fini reftexive and symmetric

b) Let H=.' . '' ' "'

f 'Q ;Q
0'' L. 1
r,1 ''1
;l,.','''..'
,.fi.9'.o-
g:,1,."0
0: 0' '1
:,...j .::,' L...
Be a parity check matrix.:Determine the group code es 83)86 (o8M)
c) Determine if following graphs G1 and G2 dr€ isomorphic or not. {08M}

ffi a

.G1 G2

B.297 E7 67DF52OADB9 I CFFSsOB 6C5EDE4

 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

4)
3)
2)
1)

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

module 7
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7

Find (f O f -1 )(x)
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

Use pigeonhole Principle.

( P  Q )  ( Q   P )
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC

corresponding Venn Diagram.

Question no.1 is compulsory.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

e(01)=01110 e(11)=11011
e(00)=00000 e(10)=10101
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

i) 11110 ii) 10011 iii) 10100

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

of these will be greater than 3000?

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Q.1 a) Prove using Mathematical Induction

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
1 2 + 2 2 + 3 2 + ... + n 2 = n (n + 1) (2n + 1)/ 6

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
(3 hrs)

58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
b) Let A = {a,b,c}. Draw Hasse Diagram for (p(A), ⊆)

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

d) Let f : R O R, where f(x) = 2x – 1 and f-1 (x) = (x+1)/2

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 1 of 2
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

b) Consider the (2,5) group encoding function defined by

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Solve any three questions out of remaining five questions.

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
All questions carry equal marks as indicated by figures to the right.

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

Q.3 a) Construct Truth Table and check if the following statement is tautology.
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

Assume appropriate data whenever required. State all assumptions clearly.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
c) Let A={1,2,3,4,5}. A relation R is defined on A as aRb iff a<b. Compute R2 and R ∞

6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

Decode the following words relative to a maximum likelihood decoding function.

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
Q.2 a) Define Distributive Lattice. Check if the following diagram is a Distributive lattice or not.

C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53

A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83
Max. Marks: 80

(08 M)
(08 M)
(04 M)
(08 M)
(08 M)
(04M)
(05M)
(05M)
(05M)

(04 M)
(05M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?
Q.4 a) A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of
c) How many four digits can be formed out of digits 1,2,3,5,7,8,9 if no digit is repeated twice? How many
b) Prove that set G = {1,2,3,4,5,6} is a finite abelian group of order 6 with respect to multiplication

c) Find the number of positive integers not exceeding 100 that are not divisible by 5 or 7. Also draw

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 /circuit.
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

degree 2.
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

MR=
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

members and 8 students.

D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

reminder of ab divided by n

0
1
1
0

c) Let A = {1, 2, 3, 4, 5}, and let

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

0
0
0
1
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6

0
0
1
0
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

0
0
0
1
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

i) Construct table for the operation ⨀ for n=4

ii) Show that (Zn, ⨀ ) is a semi group for any n
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 2 of 2
*******
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D

c) Determine if following graphs G1 and G2 are isomorphic or not.

95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

equivalence relation. Justify your answer. Find equivalence classes of A.

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83

(08M)
(08M)
(08M)
(08M)
(04M)

b) What is the solution of the recurrence relation an = -an-1 + 4an-2 + 4an-3 with a0=8, a1=6 and a2=26?
(04 M)
(08 M)

(08 M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
b) Find Transitive Closure of R represented by MR as follows using Warshall’s algorithm set {a,b,c,d}.

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

Q.6 a) How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of
c) In how many ways a committee of three faculty members and 2 students can be formed from 7 faculty

R = {(1, 1),(1, 3),(1, 4),(2, 2),(2, 5),(3, 1),(3, 3),(3, 4),(4, 1),(4, 3),(4, 4),(5, 2),(5, 5)} . Check if R is a
Q.5 a) Let Zn denote the set of integers {0,1,2,…n-1}. Let ⨀ be a binary operation on Zn such that a ⨀ b=
diagram has Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit and state the path
b) Define Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit. Determine if following

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

4)
3)
2)
1)

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

module 7
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7

Find (f O f -1 )(x)
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

Use pigeonhole Principle.

( P  Q )  ( Q   P )
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC

corresponding Venn Diagram.

Question no.1 is compulsory.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

e(01)=01110 e(11)=11011
e(00)=00000 e(10)=10101
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

i) 11110 ii) 10011 iii) 10100

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

of these will be greater than 3000?

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Q.1 a) Prove using Mathematical Induction

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
1 2 + 2 2 + 3 2 + ... + n 2 = n (n + 1) (2n + 1)/ 6

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
(3 hrs)

58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
b) Let A = {a,b,c}. Draw Hasse Diagram for (p(A), ⊆)

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299

d) Let f : R O R, where f(x) = 2x – 1 and f-1 (x) = (x+1)/2

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 1 of 2
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

b) Consider the (2,5) group encoding function defined by

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
Solve any three questions out of remaining five questions.

29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
All questions carry equal marks as indicated by figures to the right.

57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

Q.3 a) Construct Truth Table and check if the following statement is tautology.
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

Assume appropriate data whenever required. State all assumptions clearly.

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
c) Let A={1,2,3,4,5}. A relation R is defined on A as aRb iff a<b. Compute R2 and R ∞

6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58

Decode the following words relative to a maximum likelihood decoding function.

A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
Q.2 a) Define Distributive Lattice. Check if the following diagram is a Distributive lattice or not.

C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53

A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83
Max. Marks: 80

(08 M)
(08 M)
(04 M)
(08 M)
(08 M)
(04M)
(05M)
(05M)
(05M)

(04 M)
(05M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?
Q.4 a) A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of
c) How many four digits can be formed out of digits 1,2,3,5,7,8,9 if no digit is repeated twice? How many
b) Prove that set G = {1,2,3,4,5,6} is a finite abelian group of order 6 with respect to multiplication

c) Find the number of positive integers not exceeding 100 that are not divisible by 5 or 7. Also draw

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5
 58 D6 7D D 53 8 6 A 29 5D
58 D61 17D 7D 653 483 366DDA5 5299 95D FC
D 7 7 65 48 6 A 2 5 F 3A
D6 617DD7DD65 348 366 6DA 529 995DDFC C3A 257
1 3 3 D 5 9 2 5
61 7D7 7D6 6534 4836 66D A5 299 5DF FC3 3A2 575 8D6
7D D 53 83 6D A5 29 5D C A2 57 8D 17
17 7D 65 48 66 A 2 95 FC 3A 5 58 61 D
D 6 3 3 D 5 99 D 3 2 75 D 7 7
D7 7D6 534 4836 66D A52 299 5DF FC3 A25 575 8D6 617DD7DD65
D 5 8 6 A 5 C A 8 1 3
7D 653 348 366 DA 529 995DDFC 3A 257 758DD61 7D7 7D6 6534 4836
3 D 5 2 7

77261
D6 6534 483 66D A5 299 95D FC3 3A2 575 58D 617 D7DD65 5348 8366 6DA
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52
65 48 66 A 29 5 FC 3A 57 8 61 D D6 3 83 6D 5 99
3 D D 7 4 6
53 483 366DDA5 5299 95D FC 3A2 2575 58D 617 7D7 D65 534 836 6DAA52 2995 5DF
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 /circuit.
48 366 DA 529 95D FC 3A 257 58D 61 7D 7D6 534 83 66D A5 299 5D FC3 A2

degree 2.
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

MR=
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

members and 8 students.

D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

reminder of ab divided by n

0
1
1
0

c) Let A = {1, 2, 3, 4, 5}, and let

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2

0
0
0
1
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6

0
0
1
0
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6

0
0
0
1
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA

i) Construct table for the operation ⨀ for n=4

ii) Show that (Zn, ⨀ ) is a semi group for any n
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D

Page 2 of 2
*******
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D

c) Determine if following graphs G1 and G2 are isomorphic or not.

95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653 483

A25758D617D7D65348366DA52995DFC3
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48 66
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34 36 DA
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5

equivalence relation. Justify your answer. Find equivalence classes of A.

17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83 66D A5 299
D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D
D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366 DA 52 95 FC
Paper / Subject Code: 50903 / Discrete Structures

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF 3A

48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D 5 99 D C3 2
36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66 A 29 5D FC A 57
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA 52 95 F 3A 25 58
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 52 995 DF C3A 25 758 D6
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D
95 FC 3A 25 58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7
DF 3 25 75 D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6
C3 A2 75 8D 17 7D 65 348 366 DA 529 95 FC 3A 25 58 61 7D 7D 53
A2 575 8D 617 D7 65 34 36 DA 52 95 DF 3A 25 758 D6 7D 7D 653
57 8D 61 D7 D6 34 836 6D 52 99 DF C3 25 75 D6 17D 7D 65 48
58 61 7D D 53 83 6D A5 99 5D C A2 75 8D 17 7 65 34
D6 7D 7D 65 48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83
17 7D 65 348 366 DA 52 95 FC 3A 25 58 61 7D 7D 53 83

(08M)
(08M)
(08M)
(08M)
(04M)

b) What is the solution of the recurrence relation an = -an-1 + 4an-2 + 4an-3 with a0=8, a1=6 and a2=26?
(04 M)
(08 M)

(08 M)

D7 6 34 36 D 52 99 DF 3 25 75 D6 7D 7D 65 48 66
b) Find Transitive Closure of R represented by MR as follows using Warshall’s algorithm set {a,b,c,d}.

D6 534 83 6D A5 99 5D C3 A2 75 8D 17 7D 65 348 366

53 83 66D A5 299 5D FC A2 575 8D 617 D7 65 34 36 D
48 66 A 29 5D FC 3A 57 8D 61 D D6 34 83 6D

Q.6 a) How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of
c) In how many ways a committee of three faculty members and 2 students can be formed from 7 faculty

R = {(1, 1),(1, 3),(1, 4),(2, 2),(2, 5),(3, 1),(3, 3),(3, 4),(4, 1),(4, 3),(4, 4),(5, 2),(5, 5)} . Check if R is a
Q.5 a) Let Zn denote the set of integers {0,1,2,…n-1}. Let ⨀ be a binary operation on Zn such that a ⨀ b=
diagram has Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit and state the path
b) Define Euler Path, Euler Circuit, Hamiltonian Path and Hamiltonian Circuit. Determine if following

36 DA 52 95 F 3A 25 58 6 7D 7D 53 83 66
6D 5 99 D C3 2 75 D 17 7D 65 48 66 DA
A5 299 5D FC A2 575 8D 617 D7 65 34 36 DA 5
29 5D FC 3A 57 8D 61 D7 D6 34 836 6D 52
95 FC 3A 25 58 61 7D D 53 83 6D A5
DF 3 25 75 D6 7D 7D 65 48 66 A 29
C3 A2 75 8D 17 7D 65 348 366 DA 529 9
A2 575 8D 617 D7 65 34 36 DA 52 95
57 8D 61 D7 D6 34 836 6D 52 99
5 6 7 D 5 8 6 A 9 5