Contents: A The mean of continuous data [11.5] B Histograms [11.6] C Cumulative frequency [11.7]
|
|
- Frederica Pope
- 5 years ago
- Views:
Transcription
1 #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 in th rquny tl longsi: Things to think out: ² Is th t isrt or ontinuous? ² Wht os th intrvl 6 6 r<7 tully mn? ² How n th shp o th istriution sri? ² Is it possil to lult th xt mn o th t? Rinll (r mm) Frquny 6 r< r<7 7 6 r< r<9 9 6 r<1 9 Totl 9 In Chptr 13 w sw tht ontinuous numril vril n thortilly tk ny vlu on prt o th numr lin. A ontinuous vril otn hs to msur so tht t n ror. Exmpls o ontinuous numril vrils r: Th hight o yr 1 stunts: Th sp o rs on strth o highwy: th vril n tk ny vlu rom out 1 m to m. th vril n tk ny vlu rom km/h to th stst sp tht r n trvl, ut is most likly to in th rng km/h to 1 km/h IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\33igcse1_17.cdr Wnsy, 8 Otor 8 9:31:1 AM PETER
2 3 Continuous t (Chptr 17) A THE MEAN OF CONTINUOUS DATA [11.] Continuous t is pl into lss intrvls whih r usully rprsnt y inqulitis. For xmpl, or hights in th 1s o ntimtrs w oul writ 1 6 h<1. To in th mn o ontinuous t, w us th sm mtho s or group isrt t sri in Chptr 13 stion F. Sin th t is givn in intrvls, our nswr will only n stimt o th mn. Exmpl 1 Th hights o stunts (h m) in hoky trining squ wr msur n th rsults tl: Estimt th mn hight. Stt th mol lss. Sl Tutor Hight (h m) Frquny () 13 6 h<1 1 6 h<1 1 6 h< h< h< h<19 3 Hight (h m) Mi-vlu (x) Frquny () x 13 6 h< h< h< h< h< h< Totl 81 P x Mn = P ¼ 81 ¼ 163 m Th mol lss is 16 6 h<17: EXERCISE 17A 1 A rquny tl or th wights o vollyll squ is givn longsi. Explin why wight is ontinuous vril. Wht is th mol lss? Explin wht this mns. Dsri th istriution o th t. Estimt th mn wight o th squ mmrs. Wight (kg) Frquny 7 6 w<8 8 6 w<8 8 6 w< w< w<1 1 6 w< IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\3IGCSE1_17.CDR Mony, Otor 8 :31: PM PETER
3 Continuous t (Chptr 17) 3 A plnt insptor tks rnom smpl o tn wk ol plnts rom nursry n msurs thir hight in millimtrs. Th rsults r shown in th tl longsi. Wht is th mol lss? Estimt th mn hight. How mny o th slings r mm or mor? Wht prntg o th slings r twn 6 n 8 mm? I th totl numr o slings in th nursry is 87, stimt th numr whih msur: i lss thn 1 mm ii twn n 1 mm. Hight (mm) Frquny 6 h< 6 h< h< h< h<1 1 6 h<1 3 Th istns trvll to shool y rnom smpl o stunts wr: Distn ( km) 6 <1 1 6 < 6 <3 3 6 < 6 < Numr o stunts Wht is th mol lss? Estimt th mn istn trvll y th stunts. Wht prntg o th stunts trvll t lst km to shool? I thr r 8 stunts in Jos s lss, stimt th numr who trvll lss thn 1 km to shool. Th tims tkn in minuts or plyrs to inish omputr gm wr: Tim (t) 6 t<1 1 6 t<1 1 6 t< 6 t< 6 t<3 3 6 t<3 Frquny Wht prntg o th plyrs inish th gm in lss thn minuts? Estimt th mn tim to inish th gm. I 89 othr popl ply th gm, stimt th numr who will omplt it in lss thn minuts. B HISTOGRAMS [11.6] Whn t is ror or ontinuous vril thr r likly to mny irnt vlus. This t is thror orgnis using lss intrvls. A spil typ o grph ll histogrm is us to isply th t. A histogrm is similr to r hrt ut, to ount or th ontinuous ntur o th vril, th rs r join togthr. Column Grph Histogrm isrt t ontinuous t IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\3IGCSE1_17.CDR Tusy, 18 Novmr 8 11:7: AM PETER
4 36 Continuous t (Chptr 17) Consir th ontinuous t opposit whih summriss th hights o girls in yr 9. Th t is ontinuous, so w n grph it using histogrm. In this s th with o h lss intrvl is th sm, so w n onstrut rquny histogrm. Th hight o h olumn is th rquny o th lss, n th mol lss is simply th lss with th highst olumn. 3 1 rquny Hight (m) Frquny () 1 6 h< h< h< h< h<1 1 6 h< h< h< h< hight (m) In som situtions w my hv lss intrvls with irnt withs. Thr r oupl o rsons why this my hppn: ² W my wish to ollt smll numrs o t t th xtrmitis o our t rng. For xmpl, to mk th tl o girls hights sir to isply, w my omin th smllst thr lsss n lso th tllst two lsss: Hight (m) Frquny () 1 6 h< h< h<1 1 6 h< h< h<19 6 ² Th t my nturlly group in th ontxt o th prolm. For xmpl, post oi will hrg irnt rts pning on th wight o th prl ing snt. Th wight intrvls will proly not qully sp, ut it mks sns or th post oi to ror th numr o prls snt in h lss. So, th post oi my ollt th ollowing t o prls snt ovr wk: Mss (m kg) 6 m<1 1 6 m< 6 m< 6 m< Numr o prls In ithr s, th histogrm w rw is not rquny histogrm. Th rquny o h lss is not rprsnt y th hight o its r, ut rthr y its r. Th hight o h r is ll th rquny nsity o th lss. Sin rquny = rquny nsity lss intrvl with, rquny nsity = rquny lss intrvl with Th mol lss is th lss with th highst rquny nsity, n so it is th highst r on th histogrm. It is not nssrily th lss with th highst rquny IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\36IGCSE1_17.CDR Tusy, 18 Novmr 8 11:8:37 AM PETER
5 Continuous t (Chptr 17) 37 Exmpl Sl Tutor Th tl low shows msss o prls riv y ompny uring on wk. Mss (kg) 6 m<1 1 6 m< 6 m<3 3 6 m<6 6 6 m<1 Numr o prls Drw histogrm to rprsnt th t. Fin th mol lss intrvl. Us grphis lultor to stimt th mn mss o th prls riv. Mss (m kg) Frquny CIW Frquny nsity 6 m< m< m< m< m<1 1 CIW mns lss intrvl with. Histogrm showing msss o prls Th mol lss is 1 6 m<. rquny nsity 3 1 ky rprsnts prls mss ( m kg) Mil vlu (x) Frquny () : 1: 3 : 1 : 6 8 mn ¼ :1 kg (lultor) Exmpl 3 Sl Tutor Th tims tkn or stunts to omplt ross-ountry run wr msur. Th rsults wr: Tim (t min) 6 t<3 3 6 t<6 6 6 t<31 Frquny t<1 7 Drw histogrm to rprsnt th t. Fin th mol lss. Estimt th mn tim or stunts to run th vnt. Tim (t min) Frquny CIW Frquny nsity 6 t< t< t< t< : IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\37IGCSE1_17.CDR Tusy, 18 Novmr 8 11:9:13 AM PETER
6 38 Continuous t (Chptr 17) Histogrm showing ross-ountry tims Th mol lss is 6 6 t<31. rquny nsity 1 1 ky rprsnts 1 stunts Mil vlu (x) Frquny () 1: 7 : 1 8: Th mn ¼ 9: mins tim ( t min) EXERCISE 17B 1 Stunts wr sk to rw skth o thir vourit ruit. Th tim tkn (t min) ws msur or h stunt, n th rsults summris in th tl low. Tim (t min) 6 t< 6 t< 6 t<8 8 6 t<1 Frquny Construt histogrm to illustrt th t. Stt th mol lss. Us grphis lultor to stimt th mn tim. Whn th msss o popl in Singpor itnss lu wr msur, th rsults wr: Mss (m kg) 6 m< 6 m<6 6 6 m<6 6 6 m<7 7 6 m<8 Frquny Rprsnt this t on histogrm. Fin th mol lss. Us thnology to stimt th mn mss. 3 A group o stunts ws sk to throw sll s r s thy oul in givn irtion. Th rsults wr ror n tl. Thy wr: Distn ( m) 6 < 6 <3 3 6 < 6 < 6 <8 Frquny Drw histogrm o th t. Trvl tims to work Wht is th mol lss? Us grphis lultor to stimt th mn istn thrown. Th histogrm shows th tims spnt trvlling to work y smpl o mploys o lrg orportion. rquny nsity Givn tht 6 popl took twn 1 n minuts to gt to work, in th smpl siz us tim ( t min) IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\38IGCSE1_17.CDR Tusy, 18 Novmr 8 11:9:1 AM PETER
7 Continuous t (Chptr 17) 39 C CUMULATIVE FREQUENCY [11.7] Somtims it is usul to know th numr o sors tht li ov or low prtiulr vlu. In suh situtions it is onvnint to onstrut umultiv rquny istriution tl n umultiv rquny grph to rprsnt th t. Th umultiv rquny givs running totl o th sors up to prtiulr vlu. It is th totl rquny up to prtiulr vlu. From rquny tl w n onstrut umultiv rquny olumn n thn grph this t on umultiv rquny urv. Th umultiv rqunis r plott on th vrtil xis. From th umultiv rquny grph w n in: ¾ ² th min Q ² th qurtils Q 1 n Q Ths ivi th orr t into qurtrs. 3 ² prntils Th min Q splits th t into two hlvs, so it is % o th wy through th t. Th irst qurtil Q 1 is th sor vlu % o th wy through th t. Th thir qurtil Q 3 is th sor vlu 7% o th wy through th t. Th nth prntil P n is th sor vlu n% o th wy through th t. So, P = Q 1, P = Q n P 7 = Q 3. Exmpl Th t shown givs th wights o 8 ml sktll plyrs. Construt umultiv rquny istriution tl. Rprsnt th t on umultiv rquny grph. Us your grph to stimt th: i min wight ii numr o mn wighing lss thn 83 kg iii numr o mn wighing mor thn 9 kg iv 8th prntil. Sl Tutor Wight (w kg) Frquny 6 6 w< w<7 7 6 w< w< w< w< w< w< w< w<11 1 Wight (w kg) rquny umultiv rquny 6 6 w< w< w< w< w< w< w< w< w< w< this is 1+ this is 1++8 this 8 mns tht thr r 8 plyrs who wigh lss thn 9 kg, so (9, 8) is point on th umultiv rquny grph IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\39IGCSE1_17.CDR Tusy, 18 Novmr 8 11::37 AM PETER
8 36 Continuous t (Chptr 17) umultiv rquny 68 6 Cumultiv rquny grph o sktllrs wights i ii iii iv % o 8 =, ) min ¼ 88 kg Thr r mn who wigh lss thn 83 kg. Thr r 8 6 = mn who wigh mor thn 9 kg. 8% o 8 = 68, so th 8th prntil ¼ 96 kg wight (kg) min is kg Cumultiv rquny grphs r vry usul or ompring two istriutions o unqul sizs. In suh ss w us prntils on th vrtil xis. This tivly sls h grph so tht thy oth rng rom to 1 on th vrtil xis. Exmpl Sl Tutor Th hights o 1 1-yr-ol girls n 1-yr-ol oys wr msur n th rsults tl. Drw on th sm xs th Frquny (girls) Hight (h m) Frquny (oys) umultiv rquny urv or oth 1 6 h<1 th oys n th girls h<1 1 Estimt or oth th oys n th girls: h< h<16 6 i th min ii th intrqurtil rng (IQR) h< h<17 6 Compr th two istriutions h< h< IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\36IGCSE1_17.CDR Mony, Otor 8 :37:38 PM PETER
9 Continuous t (Chptr 17) 361 CF (girls) Frq. (girls) Hight (h m) Frq. (oys) CF (oys) 1 6 h< h< h< h< h< h< h< h< =7%, so (1, 7) is point on th oys umultiv rquny grph. 1 prntils Cumultiv rquny grph o oys n girls hights hight ( h m) For girls: i min ¼ 18 m ii For oys: i min ¼ 16 m ii IQR ¼ 163: 13:7 ¼ 1 m IQR ¼ ¼ 11 m Th two istriutions r similr in shp, ut th oys hights r urthr right thn th girls. Th min hight or th oys is 7 m mor thn or th girls. Thy r onsirly tllr. As th IQRs r nrly th sm, th spr o hights is similr or h gnr IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\361igcse1_17.cdr Friy, 1 Otor 8 9:7:1 AM PETER
10 36 Continuous t (Chptr 17) EXERCISE 17C 1 In running r, th tims (in minuts) o 16 omptitors wr ror s ollows: Drw umultiv rquny grph o th t n us it to stimt: th min tim th pproximt numr o runnrs whos tim ws not mor thn 3 minuts th pproximt tim in whih th stst runnrs omplt th ours th intrqurtil rng. Tims (min) Frquny 6 t< 18 6 t<3 3 6 t< t< 33 6 t< 19 6 t< umultiv rquny Th umultiv rquny urv shows th wights o Sm s got hr in kilogrms. How mny gots os Sm hv? Estimt th min got wight. Any gots hvir thn th 6th prntil will go to mrkt. How mny gots will go to mrkt? Wht is th IQR or Sm s hr? 3 1 wight ( w kg) Th lngths o 3 trout (l m) wr msur. Th ollowing t ws otin: Lngth (m) 36 l<3 36 l<3 36 l< l< l< 6 l< 6 l< Frquny g Construt umultiv rquny urv or th t. Estimt th prntg o trout with lngth lss thn 39 m. Estimt th min lngth o trout ught. Estimt th intrqurtil rng o trout lngth n xplin wht this rprsnts. Estimt th 3th prntil n xplin wht this rprsnts. Us lultor to stimt th mn o th t. Commnt on th shp o th istriution o trout lngths IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\36igcse1_17.cdr Thursy, 3 Otor 8 1:19: PM PETER
11 Continuous t (Chptr 17) 363 Th wights o gs grown y two rothrs on sprt proprtis wr msur or omprison. Th rsults r shown in th tl: Drw, on th sm xs, umultiv rquny urvs or oth g smpls. Estimt or h rothr: i th min wight ii th IQR Compr th 6th prntil wights. Compr th two istriutions. Frquny (Aln) Wight (w grms) Frquny (John) 6 w< 3 6 w< w< w< w< w<13 totls Th tims tkn or trmprs to lim Bn Nvis wr ror n th rsults tl. Tim (t min) 17 6 t< t< 6 t< 6 t<3 3 6 t< Frquny Construt umultiv rquny urv or th wlking tims. Estimt th min tim or th wlk. Estimt th IQR n xplin wht it mns. Guis on th wlk sy tht nyon who omplts th wlk in 3 hours 1 min or lss is xtrmly it. Estimt th numr o xtrmly it trmprs. Commnt on th shp o th istriution o wlking tims Cumultiv rquny urv o wtrmlon wight t umultiv rquny Th givn grph sris th wight o wtrmlons. Estimt th: i min wight ii IQR or th wight o th wtrmlons. Construt umultiv rquny tl or th t inluing rquny olumn. Estimt th mn wight o th wtrmlons. 1 1 wight ( w kg) IGCSE1 yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_17\363IGCSE1_17.CDR Tusy, 18 Novmr 8 11:1:18 AM PETER
12 #noxhing 36 Continuous t (Chptr 17) Rviw st 17A 1 A rquny tl or th msss o ggs (m grms) in rton mrk g ggs is givn low. Explin why mss is ontinuous vril. Wht is th mol lss? Explin wht this mns. Estimt th mn o th t. Dsri th istriution o th t. Th sps o vhils (v km/h) trvlling long strth o ro r ror ovr 6 minut prio. Th rsults r givn in th tl longsi. Estimt th mn sp o th vhils. Fin th mol lss. Wht prntg o rivrs x th sp limit o 6 km/h? Dsri th istriution o th t. Mss (g) Sp (v km/h) Frquny 8 6 m< m< 1 6 m< m< 6 m<3 3 Frquny 6 v< 1 6 v< 6 v< 3 6 v< v<6 6 6 v<7 1 3 A sltion o msuring ottls wr xmin n thir pitis wr not. Th rsults r givn in th tl low: Cpity (C litrs) 6 C<: : 6 C<1 1 6 C< 6 C<3 3 6 C< Frquny Drw histogrm to illustrt this inormtion. Wht is th mol lss? Th hights o plnts in il wr msur n th rsults ror longsi: Rprsnt this t on histogrm. Fin th mol lss. Estimt th mn hight o th plnts. Hight (h m) Frquny 6 h< h< 1 6 h<3 3 6 h< 1 6 h< h<1 1 Th wkly wgs o mploys in tory r ror in th tl low. Wkly wg ($w) 6w< 6w<8 86w<1 16w<16 166w< Frquny Drw umultiv rquny grph to illustrt this inormtion. Us th grph to stimt: i th min wg ii th wg tht is x y % o th mploys IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\36igcse1_17.cdr Thursy, 3 Otor 8 1:8:8 PM PETER
13 Continuous t (Chptr 17) 36 6 Th umultiv rquny urv shows th tim spnt y popl in suprmrkt on givn y. Construt umultiv rquny tl or th t, using th intrvls 6 t<, 6 t< 1, n so on. Us th grph to stimt: i th min tim ii th IQR iii th 8th prntil. Copy n omplt: i 6% o th popl spnt lss thn... minuts in th suprmrkt ii 8% o th popl spnt t lst... minuts in th suprmrkt umultiv rquny tim ( t minuts) Rviw st 17B 1 Th tl longsi summriss th msss o omsti ts hosn t rnom. Wht is th lngth o h lss intrvl? Wht is th mol lss? Fin th pproximt mn. Drw rquny histogrm o th t. From rnom sltion o 8 ts, how mny woul you xpt to wigh t lst 8 kg? Mss (m kg) Frquny 6 m< 6 m< 18 6 m< m< m<1 1 6 m<1 1 Th tl longsi summriss th st tims o 1 swimmrs who swim m. Estimt th mn tim. Wht is th mol lss? Tim ( t s) Frquny 6 t<3 3 6 t< t< 3 6 t< 9 6 t< IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\36igcse1_17.cdr Thursy, 3 Otor 8 1:36:3 PM PETER
14 366 Continuous t (Chptr 17) 3 Th tl low isplys th istns jump y yr 1 stunts in long jump omptition: Distn ( m) 3 6 < 6 < 6 <: : 6 <6 6 6 <7 Frquny Disply this inormtion on histogrm. Wht is th mol lss? Th histogrm longsi shows th rs o ln loks on strt. I ln loks wr twn 3 m to m in siz: onstrut rquny tl or th t stimt th mn r. rquny nsity r (mx) Th prntg sors in tst wr ror. Th rsults wr tgoris y gnr. Drw th umultiv rquny grphs or oys n girls on th sm st o xs. Us prntils on th vrtil xis. Estimt th min n intrqurtil rng o h t st. Compr th istriutions. Frquny (oys) Prntg sor (s) Frquny (girls) 6 s< s< 1 6 s< s< s< 1 6 s<6 6 6 s< s< s<9 9 6 s<1 3 6 In on month prio t prtiulr hospitl th lngths o nworn is wr ror. Th rsults r shown in th tl givn. Rprsnt th t on rquny histogrm. How mny is r m or mor? Wht prntg o is hv lngths in th intrvl m 6 l<3 m? Construt umultiv rquny istriution tl. Rprsnt th t on umultiv rquny grph. Us your grph to stimt th: i min lngth ii numr o is with lngth lss thn 1: m. Lngth ( l m) Frquny 8 6 l< l< 3 6 l< l< 1 6 l< l< 6 l< 6 l< IGCSE1 yn mgnt yllow lk y:\haese\igcse1\ig1_17\366igcse1_17.cdr Thursy, 3 Otor 8 1:37:16 PM PETER
15 ANSWERS y + i m m +3n 3m 3 x +6 3 x x 3 i x 1x j k mn mp n o np m 1 + x +3 j 11x 3 EXERCISE 16D.1 1 9x x x 9 x i 3x 3x 1 j 1 1 x 1 (x + 1)(x ) x +1 (x 1)(x +) 7x +8 (x 1)(x +) g x +3 x(x +1) h j (x 1) x 3 k m 7 (x 1)(x +3) o x (x + )(x ) q x +1 x(x 1)(x +1) 3(x +) x(x +3) (x 1) x + n p r 3 g x 3x 17 3 g 3 x 6 k +x x 11 g x +3 1 p x 7 g x +1 3 x +1 k 1 1x +17 (x + 1)(x +) 6 (x + )(x +1) 3(x +) (1 x)(x +) i m + h l 16 1 p x +3 h x l 11y 6 1 y h 1 x h x 7 x + l x x +6 (x + )(x ) x +x 3 l (x + 3)(x +) 17x 7 x(3x 1) x + x(x +1) x x 9 (x + 1)(x 1)(x +) s x 3 x +1 x(x + 1)(x 1) x +3 x x 1 x g x 1 x +3 h x + x 3x + x 1 os µ = x + x, sin µ = x 1 x, tn µ = x 1 x + sin µ os µ = x 1 x x + x = x 1 x x x + = x 1 x + EXERCISE 16D. 1 +x x(x +1) (x +) x + +x x(x +1) x x +3 (x )(x +3) (x +x +) (x + )(x 3) x x g (x ) x 1 3 x x 6 x (x +1) (x + )(x 3) x +3 3(x +1) REVIEW SET 16A h x +1 x x 3n x x 1 i x = or 3 ii x = 1 x + (x +) x x x + 1 x 16x i x = 1 or ii x = 3 nnot simplii x + x x x +1 1 x + (x ) x +1 REVIEW SET 16B x +3 x x 1 9 x 1 16x 9 1 x +1 3x + i x = 3 or 1 ii x = 1 3 x 3n x nnot simplii x x x 3x 1 3x 13x 1 x (x ) x 7 x 7 3(x ) x 8 1 x 1 EXERCISE 17A x +6 x(x +) 3x +1 x +1 i x = ii x = x +3 x 3x + x(x +) x 3(x +) ( ) 1 Th vril n tk ny vlu in th ontinuous rng 7 to w<9. This lss hs th highst rquny. symmtril ¼ 89: kg 6 h<6 ¼ 69:6 mm 6 o thm 3% i ¼ 7 ii ¼ < ¼ 1:66 km 33:% 9 stunts 3:% ¼ :9 min ¼ 19 popl IB MYP_3 ANS yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_n\73IB_IGC1_n.CDR Wnsy, 19 Novmr 8 9:1:9 AM PETER
16 7 ANSWERS EXERCISE 17B t<1 ¼ 7:6 min 1 rquny nsity m<7 1 ¼ 61: kg rquny nsity 1 m (kg) < ¼ 1:1 m rquny nsity mploys EXERCISE 17C 1 18 umultiv rquny t (min) (m) Cumultiv rquny grph o r t tim ( t min) min 8 8 min IQR = 1min 1 9 kg 8 17: kg 3 Cumultiv rquny grph o trout lngth 3 umultiv rquny lngth (m) % 38:6 m 3: m 37:6 m. 3% o th lngths r lss thn or qul to this vlu. ¼ 38:3 m g ngtivly skw prntils i Aln, ¼ 91; John, ¼ 83 ii Aln, ¼ 31; John, ¼ 9 Aln, ¼ 97; John, ¼ 89 Aln s gs r gnrlly hvir thn John s. Th spr o h t st is out th sm. umultiv rquny ¼ 1 min 17 1 min. This is th lngth o tim in whih th mil % o th t lis. ¼ symmtril 6 i kg ii : kg ¼ : kg Cumultiv rquny grph o g wight t John Aln wight ( w grms) Cumultiv rquny grph o Bn Nvis lim t tim (min) Wight (w grms) Frq. Cum. Frq. 6 w< w< 3 6 w< w< 1 6 w< w< w< w< w< IB MYP_3 ANS yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_n\7IB_IGC1_n.CDR Friy, 1 Novmr 8 9::6 AM PETER
17 ANSWERS 7 REVIEW SET 17A 1 Th vril n tk ny vlu in th ontinuous rng 8 6 m<3 grms. 6 m<1 ¼ :8 grms slightly ngtivly skw ¼ :9 km/h 6 v<6 ¼ :3% symmtril 3 : 6 C<1 rquny nsity pity ( C litrs) Histogrm o msss o ts rquny rquny nsity ¼ 39:1 s 3 6 t< 3 Histogrm o long jump t o thm m (kg) 6 h<3. ¼ 3: m rquny nsity umultiv rquny i ¼ $9 ii ¼ $1 6 Tim (t min) Frq. Cum. Frq. 6 t< 6 t< t< t< 1 6 t< 6 t< t< t< t< t< 8 REVIEW SET 17B Cumultiv rquny grph o wg t hight ( h m) wg ( $ ) 1 kg 6 m< ¼ :76 i min ii 1 min iii 37 min i 7 ii 18 (m) <: Ar (A m ) Frquny ¼ 71 m 3 6 A< 6 A<6 6 6 A< A<8 8 6 A<11 Prntils UE point CF (oys) CF (girls) B G 1 3:1 : 3 8:1 3: :6 1: 3 1:9 18: :9 3: :1 1: : :9 93: : 97: : 1: prntils Cumultiv rquny grph o tst sors oys girls sors (%) For oys: mium ¼, IQR ¼ 19 For girls: mium ¼ 9, IQR ¼ As th girls grph is urthr to th right o th oys grph, th girls r outprorming th oys. Both istriutions r ngtivly skw IB MYP_3 ANS yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_n\7IB_IGC1_n.CDR Thursy, Novmr 8 :17:8 PM PETER
18 76 ANSWERS 6 Histogrm o lngths o nworn is 7 is 7% o thm rquny Uppr n point Cumultiv rquny rquny i ¼ :1 m ii 18 is EXERCISE 18A lngth (m) Cumultiv rquny grph o lngths o nworns lngth (m) 1 x =:8 x ¼ 1:13 x ¼ :76 x =8 x =8:7 x =:8 x ¼ 3: m k =1: 8m 8m tru ls,.g., m m EXERCISE 18B.1 1 All o ths igurs hv tringls whih n shown to quingulr n thror r similr. For xmpl, in, CBD is similr to CAE s thy shr n qul ngl t C n CBD = C AE =9 o. EXERCISE 18B. 1 x =: x =:8 x ¼ 3:7 x =9:6 x =11: x = g x ¼ 6:67 h x =7 i x =7: EXERCISE 18C 1 7 m 7: m 1:8 m 3 :67 m 1: m 1: m 6 9 sons 7 ¼ 117 m m 9 SU =: m, BC =8: m No, th ll s ntr is ¼ 11 m on th D si o C. EXERCISE 18D 1 x =18 x =6 x = x ¼ :38 k = m n m r A : r B =1:16 3 k =: 1 m 8 m ED ¼ 1: V =8 V =: x ¼ :6 x = m 3 7 m 68 m m 9 k = m 3 8 m 1 No. Compring pitis, k ¼ 1:37 Compring lngths, k =1:6 Ths vlus shoul th sm i th ontinrs r similr. 11 : m 16 : 6 : 1 REVIEW SET 18A 1 n x ¼ 1:71 x ¼ 1:83 3 x =:8 Hint: Crully show tht tringls r quingulr, giving rsons. x ¼ 6:7 x = p 6 ¼ :9 6 A =7 x ¼ 8:1 7 x =1 y =3 8 ¼ 66:7 m wi 9 k = :99 m : m 3 REVIEW SET 18B 1 8m 8m tru ls,.g., Thy r not similr. Compring lngths; k = 16 1 = 3 Compring withs; k = 1 8 = 3 n 3 6= 3. 6 FG =: m 7 n n 1 m 3m 1\Qw_ 1\Qw_ 3 8 No, ny two quingulr tringls r similr. 3 1 m 9m m k = 7 9 : 3 x =3 x = x =1 B AC = NMC =9 o givng ]C is ommon to oth ) s ABC n MNC r quingulr, i.., similr. x 8 = 6 1 ) x = 8 =3: 1 6: m x = x ¼ :7 6 x =3:6 y =6: 7 Hint: Explin rully, with rsons, why thy r quingulr. CD =7: m : m 8 p 13 ¼ 7:1 m y 3 p 13 ¼ 1:8 m 9 68 m 3 CHALLENGE 1 ¼ 17:1 m 3:7 m m IB MYP_3 ANS yn mgnt yllow lk Y:\HAESE\IGCSE1\IG1_n\76IB_IGC1_n.CDR Thursy, Novmr 8 :19:17 PM PETER
# 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 informationPresent 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 informationECE 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 informationMath 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 informationPaths. 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 informationb. 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 informationCSC 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 informationDecimals 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 information1 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(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 informationIntegration 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 informationCS 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 informationUNCORRECTED 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, 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 informationMath 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 informationWhy 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 informationDesigning 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 informationEE1000 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 informationDUET 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 informationCOMPLEXITY 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 informationCSE 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 informationAn 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 informationPlanar 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 informationOutline. 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 informationSeven-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 informationCSE 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 informationS 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 information12. 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 informationPolygons 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 informationQUESTIONS 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 informationSolutions 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 informationCOMP108 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 informationModule 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 informationConstructive 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 information0.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 informationModule 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 informationExam 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 information12/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 informationQUESTIONS 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 information5/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 informationOn 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 informationCycles 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 informationCSE 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 informationTangram 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 informationGraphs. 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 informationUNCORRECTED SAMPLE PAGES. Length, area, surface 5area and volume. Online resources. What you will learn
Onlin rsours Auto-mrk hptr pr-tst Vio monstrtions o ll work xmpls Intrtiv wigts Intrtiv wlkthroughs Downlol HOTshts Ass to ll HOTmths Austrlin Curriulum ourss Ass to th HOTmths gms lirry Lngth, r, sur
More informationThe 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 informationWhat 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 informationNefertiti. 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 informationUsing 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 informationConstruction 11: Book I, Proposition 42
Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th
More informationSection 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 informationOutline. 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 informationAlgorithmic 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 informationINTEGRALS. 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 informationEXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL
More informationOutline. 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 informationGrade 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 informationGraph 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 informationGraphs. 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 informationChem 107: Inorganic Chemistry (40720)
Chm 107: Inorgni Chmistry (40720) Prossor Mtt Lw -mil: lwm@ui.u Oi Hours: W 3:00-4:00p n Thurs 11-noon in NS2 2127 TAs Julit Khosrowi -mil: jkhosrow@ui.u Oi Hours: Tus 2:00-3:00p, 3 r loor tls, Rins Hll
More informationV={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 informationMeasures, Shape, Space and Handling Data
Msurs, Shp, Sp n Hnling Dt 6 PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE Th Pitt Builing, Trumpington Strt, Cmrig, Unit Kingom CAMBRIDGE UNIVERSITY PRESS Th Einurgh Builing, Cmrig CB
More information1. 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 informationPage 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 informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationChapter 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 informationChem 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 informationC-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 informationMultipoint 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 informationV={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 informationProbability. Probability. Curriculum Ready ACMSP: 225, 226, 246,
Proility Proility Curriulum Ry ACMSP:, 6, 6, 7 www.mthltis.om 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
More information6202R. between SKY and GROUND. Statement sidewalk
twn SKY n GROUND Sttmnt siwlk wlkwy onnting rivrsi puli zons grnlin Lirris n musums in our tim r not only rsrv rtifts n ooks ut offr iffrnt vnts to visitors, host utionl n ivi progrms, nsur flxil sps for
More information8Algebraic 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 informationCS 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 informationSOLVED 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 informationGarnir 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 informationMAT3707. 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 informationCS61B 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 informationOpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
More informationAnnouncements. 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 informationWeighted 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 informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
More informationBinomials 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 information5/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 informationCase 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 informationThe 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 informationProblem 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 informationAquauno 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 informationEvans, Lipson, Wallace, Greenwood
Camrig Snior Mathmatial Mthos AC/VCE Units 1& Chaptr Quaratis: Skillsht C 1 Solv ah o th ollowing or x: a (x )(x + 1) = 0 x(5x 1) = 0 x(1 x) = 0 x = 9x Solv ah o th ollowing or x: a x + x 10 = 0 x 8x +
More informationCS200: 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 informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationThe 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 informationSAMPLE 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 informationCS 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 informationStructure and calculation
Strn/sustrn N1 R Bsi ountion ontnt Orr positiv n ngtiv intgrs, imls n rtions; us th symols =,, ,, Apply th our oprtions (+, ) inluing orml writtn mthos, to intgrs, imls n simpl rtions (propr n impropr),
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationCONVERTING UNITS. Converting Units PASSPORT
CONVERTING UNITS PASSPORT www.mthltis.om.u This ook shows how to writ th sm vlu using smllr or lrgr units o msurmnt. Mny nint ivilistions msur lngths/istns y rlting thm to rtin oy prts. Invstigt ths trms
More informationSection 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 informationTOPIC 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