CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

Size: px
Start display at page:

Download "CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014"

Transcription

1 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown in lss n pst exm solutions. 1) Design moulo-6 (ivie-y-6) synhronous up ounter iruit y using 4-it ounters stuie in lss n few gtes : Moulo-6 ounter z5 z4 z3 z2 z1 z The ount rnge is through 59. lerly show the onnetions of inputs n outputs of the hips n gtes. Lel ll the hip pins. Show wht is onnete to ll inputs n outputs. Note tht the 4-it ounter stuie in lss hs the following lk ox view n opertion tle : D B A LD U/D E 4-it Up/Down ounter 4-it Up/Down ounter Opertion Tle LD U/D E Opertion x Store (DBA) (Next ount is DBA) 1 ount Down (Next ount is 1 own) 1 1 ount Up (Next ount is 1 up) x x 1 x Not store x x x Not store NYU Shool of Engineering Pge 1 of 18 Hnout No : 9 Mrh 6, 214

2 2) onsier the following iruit whose lk ox view n internl iruitry re given : Lo D B A LD U/D E 4-it Up/Down ounter Lo Wht is the ounting sequene of the ove iruit? Tht is, etermine the purpose of sequentil iruit, i.e. wht the iruit oes. We o not hve to step through the six nlysis steps sine we know the sequentil iruit is ounter with four flip-flops, wiring n gting. All we hve to o is the timing nlysis n the speifition of the purpose : just the 6 th step! To o the timing nlysis, we will strt with n ritrry ount on the 4-it ounter, suh s,,,, t, 1,, 1, respetively. Then oserve the inputs n outputs of the ounter until we figure out pttern whih then les us to the purpose of the sequentil iruit. For tht, we work on tle tht strts with initil input n output vlues, the vlues t t : is onnete to U/D, so t time t the U/D vlue is time t Lo Initil vlues U/D LD D B A Lo Then, get the outputs t t1 from the input vlues t t : time Lo U/D LD D B A Lo t t NYU Shool of Engineering Pge 2 of 18 S224 Hnout No : 9 Mrh 6, 214

3 Then, get the input vlues t t1 from the output vlues t t1 : is onnete to U/D, so t time t1 the U/D vlue is time t t1 Lo U/D LD D B A Lo Then, get the output vlues t t2, from the input vlues t t1 : time t Lo U/D LD D B A Lo t t2... ontinue ontinue in this fshion to omplete the tle. 3) onsier sequentil iruit with one input n one output. The iruit ontins 3-it lole shift register. The lk-ox view of the sequentil iruit, the 3-it shift register n the opertion tle of the shift register re s follows : x z D LD Opertion 1 Store D 2, D 1, D inputs (Lo) Store,, x (Shift) D 2 D 1 D LD 3-it Shift Register Not store NYU Shool of Engineering Pge 3 of 18 S224 Hnout No : 9 Mrh 6, 214

4 The shift register lwys shifts n so oes not nee shift input. It is loe vlue when its LD input is 1. The implementtion of this sequentil iruit with 3-it lole shift register n 2-it up ounter re s follows : x D f D 2 D 1 D LD 3-it Shift Register Time x e f z t t1 t2 1 t3 1 t4 2-it Up ounter e t5 1 t6 t7 t8 1 t9 e f t1 1 t11 1 x z Determine wht this sequentil iruit oes (the purpose) y ontinuing with the ove tle n showing the vlues for 12 perios. If you nnot figure out the purpose, just write I nnot etermine the purpose. NYU Shool of Engineering Pge 4 of 18 S224 Hnout No : 9 Mrh 6, 214

5 RELEVANT QUESTIONS AND ANSWERS ) onsier sequentil iruit with single input n three outputs. The lk-ox view n implementtion of this sequentil iruit re shown elow. The sequentil iruit uses 3-it register whose opertion tle is lso given elow. x 3-it Register Opertion Tle Lo Opertion 1 Lo (D2, D1, D) Not store X Not store Lo ( x x) 3 3-it ADDer 3-it Register Note tht one input of the ADDer is (xx) where x is input x. Therefore, this input of the ADDer is either 1 when x is or 1 when x is 1. Determine the purpose of this sequentil iruit y ontinuing with the following tle n showing the vlues for 11 perios : out 3 1 D2 D1 D (,, ) y2, y1, y 3 in Time x y2, y1, y ( x x) t t1 1 t2 1 t3 1 t4 Time x y2, y1, y ( x x) t6 t7 t8 t9 1 t1 1 t5 A1) The tle is ontinue elow : The purpose of the iruit is lmost ientil to the purpose of the iruit in Pst Exm Question Homework VI. It is 3-it Up ounter tht ount up - y 1 when x is : 3, 4, 5, 6, 7,, 1, 2,... - y 2 when x is 1 : 7, 1, 3, 5, 7, 1, 3, 5,... The only ifferene is tht when the vlue of x is hnge, the new vlue tkes effet immeitely in this iruit. In the Pst Exm Question 9 iruit, it ffets in the following perio. For exmple, in oth iruits, x is NYU Shool of Engineering Pge 5 of 18 S224 Hnout No : 9 Mrh 6, 214

6 Time x y2, y1, y ( x x) t t t t t Time x y2, y1, y ( x x) t t7 1 1 t t t t hnge from 1 to in t4. The urrent iruit ounts up y 1 in t4. But, the Pst Exm Question 9 iruit ounts up y 2 in t4. This ifferene n e eliminte y elying x y one perio. This n e one y storing it on FF. This question onfirms l n lssroom isussions tht simple sequentil iruit n e onverte to iruit with registers/ounters/shift registers. ) onsier the following sequentil iruit elow. The sequentil iruit hs 3 inputs (x, shift n ler) n 2 outputs (z n vli). It uses shift register isusse in lss. The shift input is tive when the x input hs vli t so we n shift it in. Determine wht the iruit oes, i.e. its purpose. 1 x Shift ler lok? x 1 ler Seril-to-prllel 4-it shift register isusse in lss shift vli z vli omprtor isusse in lss z A2) We will perform sequentil iruit nlysis where the sequentil iruit is omplex. We re not shown the iniviul flip-flops. We re tol wht the four flip-flops in the iruit form seril-to-prllel 4-it shift register isusse in lss. First, the ler input is lwys intive for this iruit. Thus, it hs no effet on the opertion! Seon, we know tht the omprtor iruit ompres two 2-it unsigne inry numers. It outputs 1, if (, ) is greter thn or equl to (, ). For orret opertion, four its must e shifte into the shift register in four perios uring whih the shift input is 1. As long s the shifting is not omplete, the omprtor output is not orret, so its output is not vli. Its output n reflet orret ompre (is vli) when ll four its re shifte in, i.e. when the shift input is. Tht is why, the vli output is the omplement of the shift input. Then, we see tht we hve n opertion perio whih is t lest five perios long : four perios to shift in x n one perio to ompre. It is importnt to relize tht the iruit tht outputs the shift n x signls knows NYU Shool of Engineering Pge 6 of 18 S224 Hnout No : 9 Mrh 6, 214

7 this minimum five perio urtion. We note tht numer (, ) is reeive fter numer (, ) is reeive. We now otin tle to relte the vlues of the lines in the iruit. We lso pik n ritrry it sequene for input x s shown on the tle elow : time Shift x vli z omment t 1 1???? First it is eing reeive t 1 1 1??? Seon it is eing reeive t ?? Thir it is eing reeive t ? Fourth it is eing reeive Thus, this iruit reeives four its serilly, trets them s two 2-it unsigne numers n ompres them. t 4 X ompre output is vli. t 5 X ompre output is vli t First it is eing reeive t Seon it is eing reeive ) onsier sequentil iruit with input n four outputs. The lk-ox view n implementtion of this sequentil iruit with the 4-it ounter isusse in lss re shown elow. Determine wht this sequentil iruit oes y ontinuing with the following tle n showing the vlues for 17 perios 1 1 D B A Lo LD Time Lo t t t U/D E 4-it Up/Down ounter Lo A3) The tle is ontinue elow. This is speil moulo-1 ounter tht lwys ounts s...2, 3, 4, 5, 12, 13, 14, 15,, 1, 2, 3,... NYU Shool of Engineering Pge 7 of 18 S224 Hnout No : 9 Mrh 6, 214

8 Time Lo t t1 1 1 t2 1 1 t t t t t7 1 t8 1 1 Time Lo t9 1 1 t t t t t t t Q4) A sequentil iruit uses two generi 3-it Up ounters : LR E 3-it Up ounter Time EQ y2 y1 y t 1 t1 1 t it Up ounter Opertion Tle LR E Opertion 1 x Store (Next ount is ) 1 ount Up (Next ount is 1 up) x Not store (Do not ount up) 1 Not store (Do not ount up) LR E LR E 3-it Up ounter 3-it Up ounter y y1 y2 A A1 B B1 2-it Unsigne Binry omprtor EQ NYU Shool of Engineering Pge 8 of 18 S224 Hnout No : 9 Mrh 6, 214

9 The lk-ox view, the implementtion with two generi 3-it Up ounters n generi 2-it Unsigne Binry omprtor re shown ove. Determine wht this sequentil iruit oes y ontinuing with the following tle n showing the vlues until pttern emerges. A4) We etermine wht this sequentil iruit oes, y ompleting the tle elow. The ottom ounter (,, ) ounts up from to 7 n then k to. It outputs for one perio, 1 for two perios, 2 for three perios, 3 for four perios, 4 for one perio, 5 for two perios, 6 for three perios n 7 for four perios. It repets this ontinously. If the omprtor were 3-it omprtor, then the numer of perios it woul output vlue woul e one greter thn the vlue ll the time. Time EQ y2 y1 y t 1 t1 1 t t3 1 t4 1 1 t t6 1 1 t t t Time EQ y2 y1 y t t t t t t t t t t2 1 t1 1 1 Q5) onsier sequentil iruit with four outputs. The lk-ox view, the prtil implementtion, the opertion tle of the 4-it up ounter use y the iruit n output vlues for 18 perios re given elow. The prtil implementtion of the sequentil iruit ontins 4-it up ounter n n AND gte for its Lo input. Otin the full implementtion of the iruit whih must ontin (i) the ove 4-it up ounter, (ii) the ove AND gte n (iii) few more gtes. No other omponent n e use! Explin your eision for eh ounter input n the AND gte input. Drw the iruit in your lue ook. NYU Shool of Engineering Pge 9 of 18 S224 Hnout No : 9 Mrh 6, 214

10 ? 4-it Up ounter Opertion Tle Lo E Opertion 1 1 Lo (D3, D2, D1, D) 1 ount up X Not store X Not store????? D3 D2 D1 D Lo E 4-it up ounter Time Lo D3 D2 D1 D t t t t t t t t t t t t t t t t t t A5) The explntion of the inputs n the iruit re elow : NYU Shool of Engineering Pge 1 of 18 S224 Hnout No : 9 Mrh 6, 214

11 E : We see tht the ounter ounts up or los every perio. Therefore, its input must e enle ll the time. E must e permnently onnete to 1 : E = 1 Lo : We see tht the ounter los when is 1 n is 1. Therefore, Lo = D: We see tht D is the omplement of. Therefore, D = D3 D2 D1 D D1 : We see tht D1 is the omplement of. Therefore, D1 = D2 : We see tht D2 is 1 when n re the sme t the sme time. Therefore, D2 = + D3 : We see tht D3 is the omplement of. Therefore, D3 = 1 Lo E 4-it up ounter Q6) A sequentil iruit hs input n four outputs. It uses generi 4-it Up/Down ounter esies other omponents. Its lk-ox view n the opertion tle of the generi 4-it ounter re shown elow : Lo U/D Opertion 1 x Store P inputs (Next ount is P) 1 ount Up (Next ount is 1 up) ount own (Next ount 1 own) x Not store The implementtion of the sequentil iruit is shown elow. Determine wht this sequentil iruit oes y ontinuing with the tle elow n showing the vlues for 21 perios : Time Lo U/D t t NYU Shool of Engineering Pge 11 of 18 S224 Hnout No : 9 Mrh 6, 214

12 4 (,,, ) 4 in A B 4-it ADDer S3 S2 S1 S out P3 P2 P1 P (, 1, 1, 1) Lo U/D 4-it ounter A6) We etermine wht this sequentil iruit oes, y ompleting the tle shown elow : Time Lo U/D t 1 t1 1 t2 1 t t4 1 1 t5 1 1 t6 1 1 Time Lo U/D t t8 1 1 t9 1 1 t1 1 1 t t t Time Lo U/D t t t16 1 t17 1 t18 1 t t2 1 1 The ounter ounts lwys own. Every four ounts, it los vlue y ing (7) 1 to its urrent vlue. The loing hppens when the rightmost two outputs of the ounter re oth. In the given exmple, the ounter hs initil vlue 2. It ounts own to, then los 7 n ounts own to 4, then los 11 n ounts own to 8, then los 15 n ounts own to 12 then los 3 n ounts own to. It repets this ontinuously. Q7) onsier sequentil iruit with input n four outputs. The lk-ox view n implementtion of this sequentil iruit with the 4-it ounter isusse in lss re shown elow. Determine wht this sequentil iruit oes (the purpose) y ontinuing with the ove tle n showing the vlues for 17 perios. Note gin tht this ounter is the 4-it ounter stuie in lss. NYU Shool of Engineering Pge 12 of 18 S224 Hnout No : 9 Mrh 6, 214

13 D B Time Lo t t Lo 1 A LD U/D 4-it Up/Down ounter E A7) The tle is ontinue elow : Time Lo t t1 1 1 t2 1 1 t t4 1 t5 1 1 t6 1 1 t Time Lo t t t t12 1 t t t t16 1 t8 1 1 The sequentil iruit ounts up y 1 if the urrent ount is o or elow 8. Otherwise, it ounts up y 2. Q8) onsier sequentil iruit with one input n one output. The lk-ox view, implementtion of this sequentil iruit with 3-it ounter n the opertion tle of the ounter re shown elow : NYU Shool of Engineering Pge 13 of 18 S224 Hnout No : 9 Mrh 6, 214

14 x z 3-it Up ounter Opertion Tle Lo E Opertion 1 1 Lo 1 ount up X Not store Time x Y Lo z X Not store t 1 t1 1 t2 t3 1 y y 1 y 2 z t4 1 t5 1 t6 1 t7 1 t8 1 t9 1 t1 1 x Lt 3 3 D Q Y Lo LD (y 2 y 1 y ) 1 E 3-it Up ounter t11 1 t12 1 t13 t14 t15 1 t16 1 Y A B 3-it Unsigne Binry omprtor ALTB Lt Determine wht this sequentil iruit oes (the purpose) y ontinuing with the ove tle n showing the vlues for 17 perios. If you nnot figure out the purpose, just write I nnot etermine the purpose. A8) The tle is ontinue elow. The purpose of this sequentil iruit is tht it is sequene etetor tht heks for 5 (five) onseutive 1s : NYU Shool of Engineering Pge 14 of 18 S224 Hnout No : 9 Mrh 6, 214

15 Time x Y Lo z t 1 t1 1 t2 1 1 t3 1 t4 1 1 t5 1 2 t6 1 3 t Time x Y Lo z t9 1 6 t t11 1 t t t14 1 t15 1 t t8 1 5 x X X X z 1 1 It outputs 1 for one perio when it reeives the fifth onseutive 1. Then, it outputs two s n 1. Then, it strts heking gin. Thus, it hs yle of eight (8) perios, mening it heks 8-it sequenes. If it reeives n inorret it, it wits until the urrent 8-it sequene is over n then strts heking for new 8-it sequene. There re no overlppe sequenes. Note tht this iruit with ounter n omprtor hs the ientil purpose of the sequentil iruit in Pst Exm Question of Homework VI with two exeptions : x X X X z 1 1 This prolem shows how one n onvert sequentil iruit with few flip-flops to sequentil iruit with registers, ounters n shift registers s mentione in lss n in the l. Time Time Q9) onsier the Ppm term projet. Assume tht the plying strtegy of the mhine plyer is s follows : Plyer 1 is he? Ply on the (rightmost) lrgest regulr rewr position (iretly if equl) Y N Lrgest regulr rewr is < 5? Y N Ply on the (rightmost) lrgest isply position iretly Ply on the rightmost lrgest jeny position (iretly if equl) onsier the tle elow tht shows the rnom igit, position isplys efore n fter the mhine plyer plys, whether Plyer 1 is he or not, whether the rnom igit is plye iretly or e, the numer of jenies, the NYU Shool of Engineering Pge 15 of 18 S224 Hnout No : 9 Mrh 6, 214

16 points erne y the mhine plyer n whether the mhine plyer plys gin. RD Displys Before Ply Displys After Ply P1 Ahe D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin 3 F F F F F F F 3 No D 3 No Yes D No 9 E 6 F No 4 A E 5 9 Yes 1 F F F Yes Assume tht the oe is 1. The first row shows how the rnom igit is plye y the mhine plyer. A irle is rwn on position if it is plye on. The mening of D/A is Diret/A whih is whether the plyer plys the rnom igit iretly on position or y ing to position. Note tht the ses re inepenent of eh other. Tht is, they o not neessrily follow eh other with respet to time. omplete the tle. A9) The tle is omplete elow. Those entries to e fille out re shown in ol. The positions plye on re shown y irles : RD Displys Before Ply Displys After Ply P1 Ahe D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin 3 F F F F F F F 3 No D 3 No Yes A 1 12 Yes D No D 2 8 Yes 9 E 6 F E F F No A 1 3 Yes 4 A E 5 9 E E 5 9 Yes A 1 28 Yes 1 F F F F F 1 Yes D 9 No ) onsier the Ppm term projet. Assume tht the plying strtegy of the mhine plyer is elow. onsier the tle elow tht shows the rnom igit, position isplys efore n fter the mhine plyer plys, whether the rnom igit is plye iretly or e, the numer of jenies, the points erne y the mhine plyer n whether the mhine plyer plys gin. Assume tht the oe is 7. The first row shows how the rnom igit is plye y the mhine plyer. A irle is rwn on position if it is plye on. The mening of D/A is Diret/A whih is whether the mhine plyer plys the rnom igit iretly NYU Shool of Engineering Pge 16 of 18 S224 Hnout No : 9 Mrh 6, 214

17 Y Lrgest jeny is? N Lrgest regulr rewr is < (1) 1 Y N Ply on the (rightmost) lrgest jeny position (iretly if equl) Skip Ply on the (rightmost) lrgest regulr rewr position (iretly if equl) on position or y ing to position. Note tht the ses re inepenent of eh other. Tht is, they o not neessrily follow eh other with respet to time. omplete the tle. RD Displys Before Ply Displys After Ply D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin 1 E F E F E F F F A 2 6 Yes F F 8 E A1) The tle is omplete elow. Those entries to e fille out re shown in ol. The positions plye on re shown y irles : RD Displys Before Ply Displys After Ply D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin 1 E F E F E F F F A 2 6 Yes D 3 Yes 7 Skip Skip Skip Skip 2 1 F A 3 8 Yes 7 F 8 E 7 F D 1 14 Yes D 3 48 Yes Note tht the mhine plyer oes not hek for oe igits n so misses lrge rewr points on rows 3, 5 n 6. The rnom igits on these rows enle it to ply the oe igits. NYU Shool of Engineering Pge 17 of 18 S224 Hnout No : 9 Mrh 6, 214

18 1) onsier the Ppm term projet. Assume tht the plying strtegy of the mhine plyer is s shown elow. onsier lso the tle elow tht shows the rnom igit, Plyer 1 points in eiml, position isplys efore n fter the mhine plyer plys, whether the rnom igit is plye iretly or e, the numer of jenies, the points erne y the mhine plyer n whether the mhine plyer plys gin. Skip Y Lrgest regulr rewr is =? Ply on the (rightmost) lrgest zero position iretly (if equl) N Plyer 1 oes not hve (64) 1 or more points & there is position with zero & RD is not? Y N Ply on the (rightmost) lrgest regulr rewr position (iretly if equl) Assume tht the oe is 79. A irle is rwn on position if it is plye on. The mening of D/A is Diret/A whih is whether the plyer plys the rnom igit iretly on position or y ing to position. Note tht the ses re inepenent of eh other. Tht is, they o not neessrily follow eh other with respet to time. omplete the tle. RD P1PT (Deiml) Displys Before Ply Displys After Ply D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin F F E E F E 7 9 A11) The tle is omplete elow. The isplys plye on re shown in ol n irle : RD P1PT (Deiml) Displys Before Ply Displys After Ply D/A The Ajeny Points Erne (Deiml) Mhine plyer plys gin F 9 A 15 N 7 29 F F F 7 7 A 1 3 Y 1 53 F E E F E 1 E D 1 N A Y 238 F E 7 9 F E 7 9 A 15 N We oserve tht the mhine plyer misses hne to ern oe rewr points when RD is 7 n. But, y hne, it erns oe rewr points when RD is 4. NYU Shool of Engineering Pge 18 of 18 S224 Hnout No : 9 Mrh 6, 214

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts. Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2 EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register

More information

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz Welome nge Li Gørt. everse tehing n isussion of exerises: 02110 nge Li Gørt 3 tehing ssistnts 8.00-9.15 Group work 9.15-9.45 isussions of your solutions in lss 10.00-11.15 Leture 11.15-11.45 Work on exerises

More information

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering 5 INPUT MAPS (A) Loop squres with no friens, they n never shre. (B) Loop squres with no rothers, n simutneously loop their friens. Iterte: (A') Loop squres seperte from friens

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering 5 IN UT P MAPS (A) Loop squres with no friens, they n never shre. (B) Loop squres with no rothers, n simutneously loop their friens. Iterte: (A') Loop squres seperte from friens

More information

Writing Exams: Writing Exams. Exam Review

Writing Exams: Writing Exams. Exam Review riting Exms: riting Exms Exm Review riting Exms synhronous iruits += Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

5. Every rational number have either terminating or repeating (recurring) decimal representation.

5. Every rational number have either terminating or repeating (recurring) decimal representation. CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd

More information

MCH T 111 Handout Triangle Review Page 1 of 3

MCH T 111 Handout Triangle Review Page 1 of 3 Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection NMOS Trnsistors in Series/Prllel onnetion Leture 6 MOS Stti & ynmi Logi Gtes Trnsistors n e thought s swith ontrolled y its gte signl NMOS swith loses when swith ontrol input is high Peter heung eprtment

More information

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006 2:221 Principles of Electricl Engineering I Fll 2006 Nme of the student nd ID numer: Hourly Exm 2 Novemer 6, 2006 This is closed-ook closed-notes exm. Do ll your work on these sheets. If more spce is required,

More information

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important!

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important! ECE-238L: Computer Logi Design Fll 23 Solutions - Homework (Due dte: Septemer 2th @ 9:3 m) Presenttion nd lrity re very importnt! PROBLEM (5 PTS) ) Simpliy the ollowing untions using ONLY Boolen Alger

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

10. AREAS BETWEEN CURVES

10. AREAS BETWEEN CURVES . AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

Pythagoras Theorem. Pythagoras Theorem. Curriculum Ready ACMMG: 222, 245.

Pythagoras Theorem. Pythagoras Theorem. Curriculum Ready ACMMG: 222, 245. Pythgors Theorem Pythgors Theorem Curriulum Redy ACMMG:, 45 www.mthletis.om Fill in these spes with ny other interesting fts you n find out Pythgors. In the world of Mthemtis, Pythgors is legend. He lived

More information

DeMorgan s Theorem. The dual DeMorgan D + E = D E D+E D E 1 D NOR D E. Slide 29 Modified; January 3, 2006 John Knight Digital Circuits p.

DeMorgan s Theorem. The dual DeMorgan D + E = D E D+E D E 1 D NOR D E. Slide 29 Modified; January 3, 2006 John Knight Digital Circuits p. DeMorgn s Theorem DeMorgn s Theorems, Simple orms DeMorgn s Theorem DeMorgn s Theorems, Simple orms DeMorgn The ul DeMorgn A + B = A B (DeM) D + E = D E (DeM2) Inverse The ul inverse A + B = A B D E =

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Year 10 Maths. Semester One Revision Booklet.

Year 10 Maths. Semester One Revision Booklet. Yer 0 Mths. Semester One Revision Booklet. Nme YEAR 0 MATHEMATICS REVISION BOOKLET AND STUDY SUGGESTIONS NAME: READ through ALL of this vie prior to strting your revision. It is essentil informtion. Chpters

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Probability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright

Probability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright Proility The Lnguge of Chne Stuent Book - Series L-1 P(A) Mthletis Instnt Workooks Copyright Proility The Lnguge of Chne Stuent Book - Series L Contents Topis Topi 1 - Lnguge of proility Topi 2 - Smple

More information

Exercise 3 Logic Control

Exercise 3 Logic Control Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled

More information

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e . Proility C h p t e r t G l n e Rnom Experiment : An t in whih ll possile (outomes) results re known in vne ut none of them n e preite with ertinty is lle rnom experiment. For e.g. When we toss oin, we

More information

Trigonometry Revision Sheet Q5 of Paper 2

Trigonometry Revision Sheet Q5 of Paper 2 Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

8.3 THE HYPERBOLA OBJECTIVES

8.3 THE HYPERBOLA OBJECTIVES 8.3 THE HYPERBOLA OBJECTIVES 1. Define Hperol. Find the Stndrd Form of the Eqution of Hperol 3. Find the Trnsverse Ais 4. Find the Eentriit of Hperol 5. Find the Asmptotes of Hperol 6. Grph Hperol HPERBOLAS

More information

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering DIGITAL VLSI Consensus, use Krnugh + + = + + + 2n Distriutive (X + A)(X + ) = X + A DESIGN Simplifition YX + X = X Generl DeMorgn Asorption Y + XY = X + Y F(,,... z,+,.,,) F(,,...

More information

XML and Databases. Exam Preperation Discuss Answers to last year s exam. Sebastian Maneth NICTA and UNSW

XML and Databases. Exam Preperation Discuss Answers to last year s exam. Sebastian Maneth NICTA and UNSW XML n Dtses Exm Prepertion Disuss Answers to lst yer s exm Sestin Mneth NICTA n UNSW CSE@UNSW -- Semester 1, 2008 (1) For eh of the following, explin why it is not well-forme XML (is WFC or the XML grmmr

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

The Stirling Engine: The Heat Engine

The Stirling Engine: The Heat Engine Memoril University of Newfounln Deprtment of Physis n Physil Oenogrphy Physis 2053 Lortory he Stirling Engine: he Het Engine Do not ttempt to operte the engine without supervision. Introution Het engines

More information

Transition systems (motivation)

Transition systems (motivation) Trnsition systems (motivtion) Course Modelling of Conurrent Systems ( Modellierung neenläufiger Systeme ) Winter Semester 2009/0 University of Duisurg-Essen Brr König Tehing ssistnt: Christoph Blume In

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris

More information

CHEM1611 Answers to Problem Sheet 9

CHEM1611 Answers to Problem Sheet 9 CEM1611 Answers to Prolem Sheet 9 1. Tutomers re struturl isomers whih re relte y migrtion of hyrogen tom n the exhnge of single on n jent oule on. Compoun Tutomer 2 2 2 2 2 2 2 2 2 2 2 2. () Whih pir

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

3 Regular expressions

3 Regular expressions 3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll

More information

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

More information