Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?
|
|
- Morgan Melton
- 5 years ago
- Views:
Transcription
1 Rgistr Allotion
2 Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13
3 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3, 13
4 Mony, Jun 3, 13
5 Th Mmory Hirrhy I: Try to gt th st o ll worls y using multipl typs o mmory. Rgistrs L1 Ch L2 Ch Min Mmory Hr Disk Ntwork 256B - 8KB 16KB 64KB 1MB - 4MB 4GB 256GB 500GB+ HUGE ns 1ns 5ns 5ns 25ns 25ns 100ns 3 10ms ms
6 On hllng o o gnrtion Almost ll progrmming lngugs xpos ors viw o th mmory hirrhy: All vrils liv in mmory. Disk n ntwork xpliitly hnl sprtly. Chllngs in o gnrtion: Position ojts in wy tht tks mximum vntg o th mmory hirrhy. Do so utomtilly Mony, Jun 3, 13
7 Rgistrs Most mhins hv st o rgistrs, it mmory lotions tht n ss quikly, n hv omputtions prorm on thm, n xist in smll quntity. Using rgistrs intlligntly is ritil stp in ny ompilr. A goo rgistr llotor n gnrt o orrs o mgnitu ttr thn rgistr llotor.
8 Rgistr Allotion In TAC, thr r n unlimit numr o vrils. On physil mhin thr r smll numr o rgistrs: x86 hs our gnrl-purpos rgistrs n numr o spiliz rgistrs. MIPS hs twnty-our gnrl-purpos rgistrs n ight spil-purpos rgistrs. Rgistr llotion is th pross o ssigning vrils to rgistrs n mnging t trnsr in n out o rgistrs.
9 Rgistr Allotion Diing whih vlus to stor in limit numr o rgistrs Rgistr llotion hs irt impt on prormn Ats lmost vry sttmnt o th progrm Elimints xpnsiv mmory instrutions # o instrutions gos own u to irt mnipultion o rgistrs Limit mm-to-mm ALU ops, my n two instrutions Proly is th optimiztion with th most impt! Smn Amrsingh & Armno Solr-Lzm MIT
10 Chllngs in Rgistr Allotion Rgistrs r sr. Otn sustntilly mor IR vrils thn rgistrs. N to in wy to rus rgistrs whnvr possil. Rgistrs r omplit. x86: Eh rgistr m o svrl smllr rgistrs; n't us rgistr n its onstitunt rgistrs t th sm tim. x86: Crtin instrutions must stor thir rsults in spii rgistrs; n't stor vlus thr i you wnt to us thos instrutions. MIPS: Som rgistrs rsrv or th ssmlr or oprting systm. Most rhitturs: Som rgistrs must prsrv ross untion lls.
11 Builing Bttr Allotor Gol: Try to hol s mny vrils in rgistrs s possil. Rus mmory rs/writs. Rus totl mmory usg. W will n to rss ths qustions: Whih rgistrs o w put vrils in? Wht o w o whn w run out o rgistrs?
12 Liv Rngs n Liv Intrvls Rll: A vril is liv t prtiulr progrm point i its vlu my r ltr or it is writtn. Cn in this using glol livnss nlysis. Th liv rng or vril is th st o progrm points t whih tht vril is liv. Th liv intrvl or vril is th smllst surng o th IR o ontining ll vril's liv rngs. A proprty o th IR o, not th CFG. Lss pris thn liv rngs, ut simplr to work with.
13 Liv Rngs n Liv Intrvls
14 Liv Rngs n Liv Intrvls = + = + = + IZ Goto _L0 = + Goto _L1; _L0: = - _L1: g =
15 Liv Rngs n Liv Intrvls = + = + = + = + = + IZ Goto _L0 = + Goto _L1; = + _L0: = - _L1: g = = + = g =
16 Liv Rngs n Liv Intrvls = + = + = + IZ Goto _L0 = + Goto _L1; _L0: {,,, } = + {,, } {,, } = + {,, } {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
17 Liv Rngs n Liv Intrvls = + = + = + IZ Goto _L0 = + Goto _L1; _L0: {,,, } = + {,, } {,, } = + {,, } {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
18 Liv Rngs n Liv Intrvls = + = + = + IZ Goto _L0 = + Goto _L1; _L0: {,,, } = + {,, } {,, } = + {,, } {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
19 Liv Rngs n Liv Intrvls = + {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
20 Liv Rngs n Liv Intrvls = + {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
21 Liv Rngs n Liv Intrvls = + {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
22 Liv Rngs n Liv Intrvls = + {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
23 Liv Rngs n Liv Intrvls = + {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
24 Liv Rngs n Liv Intrvls = + g {,,, } = + {,, } = + = + IZ Goto _L0 {,, } = + {,, } = + Goto _L1; _L0: {,, } = + {, } _L1: = - g = {, } = + { } {, } = { } { } g = { g }
25 Rgistr Allotion with Liv Intrvls Givn th liv intrvls or ll th vrils in th progrm, w n llot rgistrs using simpl gry lgorithm. g I: Trk whih rgistrs r r t h point. Whn liv intrvl gins, giv tht vril r rgistr. Whn liv intrvl ns, th rgistr is on gin r. W n't lwys it vrything into rgistr; w'll s wht o to in minut.
26 Rgistr Allotion with Liv Intrvls g
27 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 23
28 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 23
29 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 23
30 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 23
31 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 23
32 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 32
33 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 32
34 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 32
35 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 32
36 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 32
37 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 23
38 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 23
39 Rgistr Allotion with Liv Intrvls g Fr Rgistrs R 0 R 1 R 2 R 23
40 Anothr Exmpl
41 Anothr Exmpl g
42 Anothr Exmpl g Fr Rgistrs
43 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
44 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
45 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
46 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
47 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2 Wht o w o now?
48 Rgistr Spilling I rgistr nnot oun or vril v, w my n to spill vril. Whn vril is spill, it is stor in mmory rthr thn rgistr. Whn w n rgistr or th spill vril: Evit som xisting rgistr to mmory. Lo th vril into th rgistr. Whn on, writ th rgistr k to mmory n rlo th rgistr with its originl vlu. Spilling is slow, ut somtims nssry.
49 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2 Wht o w o now?
50 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
51 Anothr Exmpl g Fr Rgistrs
52 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
53 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
54 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
55 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
56 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
57 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
58 Anothr Exmpl g Fr Rgistrs R 0 R 1 R 2
59 Linr Sn Rgistr Allotion This lgorithm is ll linr sn rgistr llotion n is omprtivly nw lgorithm. Avntgs: Vry iint (tr omputing liv intrvls, runs in linr tim) Prous goo o in mny instns. Allotion stp works in on pss; n gnrt o uring itrtion. Otn us in JIT ompilrs lik Jv HotSpot. Disvntgs: Impris u to us o liv intrvls rthr thn liv rngs. Othr thniqus known to suprior in mny ss.
60 An Entirly Dirnt Approh
61 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {,, } = + {, } {, } = + { } {, } = { } { } g = { g }
62 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } Wht n w inr rom ll ths vrils ing liv t this point? { } g = { g }
63 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {,, } = + {, } {, } = + { } {, } = { } { } g = { g }
64 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
65 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
66 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
67 An Entirly Dirnt Approh {,,, } = + {,, } {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
68 An Entirly Dirnt Approh {,,, } = + {,, } Rgistrs R 3 {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
69 An Entirly Dirnt Approh {,,, } = + {,, } Rgistrs R 3 {,, } = + {,, } {, } = + { } {,, } = + {, } {, } = { } g { } g = { g }
70 Th Rgistr Intrrn Grph Th rgistr intrrn grph (RIG) o ontrol-low grph is n unirt grph whr Eh no is vril. Thr is n g twn two vrils tht r liv t th sm progrm point. Prorm rgistr llotion y ssigning h vril irnt rgistr rom ll o its nighors. Thr's just on th...
71 Th On Cth This prolm is quivlnt to grpholoring, whih is NP-hr i thr r t lst thr rgistrs. No goo polynomil-tim lgorithms (or vn goo pproximtions!) r known or this prolm. W hv to ontnt with huristi tht is goo nough or RIGs tht ris in prti.
72 Th On Cth to Th On Cth
73 Th On Cth to Th On Cth I you n igur out wy to ssign rgistrs to ritrry RIGs, you'v just provn P = NP n will gt $1,000,000 hk rom th Cly Mthmtis Institut.
74 Th On Cth to Th On Cth I you n igur out wy to ssign rgistrs to ritrry RIGs, you'v just provn P = NP n will gt $1,000,000 hk rom th Cly Mthmtis Institut.
75 Bttling NP-Hrnss
76 Chitin's Algorithm Intuition: Suppos w r trying to k-olor grph n in no with wr thn k gs. I w lt this no rom th grph n olor wht rmins, w n in olor or this no i w it k in. Rson: With wr thn k nighors, som olor must lt ovr. Algorithm: Fin no with wr thn k outgoing gs. Rmov it rom th grph. Rursivly olor th rst o th grph. A th no k in. Assign it vli olor.
77 Chitin's Algorithm
78 Chitin's Algorithm g
79 Chitin's Algorithm g Rgistrs R 3
80 Chitin's Algorithm g Rgistrs R 3
81 Chitin's Algorithm g Rgistrs R 3
82 Chitin's Algorithm g Rgistrs R 3
83 Chitin's Algorithm g Rgistrs R 3
84 Chitin's Algorithm g Rgistrs R 3
85 Chitin's Algorithm g Rgistrs R 3
86 Chitin's Algorithm g Rgistrs R 3
87 Chitin's Algorithm g Rgistrs R 3
88 Chitin's Algorithm g Rgistrs R 3
89 Chitin's Algorithm g Rgistrs R 3
90 Chitin's Algorithm g Rgistrs R 3
91 Chitin's Algorithm g g Rgistrs R 3
92 Chitin's Algorithm g g Rgistrs R 3
93 Chitin's Algorithm g g Rgistrs R 3
94 Chitin's Algorithm g g Rgistrs R 3
95 Chitin's Algorithm g Rgistrs R 3
96 Chitin's Algorithm g Rgistrs R 3
97 Chitin's Algorithm g Rgistrs R 3
98 Chitin's Algorithm g Rgistrs R 3
99 Chitin's Algorithm g Rgistrs R 3
100 Chitin's Algorithm g Rgistrs R 3
101 Chitin's Algorithm g Rgistrs R 3
102 Chitin's Algorithm g Rgistrs R 3
103 Chitin's Algorithm g Rgistrs R 3
104 Chitin's Algorithm g Rgistrs R 3
105 Chitin's Algorithm g Rgistrs R 3
106 Chitin's Algorithm g Rgistrs R 3
107 On Prolm Wht i w n't in no with wr thn k nighors? Choos n rmov n ritrry no, mrking it troulsom. Us huristis to hoos whih on. Whn ing no k in, it my possil to in vli olor. Othrwis, w hv to spill tht no.
108 Chitin's Algorithm Rlo g Rgistrs
109 Chitin's Algorithm Rlo g g Rgistrs
110 Chitin's Algorithm Rlo g g Rgistrs
111 Chitin's Algorithm Rlo g g Rgistrs
112 Chitin's Algorithm Rlo g g Rgistrs
113 Chitin's Algorithm Rlo g g Rgistrs
114 Chitin's Algorithm Rlo g g Rgistrs
115 Chitin's Algorithm Rlo g g Rgistrs
116 Chitin's Algorithm Rlo g g Rgistrs
117 Chitin's Algorithm Rlo g g Rgistrs
118 Chitin's Algorithm Rlo g g Rgistrs
119 Chitin's Algorithm Rlo g g Rgistrs
120 Chitin's Algorithm Rlo g g Rgistrs
121 Chitin's Algorithm Rlo g g Rgistrs
122 Chitin's Algorithm Rlo g g Rgistrs
123 Chitin's Algorithm Rlo g g Rgistrs
124 Chitin's Algorithm Rlo (spill) g g Rgistrs
125 Chitin's Algorithm Rlo (spill) g g Rgistrs
126 Chitin's Algorithm Rlo (spill) g g Rgistrs
127 Chitin's Algorithm Rlo (spill) g g Rgistrs
128 Chitin's Algorithm Rlo (spill) g g Rgistrs
129 Chitin's Algorithm Rlo (spill) g Rgistrs
130 Chitin's Algorithm Rlo (spill) g Rgistrs
131 Anothr Exmpl
132 Anothr Exmpl
133 Anothr Exmpl Rgistrs
134 Anothr Exmpl Rgistrs
135 Anothr Exmpl Rgistrs
136 Anothr Exmpl Rgistrs
137 Anothr Exmpl Rgistrs
138 Anothr Exmpl Rgistrs
139 Anothr Exmpl Rgistrs
140 Anothr Exmpl Rgistrs
141 Anothr Exmpl Rgistrs
142 Anothr Exmpl Rgistrs
143 Anothr Exmpl Rgistrs
144 Anothr Exmpl Rgistrs
145 Anothr Exmpl Rgistrs
146 Anothr Exmpl Rgistrs
147 Anothr Exmpl Rgistrs
148 Anothr Exmpl Rgistrs
149 Anothr Exmpl Rgistrs
150 Anothr Exmpl Rgistrs
151 Anothr Exmpl Rgistrs
152 Anothr Exmpl Rgistrs
153 Anothr Exmpl Rgistrs
154 Anothr Exmpl Rgistrs
155 Anothr Exmpl Rgistrs
156 Anothr Exmpl Rgistrs
157 Anothr Exmpl Rgistrs
158 Anothr Exmpl Rgistrs
159 Anothr Exmpl Rgistrs
160 Anothr Exmpl Rgistrs
161 Anothr Exmpl Rgistrs
162 Anothr Exmpl (spill) Rgistrs
163 Anothr Exmpl (spill) Rgistrs
164 Anothr Exmpl (spill) (spill) Rgistrs
165 Chitin's Algorithm Avntgs: For mny ontrol-low grphs, ins n xllnt ssignmnt o vrils to rgistrs. Whn istinguishing vrils y us, prous pris RIG. Otn us in proution ompilrs lik GCC. Disvntgs: Cor pproh s on th NP-hr grph oloring prolm. Huristi my prou pthologilly worst-s ssignmnts.
166 Improvmnts to th Algorithm Choos wht to spill intlligntly. Us huristis (lst-ommonly us, grtst improvmnt, t.) to trmin wht to spill. Hnl spilling intlligntly. Whn spilling vril, romput th RIG s on th spill n us nw oloring to in rgistr.
167 Summry o Rgistr Allotion Critil stp in ll optimizing ompilrs. Th linr sn lgorithm uss liv intrvls to grily ssign vrils to rgistrs. Otn us in JIT ompilrs u to iiny. Chitin's lgorithm uss th rgistr intrrn grph (s on liv rngs) n grph oloring to ssign rgistrs. Th sis or th thniqu us in GCC.
Announcements. Programming Project 4 due Saturday, August 18 at 11:30AM
Rgistr Allotion Announmnts Progrmming Projt 4 u Stury, August 18 t 11:30AM OH ll this wk. Ask qustions vi mil! Ask qustions vi Pizz! No lt sumissions. Pls vlut this ours on Axss. Your k rlly mks irn. Whr
More informationA 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 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 informationCS553 Lecture Register Allocation 1
Low-Lvl Issus Lst ltur Livnss nlysis Rgistr llotion Toy Mor rgistr llotion Wnsy Common suxprssion limintion or PA2 Logistis PA1 is u PA2 hs n post Mony th 15 th, no lss u to LCPC in Orgon CS553 Ltur Rgistr
More informationRegister 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 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 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 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 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 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 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 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 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 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 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 information# 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information(a) v 1. v a. v i. v s. (b)
Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous
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 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 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 informationCS553 Lecture Register Allocation I 3
Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun
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 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 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 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 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 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 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 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 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 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 informationMore 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 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 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 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 informationXML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW
Smll Pth Quiz ML n Dtss Cn you giv n xprssion tht rturns th lst / irst ourrn o h istint pri lmnt? Ltur 8 Strming Evlution: how muh mmory o you n? Sstin Mnth NICTA n UNSW
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 informationCSCI Compiler Design
CSCI 565 - Compilr Dsign Spring 2013 Sond Tst - Solution My 1, 2013 t 3.30 PM in Room RTH 115 Durtion: 2h 30 min. Pls ll ll pgs you turn in with your nm nd studnt numr. Nm: Numr: Grd: Prolm 1 [20 points]:
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 information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationRAM Model. I/O Model. Real Machine Example: Nehalem : Algorithms in the Real World 4/9/13
4//3 RAM Mol 5-853: Algorithms in th Rl Worl Lolity I: Ch-wr lgorithms Introution Sorting List rnking B-trs Bur trs Stnr thortil mol or nlyzing lgorithms: Ininit mmory siz Uniorm ss ost Evlut n lgorithm
More informationNP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?
NP-Compltnss 1. Polynomil tim lgorithm 2. Polynomil tim rution 3.P vs NP 4.NP-ompltnss (som slis y P.T. Um Univrsity o Txs t Dlls r us) Trvling Slsprson Prolm Fin minimum lngth tour tht visits h ity on
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 informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd
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 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 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 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 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 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 informationLast time: introduced our first computational model the DFA.
Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody
More informationJonathan 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 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 informationAnnouncements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms
Grphs & Grph Algorithms Ltur CS Fll 5 Announmnts Upoming tlk h Mny Crrs o Computr Sintist Or how Computr Sin gr mpowrs you to o muh mor thn o Dn Huttnlohr, Prossor in th Dprtmnt o Computr Sin n Johnson
More informationFormal 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 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 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 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 informationInstructions 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 informationMinimum Spanning Trees
Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:
More informationChapter 9. Graphs. 9.1 Graphs
Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring.
More informationGreedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016
Ltur 4 Gry Algorithms, Ativity Sltion, Minimum Spnning Trs Sris: Logn Short (5), Virgini Dt: My, Gry Algorithms Suppos w wnt to solv prolm, n w r l to om up with som rursiv ormultion o th prolm tht woul
More information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationGraph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
More informationCSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
More 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 informationCh 1.2: Solutions of Some Differential Equations
Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of
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 informationNumbering 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 informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion
More informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion
More informationTrees as operads. Lecture A formalism of trees
Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn
More 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 informationOrganization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs
Orniztion Domintors, ontrol-pnn n SSA orm Domintor rltion o CFGs postomintor rltion Domintor tr Computin omintor rltion n tr Dtlow lorithm Lnur n Trjn lorithm Control-pnn rltion SSA orm Control-low rphs
More informationSybil 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 informationSimilarity 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 informationQuartets and unrooted level-k networks
Phylogntis Workshop, Is Nwton Institut or Mthmtil Sins Cmrig 21/06/2011 Qurtts n unroot lvl-k ntworks Philipp Gmtt Outlin Astrt n xpliit phylognti ntworks Lvl-k ntworks Unroot lvl-1 ntworks n irulr split
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More 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 informationExpert 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 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 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 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 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 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 information