Logic Synthesis and Verification

Size: px
Start display at page:

Download "Logic Synthesis and Verification"

Transcription

1 Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most of the following slides re y ourtesy of Andres Kuehlmnn 2 Boolen Funtion Representtion Sum of Produts A funtion n e represented y sum of ues (produts): E.g., f = + + Sine eh ue is produt of literls, this is sum of produts (SOP) representtion An SOP n e thought of s set of ues F E.g., F = {,, A set of ues tht represents f is lled over of f E.g., F ={,, nd F 2 ={,,, re overs of f = + +. List of Cues (Cover Mtrix) We often use mtrix nottion to represent over: Exmple F = + d = d d 2 2 or - - d Eh row represents ue mens tht the positive literl ppers in the ue mens tht the negtive literl ppers in the ue 2 (or -) mens tht the vrile does not pper in the ue. It impliitly represents oth nd vlues. 3 4

2 PLA A PLA is (multiple-output) funtion f : B n B m represented in SOP form n=3, m=3 over mtrix PLA Eh distint ue ppers just one in the ANDplne, nd n e shred y (multiple) outputs in the OR-plne, e.g., ue () f f 2 f Extensions from single-output to multiple-output minimiztion theory re strightforwrd f f 2 f SOP Irredundnt Cue The over (set of SOPs) n effiiently represent mny prtil logi funtions (i.e., for mny prtil funtions, there exist smll overs) Two-level minimiztion seeks the over of minimum size (lest numer of ues) = onset minterm Note tht eh onset minterm is overed y t lest one of the ues! None of the offset minterms is overed 7 Let F = {, 2,, k e over for f, i.e., f = i k = i A ue i F is irredundnt if F\{ i f Exmple f = + + F\{ f Not overed 8

3 Prime Cue A literl x ( vrile or its negtion) of ue F (over of f) is prime if (F \ {) { x f, where x (oftor w.r.t. x) is with literl x of deleted A ue of F is prime if ll its literls re prime Exmple f = xy + xz + yz = xy; y = x (literl y deleted) F \ { { y = x + xz + yz z yz xz x Prime nd Irredundnt Cover Definition. A over is prime (resp. irredundnt) if ll its ues re prime (resp. irredundnt) Definition 2. A prime (ue) of f is essentil (essentil prime) if there is onset minterm (essentil vertex) in tht prime ut not in ny other prime Definition 3. Two ues re orthogonl if they do not hve ny minterm in ommon E.g. = xy 2 = y z re orthogonl = x y 2 = yz re not orthogonl inequivlent to f sine offset vertex is overed x y 9 Prime nd Irredundnt Cover Inompletely Speified Funtion Exmple f = + d + d is prime nd irredundnt. is essentil sine d, ut not in d or d or d Why is d not n essentil vertex of? Wht is n essentil vertex of? Wht other ue is essentil? Wht prime is not essentil? d d d Let F = (f, d, r) : B n {,, *, where * represents don t re f = onset funtion f(x)= F(x)= r = offset funtion r(x)= F(x)= d = don t re funtion d(x)= F(x)=* (f,d,r) forms prtition of B n, i.e, f + d + r = B n (f d) = (f r) = (d r) = (pirwise disjoint) (Here we don t distinguish hrteristi funtions nd the sets they represent) 2

4 Inompletely Speified Funtion A ompletely speified funtion g is over for F = (f,d,r) if f g f+d gr = if xd (i.e. d(x)=), then g(x) n e or ; if xf, then g(x) = ; if xr, then g(x) = We don t re whih vlue g hs t xd Prime of Inompletely Speified Funtion Definition. A ue is prime of F = (f,d,r) if f+d (n implint of f+d), nd no other implint (of f+d) ontins (i.e., it is simply prime of f+d) Definition. Cue j of over G = { i of F = (f,d,r) is redundnt if f G\{ j ; otherwise it is irredundnt Note tht f+d r = 3 4 Prime of Inompletely Speified Funtion Exmple Consider logi minimiztion of F(,,)=(f,d,r) with f= + + nd d = + on off don t re F ={,, Expnd F 2 ={,, is redundnt is prime F 3 = {, Expnd Cheking of Prime nd Irredundny Let G e over of F = (f,d,r), nd D e over for d i G is redundnt iff i (G\{ i ) D () (Let G i G\{ i D. Sine i G i nd f G f+d, then i i f+ i dnd i f G\{ i. Thus f G\{ i.) A literl l i is prime if ( i \{ l ) ( = ( i ) l ) is not n implint of F A ue i is prime of F iff ll literls l i re prime Literl l i is not prime ( i ) l f+d (2) Note: Both tests () nd (2) n e heked y tutology (to e explined): (G i ) i (implies i redundnt) (fd) (i)l (implies l not prime) The ove two oftors re with respet to ues insted of literls F 4 = {, 5 6

5 (Literl) Coftor (Literl) Coftor Let f : B n B e Boolen funtion, nd x= (x, x 2,, x n ) the vriles in the support of f; the oftor f of f y literl = x i or = x i is f xi (x, x 2,, x n ) = f (x,, x i-,, x i+,, x n ) f xi (x, x 2,, x n ) = f (x,, x i-,, x i+,, x n ) The omputtion of the oftor is fundmentl opertion in Boolen resoning! Exmple f = + f = 7 The oftor Cx j of ue C (representing some Boolen funtion) with respet to literl x j is C if x j nd x j do not pper in C C\{x j if x j ppers positively in C, i.e., x j C if x j ppers negtively in C, i.e., x j C Exmple C = x x 4 x 6, Cx 2 = C (x 2 nd x 2 do not pper in C) Cx = x 4 x 6 (x ppers positively in C) Cx 4 = (x 4 ppers negtively in C) 8 (Literl) Coftor Exmple F = + d + d F = + d (Just drop everywhere nd throw wy ues ontining literl ) Coftor nd disjuntion ommute! Shnnon Expnsion Let f : B n B Shnnon Expnsion: f = x i f xi + x i f xi Theorem: F is over of f. Then F = x i F xi + x i F xi We sy tht f nd F re expnded out x i, nd x i is lled the splitting vrile 9 2

6 Shnnon Expnsion Exmple F = + + F = F + F = (++)+ () = +++ Cue got split into two ues (Cue) Coftor The oftor f C of f y ue C is f with the fixed vlues indited y the literls of C E.g., if C = x i x j, then x i = nd x j = For C = x x 4 x 6, f C is just the funtion f restrited to the suspe where x = x 6 = nd x 4 = Note tht f C does not depend on x,x 4 or x 6 nymore (However, we still onsider f C s funtion of ll n vriles, it just hppens to e independent of x,x 4 nd x 6 ) x f f x E.g., for f = +, f = f = nd f = 2 22 (Cue) Coftor The oftor of the over F of some funtion f is the sum of the oftors of eh of the ues of F If F={, 2,, k is over of f, then F = {( ), ( 2 ),, ( k ) is over of f Continment vs. Tutology A fundmentl theorem tht onnets funtionl ontinment nd tutology: Theorem. Let e ue nd f funtion. Then f f. Proof. We use the ft tht xf x = xf, nd f x is independent of x. () Suppose f. Then f = f =. Thus, f. () Suppose f. Then f+=f. In ddition, f = (f+) = f +=. Thus, f =. f 23 24

7 Cheking of Prime nd Irredundny (Revisited) Let G e over of F = (f,d,r). Let D e over for d i G is redundnt iff i (G\{ i ) D () (Let G i G\{ i D. Sine i G i nd f G f+d, then i i f+ i dnd i f G\{ i. Thus f G\{ i.) A literl l i is prime if ( i \{ l ) ( = ( i ) l ) is not n implint of F A ue i is prime of F iff ll literls l i re prime Literl l i is not prime ( i ) l f+d (2) Note: Both tests () nd (2) n e heked y tutology (explined): (G i ) i (implies i redundnt) (fd) (i)l (implies l not prime) The ove two oftors re with respet to ues insted of literls Generlized Coftor Definition. Let f, g e ompletely speified funtions. The generlized oftor of f with respet to g is the inompletely speified funtion: o( f,g) ( f g,g, f g) Definition. Let = (f, d, r) nd g e given. Then o(,g) ( f g,d g,r g) Shnnon vs. Generlized Coftor Shnnon vs. Generlized Coftor Let g = x i. Shnnon oftor is f xi (x, x 2,, x n ) = f (x,, x i-,, x i+,, x n ) Generlized oftor with respet to g=x i is Note tht o( f, x i ) ( f x i, x i, f x i ) f on off Don t t re f x i f xi f x i x i f x i In ft f xi is the unique over of o(f, x i ) independent of the vrile x i. o( f,) ( f,, f ) f 27 28

8 Shnnon vs. Generlized Coftor Shnnon vs. Generlized Coftor o( f,) ( f,, f ) Shnnon Coftor Generlized Coftor f So f f f f f f x f x x f x f f x y f xy f g y f y g y f x f x f g o( f,g) g o( f,g) o(o( f, g),h) o( f,gh) o( f g,h) o( f,h) o(g,h) o( f,g) o( f,g) We will get k to the use of generlized oftor lter 29 3 Dt Struture for SOP Mnipultion most of the following slides re y ourtesy of Andres Kuehlmnn Opertion on Cue Lists AND opertion: tke two lists of ues ompute pir-wise AND etween individul ues nd put result on new list represent ues in omputer words implement set opertions s it-vetor opertions Algorithm AND(List_of_Cues C,List_of_Cues C2) { C = foreh C { foreh 2 C2 { = 2 C = C return C 3 32

9 Opertion on Cue Lists OR opertion: tke two lists of ues omputes union of oth lists Nive implementtion: Algorithm OR(List_of_Cues C, List_of_Cues C2) { return C C2 On-the-fly optimiztions: remove ues tht re ompletely overed y other ues omplexity is O(m 2 ); m is length of list onjoin djent ues (onsensus opertion) remove redundnt ues? onp-omplete too expensive for non-orthogonl lists of ues Opertion on Cue Lists Simple trik: keep ues in lists orthogonl hek for redundny eomes O(m 2 ) ut lists eome signifintly lrger (worst se: exponentil) Exmple OR = Opertion on Cue Lists Opertion on Cue Lists Adding ues to orthogonl list: Algorithm ADD_CUBE(List_of_Cues C, Cue ) { if(c = ) return { = TOP(C) Cres = - /* hopping off minterms my result in multiple ues */ foreh res Cres { C = ADD_CUBE(C\{,res) { return C How n the ove proedure e further improved? Wht out the AND opertion, does it gin from orthogonl ue lists? Nive implementtion of COMPLEMENT opertion pply De Morgn s lw to SOP omplement eh ue nd use AND opertion Exmple Input non-orth. orthogonl - => ---- => Nive implementtion of TAUTOLOGY hek omplement funtion using the COMPLEMENT opertor nd hek for emptiness We will show tht we n do etter thn tht! 35 36

10 Tutology Cheking Let A e n orthogonl over mtrix, nd ll ues of A e pir-wise distinguished y t lest two literls (this n e hieved y n on-the-fly merge of ue pirs tht re distinguished y only one literl) Does the following onjeture hold? A A hs row of ll - s? This would drmtilly simplify the tutology hek! Tutology Cheking Algorithm CHECK_TAUTOLOGY(List_of_Cues C) { if(c == ) return FALSE; if(c == {-...-)return TRUE; // ue with ll - xi = SELECT_VARIABLE(C) C = COFACTOR(C,Xi) if(check_tautology(c) == FALSE) { print xi = return FALSE; C = COFACTOR(C,Xi) if(check_tautology(c) == FALSE) { print xi = return FALSE; return TRUE; Tutology Cheking Tutology Cheking Implementtion triks Vrile ordering: pik vrile tht minimizes the two su-ses ( - s get replited into oth ses) Quik deision t lef: return TRUE if C ontins t lest one omplete - ue mong others (se ) return FALSE if numer of minterms in onset is < 2 n (se 2) return FALSE if C ontins sme literl in every ue (se 3) 39 Exmple x x x x4 x4 x x2 x tutology (se ) ---- tutology (se ) tutology (se ) not tutology (se 3) not tutology (se 3) 4

11 Speil Funtions Definition. A funtion f : B n B is symmetri with respet to vriles x i nd x j iff f(x,,x i,,x j,,x n ) = f(x,,x j,,x i,,x n ) Definition. A funtion f : B n B is totlly symmetri iff ny permuttion of the vriles in f does not hnge the funtion Symmetry n e exploited in serhing BDD sine f xx f xx i j i j - n skip one of four su-ses - used in utomti vrile ordering for BDDs Speil Funtions Definition. A funtion f : B n B is positive unte in vrile x i iff f xi f xi This is equivlent to monotone inresing in x i : f (m ) f (m ) for ll min-term pirs (m -, m + ) where m j m j, j i m i m i Exmple (, ) with i = Speil Funtions Speil Funtions Similrly for negtive unte f xi f xi Exmple monotone deresing f (m ) f (m ) A funtion is unte in x i if it is positive unte or negtive unte in x i Definition. A funtion is unte if it is unte in eh vrile Definition. A over F is positive unte in x i iff x i j for ll ues j F Note tht over of unte funtion is not neessrily unte! (However, there exists unte over for unte funtion.) f m + positive unte in, negtive unte in m - f(m- )= f(m+ )= 43 44

12 Key pruning tehnique is sed on exploiting the properties of unte funtions sed on the ft tht unte lef ses n e solved effiiently New se splitting heuristi splitting vrile is hosen so tht the funtions t lower nodes of the reursion tree eome unte Unte overs F hve mny extrordinry properties: If prime over F is miniml with respet to singleue ontinment, ll of its ues re essentil primes In this se F is the unique minimum ue representtion of its logi funtion A unte over represents tutology iff it ontins ue with no literls, i.e., single tutologous ue This type of impliit enumertion pplies to mny suprolems (prime genertion, redution, omplementtion, et.). Hene, we refer to it s the Unte Reursive Prdigm Crete oftoring tree stopping t unte overs hoose, t eh node, the most inte vrile for splitting iterte until no inte vrile left (unte lef) 2. Operte on the unte over t eh lef to otin the result for tht lef. Return the result 3. At eh non-lef node, merge (ppropritely) the results of the two hildren. merge Min ide: Opertion on unte lef is omputtionlly less omplex Opertions: omplement, simplify, tutology, prime genertion,... Binte selet heuristi Tutology nd other progrms sed on the unte reursive prdigm use heuristi lled BINATE_SELECT to hoose the splitting vrile in reursive Shnnon expnsion The ide is, for given over F, hoose the vrile whih ours, oth positively nd negtively, most often in the ues of F 47 48

13 Binte selet heuristi Exmple Unte nd non-unte overs: d G = +d d F = + d+d Choose for splitting! is unte is not unte Binte vriles of over re those with oth s nd s in the orresponding olumn In the unte reursive prdigm, the BINATE_SELECT heuristi hooses (most) inte vrile for splitting, whih is thus eliminted from the su-overs Exmple f d d unte f e d de e F C F C ---- unte --- unte - - F= F= unte ---- unte 5 Unte Redution Let F(x) e over. Let (,) e prtition of the vriles x, nd let A F T C F where. the olumns of A ( unte sumtrix) orrespond to vriles of x 2. T is mtrix of ll - s Theorem. Assume A. Then F F* Unte Redution Exmple A F T C F We pik for the prtitioning unte vriles euse it is esy to deide tht A 5 52

14 Unte Redution Exmple A A 2 A 3 B B 2 Assume A nd A 2 re unte nd hve no row of ll - s. Note tht A 3 nd A 4 re unte (single-row su-mtries) Consequently only hve to look t D to test if this is tutology A 4 D Unte Redution Theorem: A F T C F Let A e non-tutologil unte mtrix (A) nd T is mtrix of ll - s. Then F F*. Proof: If prt: Assume F*. Then we n reple F* y ll - s. Then lst row of F eomes row of ll - s, so tutology Unte Redution Proof (ont d): Only if prt: Assume F*. Then there is minterm m 2 (in vriles) suh tht F* m2 = (oftor in ue), i.e. m 2 is not overed y F*. Similrly, m (in vriles) exists where A m =, i.e. m is not overed y A. Now the minterm m m 2 (in the full vrile set) stisfies F m m 2 =. Sine m m 2 is not overed y F, F. Applition Tutology Cheking Improved tutology hek Algorithm CHECK_TAUTOLOGY(List_of_Cues C) { if(c == ) return FALSE; if(c == {-...-) return TRUE; // ue with ll - C = UNATE_REDUCTION(C) xi = BINATE_SELECT(C) C = COFACTOR(C,xi) if(check_tautology(c) == FALSE) { return FALSE; C = COFACTOR(C,xi) if(check_tautology(c) == FALSE) { return FALSE; return TRUE; 55 56

15 Applition Tutology Cheking Applition Complement Exmple x x x x4 x4 Unte redution x x2 x not tutology (se 2 nd 3) tutology (se ) tutology (se ) tutology (se ) not tutology (se 3) not tutology (se 3) 57 We hve shown how tutology hek (SAT hek) n e implemented reursively using the Binry Deision Tree Similrly, we n implement Boolen opertions reursively, e.g. the COMPLEMENT opertion: Theorem. Proof. f x f x f g x fx x f f x f x f x x f g g f f g x x x 58 Applition Complement Complement opertion on ue list Algorithm COMPLEMENT(List_of_Cues C) { if(c ontins single ue ) { Cres = omplement_ue() // generte one ue per return Cres // literl l in with l else { xi = SELECT_VARIABLE(C) C = COMPLEMENT(COFACTOR(C,xi)) xi C = COMPLEMENT(COFACTOR(C,xi)) xi return OR(C,C) Applition Complement Effiient omplement of unte over Ide: vriles pper only in one polrity on the originl over ( + + ) = ( + )( + )( + ) when multiplied out, numer of produts re redundnt = + + we just need to look t the omintions for whih the vriles over ll originl ues (see the following exmple) this works independent of the polrity of the vriles euse of symmetry to the (,,,,) se (see the following exmple) 59 6

16 Applition Complement Applition Complement Mp (unte) over mtrix F into Boolen mtrix B F d e B d e onvert:, in F to in B (literl is present) - in F to in B (literl is not present) Find ll miniml olumn overs of B. A olumn over is set of olumns J suh tht for eh row i, jj suh tht B ij = Exmple {,4 is miniml olumn over for mtrix B All rows overed y t lest one 6 62 Applition Complement Applition Complement For eh miniml olumn over rete ue with opposite olumn literl from F Exmple By seleting olumn over {,4, d is ue of f d e d e The set of ll miniml olumn overs = over of f Exmple d e d e {(,4), (2,3), (2,5), (4,5) is the set of ll miniml overs. This trnsltes into: f d e d e 63 64

17 Applition Complement Theorem (unte omplement theorem): Let F e unte over of f. The set of ues ssoited with the miniml olumn overs of B is ue over off. Proof: We first show tht ny suh ue generted is in the offset of f, y showing tht the ue is orthogonl with ny ue of F. Note, the literls of re the omplemented literls of F. Sine F is unte over, the literls of F re just the union of the literls of eh ue of F). For eh ue m i F, jj suh tht B ij =. J is the olumn over ssoited with. Thus, (m i ) j = x j j =x j nd (m i ) j =x j j = x j. Thus m i =. Thus f. Applition Complement Proof (ont d): We now show tht ny minterm m f is ontined in some ue generted: First, m must e orthogonl to eh ue of F. For eh row of F, there is t lest one literl of m tht onflits with tht row. The union of ll olumns (literls) where this hppens is olumn over of B Hene this union ontins t lest one miniml over nd the ssoited ue ontins m Applition Complement The unte overing prolem finds minimum olumn over for given Boolen mtrix B Unte omplementtion is one pplition sed on the unte overing prolem Unte Covering Prolem: Given mtrix B, with B ij {,, find x, with x i {,, suh tht Bx (omponentwise inequlity) nd j x j is minimized Sometimes we wnt to minimize j j x j where j is ost ssoited with olumn j 67

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09 Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

More information

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2 BOOLEAN METHODS Giovnni De Miheli Stnford University Boolen methods Exploit Boolen properties. { Don't re onditions. Minimiztion of the lol funtions. Slower lgorithms, etter qulity results. Externl don't

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

1. Logic verification

1. Logic verification . Logi verifition Bsi priniples of OBDD s Vrile ordering Network of gtes => OBDD s FDD s nd OKFDD s Resoning out iruits Struturl methods Stisfiility heker Logi verifition The si prolem: prove tht two iruits

More information

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches. Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

Functions. mjarrar Watch this lecture and download the slides

Functions. mjarrar Watch this lecture and download the slides 9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

More Properties of the Riemann Integral

More Properties of the Riemann Integral More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

m2 m3 m1 (a) (b) (c) n2 n3

m2 m3 m1 (a) (b) (c) n2 n3 Outline LOGIC SYNTHESIS AND TWO-LEVEL LOGIC OPTIMIZATION Giovnni De Miheli Stnford University Overview of logi synthesis. Comintionl-logi design: { Bkground. { Two-level forms. Ext minimiztion. Covering

More information

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18 Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

arxiv: v1 [math.ca] 21 Aug 2018

arxiv: v1 [math.ca] 21 Aug 2018 rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

Hardware Verification 2IMF20

Hardware Verification 2IMF20 Hrdwre Verifition 2IMF20 Julien Shmltz Leture 02: Boolen Funtions, ST, CEC Course ontent - Forml tools Temporl Logis (LTL, CTL) Domin Properties System Verilog ssertions demi & Industrils Proessors Networks

More information

Alpha Algorithm: Limitations

Alpha Algorithm: Limitations Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Reference : Croft & Davison, Chapter 12, Blocks 1,2. A matrix ti is a rectangular array or block of numbers usually enclosed in brackets.

Reference : Croft & Davison, Chapter 12, Blocks 1,2. A matrix ti is a rectangular array or block of numbers usually enclosed in brackets. I MATRIX ALGEBRA INTRODUCTION TO MATRICES Referene : Croft & Dvison, Chpter, Blos, A mtri ti is retngulr rr or lo of numers usull enlosed in rets. A m n mtri hs m rows nd n olumns. Mtri Alger Pge If the

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France) Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Hybrid Systems Modeling, Analysis and Control

Hybrid Systems Modeling, Analysis and Control Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Boolean algebra.

Boolean algebra. http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

September 13 Homework Solutions

September 13 Homework Solutions College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

MAT 403 NOTES 4. f + f =

MAT 403 NOTES 4. f + f = MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn

More information

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Boolean Algebra cont. The digital abstraction

Boolean Algebra cont. The digital abstraction Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive

More information

Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

2. Binary Decision Diagrams Fachgebiet Rechnersysteme1

2. Binary Decision Diagrams Fachgebiet Rechnersysteme1 2. Binry Deision Digrms Fhgeiet Rehnersysteme 2. Binry Deision Digrms Verifition Tehnology Content 2. BDD onepts 2.22 Vrile orderings 2.3 OBDD lgorithms 2.4 FDD s nd OKFDD s 2.5 Integer vlued deision digrms

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations) KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A

More information

(Lec 4) Binary Decision Diagrams: Manipulation

(Lec 4) Binary Decision Diagrams: Manipulation (Le 4) Binry Deision Digrms: Mnipultion Wht you know Bsi BDD t struture DAG representtion How vrile orering + reution = nonil A few immeite pplitions eg, trivil tutology heking Wht you on t know Algorithms

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Maintaining Mathematical Proficiency

Maintaining Mathematical Proficiency Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now

More information

Solutions to Assignment 1

Solutions to Assignment 1 MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove

More information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

MATH Final Review

MATH Final Review MATH 1591 - Finl Review November 20, 2005 1 Evlution of Limits 1. the ε δ definition of limit. 2. properties of limits. 3. how to use the diret substitution to find limit. 4. how to use the dividing out

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information