Where We Are. Incorrect Programs. Non-Context-Free Syntax. Goals of Semantic Analysis. Type Information CS412/CS413

Size: px
Start display at page:

Download "Where We Are. Incorrect Programs. Non-Context-Free Syntax. Goals of Semantic Analysis. Type Information CS412/CS413"

Transcription

1 Where We Are CS412/CS413 Iroduco o Copers T Teebau Lecure 12: Sbo Tabes Februar 20, 2007 Source code (characer srea) Toke srea Absrac sa ree (AST) Decoraed AST f (b == 0) a = b; f ( b == 0 ) a = b ; f == b 0 f booea == b 0 = a b = a b vaue Leca Aass Sa Aass (Parsg) Seac Aass Errors (correc progra) CS 412/413 Sprg 2007 Iroduco o Copers 1 CS 412/413 Sprg 2007 Iroduco o Copers 2 No-Coe-Free Sa Progras ha are correc wh respec o he aguage s eca ad coe-free sacc rues a s coa oher sacc errors Leca aass ad coe-free sa aass are o powerfu eough o esure he correc usage of abes, obecs, fucos, saees, ec. No-coe-free sacc aass s kow as seac aass CS 412/413 Sprg 2007 Iroduco o Copers 3 Icorrec Progras Eape 1: eca aass does o dsgush bewee dffere abe or fuco defers ( reurs he sae oke for a defers) a; a; a = 1; b = 1; Eape 2: sa aass does o correae he decaraos wh he uses of abes he progra: a; a = 1; a = 1; Eape 3: sa aass does o correae he pes fro he decaraos wh he uses of abes: a; a; a = 1; a = 1.0; CS 412/413 Sprg 2007 Iroduco o Copers 4 Goas of Seac Aass Seac aass esures ha he progra sasfes a se of addoa rues regardg he usage of prograg cosrucs (abes, obecs, epressos, saees) Eapes of seac rues: Varabes us be decared before beg used A abe shoud o be decared upe es he sae scope I a assge saee, he abe ad he assged epresso us have he sae pe The codo of a f-saee us have pe Booea Soe caegores of rues: Seac rues regardg pes Seac rues regardg scopes CS 412/413 Sprg 2007 Iroduco o Copers 5 Tpe Iforao Tpe forao cassfes a progra s cosrucs (e.g., abes, saees, epressos, fucos) o caegores, ad poses rues o her use ( ers of hose caegores) wh he goa of avodg rue errors abes: a; eger ocao epressos: (a+1) == 2 Booea saees: a = 1.0; vod fucos: pow(, ) CS 412/413 Sprg 2007 Iroduco o Copers 6 1

2 Tpe Checkg Tpe checkg s he vadao of he se of pe rues Eapes: The pe of a abe us ach he pe fro s decarao The operads of arhec epressos (+, *, -, /) us have eger pes; he resu has eger pe The operads of coparso epressos (==,!=) us have eger or srg pes; he resu has Booea pe Tpe Checkg More eapes: For each assge saee, he pe of he updaed abe us ach he pe of he epresso beg assged For each ca saee (v 1,, v ), he pe of each acua ue v us ach he pe of he correspodg fora ue f fro he decarao of fuco The pe of he reur vaue us ach he reur pe fro he decarao of he fuco Tpe checkg: e wo ecures. CS 412/413 Sprg 2007 Iroduco o Copers 7 CS 412/413 Sprg 2007 Iroduco o Copers 8 Scope Iforao Scope forao characerzes he decarao of defers ad he poros of he progra where use of each defer s aowed Eape defers: abes, fucos, obecs, abes Leca scope s a eua rego he progra Saee bock Fora ue s Obec bod Fuco or ehod bod Modue bod Whoe progra (upe odues) Scope of a defer: he eca scope whch s vad Scope Iforao Scope of abes saee bocks: { a; scope of abe a { b; scope of abe b I C: Scope of fe sac abes: curre fe Scope of eera abes: whoe progra Scope of auoac abes, fora paraeers, ad fuco sac abes: he fuco CS 412/413 Sprg 2007 Iroduco o Copers 9 CS 412/413 Sprg 2007 Iroduco o Copers 10 Scope of fora ues of fucos/ehods: facora( ) { Scope of abes: vod f() { goo ; : a =1; goo ; Scope Iforao scope of fora paraeer scope of abe Scope Iforao Scope of obec feds ad ehods: cass A { prvae ; pubc vod g() { =1; cass B eeds A { pubc h() { g(); scope of fed scope of ehod g CS 412/413 Sprg 2007 Iroduco o Copers 11 CS 412/413 Sprg 2007 Iroduco o Copers 12 2

3 Seac Rues for Scopes Ma rues regardg scopes: Rue 1: Use a defer o f defed ecosg scope Rue 2: Do o decare defers of he sae kd wh deca aes ore ha oce he sae eca scope Ca decare defers wh he sae ae wh deca or overappg eca scopes f he are of dffere kds cass X { X; vod X( X) { X: for(;;) break X; X( X) { X; goo X; { X; X: X = 1; No Recoeded! CS 412/413 Sprg 2007 Iroduco o Copers 13 Sbo Tabes Seac checks refer o properes of defers he progra -- her scope or pe Need a evroe o sore he forao abou defers = sbo abe Each er he sbo abe coas he ae of a defer addoa forao: s kd, s pe, f s cosa, NAME p KIND fu TYPE boo boo ATTRIBUTES eer auo cos cos CS 412/413 Sprg 2007 Iroduco o Copers 14 Scope Iforao Eape How o represe scope forao he sbo abe? Idea: There s a herarch of scopes he progra Use a sar herarch of sbo abes Oe sbo abe for each scope Each sbo abe coas he sbos decared ha eca scope ; vod f( ) {, ; {, ; ; { ; : ; g( ) { boo ; ; fuc f sab Goba sab f fu vod g fu ab fuc g sab boo CS 412/413 Sprg 2007 Iroduco o Copers 15 CS 412/413 Sprg 2007 Iroduco o Copers 16 Idefers Wh Sae Nae The herarchca srucure of sbo abes auoaca soves he probe of resovg ae cosos (defers wh he sae ae ad overappg scopes) To fd he decarao of a defer ha s acve a a progra po: Sar fro he curre scope Go up he herarch u ou fd a defer wh he sae ae ; vod f( ) {, ; {, ; = 1; { ; : = 2; g( ) { boo ; = 3; Eape Goba sab f fu vod g fu ab = 1 = 2 boo = 3 CS 412/413 Sprg 2007 Iroduco o Copers 17 CS 412/413 Sprg 2007 Iroduco o Copers 18 3

4 ; Cachg Seac Errors vod f( ) {, ; {, ; = 1; { ; : = 2; g( ) { boo ; = 3; f g fu vod fu ab = 1 = 2 Error! boo = 3 Sbo Tabe Operaos Three operaos Creae a ew ep sbo abe wh a gve pare abe Iser a ew defer a sbo abe (or error) Lookup a defer a sbo abe (or error) Cao bud sbo abes durg eca aass herarch of scopes ecoded he sa Bud he sbo abes: Whe parsg, usg he seac acos Afer he AST s cosruced CS 412/413 Sprg 2007 Iroduco o Copers 19 CS 412/413 Sprg 2007 Iroduco o Copers 20 Arra Ipeeao Spe peeao = arra Oe er per sbo Sca he arra for ookup, copare ae a each er Ls Ipeeao Dac srucure = s Oe ce per er he abe Ca grow daca durg copao p fu boo boo Dsadvaage: abe has fed sze eed o kow advace he uber of eres fuc boo Dsadvaage: effce for e sbo abes eed o sca haf he s o average p Var boo CS 412/413 Sprg 2007 Iroduco o Copers 21 CS 412/413 Sprg 2007 Iroduco o Copers 22 Hash Tabe Ipeeao Effce peeao = hash abe I s a arra of ss (buckes) Uses a hashg fuco o ap he sbo ae o he correspodg bucke: hashfuc : srg Good hash fuco = eve dsrbuo he buckes fuc hashfuc( ) = 0, hashfuc( ) = 3 p boo Forward Refereces Forward refereces = use a defer wh he scope of s decarao, bu before s decared A coper phase ha uses he forao fro he sbo abe us be perfored afer he abe s cosruced Cao pe-check ad bud sbo abe a he sae e Eape: cass A { () { reur (); () { reur 1; CS 412/413 Sprg 2007 Iroduco o Copers 23 CS 412/413 Sprg 2007 Iroduco o Copers 24 4

5 Suar Seac checks esure he correc usage of abes, obecs, epressos, saees, fucos, ad abes he progra Scope seac checks esure ha defers are correc used wh he scope of her decarao Tpe seac checks esures he pe cossec of ous cosrucs he progra Sbo abes: a daa srucure for sorg forao abou sbos he progra Used seac aass ad subseque coper sages Ne e: pe-checkg CS 412/413 Sprg 2007 Iroduco o Copers 25 5

Abstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413

Abstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413 Abstract Syta Trees CS412/CS413 Itroductio to Copilers Ti Teitelbau Lecture 12: Visitors; Sybol Tables February 18, 2005 Separate AST costructio fro seatic checkig phase Traverse the AST ad perfor seatic

More information

Pointer Analysis. Pointer analysis. Pointer and Alias Analysis. Useful for what? Intraprocedural Points-to Analysis. Kinds of alias information

Pointer Analysis. Pointer analysis. Pointer and Alias Analysis. Useful for what? Intraprocedural Points-to Analysis. Kinds of alias information Poer Anasis Poer anasis Oue: Wha is oer anasis Inrarocedura oer anasis Inerrocedura oer anasis Andersen and Seensgaard Poer and Aias Anasis Aiases: wo eressions ha denoe he same memor ocaion. Aiases are

More information

Pointer Analysis. Outline: What is pointer analysis Intraprocedural pointer analysis Interprocedural pointer analysis. Andersen and Steensgaard

Pointer Analysis. Outline: What is pointer analysis Intraprocedural pointer analysis Interprocedural pointer analysis. Andersen and Steensgaard Poiner anaysis Poiner Anaysis Ouine: Wha is oiner anaysis Inrarocedura oiner anaysis Inerrocedura oiner anaysis Andersen and Seensgaard Poiner and Aias Anaysis Aiases: wo exressions ha denoe he same memory

More information

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity Ra Tracing II Iproving Raracing Speed Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 1 Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 2 Raracing Copuaional Coplei ra-scene inersecion is epensive

More information

Communication Systems, 5e

Communication Systems, 5e Commuao sems, 5e Chaper : ose alog Modulao. rue Carlso Paul. Crll he MGraw-Hll Compaes Chaper : ose alog Modulao adpass ose Lear C Modulao h ose poeal C Modulao h ose Comparso O C Modulao sems Phase-loked

More information

Functions. 6.1 Modular Programming. 6.2 Defining and Calling Functions. Gaddis: 6.1-5,7-10,13,15-16 and 7.7

Functions. 6.1 Modular Programming. 6.2 Defining and Calling Functions. Gaddis: 6.1-5,7-10,13,15-16 and 7.7 Functions Unit 6 Gaddis: 6.1-5,7-10,13,15-16 and 7.7 CS 1428 Spring 2018 Ji Seaman 6.1 Moduar Programming Moduar programming: breaking a program up into smaer, manageabe components (modues) Function: a

More information

Lecture Recursion. Introduction to Computer Science, Shimon Schocken slide 1

Lecture Recursion. Introduction to Computer Science, Shimon Schocken slide 1 Lecure 12-1 Recursio Iroducio o Compuer Sciece, Shimo Schocke slide 1 Recursio Recursio: a fudameal algorihmic echique, based o divide ad coquer Recursive fucio: a mahemaical fucio defied i erms of iself.

More information

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program?

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program? Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Spring 2018 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program a set of

More information

index.pdf March 20,

index.pdf March 20, ndex.pdf March 20, 20 ITI 2. Introducton to omputng II Impementaton -2-: usng an nner cass We use an nner cass to create the terators: Marce Turcotte Schoo of Informaton Technoogy and Engneerng Iterator

More information

Introduction to Sigma Notation

Introduction to Sigma Notation Itroductio to Siga Notatio Steph de Silva //207 What is siga otatio? is the capital Greek letter for the soud s I this case, it s just shorthad for su Siga otatio is what we use whe we have a series of

More information

Straight-line code (or IPO: Input-Process-Output) If/else & switch. Relational Expressions. Decisions. Sections 4.1-6, , 4.

Straight-line code (or IPO: Input-Process-Output) If/else & switch. Relational Expressions. Decisions. Sections 4.1-6, , 4. If/ese & switch Unit 3 Sections 4.1-6, 4.8-12, 4.14-15 CS 1428 Spring 2018 Ji Seaman Straight-ine code (or IPO: Input-Process-Output) So far a of our programs have foowed this basic format: Input some

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

COMSC 2613 Summer 2000

COMSC 2613 Summer 2000 Programmg II Fal Exam COMSC 63 Summer Istructos: Name:. Prt your ame the space provded Studet Id:. Prt your studet detfer the space Secto: provded. Date: 3. Prt the secto umber of the secto whch you are

More information

, the Shannon entropy is defined as (E-1), x. In image analysis,

, the Shannon entropy is defined as (E-1), x. In image analysis, SNA, 05 0.48/radol.054804 Appedx E Segmeao of Verebrae ad Ierverebral Dsks Segmeao of verebrae ad erverebral dsks s a esseal sep compuerzed regospecfc processg for erval chage aalyss of boe marrow dsease

More information

Lines and Angles. introduction

Lines and Angles. introduction 9 Lines and nges intrductin In cass VI, you have earnt soe basic concepts and ters of geoetry point, ine, pane, ine segent, ray, ange and types of anges. In this chapter, we sha earn about soe pairs of

More information

Weak (4,2)-Chain Complexes. of Simplicial Complexes

Weak (4,2)-Chain Complexes. of Simplicial Complexes Ieraoal Joural of Algebra, ol 7, 3, o 4, 653-66 HIKARI Ld, wwwm-hkarcom hp://dxdoorg/988/a33657 Weak (4,)-Cha Complexe of Smplcal Complexe Ae Ahme very of Prha, Prha, Koovo ae_ahme@yahoocom Dočo Dmovk

More information

White Paper: Inverse Signal Classification for Financial Instruments

White Paper: Inverse Signal Classification for Financial Instruments Whe aper: Iverse gal lassfcao for Facal Isrues Ur Karou 50 orer. #806 Washgo D.. 0008 U..A. ockao LL +-0-7-007 ur@sockao.co Absrac. The paper preses ew ache learg ehods: sgal coposo whch classfes e-seres

More information

TRANSFORMATIONS AND SYMMETRY

TRANSFORMATIONS AND SYMMETRY 2 Transforations Defense Practice TRNSFORMTIONS ND SYMMETRY 1.2.1 1.2.5 Studing transforations of geoetric shapes buids a foundation for a ke idea in geoetr: congruence. In this introduction to transforations,

More information

Biological Neurons. Biological Neuron: Information Processing. Axon Hillock. Axon. Soma. Nucleus. Dendrite. Terminal. M. A. El Sharkawi, NN General 2

Biological Neurons. Biological Neuron: Information Processing. Axon Hillock. Axon. Soma. Nucleus. Dendrite. Terminal. M. A. El Sharkawi, NN General 2 Bolocal Neuros Soa Ao Hlloc Ao Nucleus Dedrte eral M. A. El Shara, NN Geeral Bolocal Neuro: Iforato Process M. A. El Shara, NN Geeral 3 M. A. El Shara, NN Geeral 4 Recoto of Bolocal Neuros Lear (tra Recall

More information

Data Structures and Algorithms

Data Structures and Algorithms Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common

More information

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II CS 152 Compuer Archiecure and Engineering Lecure 7 - Memory Hierarchy-II Krse Asanovic Elecrical Engineering and Compuer Sciences Universiy of California a Berkeley hp://www.eecs.berkeley.edu/~krse hp://ins.eecs.berkeley.edu/~cs152

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Hardware Components Illustrated

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Hardware Components Illustrated Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Fa 2017 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program instructions

More information

Bezier Curves (Pierre Bezier -Renault Automobiles)

Bezier Curves (Pierre Bezier -Renault Automobiles) Bezer Curves Perre Bezer -Reaul Auomoles 2 Mahemacally P P 2 : Corol Polygo,I are called he Burse ass/ledg fucos Bezer Curves Burse Polyomals!!! [,] egave for o,...,} { for :, Bezer Curves Cuc 2 2 2 2

More information

Descriptive Statistics: Measures of Center

Descriptive Statistics: Measures of Center Secto 2.3 Descrptve Statstcs: Measures of Ceter Frequec dstrbutos are helpful provdg formato about categorcal data, but wth umercal data we ma wat more formato. Statstc: s a umercal measure calculated

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

Breitung s nonparametric unit root tests., (1) which you want to test against the alternative hypothesis that is a zero-mean stationary process: H 1

Breitung s nonparametric unit root tests., (1) which you want to test against the alternative hypothesis that is a zero-mean stationary process: H 1 Breiug s oparaeric ui roo ess. The Breiug ess. The ui roo hypohesis versus zero-ea saioariy Cosider he ull hypohesis ha he ie series, =,..,, is a ui roo process: Y H : Y ' Y & % U, () which you wa o es

More information

AN EFFECTIVE EXACT ALGORITHM FOR ONE PARTICULAR CASE OF THE TRAVELING-SALESMAN PROBLEM Panishev A.V., Plechystyy D.D.

AN EFFECTIVE EXACT ALGORITHM FOR ONE PARTICULAR CASE OF THE TRAVELING-SALESMAN PROBLEM Panishev A.V., Plechystyy D.D. Iteratioa Joura "Iforatio Theories & Aicatios" Vo 55 AN EFFECTIVE EXACT ALGOITHM FO ONE PATICULA CASE OF THE TAVELING-SALESMAN POBLEM Paishev AV Pechystyy DD Abstract: The artice resets the exact agorith

More information

TensorFaces: Multilinear Model Approach. PIE Database (Weizmann) TensorFacesvsEigenfaces (PCA)

TensorFaces: Multilinear Model Approach. PIE Database (Weizmann) TensorFacesvsEigenfaces (PCA) Muliliea epeseaio of Image Esembles fo ecogiio ad Compessio he Poblem wih Liea () Appeaace Based ecogiio Mehods Eigeimages wok bes fo ecogiio whe oly a sigle faco eg, objec ideiy is allowed o vay aual

More information

8. Staggered Price Setting: More Micro Foundations and Empirical Evidence

8. Staggered Price Setting: More Micro Foundations and Empirical Evidence 8. Saggered rce Seng: More Mcro Foundaons and Emrcal Evdence John B. Taylor, May 8, 203 Oulne Dervaon from rof maxmzaon Reverse engneerng Brefly conras wh sae deenden models olcy mlcaons Emrcal evdence

More information

UNIT OBJECTIVES. unit 3 POLYGON basics 59

UNIT OBJECTIVES. unit 3 POLYGON basics 59 UNIT 3 Polygo Basics The origis of baseball i he Uied Saes are o clear, bu i is believed ha professioal baseball bega i he id-1800s. Today s rules of baseball, icludig he layou of he field, ca be raced

More information

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30. Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM

More information

Outerjoins, Constraints, Triggers

Outerjoins, Constraints, Triggers Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358 Outerjoin R S = R S with danging tupes padded with nus and incuded in

More information

BI-TEMPORAL INDEXING

BI-TEMPORAL INDEXING BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521,

More information

TRANSFORMATIONS AND SYMMETRY

TRANSFORMATIONS AND SYMMETRY TRNSFORMTIONS ND SYMMETRY 1.2.1 1.2.5 Studing transforations of geoetric shapes buids a foundation for a ke idea in geoetr: congruence. In this introduction to transforations, the students epore three

More information

For all questions, answer choice E) NOTA" means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA

For all questions, answer choice E) NOTA means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA For all questos, aswer choce " meas oe of the above aswers s correct.. What s the sum of the frst 000 postve tegers? A) 50,500 B) 500,000 C) 500,500 D),00,000. What s the sum of the tegers betwee 00 ad

More information

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning CS 7 Foudatos of AI Lecture Mache learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mache Learg The feld of mache learg studes the desg of computer programs (agets) capable of learg from past eperece

More information

FINITE DIFFERENCE SOLUTIONS TO THE TIME DEPENDENT HEAT CONDUCTION EQUATIONS. T T q 1 T + = (1)

FINITE DIFFERENCE SOLUTIONS TO THE TIME DEPENDENT HEAT CONDUCTION EQUATIONS. T T q 1 T + = (1) Recall he ime depede hea coducio equaio FINIE DIFFERENCE SOLUIONS O HE IME DEPENDEN HEA CONDUCION EQUAIONS + q () We have already ee how o dicreize he paial variable ad approimae paial derivaive. he ame

More information

PCL ISO 8859/5 Latin/Cyrillic

PCL ISO 8859/5 Latin/Cyrillic Page 1 of 5 PCL Symbol Se t: 10N Unicode gly ph correspondence tables. Contact:help@redtitan.com http://pcl.to $20 U0020 Space -- -- -- -- $21 U0021 Ê Exclamation mark -- -- -- -- $22 U0022 Ë Quotation

More information

Rational Functions with Removable Discontinuities

Rational Functions with Removable Discontinuities Rational Functions with Removable Discontinuities 1. a) Simplif the rational epression and state an values of where the epression is b) Using the simplified epression in part (a), predict the shape for

More information

Structures. Data Types Structures. Data Types (C/C++) Gaddis: A Data Type consists of: Unit 7. example: Integer. CS 1428 Spring 2018

Structures. Data Types Structures. Data Types (C/C++) Gaddis: A Data Type consists of: Unit 7. example: Integer. CS 1428 Spring 2018 Structures Data Types A Data Type consists of: Unit 7 Gaddis: 11.2-8 set of vaues set of operations over those vaues CS 1428 Spring 2018 Ji Seaman exampe: Integer whoe numbers, -32768 to 32767 +, -, *,

More information

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression Project 3 Two-densonal arras Ma 9, 6 Thrd Prograng Project Two-Densonal Arras Larr Caretto Coputer Scence 6 Coputng n Engneerng and Scence Ma 9, 6 Outlne Quz three on Thursda for full lab perod See saple

More information

CMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols

CMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols CMPSC 274: Transac0on Processing Lecure #6: Concurrency Conrol Proocols Divy Agrawal Deparmen of Compuer Science UC Sana Barbara 4.4.1 Timesamp Ordering 4.4.2 Serializa0on Graph Tes0ng 4.4.3 Op0mis0c Proocols

More information

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete

More information

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon Curve represetato Copyrght@, YZU Optmal Desg Laboratory. All rghts reserved. Last updated: Yeh-Lag Hsu (--). Note: Ths s the course materal for ME55 Geometrc modelg ad computer graphcs, Yua Ze Uversty.

More information

l A program is a set of instructions that the l It must be translated l Variable: portion of memory that stores a value char

l A program is a set of instructions that the l It must be translated l Variable: portion of memory that stores a value char Week 1 Operators, Data Types & I/O Gaddis: Chapters 1, 2, 3 CS 5301 Fa 2018 Ji Seaman Programming A program is a set of instructions that the computer foows to perform a task It must be transated from

More information

Name Class Date. Exploring Reflections

Name Class Date. Exploring Reflections Name ass Date. Refections Essentia Question: How do ou draw the image of a figure under a refection? Epore G.3. Describe and perform transformations of figures in a pane using coordinate notation. so G.3.

More information

PA5: Last Hints on Symbol Table: Other Info to Keep

PA5: Last Hints on Symbol Table: Other Info to Keep PA5: Last Hints on Symbol Table: Other Info to Keep For each VarSTE: is it a local variable or a member variable? For each class: what will the object size be? For each method: - a VarSTE for "this" parameter

More information

Hyperbolic Coxeter groups of rank 4

Hyperbolic Coxeter groups of rank 4 Hyerboic Coxeter grous of rak Youghwa Ki Srig 2016 1. Itroductio The stadard cassificatio of fiite refectio grous ad affie Coxeter systes ca be foud i [1]. Huhrey reseted a characterizatio to cassify hyerboic

More information

CS 111: Program Design I Lecture 16: Module Review, Encodings, Lists

CS 111: Program Design I Lecture 16: Module Review, Encodings, Lists CS 111: Program Desig I Lecture 16: Module Review, Ecodigs, Lists Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 18, 2016 Last time Dot otatio ad methods Padas: user maual poit

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: Algorithms and Imperative Programming COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48

More information

9.7 Register Allocation and. Computer Science 332. Compiler Construction. Chapter 9: Code Generation. Global Register Allocation

9.7 Register Allocation and. Computer Science 332. Compiler Construction. Chapter 9: Code Generation. Global Register Allocation Compuer Scence 332 Compler Consrucon Chaper 9: Code Generaon 9.7 Regser Allocaon and Assgnmen 9.7 Regser Allocaon and Assgnmen In general, we prefer o do hngs n regsers (raher han memory) In MIPS, we can

More information

2. Connect the cable from the PC to the MEQ and set the MEQ down.

2. Connect the cable from the PC to the MEQ and set the MEQ down. 1. Take out the MEQ and delete the program that is already stored in the MEQ. a. Hold down the 2nd key and the period key, while holding these two keys down, turn on the meq. 2. Connect the cable from

More information

understood as processors that match AST patterns of the source language and translate them into patterns in the target language.

understood as processors that match AST patterns of the source language and translate them into patterns in the target language. A Basic Compier At a fundamenta eve compiers can be understood as processors that match AST patterns of the source anguage and transate them into patterns in the target anguage. Here we wi ook at a basic

More information

Welcome - CSC 301. CSC 301- Foundations of Programming Languages

Welcome - CSC 301. CSC 301- Foundations of Programming Languages Wecome - CSC 301 CSC 301- Foundations of Programming Languages Instructor: Dr. Lutz Hame Emai: hame@cs.uri.edu Office: Tyer, Rm 251 Office Hours: TBA TA: TBA Assignments Assignment #0: Downoad & Read Syabus

More information

Professor: Alvin Chao

Professor: Alvin Chao Professor: Avin Chao Anatomy of a Java Program: Comments Javadoc comments: /** * Appication that converts inches to centimeters. * * @author Chris Mayfied * @version 01/21/2014 */ Everything between /**

More information

CIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1

CIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1 Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. Router A Router B Router C Router D Network Next Hop Next Hop Next Hop Next

More information

TUTORING TEXTS IN MATHCAD

TUTORING TEXTS IN MATHCAD TUTORING TEXTS IN MATHCAD MIROSLAV DOLOZÍILEK and ANNA RYNDOVÁ Faculy of Mechanical Engineering, Brno Universiy of Technology Technická, 616 69 Brno, Czech Republic E-ail: irdo@fyzika.fe.vubr.cz Absrac

More information

Overview. 9 - Game World: textures, skyboxes, etc. Texture Mapping. Texture Space. Vertex Texture Coordinates. Texture Mapping. Game World Backgrounds

Overview. 9 - Game World: textures, skyboxes, etc. Texture Mapping. Texture Space. Vertex Texture Coordinates. Texture Mapping. Game World Backgrounds CSc 165 Compuer Game Archiecure Overview Texure Mapping 9 - Game World: exure, kyboxe, ec. Game World Background SkyBoxe & SkyDome World Bound and Viibiliy Render Sae 2 Texure Mapping Texure Space Baic

More information

Name Date. Congruence and Transformations For use with Exploration 4.4

Name Date. Congruence and Transformations For use with Exploration 4.4 Nae Date. Congruence and Transforations For use with Eploration. Essential Question What conjectures can ou ae about a figure reflected in two lines? 1 EXLORTION: Reflections in arallel Lines Go to igideasmath.co

More information

CS61C : Machine Structures

CS61C : Machine Structures CS 61C L24 VM II (1) ist.eecs.berkele.edu/~cs61c/su5 CS61C : Machie Structures Lecture #24: VM II Address Mappig: Virtual Address: VPN offset 25-8-2 Ad Carle idex ito page table located i phsical memor

More information

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1 -D matrx method We ca expad the smple plae-wave scatterg for -D examples that we ve see to a more versatle matrx approach that ca be used to hadle may terestg -D problems. The basc dea s that we ca break

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

Manual. for '

Manual. for ' .. or t Manual for.,. ; ''.. ' 291-310. System Section [:] SYSTEM SECTION DISK: Selects the Disk operations menu. Choose a function with the arrow keys and press ENTER/SELECT to complete a command. Make

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

July Registration of a Cyrillic Character Set. Status of this Memo

July Registration of a Cyrillic Character Set. Status of this Memo Network Working Group Request for Comments: 1489 A. Chernov RELCOM Development Team July 1993 Status of this Memo Registration of a Cyrillic Character Set This memo provides information for the Internet

More information

CIS-331 Spring 2016 Exam 1 Name: Total of 109 Points Version 1

CIS-331 Spring 2016 Exam 1 Name: Total of 109 Points Version 1 Version 1 Instructions Write your name on the exam paper. Write your name and version number on the top of the yellow paper. Answer Question 1 on the exam paper. Answer Questions 2-4 on the yellow paper.

More information

Differentiated Service of Streaming Media Playback Technology

Differentiated Service of Streaming Media Playback Technology Iteratoal Coferece o Advaced Iformato ad Commucato Techology for Educato (ICAICTE 2013) Dfferetated Servce of Streamg Meda Playback Techology CHENG Z-ao 1 MENG Bo 1 WANG Da-hua 1 ZHAO Yue 1 1 Iformatzato

More information

Implementing Consistency -- Paxos. Some slides from Michael Freedman

Implementing Consistency -- Paxos. Some slides from Michael Freedman Implemetig Cosistecy -- Paxos Some slides from Michael Freedma What do cliets see? Distributed stores use replicatio Fault tolerace ad scalability Does replicatio ecessitate icosistecy? Harder to program,

More information

Def : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.

Def : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index. Mth 0 Uit : Roots & Powers Red Buildig O, Big Ides, d New Vocbulry, p. 0 tet.. Estitig Roots ( clss) Red Lesso Focus p. tet. Outcoes Ch. Notes. Defie d give eple of rdicl. pp. 0, 9. Idetify the ide d the

More information

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014 /8/0 Ouline CS8 Inroducion o Algorihm Lecure May 8, 0 Nework flow finihing capaciy-caling analyi Edmond-Karp, blocking-flow implemenaion uni-capaciy imple graph biparie maching edge-dijoin pah aignmen

More information

Essential Question What conjectures can you make about a figure reflected in two lines?

Essential Question What conjectures can you make about a figure reflected in two lines? OO O earning tandard -O..5 -O..6. OTUTI VI UT To be proficient in ath, ou need to ae conjectures and justif our conclusions. ongruence and Transforations ssential uestion What conjectures can ou ae about

More information

CIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1

CIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1 Version 1 1. (20 Points) Given the class A network address 117.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 4,000 subnets? b. (5 Points) What is

More information

Analysis and Implementation of Automatic Reassembly of File Fragmented Images Using Greedy Algorithms. By Lucas Shinkovich and Nate Jones

Analysis and Implementation of Automatic Reassembly of File Fragmented Images Using Greedy Algorithms. By Lucas Shinkovich and Nate Jones Analysis and Implementation of Automatic Reassembly of File Fragmented Images Using Greedy Algorithms By Lucas Shinkovich and Nate Jones Outline Introduction & Problem Method Algorithms Problems & Limitations

More information

Using CANopen Slave Driver

Using CANopen Slave Driver CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer

More information

A Fast Collision Resolution Algorithm for Contention- Based Wireless MAC Protocols

A Fast Collision Resolution Algorithm for Contention- Based Wireless MAC Protocols A Fast Coso Resouto Agorthm for Coteto- Base Wreess MAC Protocos M-Su Km Tae-Youg Byu a K-ju Ha Deartmet of Comuter Egeerg Kyugoo Natoa Uversty Schoo of Comuter a Eectroc Egeerg Gyeogju Uversty {msm@comeg.ce.u.ac.r

More information

Lecture 4a Wireframe and Curve Lecture 3 1

Lecture 4a Wireframe and Curve Lecture 3 1 Lecure 4a Wreframe and Curve Lecure 3 Type of modelng Wre frame Surface Sold Saah keraan Pemodelan Kerangka dawa Pemodelan Permukaan Pemodelan Pepejal Lecure 3 Wha we cover? Type of enes Topologes and

More information

Relational Model. Lecture #6 Autumn, Fall, 2001, LRX

Relational Model. Lecture #6 Autumn, Fall, 2001, LRX Reationa Mode Lecture #6 Autumn, 2001 #06 Reationa Mode HUST,Wuhan,China 121 Reationa Mode Tabe = reation. Coumn headers = attributes. Row = tupe Reation schema = name(attributes). Exampe: Beers(name,

More information

Jean Eric Bitang Arranger, Composer, Director, Interpreter

Jean Eric Bitang Arranger, Composer, Director, Interpreter Jean Eric Biang Arranger, Composer, Direcor, Inerpreer Cameroon Abou he aris Birhay, Sep 28 1990.Cameroonian, I enere he wor of music a 10. Now I've wrienb abou 150 songs for he choirs of Douala, 05 masses

More information

IDEF3 Process Description Capture Method

IDEF3 Process Description Capture Method IDEF3 Process Descripion Capure Mehod IDEF3 is par of he IDEF family of mehods developmen funded by he US Air Force o provide modelling suppor for sysems engineering and enerprise inegraion 2 IDEF3 Mehod

More information

Flow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12

Flow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12 4// low graph/nework MX LOW PPLIION 30, pring 0 avid Kauchak low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource V wih no incoming

More information

Apple 9L Mac OS X Support Essentials Download Full Version :

Apple 9L Mac OS X Support Essentials Download Full Version : Apple 9L0-403 Mac OS X Support Essentials 10.6 Download Full Version : https://killexams.com/pass4sure/exam-detail/9l0-403 QUESTION: 65 You enable Stealth Mode on a Mac OS X v10.6 computer's firewall.

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

CARRIER, CARRIER BASED SQUADRONS AND NON-CARRIER BASED SQUADRON DEPLOYMENTS DURING THE KOREAN WAR

CARRIER, CARRIER BASED SQUADRONS AND NON-CARRIER BASED SQUADRON DEPLOYMENTS DURING THE KOREAN WAR CARRIER, CARRIER BASED SQUADRONS AND NON-CARRIER BASED SQUADRON DEPLOYMENTS DURING THE KOREAN WAR Carrier, Air Group and Carrier Based Squadron Deployments Essex (CV 9) with CVG -5 (26 Jun 1951-25 Mar

More information

AT MOST EDGE 3 - SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD

AT MOST EDGE 3 - SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD Iteratoal Joural o Research Egeerg ad Appled Sceces IJREAS) Avalable ole at http://euroasapub.org/ourals.php Vol. x Issue x, July 6, pp. 86~96 ISSNO): 49-395, ISSNP) : 349-655 Impact Factor: 6.573 Thomso

More information

Chap 9: Reliability & Availability Modeling

Chap 9: Reliability & Availability Modeling Chap 9: Relably & Avalably odelng C A B C C D D Relably Block Dagram usng sharpe block name { param-ls } < block lne > can be one of he followng: oponal.58 Appx B 44 comp name exponenal-polynomal or exp

More information

Area and Power Efficient Modulo 2^n+1 Multiplier

Area and Power Efficient Modulo 2^n+1 Multiplier Iteratoal Joural of Moder Egeerg Research (IJMER) www.jmer.com Vol.3, Issue.3, May-Jue. 013 pp-137-1376 ISSN: 49-6645 Area ad Power Effcet Modulo ^+1 Multpler K. Ptambar Patra, 1 Saket Shrvastava, Sehlata

More information

Midterm Exam Announcements

Midterm Exam Announcements Miderm Exam Noe: This was a challenging exam. CSCI 4: Principles o Programming Languages Lecure 1: Excepions Insrucor: Dan Barowy Miderm Exam Scores 18 16 14 12 10 needs improvemen 8 6 4 2 0 0-49 50-59

More information

Extending Graph Rewriting for Refactoring

Extending Graph Rewriting for Refactoring Extending Graph Rewriting for Refactoring Nies Van Eetvede, Dirk Janssens University of Antwerp Departent of oputer science Middeheiaan 1 2020 Antwerpen {nies.vaneetvede dirk.janssens@ua.ac.be Abstract.

More information

Programming Languages

Programming Languages CSE 130 : Fall 2008 Programmg Languages Lecture 4: Variables, Environments, Scope News PA 1 due Frida 5pm PA 2 out esterda (due net Fi) Fri) Ranjit Jhala UC San Diego Variables and Bdgs Q: How to use variables

More information

SIPART DR21 Controllers

SIPART DR21 Controllers Siemens AG 2010 SIPART DR21 Controllers /2 /2 Application, design /3 Mode of operation /8 Control and display functions /10 Function diagram /11 Configuring switches, on-line/off-line parameters /12 Technical

More information

Equality (2.1) Advanced Topics on Classes and Objects. Equality (1) Equality (2.2): Common Error

Equality (2.1) Advanced Topics on Classes and Objects. Equality (1) Equality (2.2): Common Error Advanced Topics on Classes and Objects EECS200 B: Advanced Object Oriented Prograing Fall 208 CHEN-WEI WANG Equality (2.) Iplicitly: Every class is a child/sub class of the Object class. The Object class

More information

Menu. word size # of words byte = 8 bits

Menu. word size # of words byte = 8 bits Menu LSI Components >Random Access Memory (RAM) Static RAM (SRAM) Dynamic RAM (DRAM) Read-Only Memory (ROM) Look into my... See figures from Lam text on web: RAM_ROM_ch6.pdf 1 It can be thought of as 1

More information

Cycloidal motion in an electromagnetic field

Cycloidal motion in an electromagnetic field Ccloidal otion in an electroagnetic field Luca Moroni Noeber 017 www.lucaoroni.it uilding the otion equations A charged particle is introduced in a region where there is a unifor electric field (intensit

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

The University of British Columbia

The University of British Columbia The Univesity of Bitish Coubia Copute Science 304 Midte Exaination Febuay 5, 2007 Tie: 50 inutes Tota aks: 38 Instucto: Rache Pottinge Nae ANSWER KEY (PRINT) (Last) (Fist) Signatue This exaination has

More information

2-1. The Language of Functions. Vocabulary

2-1. The Language of Functions. Vocabulary Chapter Lesson -1 BIG IDEA A function is a special tpe of relation that can be described b ordered pairs, graphs, written rules or algebraic rules such as equations. On pages 78 and 79, nine ordered pairs

More information

Digital Lighting Systems, Inc.

Digital Lighting Systems, Inc. Digital Lighting Systems, Inc. Four Channel Dry Contacts Relays Switch Pack DMX512 compatible USER'S MANUAL -UM User's Manual - Page 1 GENERAL DESCRIPTION The is a 4-channel DMX-512 compatible electro-mechanical

More information