CS150 Sp 98 R. Newton & K. Pister 1

Size: px
Start display at page:

Download "CS150 Sp 98 R. Newton & K. Pister 1"

Transcription

1 Outin Cok Synronous Finit- Mins Lst tim: Introution to numr systms: sin/mnitu, ons ompmnt, twos ompmnt Rviw o ts, ip ops, ountrs Tis tur: Rviw Ts & Trnsition Dirms Impmnttion Usin D Fip-Fops Min Equivn Inompty Spii Mins ssinmnt & Coin Sms Dsin Exmp: ssin Cos to s Dsin Exmp: Impmnt Usin D ip-ops Dsin Exmp: Impmnt Usin T ip-ops Exmp: Consir t stunt ssoition o vnin min wi ss o t /up. T min wi pt niks, ims, n qurtrs, on t tim. T o rs in wi st to tru wn or mor s n put into t min n t min wi rturn t orrt n. CS Nwton/Pistr 8.. CS Nwton/Pistr 8..2 primry (σ(t)) sonry (q(t)) Dinition: My Min Nxt- Mmory sonry (q(t+)) primry (z(t)) squnti min or My Min n rtriz y t quintup: M = ( S, Q, Z,, ) wr S = init non-mpty st o input symos σ, σ2,..., σi Q = init non-mpty st o stts q, q2,..., qn Z = init non-mpty st o output symos z, z2,..., zm = nxt-stt untion, wi mps Q S i Q = t output untion, wi mps Q S i Z primry (σ(t)) sonry (q(t)) Dinition: Moor Min Nxt- Mmory sonry (q(t+)) primry (z(t)) squnti min is si to o t Moor typ (Moor Min ) i its output untion is untion ony o its stts (i.. : Q i Z) Evry My Min n onvrt to Moor Min n vi vrs. I t Mmory is ok, t mins r Cok, Synronous My n Moor mins rsptivy. CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Dsin Exmp: s, s n s Exmp: Consir t stunt ssoition o vnin min wi ss o t /up. T min wi pt niks, ims, n qurtrs, on t tim. T o rs in wi st to tru wn or mor s n put into t min n t min wi rturn t orrt n. S = {,, 2 } M = ( S, Q, Z,, ) Squnti Min Z = { D, R, R, R, R, R2 } Nxt- n Funtions / t ( symo ropp or rity): q\s 2 q q,d q,d q,r q q,d q,r q,r q q,r q,r q,r2 Nxt, q q q Q = { q, q, q } q Mns tt upon t insrtion o, wn /D t min is in stt q, it wi o to q stt q, t o wi not rs n no n ( ) wi rturn. CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 CS Sp 98 R. Nwton & K. Pistr

2 How out Moor Min? S = {,, 2 } Nxt- Mmory Q = { q, q, q, } Z = { D, R, R, R, R, R2 } / Trnsition T n Trnsition Dirm: Moor Min q\s 2 z q q q q2 D q q q q D q q q2 q D q q q q2 R q2 q q q2 R q2 q q q2 R q q q q2 R q q q q2 R2 Nxt q/d q/r q2/r q/d q/d q/2 q2/r q/ CS Nwton/Pistr 8..7 CS Nwton/Pistr 8..8 Convrsion to My Min q\s 2 q q,d q,d q2,r q q q,d q,r q,r q,r q2,r q,r2 q q,d q,d q2,r q2 q,d q,d q2,r q2 q,d q,d q2,r q q,d q,d q2,r q q,d q,d q2,r Nxt, Min Equivn Lt q n q two stts o mins M n M rsptivy. s q n q r si to quivnt i, strtin wit q n q, or ny squn o input symos ppi to t two mins, t output squns r inti. I q n i r not inti, ty r si to istinuis. Lt M n M two squnti mins. M n M r si to qivnt i or vry stt o M tr xists t st on quivnt stt in M, n vi vrs. Simiry, i M n M r not quivnt w sy ty r istinuis. Two stts q n q r quivnt i: () q n q prou t sm output vus (or My mins, ty must prou t sm or input onitions). (2) For input omintion, q n q must v t sm nxt stt, or quivnt nxt stts. CS Nwton/Pistr 8..9 CS Nwton/Pistr 8.. Minimiztion o Compty-Spii Mins Dsin Exmp: Minimiztion Two stts r si to k-quivnt i, wn xit y n input squn o k symos, yi inti output squns. T min n prtition y tis k-quivn rtion into k-quivn sss. For ny n-stt min, tr n t most (n-) sussiv, istint prtitions. For ny n-stt min, ts quivn sss ontin on n ony on uniqu stt. To minimiz ompty-spii min: () Fin t -quivn sss, 2-quivn sss, t. unti t k+ quivn sss r t sm s t K quivn sss, tn stop. (2) Comin t stts in t sm ss into sin stt. I t min s m quivn sss, t min s m stts. q \ s 2 -prtition q q,d q,d q2,r I q q,d q,r q,r II q q,r q2,r q,r2 III q q,d q,d q2,r I q2 q,d q,d q2,r I q2 q,d q,d q2,r I q q,d q,d q2,r I q q,d q,d q2,r I CS Nwton/Pistr 8.. CS Nwton/Pistr 8..2 CS Sp 98 R. Nwton & K. Pistr 2

3 Dsin Exmp: Minimiztion ssinmnt -prtition q \ s 2 2-prtition q q,d q,d q2,r q q,d q,d q2,r I q2 q,d q,d q2,r q2 q,d q,d q2,r q q,d q,d q2,r q q,d q,d q2,r II q q,d q,r q,r III q q,r q2,r q,r2 q\s 2 q q,d q,d q,r q q,d q,r q,r q q,r q,r q,r2 W must ssin os to symoi vus. Cos or input n output symos r usuy "ivn" so w must trmin os or t stt symos. Tis pross is stt ssinmnt or stt oin. I inry stor mnts r us w n: Øo2(N s )ø < N m < N s CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Dsin Exmp: ssinmnt Minimum-Lnt Co For tis xmp, 2 < N m <. I w oos N m = 2, n ssin os rnomy, tn w v t stt t: q\σ 2,D,D,R,D,R,R,R,R,R2??,????,????,?? unus stt Impmnttion Usin D Fip-Fops Cn us positiv--trir D op-op irty to impmnt stor mnt: S = {,, 2 } Nxt- D Q D Q D Q Q = {,,} Z = { D, R, R, R, R, R2 } CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 Dsin Exmp: ssinmnt On-Hot Co For tis xmp, 2 < N m <. I w oos N m =, n ssin os rnomy ut wr xty on it o t o is "" or vi stt, tn w v t stt t: q\s 2,D,D,R,D,R,R,R,R,R2???,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?? unus stts Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t tt sows t sir nxt-stt vri omintion or stt/input omintion. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..7 CS Nwton/Pistr 8..8 CS Sp 98 R. Nwton & K. Pistr

4 Minimiztion Usin n Impition T Bui omptiiity kin t in r sp, s sown, n row q2, q,... qn n oumn q, q2, qn- (no n or ion). q\s z Minimiztion Usin m Impition T: Summry o ppro Construt n impition t wi ontins squr or pir o stts. L row q2, q,... qn n oumn q, q2, qn- (no n or ion). Compr pir o rows in t stt t. I t ssoit wit stts i n j r irnt, put n in squr i-j to init tt i j (trivi non-quivn). I t n t nxt stts r t sm, put in squr i-j to init i j (trivi quivn). In otr squrs, put stt-pirs tt must quivnt i stts i-j r to quivnt (i t nxt stts o i n j r m n n or som input σ, tn m-n is n impi pir n os in squr i-j). Go trou t non- n non- squrs, on t tim. I squr i-j ontins n impi pir n squr m-n ontins n, tn i j so put n in i-j s w. I ny 's wr in t st stp, rpt it unti no mor 's r. For squr i-j wi not ontinin n, i j. CS Nwton/Pistr 8..9 CS Nwton/Pistr 8..2 Impition T Exmp: Pss Impition T Exmp: Pss n Pss 2 q\s z CS Nwton/Pistr 8..2 CS Nwton/Pistr Impition T Exmp: Fin T Stps to FSM Dsin q\s z Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..2 CS Nwton/Pistr 8..2 CS Sp 98 R. Nwton & K. Pistr

5 Guiins or ssinmnt T i o t oowin uristis is to try to t t 's totr (in t sm impint) on t ip-op input mps. Tis mto os not ppy to proms n vn wn it is ppi it os not urnt minimum soution. s wi v t sm nxt stt, or ivn input, sou ivn jnt ssinmnts ("n-out orint"). s wi r t nxt stts o t sm stt sou ivn jnt ssinmnts ("n-in orint"). Tir priority, to simpiy t output untion, stts wi v t sm output or ivn input sou ivn jnt ssinmnts (tis wi p put t 's totr in t output K- mps; "output orint"). / / / / / / / / {,}; {,}; {,} But How Do You tuy Do It? Writ own o t stts tt sou ivn jnt ssinmnts orin to t ritri ov ("ssinmnt onstrints", or " min onstrints.") Tn, usin Krnu-mp, try to stisy s mny o tm s possi (or us omputr prorm wi os it: Kiss, Nov, Mustn, Ji). Som uiins to p r: ssin t strtin stt to t "" squr on t mp (pikin irnt squr osn't p, sin squrs v t sm numr o jnis n it's sir to rst to ""). Fnout-orint uiins n jny onitions rquir mor tn on sou stisi irst. Wn uiins rquir tt or stts jnt, ts stts sou p witin roup o on t ssinmnt mp. I tr r ony w, t output uiin sou ppi st. I tr r ots o n ony w stts, tn iv mor wit to t tir uiin. CS Nwton/Pistr 8..2 CS Nwton/Pistr ssinmnt: Dsin Exmp q \ s q q, q2, q q, q2, q2 q, q, q q, q2, q q, q6, q q, q2, q6 q, q6, Consir t stt t opposit: Guiin : {q,q2,q,q6} sin v q s nxt-stt wit input. Simiry {q,q,q,q}; {q,q}; {q,q6}. Guiin 2: {q,q2} sin nxtstts o q. Simiry {q2,q}; {q,q}; {q2,q} twi; {q,q6} twi. Guiin : wou not wort usin r. W ry v ot o onstrints n tir is ony on output, mosty. ssinmnt: Dsin Exmp Givn t jny onstrints: : {q,q2,q,q6}; {q,q,q,q}; {q,q}; {q,q6}. 2: {q,q2}; {q2,q}; {q,q}; {q2,q} twi; {q,q6} twi. Coos numr o ip-ops: 6 stts so n t st n no mor tn 6. Try wit -, B, C sy. Tsk is now to oos ssinmnt o -it (C) stt os to q-q6 so tt s mny o t ov onstrints s possi r stisi, in t orr stt rir. C q q6 q 2 6 q2 q q q 7 B C q q q2 2 6 q q q q6 7 B CS Nwton/Pistr CS Nwton/Pistr ssinmnt: Dsin Exmp ssinmnts iv y tri-nrror (qustion: wou w v n to stisy mor onstrints usin ip-ops inst o?). Top ssinmnt s to os: q =, q =, q2 =, q =, q =, q =, q6 = Now w n onstrut t nxt-stt mps or t ssinmnt. {q,q2,q,q6} s BC q q q q2 q 9 q q2 2 8 q q2 q6 7 q q q2 q6 2 6 {q,q} {q,q,q} {q,q6} Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr CS Nwton/Pistr 8.. CS Sp 98 R. Nwton & K. Pistr

6 Guiins or Dtrminin Fip-Fop Equtions rom Nxt- Mp Typ D T EN S-R S R J-K J K Qn = Qn+= CS Nwton/Pistr Qn+= Qn = Qn+= Qn+ = Rus or ormin input mp rom nxtstt mp (2) Qn = no n no n Qn = no n ompmnt no n rp s wit s rp s wit s ompmnt no n i in wit s i in wit s ompmnt Nots: () = "on't r" (2) wys opy s rom nxt-stt mp to input mp irst () For S, Qn= n R, Qn=, i rminin ntris wit s. 8.. Fip-Fop Equtions From Nxt- Mp: Exmp Qn CS Nwton/Pistr Qn Qn Qn+ nxt-stt mp D input mp T input mp Qn Qn S Qn R S-R input mp Qn J-K input mp J K 8..2 Nxt- Mps: Dsin Exmp Coos ip-op typs: D ip-ops R ssinmnts: q =, q =, q2 =, q =, q =, q =, q6 = Construt D input mps rom nxt-stt mp, sustitutin stt os. BC BC s BC n+ Bn+ Cn+ Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Nxt- Mps: Summry o Exmp Driv Equtions rom Mps N 6 ts n t- to impmnt t min usin tis ssinmnt. Strit inry ssinmnt (q=, q=, t.) wou yi ts n 9 t-. T ppro v oo rsuts in tis xmp, ut tt is not wys t s. BC mp rom Trnsition/ T 8 9 CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 CS Sp 98 R. Nwton & K. Pistr 6

7 Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..7 CS Sp 98 R. Nwton & K. Pistr 7

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

d e c b a d c b a d e c b a a c a d c c e b

d e c b a d c b a d e c b a a c a d c c e b FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count

More information

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)

More information

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO

More information

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am 16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram Fractions Overview: Students will analyze standard and nonstandard ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms

More information

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In

More information

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

CS 103 BFS Alorithm. Mark Redekopp

CS 103 BFS Alorithm. Mark Redekopp CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

Designing A Uniformly Loaded Arch Or Cable

Designing A Uniformly Loaded Arch Or Cable Dsinin A Unirmy Ar Or C T pr wit tis ssn, i n t Nxt uttn r r t t tp ny p. Wn yu r n wit tis ssn, i n t Cntnts uttn r r t t tp ny p t rturn t t ist ssns. Tis is t Mx Eyt Bri in Stuttrt, Grmny, sin y Si

More information

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4 Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,

More information

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

In which direction do compass needles always align? Why?

In which direction do compass needles always align? Why? AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on

More information

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work? E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit

More information

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT 0 NOTS: VI UNSS OTRWIS SPII IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION. NR: a. PPITION SPIITION S: S--00 b. PROUT SPIITION S: PS--00 c. PIN SPIITION

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

VLSI Testing Assignment 2

VLSI Testing Assignment 2 1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then: Assinmnts: DFA Minimiztion CMPU 24 Lnu Tory n Computtion Fll 28 Assinmnt 3 out toy. Prviously: Computtionl mols or t rulr lnus: DFAs, NFAs, rulr xprssions. Toy: How o w in t miniml DFA or lnu? Tis is t

More information

The University of Sydney MATH 2009

The University of Sydney MATH 2009 T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs Orniztion Domintors, ontrol-pnn n SSA orm Domintor rltion o CFGs postomintor rltion Domintor tr Computin omintor rltion n tr Dtlow lorithm Lnur n Trjn lorithm Control-pnn rltion SSA orm Control-low rphs

More information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),

More information

Testing Digital Systems. CPE/EE 428, CPE 528 Testing Combinational Logic (3) Testing Digital Systems: Detection. Testing Digital Systems: Detection

Testing Digital Systems. CPE/EE 428, CPE 528 Testing Combinational Logic (3) Testing Digital Systems: Detection. Testing Digital Systems: Detection Tstin iit Systms CPE/EE 428, CPE 528 Tstin Comintion Loi (3) Comintion vs Squnti Systms W sh ovr omintion first Squnti iruits n tst usin omintion tst nrtion n sn hins Th stt FF sr onnt in shift ristr.

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

(4, 2)-choosability of planar graphs with forbidden structures

(4, 2)-choosability of planar graphs with forbidden structures 1 (4, )-oosility o plnr rps wit orin struturs 4 5 Znr Brikkyzy 1 Cristopr Cox Mil Diryko 1 Kirstn Honson 1 Moit Kumt 1 Brnr Liiký 1, Ky Mssrsmit 1 Kvin Moss 1 Ktln Nowk 1 Kvin F. Plmowski 1 Drrik Stol

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d) Functions nd Grps. () () (c) - - - O - - - O - - - O - - - - (d) () (f) - - O - 7 6 - - O - -7-6 - - - - - O. () () (c) (d) - - - O - O - O - - O - -. () G() f() + f( ), G(-) f( ) + f(), G() G( ) nd G()

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,

More information

Planar convex hulls (I)

Planar convex hulls (I) Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

Computer Graphics. Viewing & Projections

Computer Graphics. Viewing & Projections Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted Graphs. Weighted graphs may be either directed or undirected. 1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur

More information

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling. Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017 COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

ECE Experiment #4 Seven Segment Display Interfacing and Timing

ECE Experiment #4 Seven Segment Display Interfacing and Timing ECE 367 - Exprimnt #4 Svn Smnt Disply Intrfin n Timin Sprin 2006 Smstr Introution This xprimnt rquirs tht you onstrut iruit intrfin th MiroStmp11 moul with svn smnt isply, n writ ssmly lnu o to ontinuously

More information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1 Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst

More information

ROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

ROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION ROSOUNT 3051S S PRSSUR TRNSITTR OPNR N PROSS ONNTION RVISION T RVISION O NO. PP' T RT1066757 N. STOS 10/21/2016 SRIPTION IN-IN V S PNTW OUSIN SOWN WIT OPTION IIT ISPY (PRIRY) PNTW OUSIN (PRIRY) RTIITION

More information

ROOM NAME A2.0 A1.10 3'-8" UNIT 2A PROVIDE PERFORATED AND SLEEVED PIPE FOR CONNECTION TO FUTURE RADON MITIGATION SYSTEM. UNIT 1A UNIT 1A 104

ROOM NAME A2.0 A1.10 3'-8 UNIT 2A PROVIDE PERFORATED AND SLEEVED PIPE FOR CONNECTION TO FUTURE RADON MITIGATION SYSTEM. UNIT 1A UNIT 1A 104 IRST OOR OMMON OOR & RM SU IRST OOR OMMON R INIS SU OOR NO. NM OOR RM TYP PIR WIT IT MT' TYP MT' RTIN T RWR 00- VSTIU N '-0" '-" UM - UM - YS PNI VI/NTRY UNTION, OSR 00- VSTIU N '-0" '-" UM - UM - YS PNI

More information

CENTER POINT MEDICAL CENTER

CENTER POINT MEDICAL CENTER T TRI WTR / IR RISR S STR SRST I TT, SUIT SRST, RI () X () VUU T I Y R VU, SUIT 00 T, RI 0 () 00 X () RISTRTI UR 000 "/0 STY RR I URT VU RT STY RR, RI () 0 X () 00 "/0 STIR # '" TRV IST TRI UIIS UII S,

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

Minimum Spanning Trees

Minimum Spanning Trees Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212, Inis Inis Curriulum Ry ACMNA: 09, 0,, 6 www.mtltis.om Inis INDICES Inis is t plurl or inx. An inx is us to writ prouts o numrs or pronumrls sily. For xmpl is tully sortr wy o writin #. T is t inx. Anotr

More information

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method:

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method: Dinition: GREEDY TECHNIQUE Gry thniqu is gnrl lgorithm sign strtgy, uilt on ollowing lmnts: onigurtions: irnt hois, vlus to in ojtiv untion: som onigurtions to ithr mximiz or minimiz Th mtho: Applil to

More information

3 a 15a 6 b 21a 5 c 30a 6 d 12a 9. e 125a 8 f 36a 12 g 90a 13 h 56a a 6a b 5 c 3a 4 d 6a 4. e 10a 4 f 8a 2 g 5a 4 h 12a 2

3 a 15a 6 b 21a 5 c 30a 6 d 12a 9. e 125a 8 f 36a 12 g 90a 13 h 56a a 6a b 5 c 3a 4 d 6a 4. e 10a 4 f 8a 2 g 5a 4 h 12a 2 Answrs Cptr Workin wit surs Eris A Surs 8 6 6 8 6 6 6 + 6 8 6 6 6 6 + 8 + + 8 6 9 6 m ( + m Cptr Simpliin prssions usin t lws o inis Eris A Inis 9 i j 6 k 8 l 6 6 i j k l 6 6 9 8 6 9 6 6 6 8 8 6 9 8 8

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48 AFF. 0 NOOY SYMO S N NOOY NOS: NO: his is a standard symbol list and not all items listed may be used. bbreviations () XSN OV NS OO NMW - UNOUN ONU OY ONO UNS ONO NS O ONO UNS OWN NS OX OX U OP SUON UN OO,

More information

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07

More information

ECE Experiment #6 Kitchen Timer

ECE Experiment #6 Kitchen Timer ECE 367 - Exprimnt #6 Kithn Timr Sprin 2006 Smstr Introution This xprimnt hs you onstrut iruit intrfin nin I/O lins from th 68HC11 with two svn smnt isplys n mtrix kyp, n writ ssmbly lnu o to rliz prormmbl

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance ptr 24 romosoml sis o Inritn 24. Sx-Link Inritn Normlly, ot mls n mls v 23 pirs o romosoms 22 pirs r ll utosoms On pir is t sx romosoms Mls r XY mls r XX opyrit T Mrw-Hill ompnis, In. Prmission rquir or

More information

CS553 Lecture Register Allocation I 3

CS553 Lecture Register Allocation I 3 Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW Smll Pth Quiz ML n Dtss Cn you giv n xprssion tht rturns th lst / irst ourrn o h istint pri lmnt? Ltur 8 Strming Evlution: how muh mmory o you n? Sstin Mnth NICTA n UNSW

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information