Probability. Probability. Curriculum Ready ACMSP: 225, 226, 246,

Size: px
Start display at page:

Download "Probability. Probability. Curriculum Ready ACMSP: 225, 226, 246,"

Transcription

1 Proility Proility Curriulum Ry ACMSP:, 6, 6, 7

2

3 Proility PROBABILITY Proility msurs th hn of somthing hppning. This mns w n us mthmtis to fin how likly it is tht n vnt will hppn. Answr ths qustions, for working through th hptr. I us to think: Wht is n outom? Wht is th rng of proility from impossil to rtin? Wht is th proility of rolling 6 with singl i? Answr ths qustions, ftr working through th hptr. But now I think: Wht is n outom? Wht is th rng of proility from impossil to rtin? Wht is th proility of rolling 6 with singl i? Wht o I know now tht I in't know for? 00% Proility Mthltis 00% P Lrning J

4 Proility Bsis Bsi Dfinitions Hr r four si trms for proility: Evnt An vnt is sitution whih oul hv iffrnt outoms. Outom An outom is possil rsult of n vnt. Smpl Sp All th possil outoms. For xmpl, th sm sp of rolling i is {,,,,, 6} n th smpl sp of tossing oin is {H, T}. Rnom Evnt An vnt with qully likly outoms. Lt's sy g ontins r stons n lu stons. On of th stons is pull out Th vnt is tht ston is slt from th g. Th possil outoms r tht r ston or lu ston oul slt. So th smpl sp is {R, B}. Th vnt is rnom vnt us thr r th sm numr of r stons s lu stons. If thr ws only on lu ston, thn th vnt woul not rnom us it is mor likly tht r ston is rwn. Rltiv Frquny Eh outom hs rltiv frquny whr Rltiv frquny numr oftims outom ours totlnumroftrils So rltiv frquny n hng from xprimnt to xprimnt. Hr is n xmpl: A g is full of 0 r, 0 lu n 0 grn stons. Lt's sy stons r rwn from th g t rnom in this orr: R G G B G G B B R R R G Th rltiv frquny of r stons is Th rltiv frquny of lu stons is Th rltiv frquny of grn stons is. or.. or Th nxt tim stons r rwn, thy r rwn in this orr: Th rltiv frquny of r stons is 6 Th rltiv frquny of lu stons is. B B G R R B R R B R B R G G or. 7 Th rltiv frquny of grn stons is. Rltiv frquny is lso somtims ll "xprimntl proility". J 00% Proility Mthltis 00% P Lrning

5 Proility Qustions Bsis. A oin is toss on. Wht is th smpl sp (th possil outoms)? Is this rnom vnt? Why?. A singl i is roll tn tims n ths r th numrs it shows:,,,,, 6,,,, Wht is th smpl sp of rolling i n is rolling i rnom vnt? Why? In this xprimnt, wht is th rlvnt frquny of ing roll? In this xprimnt, wht is th rlvnt frquny of ing roll?. A ox ftory noti tht 6 out of 7 oxs wr rokn. Wht is th rltiv frquny of rokn oxs? Wht is th rltiv frquny of unrokn oxs? If th ox ftory prou 600 oxs, wht numr of ths oxs is likly to rokn? 00% Proility Mthltis 00% P Lrning J

6 Proility Qustions Bsis. A fruit shop uys fruit oring to this tl: Fruit Numr ought Appls 8 Phs 78 Apriots 8 Orngs 7 Bnns 8 How mny itms of fruit wr ought in totl? Wht is th rltiv frquny of priots? Wht is th rltiv frquny of orngs? Th ownr notis tht of th ppls h ought wr rottn. Wht is th frquny of rottn ppls within th ppls? If th ownr ought 60 ppls ovr wk, how mny ppls shoul thy xpt to rottn? J 00% Proility Mthltis 00% P Lrning

7 Proility Knowing Mor Proility A g ontins r ston, lu ston n grn ston. If you hoos ston without looking, wht r th hns you will hoos r ston? Th proility woul. This is th formul to fin th proility of n outom "X": numrofwysx oul our P ^Xh totl numr ofoutoms Th 'totl numr of outoms' is lso th siz of th smpl sp. Hr is n xmpl: A singl i is roll, nswr th following qustions How mny possil outoms r thr? 6 (th i oul roll,,,, or 6) Wht is th proility tht is roll? numr of wys to roll P^h totlnumrofoutoms or 06. o 6 Wht is th proility tht n vn numr is roll? P^vnh numr of vn rolls totlnumrofoutoms or 0. Wht is th proility tht numr grtr thn is roll? numr of rollsgrtr thn P^ h totl numr ofoutoms or 06. o 6 6 Th formul for proility oul lso us in othr wys. A wthmkr slts 00 of his wths t rnom n notis 6 of thm r fulty. Wht is th rltiv frquny of fulty wths? numroffultywths If th wthmkr m 00 wths in totl, how mny woul h xpt r fulty? P^fultyh numroffultywths totlnumrofwths 6 numroffultywths numr of fulty wths 00 # This will not finitly hppn. It is just n xpt vlu s on th proility. 00% Proility Mthltis 00% P Lrning J

8 Proility Knowing Mor Proility is Alwys Btwn 0 n Th numr of wys ny outom X n our will lwys lss thn or qul to th totl numr of outoms. So th proility will lwys frtion. This mns tht: 0 # P^Xh# If P ^X h 0 it mns tht th outom X is impossil. If P ^X h, it mns tht th outom X is rtin. Th losr P^Xh is to 0, th mor unlikly X is n th losr P^Xh is to th mor likly X is. If you fin proility grtr thn thn mistk hs n m somwhr. Complmntry Proility Th omplmnt of n outom is whn th outom osn't our. Th nottion X u (u is ll til) mns th omplmnt of X n so P ^ X u h mns th proility of X not ouring. Th totl proilitis of th outoms must up to n so P^Xh + P^Xu h. This mns w n us th formul: P^Xu h -P^Xh A g ontins lu stons, grn stons n r stons. Answr ths qustions if on ston is rwn t rnom Fin th proility tht th ston will not lu. Fin th proility tht th ston will not r. P^not luh -P^luh - P^not rh -P^rh - 7 Fin th proility tht th ston will not grn. P^not grnh -P^grnh - 6 J 00% Proility Mthltis 00% P Lrning

9 Proility Qustions Knowing Mor. A ook hs 0 pgs n is opn to rnom pg. Wht is th proility it opns on pg 89? Wht is th proility it is opn to n o pg? Wht is th proility of opning to pg 6 or ftr? Wht is th proility of opning to pg ftr pg 6? Wht is th proility tht it is not opn to pg 0? f Wht is th proility tht it is opn to pg numr whih is multipl of? g Wht is th proility tht th pg is not multipl of? h How r th nswrs from f n g rlt? Why? 00% Proility Mthltis 00% P Lrning J 7

10 Proility Qustions Knowing Mor. You noti tht whn tking tst, you gt out of th first qustions inorrt. Wht is th xprimntl proility of inorrt nswrs s on this informtion? Bs on this informtion, how mny qustions woul you xpt r inorrt if th tst totll 80 qustions?. A stnr k of rs (with no jokrs) is shuffl n pl f own n spr out. If r is rwn t rnom, wht is th siz of th smpl sp? If r is rwn t rnom, wht is th proility it is n? If r is rwn t rnom, wht is th proility it is th of sps? If r is rwn t rnom, wht is th proility it is not imon? If r is rwn t rnom, wht is th proility it is r? 8 J 00% Proility Mthltis 00% P Lrning

11 Proility Qustions Knowing Mor. A lirry hs ooks out sport, foo n history only. Th proility of slting singl history ook is 9. How mny history ooks woul you xpt to in group of 6 rnomly slt ook? Th proility of slting singl ook out foo is 9. Wht is th proility of slting singl ook out sport? If ooks r slt t rnom, how mny of h typ of ook oul xpt to slt? 00% Proility Mthltis 00% P Lrning J 9

12 Proility Qustions Knowing Mor. Th lttrs from th wor Mississippi r put into g. Answr th following qustions if singl lttr is rwn: Wht is th smpl sp of this xprimnt? (Hint: How mny iffrnt lttrs r thr?) Whih lttrs hv th grtst hn of ing slt? Why? Wht is th proility of slting n 's'? Wht is th proility of not slting th 'M'? 0 J 00% Proility Mthltis 00% P Lrning

13 Proility Using Our Knowlg Mutully Exlusiv Evnts Mutully xlusiv vnts r vnts tht nnot our t th sm tim. If thy r not mutully xlusiv thy r ll inlusiv vnts. For xmpl, rolling n rolling with singl i r mutully xlusiv vnts thy n't hppn t th sm tim. If X n Y r mutully xlusiv vnts thn P^Xor Yh P^Xh+ P^Yh. Fin th proility of rolling or with singl i P^or h P^h+ P^h Hr is n xmpl ompring mututlly xlusiv vnts n inlusiv vnts: A ook hs 0 pgs n is opn to rnom pg. Whih of ths r mutully xlusiv? X: Th pg numr is multipl of X: Th pg numr is multipl of 0 Y: Th pg numr is vn Y: Th pg numr is o Ths r inlusiv vnts us 0 n 0 r multipls of n vn whih mns X n Y n hppn t th sm. Ths r mutully xlusiv vnts us thr r no numrs whih r multipls of 0 n o. So X n Y n't hppn t th sm tim. ` P^Xor Yh! P^Xh+ P^Yh ` P^Xor Yh P^Xh+ P^Yh Numrs from 0 Numrs from 0 Multipls of Evn numrs O Numrs Multipls of 0 In th Vnn igrm ov it's sy to s tht 0 n 0 r oth multipls of AND vn numrs. Th sts ovrlp. In th Vnn igrm ov it's sy to s tht th sts of multipls of 0 n o numrs r mutully xlusiv. Th sts o not ovrlp n r sprt. 00% Proility Mthltis 00% P Lrning J

14 Proility Using Our Knowlg If X n Y r inlusiv thn thr is n xtr stp to fin P^Xor Yh. Sutrt th proility of th 'ovrlpping' outoms. To ontinu th xmpl from th prvious pg. A ook hs 0 pgs n is opn to rnom pg. Fin th proility tht th pg numr is vn OR multipl of X: Th pg numr is multipl of Numrs from 0 Y: Th pg numr is vn P^Xor Yh P^Xh+ P^Yh- P^Xn Yh Sin som pg numrs r in oth X n Y thy shouln't ount twi Multipls of Evn numrs Compoun Evnts A ompoun vnt involvs mor thn on outom. It oul hv two stgs or mor. To fin th proility of ompoun vnts, fin th proility of h outom n multiply thm togthr. A g hols 6 r stons n lu stons. Fin th proility of rwing two lu stons from two rws. Stp : Fin th proility tht th first ston is lu. P^ststonisluh numroflustons totlstons 0 Stp : Fin th proility tht th son ston is lu. numroflustonsrmining P^nstonisluh totlstonsrmining 9 Thr is on lss lu ston from th prvious rw Thr is on lss ston in th g from th prvious Stp : Multiply th proilitis togthr: P^lustonsh P^ststonis luh# P^n stonisluh # J 00% Proility Mthltis 00% P Lrning

15 Proility Using Our Knowlg Tr Digrms Tr igrms r us with ompoun vnts to s ll th possil outoms (th smpl sp). A g ontins r, grn n lu ston. Wht r ll th possil mthos to slt two stons? First rw Son rw Smpl sp R B G R B G R B G R B R R R B B B G G R B G R B G R B Smpl sp (ll possil outoms) From th tr igrm w n tht thr r 8 possil outoms in this smpl sp. {RR, RB, RG, BR, BB, BG, GR, GB} (GG is not in th smpl sp us thr is grn ston.) Wht is th proility tht lu ston is slt first n r ston slt son? (without rpling th lu ston) P^BRh # Wht is th proility of rwing on r n on grn ston? Thr r two possil outoms with on r ston n on grn tl: GR n RG P^GR or RGh P^GRh+ P^RGh ` # # j+ ` j 0 Noti th iffrn twn n. In, th orr mttrs so thr is only on wy to rw lu first n r son. In, th orr osn't mttr, so oth GR n RG r ount. 00% Proility Mthltis 00% P Lrning J

16 Proility Using Our Knowlg Tls for Two-Stg Evnts If th ompoun vnt is just two-stg vnt, thn two-wy tl n us. Two multipl hoi qustions with options A, B n C n to nswr. How mny possil wys r thr to nswr th qustions? Q Q A B C A AA BA CA B AB BB CB C AC BC CC Thr r 9 possil wys to nswr th Q n Q: {AA, BA, CA, AB, BB, CB, AC, BC, CC}. So th smpl sp siz is 9. Wht is th proility tht oth nswrs r A? Only on outom hs oth nswrs s A. ` P^oth nswrsr Ah P^AAh 9 Wht is th proility tht oth nswrs r th sm? P^sm nswrsh P^AAor BBor CCh P^AAh+ P^BBh+ P^CCh Wht r th hn tht th nswrs r iffrnt? P^iffrnt nswrsh -P^sm nswrsh - To fin th smpl siz of ompoun vnt without tl or tr igrm, multiply th smpl sizs of h stg. In th xmpl ov thr r wys to nswr Q n wys to nswr Q, so th smpl siz is # 9. A rsturnt srvs strtrs, mins n ssrts. How mny wys r thr to orr thr ours ml of strtr, min, n ssrt? strtrs # mins# ssrts # # 60 iffrntwystoorrthroursml. J 00% Proility Mthltis 00% P Lrning

17 Proility Qustions Using Our Knowlg. Wht is th iffrn twn mutully xlusiv vnts n inlusiv vnts?. Intify in th following if outoms A n B r mutully xlusiv or not. Giv rson why you sy so. A: Otining 'hs' from oin toss A: Finishing tsk twn Mony n Thursy B: Otining 'tils' from oin toss B: Finishing tsk twn Stury n Tusy. A singl i is roll. Answr th qustions out ths outoms (hk if thy r mutully xlusiv first): A: Rolling or 6 B: Rolling n vn numr C: Rolling n o numr D: Rolling Fin P (B or D). Fin P (A or D). Fin P (A or C). Fin P (B or C). 00% Proility Mthltis 00% P Lrning J

18 Proility Qustions Using Our Knowlg. Us this informtion to nswr th following qustions: P ^Ah P ^Bh 0 Ar A n B mutully xlusiv? P ^Ch P ^Dh P ^Aor Bh Ar C n D mutully xlusiv? P ^Cor Dh 7 00 P ^Bor Ch Ar B n C mutully xlusiv? If P (A or C), us P (A or C) P (A) + P (C) - P (A n C) to fin P (A n C). Fin P (B n C). 6 J 00% Proility Mthltis 00% P Lrning

19 Proility Qustions Using Our Knowlg. A ook with 0 pgs is opn up to rnom pg. Answr qustions tht follow out ths outoms: (Hint: First hk if thy r mutully xlusiv) A: Th pg numr is multipl of 0 B: Th pg numr hs 7 in it C: Th pg numr is multipl of D: Th pg numr is multipl of E: Th pg numr is 0 or low F: Th pg numr is or mor Fin P (A or B). Fin P (A or F). Fin P (B or E). Fin P (C or D). Fin P (E or F). f Fin P (B or D). 00% Proility Mthltis 00% P Lrning J 7

20 Proility Qustions Using Our Knowlg 6. A singl i is roll twi. Wht is th proility of rolling n thn? Wht is th proility tht oth rolls will grtr thn? Wht is th proility tht oth rolls will vn? Wht is th proility of oth rolls ing 6? Wht is th proility tht oth rolls will or? 8 J 00% Proility Mthltis 00% P Lrning

21 Proility Qustions Using Our Knowlg 7. A g ontins yllow, whit n orng ston. A ston is rwn t rnom n thn rpl. Thn ston is rwn t rnom for son tim. Complt th tr igrm low for this ompoun vnt: First rw Son rw Smpl sp Y Y - Y Y Y - W O Y - - W - W - O - O - - How ig is th smpl sp of this xprimnt? Is this wht you xpt? Wht is th proility th whit ston will rwn first? Wht is th proility th whit ston will rwn son? Wht is th proility tht th whit ston will rwn oth tims? 00% Proility Mthltis 00% P Lrning J 9

22 Proility Qustions Using Our Knowlg f Rrw th tr igrm if th ston tht is rwn first is not rpl? g Wht is th siz of th smpl sp now? h Wht is th proility tht th yllow ston will rwn first? i Wht is th proility tht th yllow ston will rwn son? j Wht is th proility tht th yllow ston is rwn oth tims? 0 J 00% Proility Mthltis 00% P Lrning

23 Proility Qustions Using Our Knowlg 8. A tnnis tournmnt hs singls trophy n ouls trophy. Th ountris ompting for th singls trophy r: Ini, Spin n Gr. Th ountris ompting for th ouls trophy r just Ini n Spin. Eh ountry hs qul hn to win th trophis. Drw tl for this two-stg vnt of trophy winnrs. Wht is th proility tht Gr will win th singls trophy? Wht is th proility tht Ini will win oth trophis? Wht is th proility tht Ini n Spin will win trophy h? Wht is th proility tht Spin n Gr will win trophy h? f Wht is th proility tht Ini will not win trophy? 00% Proility Mthltis 00% P Lrning J

24 Proility Thinking Mor Proility Tr Digrms Whn proilitis of h outom r writtn on th 'rnhs' of tr igrm it is ll proility tr igrm. To fin th proility of h multi-stg vnt just multiply th proilitis of h rnh. Th proility of flipping hs with trik oin is Drw tr igrm rprsnting flips of this oin: # # H T # H T H # T H T H T H T H T H H H H H T H T H H T T T H H T H T T T H T T T Fin th proility of flipping hs? P^HHHh # # 6 Multiply th proilitis of h rnh Fin th proility of flipping T-H-T. P^THTh # # Multiply th proilitis of h rnh J 00% Proility Mthltis 00% P Lrning

25 Proility Thinking Mor Proility from Vnn Digrms Vnn igrms hlp us s groups ttr. Lt's sy tht from 0 stunts, ply footll, ply tnnis n ply oth thn th Vnn igrm woul look lik this: Footll Tnnis 7 6 So th igrm shows tht 7 stunts ply footll only, 6 stunts ply tnnis only, stunts ply oth n stunts on't ply ithr gm. Th prt in oth irls is ll th intrstion. It hs this symol "+". In th xmpl ov thr r (7 + ) stunts in footll, (6 + ) in tnnis n in th intrstion footll + tnnis. This mns tht stunts ply footll AND tnnis. Th union of sts is th omin st n hs th symol ",". Aov xmpl footll, tnnis hs stunts. This mns tht stunts ply footll OR tnnis. Lt's sy stunt is slt t rnom from th group rprsnt in th ov Vnn igrm Fin th proility tht th stunt plys footll. P^footllh numroffootllplyrs numrs of stunts Fin th proility tht th stunt plys tnnis or footll. P^footll numrofstuntswho ply footll or tnnis, tnnish numrsofstunts Fin th proility tht th stunt plys tnnis n footll. numrofstuntswho ply footll ntnnis P^footll + tnnish numrs of stunts % Proility Mthltis 00% P Lrning J

26 Proility Thinking Mor Proility from Tls Somtims tls r us in proility qustions. At th olympis, ountry won mls for vnts oring to this tl Gol Silvr Bronz Totl Swimming 7 Fning 0 8 Arhry 6 9 Totl If ml is slt t rnom thn wht is th proility it is gol? numrofgolmls P^gol mlh totlmls 7 00 If silvr ml is slt t rnom thn wht is th proility it woul for rhry? numr of silvrmlforrhry P^silvr ml forrhryh totlsilvrmls 9 If ml from fning is slt t rnom, wht is th proility it is ronz? numr of ronz fning mls P^fning ml is ronzh totl fning mls 8 If ml is slt t rnom, wht is th proility it will gol ml for swimming? numrofgolmls for swimming P^gol mlfrom swimmingh totlmls 00 Th typ of tl in th ov xmpl is ll 'ontingny' tl. J 00% Proility Mthltis 00% P Lrning

27 Proility Qustions Thinking Mor. Wht o th symols + n, mn?. A group of 0 popl r sk whih pts thy hv. This is rprsnt in this Vnn Digrm: Cts Dogs 7 9 How mny popl hv ogs only? How mny popl hv ogs n ts? If prson is hosn t rnom fin th proility tht thy hv ts only, P (ts). Fin th proility of prson hving ts n ogs, P (ts + ogs). Fin th P (ts, ogs). 00% Proility Mthltis 00% P Lrning J

28 Proility Qustions Thinking Mor. A iffrnt group of popl ws sk out whih pts thy h n this is th rsulting Vnn igrm: Cts 6 7 Dogs 6 0 Fish How mny popl hv fish only? How mny r in th st ts + ogs? How mny popl in th st ogs + fish? How mny popl hv ll pts? If prson is slt t rnom, thn fin P (ts + ogs). f If prson is slt t rnom, thn fin P (ts, ogs). g If prson is slt t rnom, thn fin P (ogs + fish). 6 J 00% Proility Mthltis 00% P Lrning

29 Proility Qustions Thinking Mor. A prolity tr igrm for rtin ompoun vnt looks lik this: A 6 0 C D I J K L M N A C I A C J A C K A D L A D M A D N E 8 8 O P Q A E O A E P A E Q B 0 0 F G H R S T U V W X Y Z B F R B F S B F T B G U B G V B G W B H X B H Y B H Z How mny stgs r in this ompoun vnt? Us th tr igrm to fin P (AD). Us th tr igrm to fin P (BGU). Us th tr igrm to fin P (AEQ). Us th tr igrm to fin P (ADN). 00% Proility Mthltis 00% P Lrning J 7

30 Proility Qustions Thinking Mor. Th tl low is of group of tngrs who ply iffrnt sports. Tnnis Footll Vollyll Totl Boys 8 Girls Totl If stunt is slt t rnom wht is th proility of slting r oy? If stunt is slt t rnom wht is th proility of slting vollyll plyr? If stunt is slt t rnom wht is th proility of slting girl who plys footll? If oy is slt t rnom wht is th proiliy h plys footll? If footll plyr is slt t rnom, wht is th proility thy r girl? 8 J 00% Proility Mthltis 00% P Lrning

31 Proility Answrs Bsis: Knowing Mor:. Hs n tils or {H,T}. This is rnom vnt us h outom is qully likly.. Th siz of th smpl sp is.. Th smpl sp of rolling i is {,,,,, 6} n it is rnom vnt us h outom is qully likly.. Rltiv frquny of ing roll is 0. Rltiv frquny of ing roll is 0. Rltiv frquny of rokn oxs is.. 8 Foo: History: Sport: 8 9 Rltiv frquny. {m, i, s, p} 00 'i'n 's' s thy ppr tims h in th wor Mississippi.. 00 Proility of slting n 's' is. Rltiv frquny of priots is Rltiv frquny of orngs is 6. Rltiv frquny of rottn ppls within th ppls is. 7. Using Our Knowlg: Mutully xlusiv vnts nnot our t th sm tim. Appls xpt to rottn... Knowing Mor: Mutully inlusiv vnts n our t th sm tim.. g h Whn you th two proilitis, thy qul. This is us ths r ll th possil outoms, n ll th possil outoms hv proility of us proility of ovrs ll outoms. f. Rolling 'hs' n 'tils' in oin toss r mutully xlusiv vnts. This is us ths nnot on t th sm tim. Finishing tsk twn Mony n Thursy n finishing tsk twn Stury n Tusy r mutully inlusiv vnts. This is us thy n on t th sm tim. Th tsk oul omplt on Mony or Tusy. 00% Proility Mthltis 00% P Lrning J 9

32 Proility Answrs Using Our Knowlg:. P (B or D) 7. P (A or D) P (A or C) P (B or C) Using Our Knowlg: First rw Son rw Smpl sp Y Y - Y Y W Y - W O Y - O W Y W W - Y W - W. Ys us P^Ah+ P^Bh P^Aor Bh O Y W - O - O Y No us P^Ch+ P^Dh! P^Cor Dh O W O - W No us P^Bh+ P^Ch! P^Bor Ch O O - O P (A n C) 0 P (B n C) 0 Th smpl sp hs 9 possil outoms. This is xpt sin outoms r in h vnt. So, thr shll # 9 totl outoms.. P^Aor Bh P^Aor Fh P^Bor Eh 0 f 9 Y W Y - W P^Cor Dh O Y Y - O W - Y P^Eor Fh W f P^Bor Dh O Y W - O O - Y O W O - W 9 6 g h j Thr r now 6 totl outoms. 0 i 0 J 00% Proility Mthltis 00% P Lrning

33 Proility Answrs Using Our Knowlg: 8.. Singls Trophy. f Douls Trophy Ini Spin Thinking Mor: Ini Spin Gr Ini, Ini Ini, Spin Spin, Ini Spin, Spin 6 6 Gr, Ini Gr, Spin + is mthmtil symol for th trm intrstion. For xmpl, A+ B is st whih ontins ll th lmnts tht sts A n B hv in ommon.. Thinking Mor: Thr r stgs. 9 P^oyh P^vollyllh 7 P^girl plys footllh P^oy plys footllh 00 0 P^footll n girlh 6, is mthmtil symol for th trm union. For xmpl, A, B is st whih ontins ll th lmnts tht r in A or in B or in oth A n B.. 9 P^tsh 7 0 P^ts + ogsh P ^ts, ogsh f 7 8 g 0 00% Proility Mthltis 00% P Lrning J

34 Proility Nots J 00% Proility Mthltis 00% P Lrning

35

36 Proility

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

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

# 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

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

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

More information

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

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

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

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

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

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

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

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

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

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

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

(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

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

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse Animls shp T h i nk Wht o you know? 2 2:29 Listn n fin. hors Wht s this? Wht s this? It s got ig nos. It s ig n gry. It s hors! YES! 2 Wht r ths? Wht r ths? Thy v got two lgs. Thy r smll n rown. Thy r

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

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

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

QUESTIONS BEGIN HERE!

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

More information

QUESTIONS BEGIN HERE!

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

More information

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

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

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

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

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

N1.1 Homework Answers

N1.1 Homework Answers Camrig Essntials Mathmatis Cor 8 N. Homwork Answrs N. Homwork Answrs a i 6 ii i 0 ii 3 2 Any pairs of numrs whih satisfy th alulation. For xampl a 4 = 3 3 6 3 = 3 4 6 2 2 8 2 3 3 2 8 5 5 20 30 4 a 5 a

More information

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

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

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

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

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

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

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

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

3 Make words with the jumbled letters. 4 Match the questions and answers.

3 Make words with the jumbled letters. 4 Match the questions and answers. Unit Tst A n writ. son n nswr. My nm is Mr n I m rom Gon. I m tn yrs ol. My prnts r Mrln n Rul. My rothr is Sm. H s tn yrs ol, too. W r twins! My littl sistr is Lol n sh s only on. Sh s vry smll n vry

More information

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

Fractions. Mathletics Instant Workbooks. Simplify. Copyright Frctons Stunt Book - Srs H- Smplfy + Mthltcs Instnt Workbooks Copyrht Frctons Stunt Book - Srs H Contnts Topcs Topc - Equvlnt frctons Topc - Smplfyn frctons Topc - Propr frctons, mpropr frctons n mx numbrs

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

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion

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

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

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

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

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to

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

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

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

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

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

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

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

More information

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

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c. MA56 utorial Solutions Qustion a Intgrating fator is ln p p in gnral, multipl b p So b ln p p sin his kin is all a Brnoulli quation -- st Sin w fin Y, Y Y, Y Y p Qustion Dfin v / hn our quation is v μ

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

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

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

Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch. 2.3 Counting Sample Points. Cardinality of a Set Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

More information

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

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

More information

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

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

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

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

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

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

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

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

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

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

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

Solutions to Homework 5

Solutions to Homework 5 Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()

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

Motivation. Problems. Puzzle 1

Motivation. Problems. Puzzle 1 Introution to Roust Algorithms Séstin Tixuil UPMC & IUF Motition Approh Fults n ttks our in th ntwork Th ntwork s usr must not noti somthing wrong hppn A smll numr of fulty omponnts Msking pproh to fult/ttk

More information

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to

More information

Contents: A The mean of continuous data [11.5] B Histograms [11.6] C Cumulative frequency [11.7]

Contents: A The mean of continuous data [11.5] B Histograms [11.6] C Cumulative frequency [11.7] #noxhing Continuous t 17 Contnts: A Th mn o ontinuous t [11.] B Histogrms [11.6] C Cumultiv rquny [11.7] Opning prolm Anrino ollt t or th rinll rom th lst month or 9 towns in Argntin. Th rsults r isply

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

A prefix word in each of these sentences is incorrect. Rewrite the prefix words correctly.

A prefix word in each of these sentences is incorrect. Rewrite the prefix words correctly. Spring Trm 2 Cirl th possssiv pronoun: Th hilrn wr thrill tht th i tht h n hosn or th inl prout ws thirs. Rwrit this sntn with th vril phrs t th ginning. Don t orgt omm! Thr wsn t on pi o pizz lt tr th

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

Practice Test I Bonding and Geometry Name Per

Practice Test I Bonding and Geometry Name Per 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.

More information