Practice Test I Bonding and Geometry Name Per

Size: px
Start display at page:

Download "Practice Test I Bonding and Geometry Name Per"

Transcription

1 Prti Tst Boning n Gomtry Nm Pr This is prti - Do NOT ht yourslf of fining out wht you r pl of oing. B sur you follow th tsting onitions outlin low. DO NOT USE A CALCULATOR. You my us ONLY th lu prioi tl. Try to work t p of 1.2 min pr qustion. Tim yourslf. t is importnt tht you prti working for sp. Thn whn tim is up, ontinu working n finish s nssry. 1. Th orrt Lwis symol for groun stt for tomi ron is..... Us th Born-r igrm n th lttr prosss low, to nswr th following fiv qustions. A. Li(s) + ½2(g) Li(g) B. D. (g) + 1 C. Li(s) (g) 2. Wht pross (or its rvrs) orrspons to th ltti nrgy? 3. Wht pross (or its rvrs) orrspons to ltron ffinity? 4. Wht pross (or its rvrs) orrspons to on issoition nrgy (BDE)? 5. Wht pross (or its rvrs) orrspons to ioniztion nrgy? 6. Wht pross (or its rvrs) orrspons to ht of formtion nrgy? + E. Li + (g) ow mny vln ltrons r shown in th Lwis strutur of prhlort ion, O4? Whih of th following ons is most polr?. N. C N. S S. Br Br. O 10. Wht is th siz of th C C O on ngl in ton shown in th Lwis strutur low <120. > Whih of th following ontins ntrl tom tht is n xption to th ott rul?. NO2. 2O. O3. C4. non of ths 7. Whih of th toms low is most likly to violt th ott rul y hving lss thn n ott?. B. P. S. B. 12. Whih of th following is th orrt Lwis strutur for SO2? (Consir forml hrg.).....

2 MC Prti Tst Boning & Gomtry pg 2 of Whih on of th following moluls is polr molul?. 2. CO2. N3. C4. 2S 14. Whih of th following molulr shps hs six toms join to ntrl tom?. othrl. linr. trigonl ipyrmil. ttrhrl. plnr tringulr 15. Whih molulr shp hs on ngls whih r not ll th sm?. linr. plnr tringulr. ttrhrl. trigonl ipyrmil. othrl 16. Wht is th gomtry of th ltron omins in th molul X2. linr. plnr tringulr. ttrhrl. trigonl ipyrmil. othrl 17. Th molul Br3 hs how mny lon pirs of ltrons on th ntrl tom? Wht is th gomtril rrngmnt of ltron omins in 2O?. linr. trigonl ipyrmil. nt. ttrhrl. othrl 19. Wht is th shp of Br3?. squr plnr. pyrmil. T-shp. nt. istort ttrhrl 20. Wht typ of hyriiztion is ssoit with squr plnr molulr shp?. sp. sp 2. sp 3. sp 3. sp Wht is th shp of th 4 ion?. squr plnr. othrl. ttrhrl. T-shp. squr pyrmil 22. Whih of th following is polr spis?. CO2. P5. 2. T4. C4 23. Among thos list low, whih lmnt will hv th strongst tnny to form oul ons?. Br. B.. O. Mg 24. Whih hyriiztion is ssoit with 3 omins?. sp. sp 2. sp 3. sp 3. sp Th molul S4 hs how mny ltron omins on th ntrl tom?

3 MC Prti Tst Boning & Gomtry pg 3 of Wht is th hyriiztion of Br in Br5?. sp. sp 2. sp 3. sp 3. sp Wht shp for ltron pirs is ssoit with sp 3 hyriiztion?. linr. ttrhrl. squr plnr. othrl. trigonl plnr 28. Wht hyriiztion is prit for phosphorus in th P3 molul?. sp. sp 2. sp 3. sp 3. sp A oul on ontins sigm on(s) n pi (π) on(s).. 0, 2. 1, 2. 2, 0. 1, 1. 0, Wht is th smllst ngl tht xists twn omins in n othrl strutur? Whih of th following lmnts is most likly to isply sp 3 hyriiztion?. oxygn. ron. nitrogn. oron. phosphorus 32. ow mny sigm (σ) n pi (π) ons r in ron ioxi molul?. four σ n zro π. two σ n four π. thr σ n two π. on σ n thr π. two σ n two π 33. Wht is th hyriiztion of th oxygn toms in C3O n CO2, rsptivly?. sp 3, sp 3. sp 2, sp 2. sp 3, sp 2. sp 3, sp. sp 2, sp All of th following spis ontin two π-ons EXCEPT. SCN. OCS. CO. NO. 2CCO 35. ow mny unshr pir of ltrons on th ntrl tom in th molul, X2? Whih of th following r tru out B3? i. trigonl plnr ii. on unshr pir of ltrons on B iii. polr molul. i only. i n ii only. i n iii only. ii n iii only. i, ii, n iii 37. Consir th hmil rtion low. B3 + N3 B3N3 During this hmil rtion, th gomtry roun th oron tom hngs from. trigonl pyrmi to ttrhrl. trigonl plnr to ttrhrl. trigonl plnr to othrl. trigonl pyrmi to trigonl ipyrmil. tully its gomtry osn t hng t ll

4 MC Prti Tst Boning & Gomtry pg 4 of Th mlting point of CS is highr thn tht of K. Explntions for this osrvtion inlu whih of th following?. C 2+ is mor positivly hrg thn K +.. V.. only.,, V only. n V only. n only.,,, n V S 2 is mor ngtivly hrg thn Th S 2 ion is smllr thn th ion. Th C 2+ ion is smllr thn th K + ion 39. Typs of hyriiztion xhiit y th thr C toms in propn, C3CC2, inlu whih of th following?. sp. sp 2. sp 3. only. only. n only. n only.,, n 43. n orr to xhiit loliz π oning, molul must hv. t lst two π ons. t lst two rsonn struturs. t lst thr σ ons. t lst four toms. n r oth tru 44. n ozon, O3 th forml hrg on th ntrl tom is Th Lwis strutur of CN shows tht hs nononing ltron pirs.. C, 1. N, 1., 1. N, 2. C, Of th following moluls, whih hs th lrgst ipol momnt?. N3. CO2. O2. 2O. C4 41. Th molulr gomtry of S4 is. s-sw. t-shp. trigonl ipyrmil. othrl. ttrhron 42. n th molul shown with th formul A4 whih lmnt oul in th ntrl position?. S. O. X. P. t oul ithr or 46. Aoring to th VSEPR mol, th progrssiv rs in th on ngls in th sris of moluls C4, N3 n 2O is st ount for y th. inrsing strngth of ons. rsing siz of th ntrl tom. inrsing th ltrongtivity of th ntrl tom. inrsing numr of unshr pirs of ltrons. rsing rpulsion twn hyrogn toms 47. Th hyriiztion of th ron tom in mthn, C4 is. sp. sp 2. sp 3. sp 4. sp Th ntrl ioin tom in 4 hs unshr ltron pirs n on ltron pirs.. 3, 2. 3, 1. 1, 3. 1, 4. 2, 4

5 MC Prti Tst Boning & Gomtry pg 5 of 12 or th nxt 8 qustions rfr to th following moluls. (You might fin it usful to skth strutur for h on.) (A) CO2 (B) 2O (C) C4 (D) N3 (E) Non of th moluls ov stisfy th sttmnt. 49. Th molul whos ntrl tom s ltron omins r not ttrhrl. 50. Th molul with only on oul on. 51. Th molul with th lrgst ipol momnt. 52. Th molul tht hs trigonl pyrmil gomtry. 53. Th molul with t lst on on ngl of Th molul tht xhiits rsonn. 55. Th molul with t lst on pi on. 56. Th molul with no non-on ltron pirs. or nxt 7 qustions rfr to th following moluls. (You might fin it usful to skth strutur for h on.) (A) C2O (B) 2S 64. Wht is th mximum numr of oul ons tht singl ron tom n form? ow mny singl ovlnt ons must silion tom form to hv omplt ott of its vln ltrons? Th on ngls roun th toms 1, 2, n 3 in th molul low r pproximtly,, n rsptivly.. 90, 90, , 120, , 120, , 120, , 90, Th hyriiz oritls roun th C tom mrk #2 in th strutur ov r. sp. sp 2. sp 3. sp 3. sp 3 2 C 1 O C O 2 3 (C) C22 (D) P3 (E) Non of th moluls ov stisfy th sttmnt. 57. Th molul with oul on. 58. Th molul for whih isomrs n writtn. 59. Th molul tht hs trigonl plnr gomtry. 60. Th molul with on ngls of Th molul tht is linr. 62. Th molul with mor thn on pi on. 63. Th molul with no non-on ltron pirs. 68. Of th following toms, whih n not ommot mor thn n ott of ltrons?. P. X. N. S. 69. or whih of th following moluls n vli Lwis strutur not rwn without violtion th ott rul?. PO4 3. Si4. C4. S4. N3

6 MC Prti Tst Boning & Gomtry pg 6 of Th ltron-omin gomtry n molulr gomtry of ioin trihlori r n rsptivly.. trigonl plnr, trigonl plnr. ttrhrl, trigonl pyrmil. trigonl ipyrmil, T-shp. othrl, trigonl plnr. T-shp, trigonl plnr 71. f th ltron omin gomtry of som sulfur-ntr ompoun is trigonl ipyrmil, thn th hyriiztion of th ntrl sulfur tom must.. sp. sp 2. sp 3. sp 3. sp ow mny unhyriiz p tomi oritls r on n sp hyriiz ron tom? Wht woul th ltron-omin gomtry of ntrl tom for whih th hyriiztion of oritls r sp?. othrl. linr. trigonl plnr. trigonl ipyrmil. ttrhrl 76. Whn ounting omins, tripl on. Shoul not ount s omin. Dpns on th gomtry s to how mny omins it shoul ount s. Shoul ount s thr omins. Shoul ount s two omins u to th 2 π ons. Shoul ount s only on omin 77. Th ltron-omin gomtry n th molulr gomtry of molul of th gnrl formul ABx will th sm if. thr r no unshr ltron pirs on th ntrl tom. thr is mor thn on ntrl tom. x is grtr thn 4. x is lss thn 4. th ott rul is oy 78. Whih of th moluls low is nonpolr?. B3. N3. 3. P3. Br3 79. Wht is th molulr gomtry of th 3O + ion?. linr. ttrhrl. nt. trigonl pyrmil. trigonl plnr 74. Th shortst X on ngl in th X4 molul woul pproximtly Whih ovlnt on is th longst. singl. oul. tripl. thy r ll th sm lngth. nonpolr

7 Prti Tst Boning n Gomtry r Rspons 80. Drw th Lwis strutur for ront: CO3 2.. Wht is th shp of th ltron omins roun th ntrl ron?. Wht is th shp of th ront ion?. Wht r th on ngls in ront?. Dos th ront ion xhiit rsonn? f so, rw th rsonn struturs.. Dos loliztion our? Wht os this trm mn? f. Commnt on th on lngths in ront. 81. Bon nthlpy vlus n us to lult n stimtion for rx whn th f vlus r not vill for ll th ompouns in th rtion. Us on nthlpy vlus from th k of your f tls to lult th rx for th rtion low. Do your work in th sp low. Cirl your finl nswr. B sur n ll it ppropritly. 2CN2 + 2O C2O + N3

8 MC Prti Tst (pg 8 of 12) ANSWERS Boning & Gomtry 1. Lwis strutur will rprsnt th vln ltrons, thus you must rliz tht C is 2s2 2p2. Th s2 ltrons will pir n p2 ltrons will in sprt oritls. 2. A Born-r igrm rprsnts hmil rtions tht work togthr. Essntilly it is fny mtho of showing ss Lw. t is us to trmin th nrgy for th rtion of sprting n ioni ompoun into its sprt ions. This is ll ltti nrgy. n th igrm shown, th rrow inits th rvrs of ltti nrgy. 3. Rmmr tht ltron ffinity is th rtion rprsnting th pross of nutrl tom tking in n ltron to prou ngtiv ion. 4. Bon issoition nrgy is th nrgy n to rk prtiulr on. 5. oniztion nrgy is th nrgy rquir to onvrt nutrl tom into positiv ion. 6. Th finition of ht of formtion is th rtion of lmnts in thir stnr form to prou on mol of hmil ompoun. 7. Boron is n nomly in tht it n prou firly stl ompouns with only thr othr toms on to it with singl ons, proviing only 6 vln ltrons roun it () (O) + 1 (xtr ltron) = Th furthr prt two toms r on th prioi tl, th grtr th polrity of on twn thos two toms, thus N n mt this ritri. 10. Th ntrl ron hs 3 omins ( oul on is in two ons, 4 ltrons, ut only ount s on omin). Thr omins lwys rsults in trigonl pyrmi with hs on ngls of 120º. Th pi on of th oul on (th hot og un on) ulgs rsulting in istort trigonl plnr strutur. This ulg fors th othr two ltron pirs wy, rsulting in C C O on tht is slightly lrgr tht 120º. Th C C C on woul slightly lss thn 120º. 11. An ott rul, is th rul tht sys h tom is oning with othr toms in n ttmpt to hiv th stl onfigurtion of 8 vln ltrons. Th NO2 molul n not hiv this us it hs n o numr of vln ltrons. Th lst ltrongtiv tom will om up short with only 7 vln ltrons roun it. 12. Th SO2 molul hs 26 vln ltrons, thus w n 13 lins. Strutur () n rul out us it hs only 12 vln pirs. Strutur () n rul out us th lss hlorin hs mor thn n ott, n w only vr put xpn otts on ntrl toms. Th rmining struturs ll hv forml hrg, thus w must hoos th strutur with th lowst n lst mount of forml hrg, whil pling th ngtiv forml hrg on th most ltrongtiv tom, n th positiv forml hrg on th lst ltrongtiv tom. f you o not know how to ount/pply forml hrg, pls r th k of NS.1 or sk xtr hlp. 13. Dtrmining th polrity of molul is two prt pross. irst you must stlish if thr r ny polr ons, thn you must onsir th rrngmnt of thos ons. f th polr ons r symmtrilly rrng, th polr ons will not nl out, n th molul will polr. Th highly polr N ons, togthr with th trigonl pyrmi strutur of th molul will rsult in polr molul. 14. This is mmoriz th lst strutur low hs six toms tth Rfrring to th igrm ov, you n s tht trigonl ipyrmi hs qutoril toms, 120º prt from h othr, n hs xil toms, only 90º prt from th qutoril toms. 16. irst you must th vln ltrons n thn rw Lwis strutur. Th molul hs 22 vln ltrons giv ris to th 5 omins r trigonl ipyrmi, th 3 unshr pirs whih lwys lot into th xil position mking th gomtry of th molul linr. 17. Agin, thr is no sustitut for ing l to rw orrt Lwis Strutur. Br3 hs 28 vln ltrons rsulting in th Lwis strutur shown. Th fiv ltron omins r trigonl ipyrmi. X Br

9 MC Prti Tst (pg 9 of 12) Boning & Gomtry ANSWERS 18. An urt Lwis strutur with 8 vln ltrons rsults in th Lwis strutur shown. our ltron omins roun th ntrl oxygn tom is ttrhron. 19. Agin, n urt Lwis strutur is ssntil. This is th sm molul s in qustion #17. Th trigonl ipyrmi st of omins with two unshr pir of ltrons on th ntrl romin tom rsults in T-shp molul Br Squr plnr shp molul riss from n six ltron omins whih is n othrl st of ltron omins. Six ltron omins must uilt from six oritls, thus sp32. An urt Lwis strutur rwn with 36 vln ltrons s shown, rsults in six omins roun th ntrl tom, two of whih r unshr pir. Ths two unshr pir will orint opposit to h othr, rsulting in squr shp for th molul. As outlin in th nswr to #13, trmining th polrity of molul is two prt pross. irst you must stlish if thr r ny polr ons, thn you must onsir th rrngmnt of thos ons. T Consiring th rrngmnt rquirs th rwing of urt Lwis struturs to l to look for unshr pirs roun th ntrl tom. f th polr ons r symmtrilly rrng, th polr ons will not nl out, n th molul will polr. All of ths spis hv polr ons, though only th T4 molul, whih hs fiv omins with on unshr pir is unsymmtrilly rrng in th s sw shp. C 23. Oxygn with its s2p4 ltron onfigurtion most oftn forms two ons, ithr two singl ons or on oul on. Boron is l to form 3 or 4 ons, ut rrly oul ons. luorin will NEVER form oul ons. Mgnsium mks ioni ons, n lstly romin with it s 7 vln ltrons is fr mor likly to ngg only in singl oning Thr omins mns 3 oritls must hv n us to mk th hyri oritls tht go into uiling thos 3 omins, thus sp2 hyriiztion prous thos 3 omins. #26 Thr is no sustitut for writing n urt Lwis strutur. 26. Drw Lwis strutur to s th six omins whih mns six oritls must us to mk thos omins. 27. sp3 hyriiztion mns 4 oritls, thus 4 omins, thus ttrhron. 28. P3 hs 26 vln ltrons rsulting in th Lwis strutur shown. Thr r four omins, thus sp3 hyriiztion. 29. All singl ons r sigm ons. Doul ons r m of sigm n pi on. Consir th sigm n pi on in th C=C on in thn. 30. Th othrl strutur hs six omins. S th igrm to th right. 31. n orr for oritls to inlu in th hyriiztion of n tom, th tom must in th thir prio or highr, sin lmnts in th son prio o not hv th pity to hv oritls. 32. Two oul ons must 2 pi n 2 sigm ons. 33. As init y th strutur to th right, th oxygn in C3O hs four omins, initing sp3 hyriiztion, ut th thr omins roun ithr oxygn in CO2 s rwn ov, inits sp2 hyriiztion. 34. SCN hs 16 vln ltrons, OCS hs 16 vln ltrons, CO hs 10 vln ltrons, NO hs 12 vln ltrons, 2CCO hs 16 vln ltrons. Drw th Lwis struturs s shown to th right, n osrv tht only NO hs singl pi on. 35. Th X2 molul hs 22 vln ltrons, rsulting in 3 unshr pirs on th ntrl X tom with its xpn ott. #27 #25 #30

10 MC Prti Tst (pg 10 of 12) Boning & Gomtry ANSWERS 36. B3 is n xption to th ott rul n is molul tht n xist with only six vln ltrons, rsulting in trigonl plnr strutur. Th symmtrilly oppos B ons will rsult in nonpolr molul. t will not hv n unshr pir on th oron tom. 37. Osrv th hnging gomtry of th oron tom s it prtiipts in th Lwis i s rtion shown in th photogrphs of th mol kits. Boron strts with thr omins (trigonl plnr) n ns with four omins (ttrhrl). N : B 39. irst you must rw th molul propn. Pro mns thr ron hin, n mns oul on. Thus th molul hs th strutur shown to th right. Th ron on th lft hs four omins whih woul sp3 hyriiztion, n th ron in th mil n on th right h hv thr omins n r oth sp2 hyriiz. 40. All of th ons in ths fiv moluls r polr, this mns tht you must rw ll fiv Lwis struturs to onsir th symmtry or lk throf of h of th struturs. importnt to rw ll fiv. rom this you shoul l to noti tht in th CO2 n C4 moluls, th polr ons nl out lving thos two moluls s nonpolr. or th rmining thr moluls, th prsn of th unshr pirs on th ntrl tom mk th molul polr. Thus w n to go k to th prioi tl n onsir th ltrongtivity of th toms involv to trmin tht th O on is proly mor polr thn th O or th N ons. N Ltti nrgy is numr tht tlls us th nrgy rquir to onvrt n ioni ompoun into its iniviul gsous toms. Th lrgr th ltti nrgy, th strongr th ioni on. Th strngth of ioni ons is influn y two ftors. irst n formost, th mgnitu of th ioni hrgs, this of ours mks th C2+S2 ioni on strongr thn th K+ ioni on. urthr, th C2+ ion is smllr thn th K+ ion, sin ths two ions r isoltroni with 18 ltrons h, howvr th lium ion hs 20 protons, whil th potssium ion hs only 19 protons B Th S4 molul hs 34 vln ltrons rsulting in th Lwis strutur shown. Th fiv omins on th ntrl S tom, with on of th omins s n unshr pir, rsult in s sw shp. O S C S S 42. f th molul shown hs 4 s, tht woul 28 ltrons, n in orr to n up with th unshr pir on th ntrl tom, w woul n 6 mor vln ltrons. This woul mk you think ithr S or O woul gt th jo on, howvr, sin th ntrl tom is n xpn ott, th ntrl tom must in th thir prio of th prioi tl so tht is n tom tht hs oritls. 43. Dloliz pi oning ours whn molul xhiits rsonn, n in orr to xhiit rsonn, molul must hv oul on, n l to xhiit t lst two vli rsonn struturs. Pls rmmr tht not ll struturs with oul on xhiit rsonn struturs, n somtims thr rsonn struturs n rwn. 44. irst rw n urt Lwis strutur for ozon with its 18 vln ltrons. Thn pply forml hrg. Th oxygn in th mil is ssign 5 ltrons, ompr to th 6 vln ltrons in tomi oxygn, thus it is ssign forml hrg of +1. Th oxygn on th right woul ssign forml hrg of Th CN molul hs 10 vln ltrons rsulting in th Lwis strutur shown to th right. Thus you n s th only nononing pirs rsi on th nitrogn tom. Rmmr tht th forml hrg will is you put nitrogn in th ntr of this molul. t is lwys goo to put ron in th mil of th moluls tht you rw, this wy th ron is unlikly to n up with unshr pirs whih ls to forml hrg. 46. Eh of ths thr moluls hv 8 vln ltrons. This hngs th numr of unshr pirs on th ntrl tom inrss. Unshr pirs of ltrons r hl in pl y only on nulus, not two, n thus tk up mor room, rsulting in grtr rpulsion on th on pirs of ltrons n istorting th ttrhron. 47. Th Lwis strutur of th mthn molul shown in th prvious prolm lrly hs four omins on th ntrl tom, rquiring thr vln oritls, rsulting in sp3 hyriiztion.

11 MC Prti Tst (pg 11 of 12) 48. Boning & Gomtry ANSWERS Th ion hs 36 vln ltrons, rsulting in 18 pirs. Th orrt Lwis strutur is shown to th right. 49. or #49 56, it woul st to rw th Lwis struturs for ll four moluls. hv shown thm to th right. CO2 hs on two omins on th ntrl tom rsulting in linr shp, not ttrhrl. 50. Sin CO2 hs two oul ons, n non of th rmining 3 hv no oul ons, thus you must hoos () non of th ov. 51. Th molul with th lrgst ipol momnt is th sm s th most polr. CO2 hs polr ons, ut is linr n is thus nonpolr. C4 is nonpolr sin its ons r ssntilly nonpolrs, n it hs symmtril shp nywy. f N3 n 2O, th O ons r mor polr thn th N ons, rsulting in mor polr molul. 52. Th four omins with on unshr pir in th N3 molul mk it trigonl pyrmi in shp. 53. Rmmr tht th unshr pirs on 2O n N3 us th ttrhrl st of omins to istort. Thus on unshr pir of ltrons in th N3 molul uss th N on to 107º n th two pir of non-on ltrons in th wtr molul us th O on to 105º. Th O=C=O on in linr CO2 is oviously 180º, thus th C4 molul is th on in whih th C on is 109.5º 54. Non of ths moluls xhiit rsonn. Only th CO2 hs oul ons, ut no othr strutur in whih th oul on hv n shift n writtn. You oul onivl rw CO2 strutur with tripl n singl on, howvr, thr woul forml hrg on this molul n thus mking it not vli, sin thr is no forml hrg on th oul on CO2 molul. 55. Rmmr tht vry oul on is m of on sigm n on pi on, thus th CO2 molul hs two sigm n two pi ons. 56. Whil th CO2 molul hs no non-on pirs on th ntrl tom, it os hv non-on pirs on th oxygn toms. Only th C4 molul hs no non-on pirs on ny of its toms. 57. or #57 63, it woul st to rw th Lwis struturs for ll four moluls. hv shown thm to th right. Only formlhy, C2O hs oul on. 58. No isomrs n rwn for ny of ths simpl moluls. 59. Thr omins prou trigonl plnr gomtry. This hppns roun th ntrl ron in th C2O molul. 60. Th on unshr pir of ltrons in th P3 molul uss th ttrhron of omins roun th nitrogn to istort, rsulting in th th P on to 107º. 61. Ethyn, C22, with it s tripl on, hs linr gomtry roun oth ron toms. 62. Th tripl on in thyn, C22, is m of on sigm on n two pi ons. 63. As you n s it is thyn, C22, whih hs no non-on pirs of ltrons. 64. As in th ron ioxi molul, th ron oul form two oul ons. 65. Silion (lik ron) with it s four vln ltrons n onnt with four singl ons to omplt its ott. 66. n th strutur shown, ron 1 hs four omins, on ngl 109.5º, ron 2 hs thr omins, on ngl of 120º, n oxygn 3 hs four omins, with two of th pirs r unshr, rsulting in on ngl of ~109.5º (105º). 67. Thr omins will lwys sp2 hyriiztion. 68. Atoms in th first or son prio, without ny oritls, n not ommot n xpn ott. 69. Th S4 molul hs 34 vln ltrons, n must rwn with n xpn ott on th ntrl S tom. 70. Agin, thr is no sustitut for rwing Lwis strutur for this molul tht hs 28 vln ltrons. Rmmr tht th unshr pirs in trigonl ipyrmi st of omins lwys r in th qutoril position. sp3 71. Trigonl ipyrmi is fiv omins, whih must hyriiztion. 72. f you hv n sp hyriiz ron tom, th rmining 2 p oritls must unhyriiz. 73. sp hyriiztion is lwys linr in shp. 74. Drw Lwis strutur to s th X ntrl tom hs n othrl st of omins whih will rsult in 90º ngls. S

12 MC Prti Tst (pg 12 of 12) Boning & Gomtry ANSWERS 75. or ons m of th sm two toms, C C, C=C, n C C, th singl on will longst. Th oul ons r shortr us th unhyriiz p oritls must losr togthr for thm to ovrlp n mk th on. 76. A omin is n ltron group orint in th sm gnrl irtion, thus singl omin n singl on, oul on (on omin), tripl on (on omin), or non-on pir. 77. No unshr pirs on th ntrl tom mn tht omin gomtry n molulr gomtry r th sm. 78. Non-polrity will rsult if th polr ons in th molul ll of th ons in th list moluls r polr rrng in non-symmtril rrngmnt. No unshr pirs of ltrons on th ntrl tom will l to non-symmtril rrngmnt. Only th B3 molul hs symmtril trigonl plnr rrngmnt. P 79. Drw Lwis strutur to s tht thr is ttrhron of omins roun th ntrl oxygn tom. 80. Th ront ion hs thr rsonn struturs.. trigonl plnr. trigonl plnr sin thr r no unshr pirs on th ntrl ron.. Thr omins r lwys 120º. ys, th oul on n in ny of th thr possil lotions. ys, th ltrons r lolizs ross ll thr ons. f. th on lngths will ll th sm, somwhr twn singl n oul lngth (losr to singl) 81. = 40 kj Drwing th Lwis struturs will show on invntory will show Bons rking: 1 C=N (615), 2 C (413), 1 N (391), 2 O (463) Bons forming: 1 C O (799), 2 C (413), 3 N (391) Not tht you n nl out 1 N n 2 C from rking n forming for th nt rsult of 40 kj

Chem 104A, Fall 2016, Midterm 1 Key

Chem 104A, Fall 2016, Midterm 1 Key hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn

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

# 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

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

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

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

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

, 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

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S. ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both

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

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

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

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

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

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

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

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

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

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

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

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

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

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

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

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

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

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

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

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

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

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

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

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

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

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012 Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl

More information

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

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/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 2 Eulr s rig prolm

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

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

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

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

Module 2 Motion Instructions

Module 2 Motion Instructions Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr

More information

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii - Nming frtions Chptr Frtions Eh shp rprsnts ONE whol. i ii Wht frtion is shdd? Writ s frtion nd in words. Wht frtion is not shdd? Writ s frtion nd in words. i ii i ii Writ s mny diffrnt frtions s you

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

Binomials and Pascal s Triangle

Binomials and Pascal s Triangle Binomils n Psl s Tringl Binomils n Psl s Tringl Curriulum R AC: 0, 0, 08 ACS: 00 www.mthltis.om Binomils n Psl s Tringl Bsis 0. Intif th prts of th polnomil: 8. (i) Th gr. Th gr is. (Sin is th highst

More information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

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

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers. Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =

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

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Trees as operads. Lecture A formalism of trees

Trees as operads. Lecture A formalism of trees Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn

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

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

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

UNCORRECTED PAGE PROOFS

UNCORRECTED PAGE PROOFS 7 Shps 9 Unrstning lngth isovr n ojts Msurmnt n gomtry Wht informtion n w gthr from 2 shps n 3 ojts? 7 7 7 7 7E 7F 7G 7H 7I Tringl proprtis Quriltrl proprtis 2 shps n 3 ojts Isomtri rwings n plns Nts n

More information

Polygons POLYGONS.

Polygons POLYGONS. Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon

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

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

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

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

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

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

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

8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F

8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F 8A 8B 8C 8D 8E 8F 8G 8H 8I 8J 8K Chptr Wht you will lrn 8Algri thniqus Epning inomil prouts Prt squrs n irn o prt squrs Ftorising lgri prssions Ftorising th irn o two squrs Ftoristion y grouping Ftorising

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

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

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry

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

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

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

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

C-201 Sheet Bar Measures 1 inch

C-201 Sheet Bar Measures 1 inch Janine M. lexander, P.. P.. No. 9, L 0 N. PRK RO, SUIT 0 HOLLYWOO, LORI 0 PHON: (9) - X: (9) 08- No.: 9 I ST SRIPTION Y GT VLVS SHLL RSILINT ST, MNUTUR TO MT OR X TH RQUIRMNTS O WW 09 (LTST RVISION) N

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

This chapter covers special properties of planar graphs.

This chapter covers special properties of planar graphs. Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl

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

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION RVISION RV SRIPTION Y T HNG NO NOT OR PROUT LL JJH // LR TIL PPLY PROUT I LL TIL INSI UPPR ROSS MMR ON PR RK IS J OUR POST RK SQUR HOL RIL IS MN MS G NUT, PNL RNG 99 PPLY PROUT I LL INSI UPPR ROSS MMR

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

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

More information

Physics 222 Midterm, Form: A

Physics 222 Midterm, Form: A Pysis 222 Mitrm, Form: A Nm: Dt: Hr r som usul onstnts. 1 4πɛ 0 = 9 10 9 Nm 2 /C 2 µ0 4π = 1 10 7 tsl s/c = 1.6 10 19 C Qustions 1 5: A ipol onsistin o two r point-lik prtils wit q = 1 µc, sprt y istn

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

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

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm] Powr istriution Short-iruit withstn strngth to EC Short-iruit withstn strngth to EC 439-1 Typ tsting to EC 439-1 During th ours of systm typ-tsting, th following tsts wr onut on th Rittl usr systms n on

More information

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces.

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces. Cmrig Essntils Mthmtis Cor 8 N1.1 Homwork N1.1 Homwork 1 A thr shows hr lss 2 six-si i. On h of thm r th numrs +6, 5, +4, 3, +2, 1. Th two i r roll. Th sor is otin y ing th numrs on th uppr fs. Clult th

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

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

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss

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

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

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

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

Formal Concept Analysis

Formal Concept Analysis Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst

More information