0% found this document useful (0 votes)
42 views30 pages

Discrete Structure Bikash Basnet

this for the csit students

Uploaded by

basnetbikash4321
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
42 views30 pages

Discrete Structure Bikash Basnet

this for the csit students

Uploaded by

basnetbikash4321
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 30
4. prove: that Pr all integers —o oO, if wis nas is odd, ——____ When _1n_ts_even using ndutton Prove hat: {24Qd4 G34. 2-2 +08 ={A tata \*. SO ution. Yen is odd. Assemetion: rfc outs oad jre- when 9= Q2K4t1 KetZ : nisa Seis as. SAKre oF &Ck43) Here, @ two times of positive integer is alway a@even: S% when neis odd , nts ig even - since, Dvr assumphon is fase, n te even when nas_is odd! is Avve- PCA) 7 134224924 --. tn? = | 96o41)\% west a Basis Sttp! when N=4 pec /L(aret o { (2124) pay eh . PCL) is trve- Tndethon Hig fotmesis » Leb pony is tre Br nz K- bre pee) it BSag tee eda (Picts) Q _ hyve for n=K44, yo 8 oe Pmt V4 24 (KAY: re Taking © LN ~~ Pets Pa. «Ae Ot et 3 a (ies (oye (e41)2 ™ riage eae ~ Ee = S Bi Ke tesa) ty ts +193 4 let tuk 4) a = (cat)® Gea)? Qu = (Cs 4) tesa) |" ZR. Hes 29 State. pigeonhole Princ pal Seve tne ter RAMEN On = B4Q~ 4-349 + AQ voi inMar nc 3 792 t: “ . wa igdeonhole princital &Aqtes that if trey : —— +1 pigeons in Figeonholes nen Yntie is “4 ten, ONE Pig conhole lon feining, +0 or more Pp ; iFeons. Stott Sol?, Miven yecurrence relotion is. An = 349-173 9N-2 t Ina = The _Chayachertstic ¢q2 fh, y2-a 43-120 Postage V2. 3-722 43-9.17 -12. 20 (y-4)?70 Yok (444. sme3 Since, three Wot Are Same , we vse " Meorem 4 fay Caleotations: The_4 enaral form of tne-tol@ js “ ne n Anz (Asot 444-4 he nt) x n An = [Mot Aayy0 t4y20°)? Crom tne inihal cond ®, as (ea,0 £14 “bola, 93%) ac 5,04 Maya 4 4,2 24 14 X44 4 X49 = 434 aos 3s, * Kaya s?B = ayo = @O__ 28 3. CE fem W) 1 at Og =(Xy 5 + M12 XA te g° 2 oy, += A1V0 Raya 4 4%9,2 = 1 ~ = oy, A+ R (9-44) 4 4 tain (ecm >| oy, St tel gees oo Aaj2 2-64 putting. me vane in_eq2 AD we Hy a. < a ate 2B.L. , the_required Solution: is, _ 7 da (.+ 3:9 ate.ot) 1% Lisa tre neceeisavy tqadiions for tne graph te oe tLomorphic with MLamele Find Wee maim at Flow fer me node force Fohowing Depwore fro fo re sine mM he Whe necessary _ condition ¢ fer aF grave hte SS _iSomorphic ie ore" ee gare Komber of verlices— ve. ‘Wa = \val game: umber of edges ie \el=lel “AR §uyv% in Ey=> fo > diy) Sin Ey AH ep tlagy AE deg eye kK in 4 Aes ‘Cd =e in Gr: ‘ > ‘yA : ch bo -corcers oF ve Ny Ny Wg = Ne ond ab Uy) bay vg) =O then S Of -_ pt - ne’ F (53) yan Os op (#5; 102 To nfs a Gene {#}--— a ME: Coarse: gy OH x SX. cuts (4,4) fay MGW FAO, @c) — {9,03 | 5 9,68} A, (8,03,(8,6) | —_§{4,c} 28,9, 6,6} C18) 6,9) Je, {d,e.63 48,9), (6, 6) ey (Ce 44, 6,>} ACeey 4,0), © €) 0,6) ——14,8,¢} $C, d,¢} 610, 9) (Ge) 14.6.5 Ate Bee ,e) (8,2) (¢, >) Cee EDF) CER) S529 IS45415¢ 295 4 S4522¢ SASS nae S4s45 rts —ScFW fo, py fr ecpe] Fry fiinimem Capacity iy As. By tre max Flow min bo} Meoreen, —— Ma Ximal fow =m intimal Cq ad eee CREE SS q. over Smart people Sree. Stupid. chiyg Gre Nacghty John ts Childeen of OR gag ae dane. « gmard Pepreseak Meese Sbavernente fie iS Prove Vhab toh is avg hty an aN Lee nts 9 people OLX): Overimart People. SUD: Stupid people : the we children att tf Clg) * gis a children of m, a Nig): Q is Mayhty —__niven Premises. _¥», “0(%)— Ste) 7 - Yua, ¢Ui 0 ASO) 9 nla) —_ €€30hn, yane) tentwiten LN (dahn) eC Bohn 9 ane) | NS (dane) eae ins teat yf niven to ‘$csane) $ Bom DEO mes “ponent } ¢ ohn, zane) & niven ¥ C Caohn, sane) NS (Sane) fhem DED Simp a BW (eho) | A Prom | oO k Gin, € seeds 3 fonens 3 a = SW ahich Of We Fenrowireg Are poscas? as CZ, =) fr reflenve: for vefreype. th Aas Syromehic n-ti~ $$ (ib) € 2 (b,4) ez = : sQaeb _ bea $2 ,i+ 1S 2a Symmes. Xi rans tive “i Coyb) .doycy Men (ace). S35 ppsic Yn, Q=-Cc- he. F960 eupoed. bD- (2,4) - fF rtHeyne + Ma) 2. , azg : ae ~ wi Alor Podep » tc) Gwe) eter: Ga) €2 asq, i. Pnti~Symomebies Gib) (ora) €2, Teb, bag. taae. ili- Transifive ¢ (4,6), 6)c) Peen QOL ey Geer em d_Sy.mmerric_closure Find —__&- Define _refievive clasore 4 is divided by 142 us Yre_ remainder ef yxt=n43 — Kernainder Meortm- > tet Ra Yeledtion 5 — baat tontains and Salo Contained _v every — yeflexive_retetrern Vnek cusntains By is called Lefleave close ef % + Ven ang new relat Let ge 4 Helation , tren relation Ron a get a ts Symmetric if (ba) € whenever Ob) ¢ % fr all aben: sols, etx UX" ATS . ac 42) UO2043 (a= +s WX BX = 9073 ze ak Remainder of Pex) 70) = 2b» ee Define ute pain and Hamilton Patty i, Pe S$" of both Coler. pakh_and Hamilton ¢ Euler path isa path nak passes In” oo tedge exact once: Fuler Path iss a. be ———0f edge; - : ed ih oil ws enilien pamme is A Pan Yay ir Ane . d y Vey VerHex exachiy once * 14 SEEN OF Hyyoe heuer edges: orem ———Rxample of pute pani ee Kami lin pat, B= _whad is minima spanning 0c? RANAIN IFAS sa loritn si Moog : For finding minimem 6panoing Aree: > Let Mm be aconne is a $ Panny \ree ___ Rasible weight amory ched grarh L Minimum, Spanning Tree ob of (ype mnininw ny AN Jossible spanning brees isan algorithms. ing tree of Ire KrusKanls algorithm or ae 6 pann efven weighted _invoiwes Be\lowing Steps: _ __ a step iz Vik 3 Fre ediges oF {n_witin_nens deer Asing order of Yheir Wt +5: _ sip 2° selec) me edge of minimem weighs ( \nan one edge of mioin ; Where Gre more weights avbibrarild: chooke Ane of the gelect a9 edge Of sep 3° At _eath- § kage qnimum wet b fem alt ne Yemain dyes, oft if 1) deetne “evens “oy cle witin the previovs) _ selected se ee wep 3 Gant unk) ot eM Tsp He Repent 8. ae eee Se Gy Solorindg Hy Se ne ~Ang-4WO_ Applications of. terete prctathyfioe AEA tree sity N verdvcee hag n-1 edges», oer LAN two APpPlilalion of Graph Coloring Yeoreen Aye: Making Schedore + Regis ker Ullotation tN Me tompilers —ted_us_dake om ree with $74 versiea = A L a € by Wert, Nock vertes ip n=e Owinber of edges, G25 Now, I A'tcording te the qvesyon . rEanet oy 5 T6rL aD wit o. S- = 109. List _any Jwo application $ of Condition «\_probabiiit —_jwo applications of Londiliona) _prsloalo medical diagenosis — ere ee ee ees —__ij._Weather forecasting. Solvtion: total wo: of Families = 9 aw Ahamilies te invite =6 New, Tota) Set of invitations =3c, = 9) (9-6)! 6! = 362-940 9x9 xexor Bl xg = SOY G Se ey +: &Y cif ferent Sets of invitatons <¢! bbe wri tHe - = aimed 3). Find he vaive of x such nat ™ 2 o (mod 3) XE ALmed UW), x23 Cmed 6) and = using chinese Yemainder Yheore™ >So, gcd 9.423 gcd (2 52=h gcd i sd=4 cd (3,3) = 2 cd (Deh gcd th) = _sinw, theg gcd of = See es aS) Weg ore lo-frime bw each omer: MF my xen, x3, SBXYXTXH 2420 Mew Moo. Yas 60 ; ma New May isd oa) = Wo Fy (mel 3) 24 ——— 2.24 (mod 3921 —— os s — nN yh med mm) eb ne 5 2 (med 192 ty (mod WE 7 en ne __gu 33 (med 5) 24 ty (med SED —————————EEEEES i _ My Hy Crood my ed Ge Hy femod WAR See een cua ce a ———— — 2 (Ma 2 AMI Ia 4 Mas ay 4m ryl) i mod a= (140A A421 t joss gs SAS 4 fue sey + box 4 XD) mo eo L2as med yao - 38S $Y. a. State pigeonhole Priawzal Grammer __Pearremvl for Me Fbonacei Oumbers vb 4 fae as recursive Condifpon ard f, 20-04 __ Fy, =4 as initial condition. _D_pigeenhel €_ermerpal Staten treat TF there ore erent pigeons ini Pigconholes then Mere is at Teast on e Ptyton hele containing ____ Awe or more Pigkeo ns: Given relation, —. = fa-a+ fi. —O The _Characterbia equation ©. y2y-2=0 Comat). th antabenaceo, asi, bert .ca-b [se So Versace y¥ oom vs 44 V5 bate» Since, duo Of Me sototion = “rn fae “ky ota sav tax wee = oy tay: 2 AAx, =O Ay = =; —@- @y fy = Ay DAs) a ae 2 S mee F\ 4 4 {iar [en @) Le -o-Vee, 4, -ve Q = a= ~avea, sof ep = 1 OSE Me Yequned fotvtion ce oy an: 4. (tay)? + hy D what is §-3 Got 2 Find Whe mayirnal flow fre Sts t le fom given networn Prov. D_S-d_ cot iy a Ce Of edge Whok x mova} will divide Phe mejwork inte two haves And % wheres Gone -$e x Sine 5 DEX It Nh denoted ey (a, <) Taxing, Hee augmenting Paln Sc 3 fer Erward Piow. Minimum slate = 3 ASncreasing. He ow by 3, : by) aGtafa Mere Arg eNO ferewor RakD“S0_ytae, t : . rahn:$— > qa,4 batkward Parnas augment Parnes 492 y t minimem_$ late = % | sing paugenen ting paki Meteding acre | go ce aD b Ped. Her, prinsslace> Le Flow leg Lin forwards & Subhad Sncrea ging id Flow by 4_in batkward Path: — fay (Sitayy (5,15) + Since, Qo any furtner Patns Are i Sble . d : Pes oy maximum Flows tot Ly ae AS ‘ you ; {Prove Irak if Og positive integer. men ods edd if aga ona T snes mane > Assumphon: if nics poschwe_in tegen,” en O43 wodd if and only it sare_is even when nt Qrat K€ 42 snt+6 > S (2K mts ~ low +64 a (Us et bite 3) Were Deen nik el gare is 050% Site ose assumption i$ False. s¢,9% IP and_omvg_if 5026 “is _pdd_Bemains 27ee = veo — meat “Joly ke ~_§ Define Prapasition consider tne args a_Student in the class Knows how ts inc + Evergone who Knows how. fe write inc ¢ 2 get a high pay ing _dolb-ntows_explain which 0S ~_anferente ore used in each Ope ___— ai Yo AN Shydent £4 } Xx) WG A Byedent of We class Coo No knows Kew be wrilt gv \ pan AC) “1 Ca dtiia igh Paying joo miven Premises Ax, $y 9 OO) / at “ye (ty > Hod) __fonctytion: $0) A HOC) : 7 - QO 4x, Sop? ch) — Aniven_prenis ey. @__scaohay * cCtehn)_§ exishation ingantialo @_ vn 69 Hoy Awiven’ : @_c toh) 9M Liohn) § univenel_inptankietors @__clachn) § From ©, simplifiestiont § Frem fy odut_Panen sy Ww (10h) Vir sigohn) § fem (D,_Sireplifi cohort 6 (john 0 A (gohn? § frm © & GL simp Fhcat} 4x, Sta An 1994 bem Gi), fasten a . Senewali7ZHen}. ati &) Repetition of digits - Pepenion of HOw mens 3 digats numbers. ban be Formed from We ayid 12, S38 and & assuming Tok save ao wed agis are no} BMilewed. As three digits numbers feormed Perr We _ __ digits _4,2,3,4 and 5 can tare ones, nundred, tf We yepebtion of n re termed _ can be tens place respectively agit Are _aqliowed then ones place cai in S ways, sens Place and hitlred plac farmed in SBaee ow dys: fo, re yeh a ~ys_= SAS xX - = tap way bD Since, Aree ‘aye’ Yoree Argib Ge iy consis ones, tens and undated pojition- Ones (ein be fermed tn S paisible ‘ways and Hema int ng. goss tion {an be Rorned yedudng. one from _previows possible sways $0, +0 +4 ne: Po wry = 5xy xX3 ; 4 <~ 60 wys- 1 PInd ne mnsd ate Cy he expansion of ta —~4-}2013 : id Olay Hews, tog Ntantte whit 2 an AD ern a fa Yoere arte (antytt Fxpantivry dp (4 ~gjints : rrp, Wrest 4 Theetforg bere oni ts tee middie Yer eg ay — = Lantiut , t 2odith td - - a ee ee tanaa 4—bang2at——————— = 08 Sart. kA naa ore When asn4t, i neh yee \o 7 ie tn (BY ulisci eb - (n+1) (9!) Z7 ay 142) 1 13 (X) ea) nn) (N42) (ay 2 Go Uesdaate He Dis ketras prin farn from sowte rode by dastinalo 5 EHample nere ,we t have be Find _yerHx Porm a ao d At te and co te fe, we Assi ign “Wwei}hi a te Vertex a yemaining Verti ces. ~fesele Label ae pe vertices adjaen) A Ors_ Wwe Ub) = wt (ar + wk (4,6) = 04646 WET = wh EDA WE LUOQs o4e FL __ Since, hes spicier weight we select ite ertex. ee et 7 e aaa - [tapes «| bdke. aa tec eb; 224273 eee ee vertices ww (bY = VE COT wo ba) “* ae Seve Nak Be Ssaliert Geib ne pele gy Shee —— . Vt Yoon! ww ate q a 4 an a = Lay te ag The vertices AAjnre.t te le on © ag wt (= wh wet Chey ~2sAdré a wb Cay woh Cb) 4 awd te a) _ a >3ag Z b =4 oo Since, a hod minveem weiyht Fy we then d rete Te eT yey — Traver To | 3 12 fate) 7 aaaret for fom ab du 7 nO Ob A lengin = 4 _ Alte, the Shrerie} Path From Ah ES 7 ance Neayey = 6 a ee —_ 9+ Petre foler path and Hamilton Path with examples _ pms the Hasse diagram for We _divisible_ yeation on seh $4, 25/8, 16,324 and find He ymarinsl, minimal greatest “wand Veast herent esisbs >_AN €ovler path ia path that passes Wh roy fers, edge Cxacy OCC: 44 ts qlee called graph of edges Adem Hn Pg is a pal Wot passes Through every vertex exacy once + SF P O10 cated gnoeh of vertices: ae fy-buler gnh fe kramil ton omaeh, \ “Civen Seb ‘ AFSL 2.5)8 wm, 32h 5 divisible peleisn, i Ref (499, (9j2), (15), (1,2), [ le a,32) (2.2), (3,8), A.) 2,82), 692,68 (61s), (8.32), No, 16) lo, 32) (8%, 23% ¥ q bi J _ 1 _ - . —maimal = $ 5) ee ee aga + trrease sp = leas} = 1 _to- Define spanning. tree -mention Ine the Conditions fr: graphs for being isornorphic_veiln an example. 9 Lek We (Y6) be ang connected. grph Peén_an Sobgraph T2' (YE) of given graph t consist! the_vertices in (which _t still connected and av —is_canned_Spanning cee of Ye given graph: - te ————Ihetenditions for two gnphs fer — —__barg_jomorphic wih 29 pamole Sues —E same _nume of verity bee Wusl cup a ii: — Bp tame _numbeer of. pedlges ie. Ey) = WP Lavy io Fy a> Lie, OM4)% in GL IV TP deg Cod = 19 (ny hen deg (Ol) = in ny: Ve A (U2 A Li) wih espe] te Orders of vertees MM Vand b (YW, PEYD 2 PUYSD oh Vy) I} —— es) -d— ViOa)= Y= Vial, <0 E (1) = 3 =E\onl (ny Degree Sequence. 42, 2,223 7 Cy, degree Sequence: $2, 2,2,4 Let, A » Vv (41) 4 vy) @ (A) = 2 dcc2 ob (0) = 4 ocdz 42 Mow adjacent matrix Ff i, bh, ar a b&b cg mone esas L c]4 0 ol 7 : ~gto tT TO - —_ Ae By — ACO = *t1o 411260 R\4 0 O11 3 1 Oo Lt y{o 2 1t 0 xo moyphrc: Sina. AC) zAlDy)- &, , bO, aye Some induction 2 _ Sel, asi 4 rra trem abies 1 Prove had S=1 4 divisible by 4 vit Pri 52-3 Sreps O21, Pas Lae hoe Andee yon hypoln es's* _ Jnduchive step te+ ff is Arve for n=kKit i pots gktha-a a sSs-2 E (UCAS = 2 > g0ct4 =~ (sett) ert, Ch Kare positive. integer $2 sng —owmber rou bplitd by Y_is divisible by SL — 42. Define ceiling amd figor fundtion “hg 4028 need inclesion = Exctesion principle Tepe Ib clear with example. ceiling Fonction ef 4 as Fo, yeund.s yeal Nnember_ on, denoted — : the number vpte He n= a rest In bey-er garea Mer nan _or equal be c= : e-g- _Ta-2] =y_ (Since UY is tre Srmalies + ne pe eater whan 22)- Floor fun cion ®F a real number 7 denoted Of Lt) rounds Ire Number doen te the Dearest jn Heyer bess than _oT eqval_ te >: eg. \e-21 = 3 The inclusion - $xcluyion principle sq counting technique used te Bind Hee cardinality of re_ Union OF mo iple sets = at helps in deter d gets while of Wy aceounting for overlaps between sets. fhe princPlk Can_be brated 23 : inin, 7 uo sets A and a. jave) = 1A +6) — hos) for Yee A 6 E¢ avgvel = 1Alt ie) tio =! Ane) - [endl “Wane atanenc|

You might also like