Total No. of Questions: 8}
epi www.rgpvonline.com
Total No of Prnced Pages: 2
ap/www.rgpvenline.com
ta
RONG none 1) For he finite state machine shown below, find all
equivalent states and obtain an equivalent finite state
z CS/AIT-224 5 tachins wi he smallest manber of sas
= BE., 111 Semester = sae Ls
i Examination, December 2016 i +2
3 Choice Based Credit System (CBCS) a B D
a Discrete Structure 2 c |G
F Time: Three Hours : Dd E
3 ‘Maximum Marks: 0 3 ze | D
5 Note: i) Atemptany five questions. 3 é eG
i) Allquestonscarry equalmarks. e c
1. 9) LetA.B,Cheany three sets, then prove that a ‘yas
Ax BAC =AXB)VAXO) 3) Teemorpizn of rou
9) Show that ifR, and R, ae 4i) Univeral and existential quantifiers
then, AR, sanequvalence relation on A. eam
2. 8) Letf:R Re defined by /() = 3+ 4, show that fis 4) Hamiltonian paths andeircits
one-one and ono, Givea formula that defines /~! 1) Graph oloring
tb) Prove by the method of mathematical induction that ‘Dy Steal shri il elroy wl a
[Pa ghee! is divisible by 25 forall N. ‘ke graph shownbelow.
st
z 3. a) Stow battesgehaicsoucnre({2+OVE:0.be 1-4) 1S
see 452+
} bene tea eine = Seo
4 cash Gauupieceatenst 1” sy yanstestey lb edie
3 ave ay ape 2 a soltion forthe recurrence relation
3 2) Show thr (oven -pat-av-AVERAOvCPA-) Naa toes .
2 isatautolony. z 8, hay +40)-9 =(r+1)2"
i 5.0) Fafodsominsc rte SueNativaatsopis J chdia, stan ens
the set >) Deseibe:
r={(o Prenat] DT Hite diagam — i) Bloom orem
rroconrane oe
bitp:/wew.rgpvontine.com.
itp:/www.rgpventine.com
twoyomquondsriawnicdyy cat eaediyy I