Typesetting Karnaugh Maps with L A TEX and TikZ

Size: px
Start display at page:

Download "Typesetting Karnaugh Maps with L A TEX and TikZ"

Transcription

1 Typesetting Krnugh Mps with L A TEX n TikZ Luis Pulo Lus emil: lus@utfpr.eu.r Version:., Version te: 89 Astrt Krnugh mps re use to simplify logi equtions leing to the most ompt expression of two levels for given truth tle. The rwing of them use to e oring, nnoying n errorprone tsk. This set of mros inten to simplify the tsk. They n typeset Krnugh mps with up to twelve vriles, whih is more thn you might likely nee. You only hve to provie list of vrile ientiers plus the truth tle of your logi funtion. The mros lso llow to highlight the simplitions of your logi funtion iretly within Krnugh mp. This pkge is se on kvmros.tex from krnugh pkge referre herein s the originl one. The moitions rrie out intene to use Tik Z inste of ntive LATEX ommns llowing esier ustomistion, esier extension when you nee to rw other elements long with the mp n leing to higher grph qulity. Introution Krnugh mps n Veith hrts re use to simplify logi equtions. They re mp representtions of logi funtions, n in tht they re equivlent. Veith hrts re not supporte y this pkge, ut it shoul not e ig prolem to port Anres W. Wieln's veith mro, ville in krnugh pkge, if you nee it. Plese note tht this pkge, inluing its oumenttion, is se on Anres W. Wieln's previous work n the uthor wishes to register his knowlegment.. Comprison with Other Pkges If you sk yourself why nother Krnugh mp typesetting pkge? the nswer is esy: euse I ws not ompletely hppy with the pkges ville I know n those re:. krnugh: it is gret pkge tht uses ntive LATEX ommns to rw the mp. It supports Krnugh mps n Veith hrts. It employs reursive lgorithm with no size limit whih les to n interesting kin of symmetry. Rememer, Krnugh mps re ll out symmetry. It is not ustomisle, for instne, one nnot hnge the istne etween rs (the mrks showing roun the mp with vrile ientiers on them) n if the vrile ientier is long it will overlp nother r. Also, I wnt to use TikZ to rw olourful semitrnsprent gures on to top of the mp to highlight groups (prime implints) n, lthough it is possile, it is rther iult n the result is not very goo euse they lwys look it o. I hve longtime experiene with this pkge n I hve lso written jv progrm to rw the mps euse, though typesetting simple mps is esy, highlighting the prime implints is not.. krnughmp: it uses TikZ so you got lot of options for ustomistion. It is limite to eight vrile whih, to e honest, shoul e enough for nyone. The prolem is tht it only rws rs (those mrking mentione ove) up to four vriles. Also, the orer in whih the vrile list is inputte is ierent from the orer employe y krnugh. The tul limit my e ierent for you. A twelve vriles mp ontins of 9 ells in gri. They re simply too ig to hnle mnully n you shoul onsier to use softwre. It works until you low the memory out whih will hppen out ten to twelve vriles. Those rs hve een unerppreite long the history. Krnugh (9) himself lle them simplie lels n use them only to reple the Gry oe numers showing roun the mp. Their true strength is the ese wy they point out whih vrile elong to prime implint n whih oes not. An pproh muh esier thn interpreting the Gry oe numers.

2 . skmps: this pkge genertes ongurle Amerin style Krnugh mps for,, n vriles. In Ameri, inste of rs enoting the one vlue of vriles, they use Gry oe inries on the top n left sie of the mp. This ehviour n e mimi with tikzkrnugh (see Setion ), though, in my twenty yers of experiene tehing the sujet, I hve foun out tht rs re muh more intuitive. The skmps ontins four mros, one for eh numer of vriles, n it n e use to highlight the prime implints in the very sme wy tht krnugh oes.. krnughmp: uses TikZ to rw up to four mps of four vriles leing to D six vriles mp. It ontins ommns for rwing implints on top of the mp. Like skmps, this pkge uses Gry oe inste of rs. With tikzkrnugh you n typeset ig (up to twelve vriles or 9 ells) goo looking mps. Using jv softwre, you n o it utomtilly, inluing highlighting the solution.. Introutory exmple Let us strt with n introution on how to use these mros. The rst thing you hve to o is to lo Ti kz. For this type \usepkge{tikz} in the premle of your oument. Then, if the pkge is somewhere TEX n n it, lo the lirry with the ommn \usetikzlirry{krnugh}. If it is not, you n use something like \input tikzlirrykrnugh.oe. You my nee to provie the full or reltive pth to le tikzlirrykrnugh.oe.tex. Suppose now you hve logi funtion f with the following truth tle: Inex f Inex f 8 9 This logi funtion n esily e put into Krnugh mp y using the \krnughmp mro in Tik Z environment (\egin{tikzpiture}) or inline ommn (\tikz). The \krnughmp mro hs ve mntory prmeters:. the numer of vriles in the mp;. n ientier for the funtion;. list of vrile ientiers for the vriles;. the list of vlues of f for eh line in the truth tle; n. possily empty set of TikZ ommns tht will e rown efore the funtion vlues so the vlues will pper on top of them. The vrile ientiers in the thir prmeter re orere from highest to lowest signine (the sme wy s in the truth tle, with hving signine of = 8 n hving signine of = ). The list of vlues of f ws re from lowest to highest inex. The fth prmeter remins empty in this exmple, it will e isusse further on: \tikz[krnugh,enle inies] \krnughmp{}{f(,,,)}{}{ }{}; f(,,,) 8 9

3 The inies in the upper left orner of eh ell orrespon to the inies in the truth tle: The mros tht re the vrile list n the list of logi vlues (i.e., prmeters # n #) work reursively. Eh entry hs to e one hrter long n spes re llowe, otherwise like vrile ientier enlose in $s you hve to put it into urly rkets: \egin{tikzpiture}[krnugh] \krnughmp{}{$f(,,,)$}{{$$}{$$}{$$}{$$}}% f(,,, ) { }{} \en{tikzpiture} Oserve tht the lels re ll in mth moe in this exmple. Also, TikZ environment ws use so there is no semiolon (;) in the en of \krnughmp mro. Moreover, the inies were omitte y removing enle inies from the options list. Krnugh Mp Lirry Tik Z Lirry krnugh \usepgflirry{krnugh} % L A T E X n plin T E X n pure pgf \usepgflirry[krnugh] % ConT E Xt n pure pgf \usetikzlirry{krnugh} % L A T E X n plin T E X when using Tik Z \usetikzlirry[krnugh] % ConT E Xt when using Tik Z This lirry provies TEX mros to typeset Krnugh mps. This lirry enes the following key: /tikz/krnugh (no vlue) This key shoul e psse s n option to piture or sope tht ontins mp, i.e., tht lls \krnughmp mro. It will o some internl setups. \krnughmp{ num vr }{ funtion }{ vr list }{ ontents }{ eortion } This mro retes Knugh mp of num vr vriles for vrile funtion s funtion of the vriles liste in vr list for the vlues given in ontent n pplying the speie eortion. Any ut the rst prmeter n e empty. \krnughmpvert{ num vr }{ funtion }{ vr list }{ ontents }{ eortion } Similr to \krnughmp, ut mp will e trnspose (like in mtrix trnsposition). /tikz/every krnugh (style, initilly empty) The style utomtilly pplie to every Krnugh mp. Cn e gloly set using \tikzset. \kminexounter A TEX ounter for ell inex. See kmell/.style for n exmple of pplition. \kmunitlength={ length } This length sets the size of n iniviul ell in the mp. Must e set efore krnugh is use. /tikz/isle rs= oolen (efult true, initilly flse) The inies n esily e lulte from the vrile vlue in the truth tle, e.g., row : the inex equls = = =. White spes re relly usle to mke the string more rele leing to fst verition.

4 Boolen swith tht isles the typesetting of ll rs n the funtion ientier. Usle when you wnt n Amerin style mp. The initil vlue is flse mening tht the rs will e typeset unless they re expliitly isle. \egin{tikzpiture}[krnugh,isle rs] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} Note tht $f(,,)$ n {$$}{$$}{$$} re not use n oul e empty. /tikz/kmr (style, initilly ) The style use for the top n sie rs relte to the vriles n enoting the rows n olumns for whih the respetive vrile is. The initil vlue is mening they ll will e represente s line with T hppe tips. f(,, ) \egin{tikzpiture}[krnugh,kmr/.style={lue,<>}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmr lel (style, initilly empty) The style use for the vrile ientiers on the rs. f(,, ) \egin{tikzpiture}[krnugh, kmr lel/.style={lue,font=\lrge}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmr sep= with (no efult, initilly.\kmunitlength) The istne etween the r loser to the mp n the mp itself. It epens minly on the line tip use in kmlines/.style. \egin{tikzpiture}[krnugh,kmr sep=\kmunitlength] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} f(,, ) /tikz/kmr top sep= with The istne etween two rs on top of mp. kmr lel/.style. (no efult, initilly \kmunitlength) It epens minly on the font height use in

5 \egin{tikzpiture}[krnugh,kmr top sep=\kmunitlength] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} f(,, ) /tikz/kmr left sep= with (no efult, initilly \kmunitlength) The istne etween two rs t the left sie of mp. It epens minly on the vrile ientier with n the font size use in kmr lel/.style. f(,,, ) \egin{tikzpiture}[krnugh,kmr left sep=\kmunitlength] \krnughmp{}{$f(,,,)$}{{$$}{$$}{$$}{$$}}% { }{} \en{tikzpiture} /tikz/enle inies= oolen (efult true, initilly flse) Boolen swith tht enles the typesetting of ll inies. The initil vlue is flse mening tht the inies will not e typeset unless they re expliitly enle. \egin{tikzpiture}[krnugh,enle inies] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} f(,, ) \en{tikzpiture} /tikz/kminex The style use for ell inex if enle (see lso enle inies). (style, initilly re,font=\tiny) \egin{tikzpiture}[krnugh,enle inies, kminex/.style={lue,font=\sriptsize\itshpe}] f(,, ) \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kminexposx= imension The horizontl istne from the ell left sie to the inex entre. (no efult, initilly.\kmunitlength)

6 f(,, ) \egin{tikzpiture}[krnugh,enle inies, kminexposx=.8\kmunitlength] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kminexposy= imension The vertil istne from the ell ottom to the inex entre. (no efult, initilly.8\kmunitlength) f(,, ) \egin{tikzpiture}[krnugh,enle inies, kminexposy=.\kmunitlength] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kminexpos={ x oorinte }{ y oorinte } Sets \kminexposx n \kminexposy to x n y oorintes mesure in \kmunitlength from the ell ottom left orner. \egin{tikzpiture}[krnugh,enle inies, kminexpos={.8}{.}] f(,, ) \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/inry inex= oolen (efult true, initilly flse) Boolen swith tht sets the inex presenttion to inry oe. It is onvenient to lso set the inex oorintes. In the following exmple, the signine orer is, n, mening, is the most signint it n is the lest signint it. Therefore, the left most it of the inies is one only in the two left olumns elow r, the mile it is one in the ottom row s r extens n the right most it is one in the entrl olumns elow r. \egin{tikzpiture}[krnugh,enle inies, inry inex,kminexpos={.}{.8}] f(,, ) \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmell The style use for ell ontents. (style, initilly empty)

7 f(,, ) \egin{tikzpiture}[krnugh,kmell/.style={lue,font=\lrge}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} Some interesting pplitions of kmell/.style involves the ell inex given y \the\kminexounter. You n nme every ell for future use or ple lel within the ell inex just like enle inies oes. In the following exmple, kmell/.style is use to ple lel within eh ell with the eiml vlue of the ell inex n enle inies is for the inry vlue. Moreover, the ell ontent is lso numer tht orrespon to the ell inex (mnully ple) just to show the orreltion. f(,, ) \egin{tikzpiture}[krnugh,enle inies, inry inex,kminexpos={.}{.8}, kmell/.style={lel={[font=\sriptsize,lue, lel istne=.\kmunitlength] elow left:\the\kminexounter}, green!!lk}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmvr The style use for the vrile nme (funtion) of the mp. (style, initilly empty) f(,, ) \egin{tikzpiture}[krnugh,kmvr/.style={lue,font=\lrge}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmox The style use for the ox surrouning the mp. (style, initilly empty) f(,, ) \egin{tikzpiture}[krnugh,kmox/.style={lue,very thik}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture} /tikz/kmlines The style use for the lines seprting jent rows n olumns insie the mp. (style, initilly empty) f(,, ) \egin{tikzpiture}[krnugh,kmlines/.style={lue,very thik}] \krnughmp{}{$f(,,)$}{{$$}{$$}{$$}}{ }{} \en{tikzpiture}

8 You n options to the grphis y setting the every krnugh style whih is utomtily pplie. Mrking simplitions The lrey mentione fth prmeter n e use if you wnt to rw something insie the Krnugh mp. For exmple, this is useful if you wnt to show how you simplie logi funtion highlighting the prime implints: \egin{tikzpiture}[krnugh,x=\kmunitlength,y=\kmunitlength, thik, f(,,, ) grp/.style n rgs={}{#,fill=#!, minimum with=#\kmunitlength, minimum height=#\kmunitlength, roune orners=.\kmunitlength, fill opity=., retngle,rw}] \krnughmp{}{$f(,,,)$}{{$$}{$$}{$$}{$$}}% { }% { \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \rw[lue] (n.north) to [en left=] (n.north) (n.south) to [en right=] (n.south); \noe[grp={re}{.9}{.9}](n) t (.,.) {}; \noe[grp={re}{.9}{.9}](n) t (.,.) {}; \rw[re] (n.west) to [en right=] (n.west) (n.est) to [en left=] (n.est); } \en{tikzpiture} n the orresponing expression is: f(,,, ) = + where olours were use to relte the suexpression with the prime implint highlighte on the mp. Inste of LATEX's grphis mros you n use TikZ for this purpose. In this exmple, new style grp ws ene in orer to rw semitrnsprent retngles with speie olour, with n height (oth given in \kmunitlength). The Krnugh mp hs its tum t the lower left point extly. The entre point oorintes of those retngles re speie using the t ommn. The length of single ell within the Krnugh mp is equl to \kmunitlength. Thus, the x n y units re set to \kmunitlength so the oorintes n e written without the unit n the retngles will fll in the preise position even if one hnges the mp size y hnging the \kmunitlength. Ajusting the mp size Possily the most importnt feture tht you n hnge is the size of the igrms n it is one y hnging the size of the ells within the mp, simply y typing: As in the originl pkge. 8

9 f \kmunitlength=mm \egin{tikzpiture}[krnugh] \krnughmp{}{$f$}{}{ }{} \en{tikzpiture} The setting of the \kmunitlength remins tive until you hnge it gin; 8 the efult \kmunitlength is 8 mm: Complete exmple In this n in the next setions, exmples of how iniviul vriles n ell ontents n e formt re presente. The syntx relies on squre rkets ([]) to enlose Tik Z fetures tht hnge the pperne n more grphs to n iniviul vrile or ell ontent. Let us see more interesting n olourful exmple: 8 Or, of ourse, until you leve the group in whih you reene the vlue. 9

10 \kmunitlength=.em \egin{tikzpiture}[krnugh,x=\kmunitlength,y=\kmunitlength, } thik, grp/.style n rgs={}{#,fill=#!, minimum with=#\kmunitlength, minimum height=#\kmunitlength, roune orners=.\kmunitlength, fill opity=., retngle,rw}, kmr/.style={lue,<>,oule=white,semithik}, kmr left sep=.\kmunitlength, kmr sep=.\kmunitlength, kmr lel/.style={re!!lk,font=\lrge}, kminex/.style={ornge,font=\tiny}, enle inies, kmell/.style={yn!8!lk}, kmox/.style={rown,thik}, kmlines/.style={rown,thin}, kmvr/.style={green!!lk,font=\huge}, ll/.style={left,lign=right,text with=.\kmunitlength}] \krnughmp{}{$z_{}$}{% {$x_{}$}{$x_{}$}{$x_{}$}{$x_{}$}% {[yellow!!lk,nme=nv,,oule=re,very thik, lel={[font=\tiny,green!!lk]ove:vr.}, text=lue!!re]$x_{}$}% {$x_{}$}}% {{}{}{}{}{}{}{}{}{}{}% {[re,nme=n,lel={[nme=nl,ornge!9!lk, lel istne=\kmunitlength]left:speil}, irle,inner sep=pt,rw=green!!lue]}% {}{}{}{}{}{}{}{}{}}% { \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \noe[grp={lue}{.9}{.9}](n) t (.,.) {}; \rw[lue] (n.est) to [en left=] (n.west) (n.est) to [en left=] (n.west) (n.est) to [en right=] (n.west) (n.south) to [en right=] (n.north) (n.south) to [en left=] (n.north) (n.south) to [en right=] (n.north) (n.south) to [en left=] \noe[grp={re}{.8}{.8}](n) t (.,.) {}; \noe[grp={re}{.8}{.8}](n) t (.,.) {}; \rw[re] (n.north) to [en left=] (n.north); (n.north) (n.south) to [en right=] (n.south); \noe[grp={ornge}{.9}{.9}](n) t (.,.) {}; \noe[grp={ornge}{.9}{.9}](n) t (.,.) {}; \rw[ornge] (n.west) to [en right=] (n.west) (n.est) to [en left=] \noe[grp={tel}{.8}{.8}](n) t (.,.) {}; \noe[grp={tel}{.8}{.8}](n) t (.,.) {}; (n.est); \rw[tel] (n.west) to [en right=] (n.west) \rw[<] (Nv) +(,) (n.est) to [en left=] (n.est); noe[ll]{vrile on its r}; \rw[<] (N) +(,) noe[ll]{speil ell}; \rw[<] (Nl.) +(.,.) \en{tikzpiture} The orresponing Krnugh mp looks like this: noe[ll]{lel for speil ell};

11 x x z x x lel for speil ell vrile on its r x vr. x x Speil vr. x speil ell 9 8 en the logi expression 9 is z = x x + x x + x x x + x x x. You my notie tht the zeros were omitte (reple y {} in the list). Also, the ell is speil euse {[re,nme=n, lel={[nme=nl,ornge!9!lk, lel istne=\kmunitlength ]left: Speil}, irle, inner sep=pt, rw=green!!lue]}. You n put lmost nything insie ell using urly rkets n you n ustomize the ell style using squre rkets. The formt is: {[opt]string} where opt is n optionl set of styles (mong other Tik Z prmeters) whih will e psse s the lst option of TikZ ommn \noe n string will e written insie the ell y tht ommn. To use this syntx, it is impertive tht the very rst hrter fter the opening urly rkets ( {) e the opening squre rkets ([). Mthing pirs of squre rkets re llowe insie the optionl sequene provie tht they re protete insie pir of urly rkets. In this se, the proper ontent of ell is just the numer ner the en, ll the rest is the style pplie to this single, therefore oe etween squre rkets. The style uses TikZ syntx in orer to hnge olour, font size, lel, gure, eortion n nme it for future referene. In this se, two noes re nme N n Nl for future referene. Ner the TikZ environment en, those nmes re use to ple rrows pointing to the noes with esription. The \rw ommn tht rws those rrows nnot e ple insie the fth rgument of mro \krnughmp euse the fth rgument is typeset efore the ells ontents (the fourth rgument), therefore no nme woul e rete t the time the fth rgument is typeset. The vriles ientiers (the thir rgument) n lso e formtte iniviully using style, ut note tht the ustom style will e pplie to oth the r line n the noe for the vrile ientier. If r gets segmente, just like x r, the nme noe will e the top most if the r is vertil or the right most if the r is horizontl. The x r is ierent from the other rs euse [yellow!!lk,nme=nv,,oule=re, very thik, lel={[font=\tiny,green!!lk]ove:vr.}, text=lue!!re] hnges its pperne. The noe nme Nv is lso not ville t the time the fth rgument is typeset. So ny ommn tht mkes use of it will nee to e ple fter the en of mro \krnughmp. The istne etween rs on the left sie ws set to.\kmunitlength to prevent overlpping etween x (the lel) n x r n x n x r, ut the istne etween the rs on top ws left unhnge. The istne etween the mp n the rs losest to it ws set to.\kmunitlength to prevent overlpping etween the r tip ( ) n the mp itself. 9 This is not of ny importne here, ut I ouln't hol myself k. By the wy, if you re urious, there re nother two miniml solutions.

12 The inies n e ompute y x + 8 x + x + x + x + x whih is it izrre. The truth tle vlues ought to e rrnge oring to this inex orer. This izrreness is the prie we py to hve the vriles ple in positions whih re more intuitive. See Setion for jv softwre tht n help on this mtter. Amerin style If you relly wnt n Amerin style mp n you re not fri of mitting it pulily, you n still use this pkge to typeset it. The rst thing to o is to isle the rs n the funtion ientiers. Therefore, this option hs to e inlue in the Tik Z environment: isle rs. Then you will nee rows n olumns lels in Gry oe n ption for the mp n vriles ientiers. In the lst exmple, these n e hieve y ppening the following oe in the fth rgument of the krnughmp mro: \rw[kmox] (,8) noe[elow left,mgent]{$x_,x_,x_$} noe[ove right,violet]{$x_,x_,x_$} +(,) noe[ove left,green!!lk] {$z_$}; \foreh \x/\l in % } {/,/,/,/,/,/,/,/} { \noe[violet] t (\x+.,8.) {\l}; \noe[mgent] t (.,.\x) {\l}; The result shoul e: z x, x, x x, x, x Note, however, tht the inex insie ell oes not mth the Gry oe vlue of the respetive row n olumn. The inies n still e ompute y 8 Vertil moe x + 8 x + x + x + x + x. For n o numer of vriles, the Krnugh mp is retngulr n mro krnughmp will typeset it twie s wie s it is high (not tking into ount the rs). Like this single vrile mp: Do not use Gry oe tle to ompute the inex.

13 f() \tikz[krnugh,enle inies]% \krnughmp{}{$f()$}{{$$}}{}{}; This lyout is goo for presenttions euse the projetion re is usully wier thn higher. Pper sheets, on the other hn, re usully higher thn wier, so for ig mp you my nee something like : f() \tikz[krnugh,enle inies]% \krnughmpvert{}{$f()$}{{$$}}{}{}; This is lle, for lk of etter nme, vertil moe n it is one y the krnughmpvert mro. Note tht krnughmpvert mro rrnges the vriles in ierent orer. Compre the two squre (four vriles) mps elow in the norml (on the left) n vertil moe (on the right) pying ttention to the inies n vriles ientier. f(,,, ) f(,,, ) Norml (horizontl) moe Vertil moe The inies re lulte in the sme wy, ut their position insie the mp re ierent euse the vriles positions re ierent. It is like one mp is mirrore n then rotte 9 o (mirrore horizontlly n rotte lokwise or mirrore vertilly n rotte ounterlokwise.) Extly like mtrix trnsposition. One interesting pplition of vertil moe is when you wnt to keep onsisteny in vrile ientier position mong mps with o n even numer of vriles. For exmple, if you wnt the most signint vrile ppering on top of the mps you n use norml (horizontl) moe for mps of o numer of vriles n vertil moe for even mounts, like this: g(,,, ) 8 f(,, ) 9 Norml (horizontl) moe Vertil moe A more generl pproh is to use the jv softwre esrie in Setion to rete mps with ritrry vriles positioning. Suppose tht you esire the most signint vrile to pper t the left sie of three vriles mp. You n o the opposite of wht ws one in the lst exmple, ut you will en up with vertil mp of three vriles n mye it is not wht you wnt. Using the softwre esrie in Or you n use lnspe. Not to e onfuse with TEX vertil moe.

14 Setion llows to e ple t the left in norml (horizontl) moe mp. This will hnge the inies euse it reorers the truth tlet suh tht will no longer e the most signint vrile, ut without hnging the logi funtion. 9 If you use the originl version of the mros you ertinly hve notie numer of hnges. The most importnt one is tht now you ontrol the pperne of ell, inex, et. y hnging the style n not through mros. Also, you nee Ti kz piture environment or inline ommn. Finl remrks This is not even nerly ll you nee to know out the usge of these mros, ut it is goo strt. In se you n ug, or if you hve omments or suggestions, plese sen me n emil. The mximum size mp I oul proue ws Krnugh mp with vriles; with igger mps I only exeee TEX's min memory. This is ue to the mros' reursive lgorithm. Quite likely you will exee TEX's pity with even smller mps if they our in lrge ouments. If you nee help to typeset Krnugh mps with or without the prime implints highlighte, you n try JQM Jv Quine MCluskey for minimiztion of Boolen funtions ville on net/projets/jqmjvquinemluskey/. It n generte the solution n rete the orresponing mp se on given truth tle. One very useful feture of this softwre is tht you n reorer the vriles on the mp to suite your prtiulr pplition inste of rely exlusively on the mro to stter your vriles roun.

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

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

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

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

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

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More 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

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

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Section 2.1 Special Right Triangles

Section 2.1 Special Right Triangles Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

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

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

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

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

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

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

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

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

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

A Primer on Continuous-time Economic Dynamics

A Primer on Continuous-time Economic Dynamics Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

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

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

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

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting

More information

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2 EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

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

Momentum and Energy Review

Momentum and Energy Review Momentum n Energy Review Nme: Dte: 1. A 0.0600-kilogrm ll trveling t 60.0 meters per seon hits onrete wll. Wht spee must 0.0100-kilogrm ullet hve in orer to hit the wll with the sme mgnitue of momentum

More information

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering DIGITAL VLSI Consensus, use Krnugh + + = + + + 2n Distriutive (X + A)(X + ) = X + A DESIGN Simplifition YX + X = X Generl DeMorgn Asorption Y + XY = X + Y F(,,... z,+,.,,) F(,,...

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonal Complement (pages ) Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

More information

CS 360 Exam 2 Fall 2014 Name

CS 360 Exam 2 Fall 2014 Name CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

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

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

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

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

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

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

D. Harel, Statecharts: A visual formalism for complex systems, Science of Computer Programming 8, 1987, pp

D. Harel, Statecharts: A visual formalism for complex systems, Science of Computer Programming 8, 1987, pp Sttechrts y Kenr ooper ontents Introuction Stte igrms epth (hierrchy) Orthogonlity (concurrency) rocst ommuniction Exmple Prolems Introuction Sttechrts were introuce y vi Hrel in 1987. Hrel, Sttechrts:

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

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Trigonometry and Constructive Geometry

Trigonometry and Constructive Geometry Trigonometry nd Construtive Geometry Trining prolems for M2 2018 term 1 Ted Szylowie tedszy@gmil.om 1 Leling geometril figures 1. Prtie writing Greek letters. αβγδɛθλµπψ 2. Lel the sides, ngles nd verties

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

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

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

Writing Exams: Writing Exams. Exam Review

Writing Exams: Writing Exams. Exam Review riting Exms: riting Exms Exm Review riting Exms synhronous iruits += Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Designing finite automata II

Designing finite automata II Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

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

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

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts. Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions

More information

Solids of Revolution

Solids of Revolution Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

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

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

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

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering 5 INPUT MAPS (A) Loop squres with no friens, they n never shre. (B) Loop squres with no rothers, n simutneously loop their friens. Iterte: (A') Loop squres seperte from friens

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

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

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

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle.

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle. Mth 3329-Uniform Geometries Leture 06 1. Review of trigonometry While we re looking t Eulid s Elements, I d like to look t some si trigonometry. Figure 1. The Pythgoren theorem sttes tht if = 90, then

More information

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Spring 2018 Homework 7 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should

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

Plotting Ordered Pairs Using Integers

Plotting Ordered Pairs Using Integers SAMPLE Plotting Ordered Pirs Using Integers Ple two elsti nds on geoord to form oordinte xes shown on the right to help you solve these prolems.. Wht letter of the lphet does eh set of pirs nme?. (, )

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

(Lec 9) Multi-Level Min III: Role of Don t Cares

(Lec 9) Multi-Level Min III: Role of Don t Cares Pge 1 (Le 9) Multi-Level Min III: Role o Don t Cres Wht you know 2-level minimiztion l ESPRESSO Multi-level minimiztion: Boolen network moel, Algeri moel or toring Retngle overing or extrtion Wht you on

More information

Digital Circuit Engineering

Digital Circuit Engineering Digitl Ciruit Engineering 5 IN UT P MAPS (A) Loop squres with no friens, they n never shre. (B) Loop squres with no rothers, n simutneously loop their friens. Iterte: (A') Loop squres seperte from friens

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

DeMorgan s Theorem. The dual DeMorgan D + E = D E D+E D E 1 D NOR D E. Slide 29 Modified; January 3, 2006 John Knight Digital Circuits p.

DeMorgan s Theorem. The dual DeMorgan D + E = D E D+E D E 1 D NOR D E. Slide 29 Modified; January 3, 2006 John Knight Digital Circuits p. DeMorgn s Theorem DeMorgn s Theorems, Simple orms DeMorgn s Theorem DeMorgn s Theorems, Simple orms DeMorgn The ul DeMorgn A + B = A B (DeM) D + E = D E (DeM2) Inverse The ul inverse A + B = A B D E =

More information

Exploring parametric representation with the TI-84 Plus CE graphing calculator

Exploring parametric representation with the TI-84 Plus CE graphing calculator Exploring prmetric representtion with the TI-84 Plus CE grphing clcultor Richrd Prr Executive Director Rice University School Mthemtics Project rprr@rice.edu Alice Fisher Director of Director of Technology

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem HS Pre-Alger Notes Unit 9: Roots, Rel Numers nd The Pythgoren Theorem Roots nd Cue Roots Syllus Ojetive 5.4: The student will find or pproximte squre roots of numers to 4. CCSS 8.EE.-: Evlute squre roots

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

MCH T 111 Handout Triangle Review Page 1 of 3

MCH T 111 Handout Triangle Review Page 1 of 3 Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More 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

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

CMSC 330: Organization of Programming Languages

CMSC 330: Organization of Programming Languages CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information