Department of Epidemiology and Biostatistics, McGill University. EPI (Inferential Statistics) Midterm Examination, May 31, 1994

Size: px
Start display at page:

Download "Department of Epidemiology and Biostatistics, McGill University. EPI (Inferential Statistics) Midterm Examination, May 31, 1994"

Transcription

1 INSTRUCTIONS Dprtmnt of Epimiology n Biosttistis, MGill Univrsity B rif n W R I T E C L E A R L Y. EPI (Infrntil Sttistis) Mitrm Exmintion, My 31, 1994 Unlss spifilly sk for, omplt lultions [or vn omplt sntns] r not n. Answr in point form whn possil. Answrs [intifi vi nom--plum known only to you] to hn in t/for th ginning of lss on Tusy Jun 7. W will olltivly orrt/gr som of th work in lss. 1 Tru or fls, n xplin rifly. f g h i j k If you 7 to h vlu on list, you 7 to th SD. If you oul h vlu on list, you oul th SD. If you hng th sign of h vlu on list, you hng th sign of th SD. If you uplit h vlu in list, you lv th SD pproximtly unhng. If ll th vlus in list r positiv, you nnot hv SD whih is lrgr thn th mn. Hlf th vlus on list r lwys low th mn. In lrg list, th istriution of msurmnts follows th norml urv quit losly. If two lrg popultions hv xtly th sm vrg vlu of 50 n th sm SD of 10, thn th prntg of vlus twn 40 n 60 must xtly th sm for oth popultions. Th vrin of th sum of two rnom vrils is lwys iggr thn th vrin of h on. An rsrhr hs omputr fil of pr-trtmnt WBCs for ptints. Thy rng from 2,800 to 38,600. By int, th highst WBC gts hng to 386,000. This ffts th mn ut not th min n th IQR. For th mn in lrg U.S. smpl survy ( th HANES stuy), mn inom in th iffrnt g groups inrs with g until 50 or so n thn grully lin. Thus, th inom of typil mn inrss s h gs until 50 or so n thn strts rsing. l Suppos ll stunts in lss of 20 got th sm wrong nswr to multipl hoi xm qustion with 4 hois. To tst whthr th stunts ollu [ont trihé] whil th monitor ws out of th room for 2 minuts, th shool prinipl lult th proility tht rnom vril Y with Binomil(20,0.25) 0.25 x 0.75 istriution woul 20. H i this y first lulting µ=20(.25) = 5 n SD=. H 20 thn lult Pro[ Z 20 µ ] n, fining tht th P-vlu ws vry smll, h onlu tht th SD stunts h "lmost rtinly" ollu. [Hint: thr r svrl prolms; onntrt on th min lultion rror n lso on th iggr prolm of possil logil rror in infrn; ignor th issu of ontinuity orrtions n th ury of th Gussin pproximtion] Cours MiTrm pg 1 / 6

2 2 Rfr to th lttr to th BMJ from lft-hn mil sttistiin onrning srious is in th omprison of gs t th of lft-hn n right-hn prsons. Th sm point woul pply, vn mor rmtilly, if w wr to ompr g t th of prsons who wnt through 'th nw mth' urriulum in lmntry shool with g t th of thos who h th 'ol mth' urriulum (th 'nw mth' urriulum ws introu into wstrn ountris t vrious stgs in th 1960's n 1970's). It woul lso pply to omprison, vi th oitury olumns of th mil journls, of g-t-th of riologists (thirs is long stlish spilty] n mrgny-miin spilists (n mrging spilty). To monstrt tht you unrstn Pto's point,... onstrut rlisti 2-wy tl sriing th g istriutions in ths two typs of prsons {l/r or, if you prfr, nwr/olr} in 1994 popultion [or s Pto looks t it, th prvlns of ths two typs of prson s funtion of g]. To kp it simpl, limit yourslf to on gnr. Apply th sm g-spifi th rts to th two typs of prsons [if you wish, you n us th th rts riv from 1990 Qu mortlity t givn in pg 3 of th mtril on M&M $4.1; you n still mk th sm point if you us fwr g tgoris to ru th mount of rithmti]. Thn, for h of th two typs, lult th vrg g-t th of thos tht i in th nxt svrl yrs. How ig iffrn o you gt in th "vrg g t th" of th two typs of prsons? Commnt. 3 In th ightnth ntury, yllow fvr ws trt y ling th ptint. On minnt physiin of th tim, Dr. Bnjmin Rush, wrot: I gn y rwing smll quntity t tim. Th pprn of th loo n its ffts upon th systm stisfi m of its sfty n ffiy. Nvr for i I xprin suh sulim joy s I now flt in ontmplting th suss of my rmis... Th rr will not wonr whn I short xtrt from my notook, t 10th Sptmr, 1793]. ''Thnk Go, of th on hunr ptints, whom I visit, or prsri for, this y, I hv lost non.'' Explin som of th sign prolms in Rush's stuy. 4 A snil strts out to lim wll. During th y it movs upwrs n vrg of 22 m (SD 4 m); uring th night, inpnntly of how wll it os uring th y, it slips k own n vrg of 12 m (SD 3 m). Th forwr n kwr movmnts on on y/night r lso inpnnt of thos on nothr y/night. Aftr 16 ys n 16 nights, how muh vrtil progrss will it hv m? Wht is th hn tht, ftr 16 ys n 16 nights, it will hv progrss t lst 150 m? Ovr n ov th ssumption of inpnn, whih ws 'givn', i you hv to mk strong [n possily unwrrnt] istriutionl ssumptions in orr to nswr prt? Explin rfully. Cours MiTrm pg 2 / 6

3 5 A ovrviw of rnomiz linil trils of ntipltlt thrpy s prophylxis ginst p vnous thromosis [BMJ on 22 Jn. 1994] foun th following: Ctgory of tril % os rution (SD) gnrl surgry 37% ( 8) trumti orthopi surgry 31% (13) ltiv orthopi surgry 49% (11) Is 37% sttisti or prmtr? Why? Dos h SD rfr to (i) vrition of iniviuls or (ii) smpling vrition ssoit with th stimt? Explin your rsoning. Us th SD of h stimt to rgu tht th pprnt htrognity in th prnt rutions, i.. th spr from 31% to 49%, oul simply rflt rnom vrition lon [iffrns mong thr stimts r mor iffiult thn w hv lrn to lt with, so for simpliity, onntrt on th iffrn of two stimts] Sin w hv nithr sttistil nor iologi sis for ssuming iffrnt siz ffts for iffrnt typs of ptints, in th spirit of Om's rzor, w n onstrut on ovrll stimt from th thr. On wy to o this is tk simpl vrg of th thr rutions, giving h stimt wight of 1/3 i.. ( )/3 = 39%. If w rt this qul-wight vrg, th unrtinty {SD} ssoit with it shoul smllr thn th SD of th omponnts. Clult th SD for 1 3 stimt stimt stimt 3 [M&M 4.3 & xriss shoul hlp] Sin w hv thr stimts with iffrnt grs of unrtinty, it mks sns to lult n vrg of thm whih givs mor wight to th iniviul stimts with smllr SD's. It n shown mthmtilly tht th wight vrg with th lowst SD is th on with wights tht r invrsly proportionl to th iniviul vrins. In our xmpl hr, this woul l to wights proportionl to 1 64, n rsptivly, or n ovrll stimt of 0.52stimt stimt stimt 3. This givs wight vrg of just ovr 39%. [th ft tht th two mthos giv lmost th sm nswr is oinin in this xmpl; it osn't hppn gnrlly] As stt, this informtion-wight vrg hs lowr unrtinty {SD} ssoit with it thn simpl qully-wight vrg. Clult th SD for 0.52stimt stimt stimt 3 ; ompr it with th SD in ov. Th ovrviw rport n stimt of 42% (SD 17) for high risk mil ptints. f Comin th singl stimt for surgil ptints n th 42% for mil ptints. Your ovrll stimt shoul losr to 39 thn to 42%. Why? Clult its SD. Why os th 'vrging' of th two stimts not iminish th SD vry muh? Commnts: 1. It might prfrl (in trms of mor urt CI's) to omin th stimts on log sl, whr th smpling vrition shoul mor Gussin; 2. th ov mtho of omining stimts (n prtiulrly of lulting SD's, or SE's if you prfr) is not pproprit if thr is finit htrognity in th stimts (lso, th vrg hs muh lss mning). Cours MiTrm pg 3 / 6

4 6 A hlth prtmnt srvs 50,000 houshols. As prt of survy, simpl rnom smpl of 400 of ths houshols r survy. Th vrg numr of ults in th smpl houshols is 2.35, n th SD is 1.1. Skth possil frquny istriution showing th vriility in th numr of ults pr houshol [on't spn lot of tim on tril n rror gtting th istriution to mth th mn n SD xtly; if you n show on whih oms within 0.1 of th mn n 0.2 of th SD, tht's goo nough] If possil, fin n pproximt 95%-onfin intrvl for th vrg numr of ults in ll 50,000 houshols, n from it n pproximt 95%-onfin intrvl for th totl numr of ults in ll 50,000 houshols. If this isn't possil, xplin why not. All ults in th 400 smpl houshols r intrviw. This mks 940 popl. On th vrg, th smpl popl wth 4.2 hours of tlvision th Suny for th survy, n th SD ws 2.1 hours. If possil, fin n pproximt 95%-onfin intrvl for th vrg numr of hours spnt wthing tlvision y ll ults in th 50,000 houshols on tht Suny. If this isn't possil, xplin why not. 7 Nw lsr ltimtrs n msur lvtion to within fw inhs, without is, n with no trn or pttrn to th msurmnts. As prt of n xprimnt, 25 rings wr m on th lvtion of mountin pk. Thir mn ws 81,411 inhs, n thir SD ws 30 inhs. Fill in th lnks in prt (), thn sy whthr h of () is tru or fls; xplin your nswrs rifly. (You my ssum Gussin vrition of th msurmnts, with no is.) Th lvtion of th mountin pk is stimt s. Thr is pproximtly % hn tht w r ovr-stimting or unr-stimting th tru lvtion y mor thn 6 inhs. 81,411 ± 12 inhs is 95%-onfin intrvl for th vrg of th 25 rings. 81,411 ± 12 inhs is 95%-onfin intrvl for th lvtion of th mountin pk. A lrg mjority of th 25 rings wr in th rng 81,411 ± 12 inhs. Th lvtion of th mountin pk is th sttisti hr; th 81,411 is prmtr. 8 An invstigtor t lrg univrsity is intrst in th fft of xris in mintining mntl ility. H is to stuy th fulty mmrs g 40 to 50, looking sprtly t two groups: th ons who xris rgulrly n th ons who on't. Thr r lrg numrs in h group, so h tks simpl rnom smpl of 32 from h group, for til stuy. On of th things h os is to ministr n IQ tst to th smpl popl, with th following rsults: rgulr xris no rgulr xris smpl siz vrg sor SD of sors Th iffrn twn th vrgs is "highly sttistilly signifint". Th invstigtor onlus tht xris os in hlp to mintin mntl ility mong th fulty mmrs g 40 to 50 t his univrsity. Stt th null n ltrntiv hypothss, lult th p-vlu n vrify th sttmnt out th iffrn ing "highly sttistilly signifint". Is th uthor's onlusion justifi? Why/why not? Cours MiTrm pg 4 / 6

5 9 An invstigtor wnts to show tht first-orn hilrn sor highr on voulry tsts thn sonorns. Sh will us th WISC voulry tst (ftr stnrizing for g, hilrn in gnrl hv mn of 30 n SD of 10 on this tst). Sh onsirs two stuy signs: i ii In shool istrit fin numr of 2-hil fmilis with oth 1st-orn n 2n-orn nroll in lmntry shool. From shools in th istrit, tk smpl of 1st-orn n smpl of 2n orn hilrn nroll in lmntry shool. List 1 sttistil n 1 prtil vntg of h pproh. For th sign you prfr, wht woul you rommn s sttistil tst of th hypothsis? For th sign you prfr, n ssuming sh tlls you tht iffrn of 3 points on th stnriz tst woul importnt, trmin n pproprit smpl siz. If you on't hv suffiint informtion to mk th trmintion, xplin to hr xtly wht sh ns to provi you for you n trmin th smpl siz. 10 Consir RCT tht l to th rommntion of lumptomy n rition s n qully fftiv ut lss isfiguring ltrntiv to msttomy in trting rst nr. In th originl stuy thr wr thr trtmnt groups: totl msttomy (n = 590), lumptomy (n = 636), n lumptomy n irrition (n =629). At th n of th follow-up prio (vrg 81 months), th numrs liv with no vin of iss wr: totl msttomy 373 (63.2%), lumptomy 371 (58.3%) n lumptomy n irrition 412 (65.5%). [I hvn't hk ths numrs; thy, n qustions - tht follow r tkn from n rtil in Chn Nws 1 ] Clult mrgin of rror ssoit with h of th prntgs liv with no vin of iss. Likwis, lult mrgin of rror ssoit with th iffrn of th first n thir prntgs. Stt your lvl of onfin tht th rrors in th stimts r no mor thn wht you hv lult. Wht r th most importnt ssumptions r you mking in lulting ths limits of rror? Wht woul th fft on ths mrgins of rror if th t on rnom 19% of th stuy sujts wr rmov? Crry out th lultions. Suppos tht som womn nroll wr thnilly inligil for th stuy, lthough th rnomiz ssignmnt n follow-up wr proprly rri out in n unis wy. Th rsrh group si tht nw nlysis, with th t on 19% of th ptints rmov, shows tht th stuy's originl pulish onlusions rmin vli. But govrnmnt spoksmn rmrk tht rmoving 19% of th smpl iminish th sttistil powr of th stuy. Wht os this lttr sttmnt mn? You wr sk to prtiipt in iing th smpl siz for nw two-rm stuy to rvisit th qustion of totl msttomy vrsus lumptomy n irrition. Givn th intns puli intrst in th nw tril, th onologists in th rsrh group sk you, s th most sttistilly rtiult, to provi thnilly urt intrprttions of th 3 Grk symols (α, β, ) in th smpl siz formul tht woul unrstnl to journlists n ut non-xprts in sttistis (or for tht mttr in linil trils). You might lso intrviw y lol tlvision sttion. Prpr suh n intrprttion, limiting yourslf to 200 wors [or 150 sons of 'soun its'] in totl. If you r fml, wht vlu of o you think shoul us? If you r ml, sk som (sttistilly?) signifint fml in your lif (who hsn't tkn ours in sttistis) wht vlu of shoul us. How woul you wor your qustion to hr? 1 Prpr y J. Luri Snll s prt of th CHANCE Cours Projt support y th Ntionl Sin Fountion n th Nw Engln Consortium for Unrgrut Sin Eution. Currnt n prvious issus of CHANCE Nws n foun on th intrnt vi gophr to: hn.rtmouth.u. Cours MiTrm pg 5 / 6

6 11 Rfr to th rtil "Hir onntrtions of niotin n otinin in womn n thir nworn infnts y Eliopoulos t l (JAMA 1994; 271: ). f g h i j Th uthors stt tht th smpl siz ws hosn to tt twofol mor otinin in infnts of pssiv smokrs thn infnts of non-smokrs [lst prgrph of Sujts n Mthos]. This "twofol mor otinin", roughly spking, orrspons to iffrn of 0.3 twn mns in th log 10 (onntrtion) sl, sl on whih th osrvtions r mor nrly [ut still not quit] Gussin thn in th onntrtion sl. Suppos tht thir pr-stuy informtion ws tht th twn-infnt SDs on this log 10 otinin sl woul pproximtly 0.4 for h of th two groups ing ompr. Assuming thy wr going to rruit qul numrs of pssiv smoking n nonsmoking mothrs, n with th lph n powr thy mntion, how mny of h woul rquir? If otinin msurmnts wr Gussin on th log 10 sl, woul thy Gussin on th ln i.. log sl? Not tht log 10 (otinin ) = log (otinin ) = ln(otinin ). For th 36 tiv smoking womn, th mn numr of igrtts us ily ws Wht ws th SD? Why woul this twn-womn SD of littl us in sriing th pttrn of twnwomn vrition in rport onsumption [stt to hv vri from 1 to 40]? In th lst sntn of th first prgrph of Rsults, wht o (i) th sttmnt tht "r=.75" n (ii) th wor "signifint" mn? Why o you think "thr ws no orrltion twn th ily numr of igrtts rport y th mothrs n ithr mtrnl or nontl onntrtions of niotin or otinin"? Put th sttmnt "P<0.001" [ftr th r=.49 t top of thir olumn] into wors tht ths prnts woul unrstn. Don't us th irulr xplntion tht us P<0.001, it is "signifint". "Mtrnl onntrtions of niotin wr invrily highr thn nontl lvls (P<0.001)" [nxt sntn]. Sin this rtinly isn't th s for ll 94 mothr pirs in Figur 1, th uthors must rfrring only to th n=36 pirs whr th mothr smok. Th uthors on't sy in thir sttistil mthos stion wht tst thy us to lult this p-vlu [thy only rfr to tsts for 'twn groups']. Wht 2 tsts of hypothss tht r ovr in M&M Ch 7 wr vill to thm? Extly wht hypothsis os h on tst? In plin wors, wht is mnt y th phrs "onntrtions of otinin i not iffr signifintly twn mothrs n infnts"? Th primry npoint of intrst ws stt to infnts' hir onntrtion of otinin, n th smpl siz lultion onntrt on th pssiv smoking vrsus non smoking mothrs. Mn {SEM] onntrtions of otinin in infnts of pssiv smoking n nonsmoking mothrs wr 0.60[0.15] n 0.26[0.04] rsptivly. Th uthors sy tht ths onntrtions wr signifintly iffrnt. Just from th numril summris {mn[sem]} thy provi, n you n prform sttistil tst to vrify this? Do you fl omfortl rrying out this tst? Why/Why not? If not, n if you h ss to th til t, wht othr options woul you propos? Th Figur lgn osn't sy, ut wht o th rror rs in Fig 3 rprsnt? Woul you hv us somthing ls? Why/Why not? Cours MiTrm pg 6 / 6

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

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

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

(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

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

, 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

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

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

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

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

Garnir Polynomial and their Properties

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

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

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

More information

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

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

More information

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

More information

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

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

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

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University I TURFGRASS DISEASE RESEARCH REPORT 9 J. M. Vrgs, Jr. n R. Dtwilr Dprtmnt f Btny n Plnt Pthlgy Mihign Stt Univrsity. Snw Ml Th 9 snw ml fungii vlutin trils wr nut t th Byn Highln Rsrt, Hrr Springs, Mihign

More information

Journal of Solid Mechanics and Materials Engineering

Journal of Solid Mechanics and Materials Engineering n Mtrils Enginring Strss ntnsit tor of n ntrf Crk in Bon Plt unr Uni-Axil Tnsion No-Aki NODA, Yu ZHANG, Xin LAN, Ysushi TAKASE n Kzuhiro ODA Dprtmnt of Mhnil n Control Enginring, Kushu nstitut of Thnolog,

More information

C-201 Sheet Bar Measures 1 inch

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

More information

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

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

Jonathan Turner Exam 2-10/28/03

Jonathan Turner Exam 2-10/28/03 CS Algorihm n Progrm Prolm Exm Soluion S Soluion Jonhn Turnr Exm //. ( poin) In h Fioni hp ruur, u wn vrx u n i prn v u ing u v i v h lry lo hil in i l m hil o om ohr vrx. Suppo w hng hi, o h ing u i prorm

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

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

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

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

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

More information

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

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

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

Case Study VI Answers PHA 5127 Fall 2006

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

More information

Walk Like a Mathematician Learning Task:

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

More information

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

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

More information

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

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

Sybil Attacks and Defenses

Sybil Attacks and Defenses CPSC 426/526 Syil Attks n Dfnss Ennn Zhi Computr Sin Dprtmnt Yl Univrsity Rll: L-5 Rputtion systms: - Why w n rputtion/trust systms - Wht is glol rputtion mol - Wht is prsonliz rputtion mol - Cs stuis:

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

Exploration of the variability of variable selection based on distances between bootstrap sample results

Exploration of the variability of variable selection based on distances between bootstrap sample results Explortion of th vriility of vril sltion s on istns twn ootstrp smpl rsults Christin Hnnig Willi Surri Univrsity Collg Lonon Univrsität Friurg Rgrssion vril sltion n vry unstl. Diffrnt mols my yil vry

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

Expert System. Knowledge-Based Systems. Page 1. Development of KB Systems. Knowledge base. Expert system = Structured computer program

Expert System. Knowledge-Based Systems. Page 1. Development of KB Systems. Knowledge base. Expert system = Structured computer program Knowlg-Bs Systms Exprt Systm Anrw Kusik 2139 Smns Cntr Iow City, Iow 52242-1527 nrw-kusik@uiow.u http://www.in.uiow.u/~nkusik Tl: 319-335 5934 Fx: 319-335 5669 Knowlg s Infrn Engin Dt Exprt systm = Strutur

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

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

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

More information

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

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

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

Module 2 Motion Instructions

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

More information

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

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

More information

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

Acceptance Single Sampling Plan with fuzzy parameter with The Using of Poisson Distribution

Acceptance Single Sampling Plan with fuzzy parameter with The Using of Poisson Distribution Worl Amy of Sin, Enginring n Thnology 49 9 Aptn Singl Smpling ln with fuzzy prmtr with Th sing of oisson Distriution Ezztllh Bloui Jmhnh,*, Bhrm Sghpour-Gilh, Gholmhossin Yri 3 h.d Stunt, Sin n Rsrh Brnh,

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

period (time)? frequency?

period (time)? frequency? AQA Trilogy Unit 6.6: Wvs n Eltromgnti Wvs - Fountion 1 Complt th gp ill: All wvs trnsr rom on pl to nothr, ut th m os not mov. Th prtils osillt (v ) roun ix point n pss onto th nxt prtil n in turn thy

More information

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

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

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

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

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

More information

Computational Biology, Phylogenetic Trees. Consensus methods

Computational Biology, Phylogenetic Trees. Consensus methods Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt

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

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

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

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE 18 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE Y.Fujit 1*, T. Kurshii 1, H.Ymtsu 1, M. Zo 2 1 Dpt. o Mngmnt

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

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

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

Multipoint Alternate Marking method for passive and hybrid performance monitoring

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

More information

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

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

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