CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

Size: px
Start display at page:

Download "CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001"

Transcription

1 CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic function, DC chrcteristics, nd AC chrcteristics The MOS Trnsistor Almost ll of modern digitl electronics re uilt from one simple device, the metloide-semiconductor (MOS) field-effect trnsistor. MOS trnsistors come in two flvors, n-chnnel trnsistors sometimes clled NFETs, nd p-chnnel trnsistors (PFETs). A FET hs three terminls the gte, the, nd the drin. The schemtic symol for n NFET is shown elow with the terminls leled. The schemtic symol does not distinguish etween the nd drin terminls. This is ecuse they re interchngele, for n NFET, whichever terminl is more negtive is the nd the other is the drin. gte drin gte drin closed if gte= nd = open if gte= otherwise undefined For the purposes of understnding logic circuits, we cn model the NFET s switch etween the nd the drin tht is controlled y the gte. When the gte voltge is high (logic ) nd the voltge is low (logic ), the switch is closed effectively connecting the nd drin. When the gte is low (logic ), the switch is open disconnecting the nd drin. When the gte is high (logic ) nd the more negtive of the other two terminls is not t zero, the stte of the trnsistor is undefined. For this reson, we cn use n NFET to pss zeros, ut not ones we use PFET to pss s. gte drin gte closed if gte= nd = open if gte= otherwise undefined drin The PFET works ectly the sme wy n NFET does if you reverse nd. The PFET is open (or off) when the gte is high nd closed (or on) when the gte is low nd the is high hence it cn pss logic or not under control of the gte. The schemtic symol for PFET is shown ove long with our switch model for the PFET. For the PFET the is the more positive of the two interchngele terminls, so we

2 tend to drw it on the top (y convention we drw schemtics with voltge decresing from top to ottom nd signls propgting from left to right). The symol for the PFET is the sme s the NFET ecept tht it includes n inversion ule on the gte terminl. This ule indictes logicl inversion from to or to indicting tht the device is on when the gte is s opposed to the NFET which is on when the gte is. Series nd prllel switches We cn perform logicl function y connecting two switches or two FETs together in series or prllel. For emple, terminl c t the left elow will e connected to if AND re oth. Similrly, terminl f t the right elow will e connected to if either d OR e (or oth of them) is. c d e f We cn uild similr series nd prllel circuits out of PFETs. Also, while these re 2- input series nd prllel networks, we cn clerly etend these circuits to hndle n ritrry numer of inputs. Prep question : Drw n NFET network tht connects the output to when AND ( OR c) is true ( ( c) in shorthnd). Mking n Inverter To e composle circuit must generte n output tht is suitle for use s n input to similr circuit. A simple series or prllel comintion of NFETs s shown ove won t do this since the input needs to e either or, ut the output is either or open circuited. We need to dd PFETs (or resistor) to generte on the output in this stte. The simplest composle circuit is the inverter, shown ove long with its schemtic symol. When input is, the NFET is on nd the PFET is off, so output is. Similrly, when input is, output is connected to vi the PFET nd the NFET is off. To sve time in drwing, we use the schemtic symol on the left to indicte n inverter

3 nd omit the power supply connections (to nd ). In short, the inverter genertes the logicl inverse of its input. We sy tht = NOT(), or = ~ (for shorthnd). Logic Functions nd Boolen Alger While inverters re useful (signls never seem to e the polrity you wnt) we need to comine multiple logic signls to compute most functions. We cn specify logicl function of severl vriles in severl wys including n eqution or truth tle. For emple, the eqution for the NAND (not nd) function is = NOT( AND ), or = ~( ) for shorthnd. A truth tle shows the vlue of the function for every possile comintion of input vlues. For emple, the truth tle for the NAND function is: Sometimes it is convenient to write our truth-tle out in two dimensions with the vlues of long one is nd the vlues of long the other. This form of truth tle for the NAND is shown elow nd is clled Krnugh (pronounced Cr-gnw) mp. Just like we re used to using lgeric identities to simplify equtions using + nd * nd rel numer vriles, we cn use the identities of Boolen Alger to simplify equtions using NOT (~) AND ( ), nd OR ( ) nd inry-vlued vriles. The sic lws of Boolen Alger re Zero = = Identity = = Negtion ~ = ~ = ~(~) = ~ = ~ = Commuttivity = = Associtivity ( c) = ( ) c ( c) = ( ) c Distriutivity ( c) = ( ) ( c) ( c) = ( ) ( c) Idempotence = = De Morgn s ~( ) = ~ ~ ~( ) = ~ ~ Note tht these rules re similr to, ut not identicl to those of lger over + nd *. For emple, we cn distriute OR over AND nd AND over OR, ut we cn only distriute * over + nd not the other wy round. Also, + nd * re certinly not idempotent. For this reson I discourge people from using + nd * to represent OR nd AND respectively lthough it is common prctice.

4 We cn esily convert ck nd forth etween truth tles nd equtions. To write the truth tle for n eqution, just sustitute ll possile vlues of the input vriles into the eqution nd evlute the resulting epression. Ech set of vlues gives one row of the truth tle. To convert from truth tle to n eqution, we cn write the logic function in norml form s sum of products (n OR of ANDs). For ech line of the truth tle for which the output is, write down the AND tht corresponds to tht line (e.g., ~ ~ corresponds to the line =, =) nd OR the resulting ANDs together. For emple, the norml form for NAND gte is (~ ~) (~ ) ( ~). We cn then pply the lws of Boolen lger to simplify this epression to ~ ~. Prep question 2: Write down the norml form nd simplify the eqution for the following truth tle. Logic Gtes To implement logicl function of multiple signls, we uild logic gte, s shown elow, y replcing the PFET of the inverter with network (e.g., series or prllel) of PFETs tht pulls up (connects the output to ) when some logicl function, f, of the inputs is true, so the output,, is when f(,, ) is true. To hndle the cse when f is flse, we replce the NFET of the inverter with network of NFETs tht pulls down the output (connects it to ) when f is flse, so the output is when ~f(,, ) is true. PFET Network NFET Network We mke NAND gte (or not-nd) gte, s shown elow, y using series network for the pull-down side of the gte so the output is when AND re oth (in shorthnd, when = ). We use prllel network of PFETs to pull up the output when OR is zero (in shorthnd when ~ ~ = ). Thus, for this connection, f = ~( ) = ~ ~. nd ~f =. The circuit digrm for the NAND nd its schemtic symols re shown elow. The schemtic symol on the left reflects the = ~( ) interprettion the squred gte

5 symol mens AND nd the ule (s ove) mens NOT, so = NOT( AND ) or ~( ). The symol on the right is the = ~ ~ interprettion, the rounded gte symol mens OR nd the inversion ules gin men not, so = (NOT ) OR (NOT ) or ~ ~. This is the sme function s ~( ) write out the truth tles to convince yourself if you re not sure. Another useful gte is the NOR gte which hs the eqution = ~( ). The two symols for the NOR gte re shown elow long with the truth tle for NOR Prep question 3: Sketch trnsistor digrm for 2-input NOR gte. At this point, you my hve noticed tht ll of the gtes we re mking re inverting. This is ecuse the NFETs tke input to generte output nd the PFETs tke input to mke output. Any sttic CMOS gte you mke ccording to the rules ove will e inverting. To mke non-inverting gte, like n AND we need to use two levels of gtes s shown elow. The figure t the left shows how we relize the AND function with NAND gte nd n inverter. Note tht we cn drw n inverter with the ule on either side nd here we oey the convention tht we connect ules to ules to preserve the polrity of the logic. The figure t the right is the schemtic symol for n AND gte. Finlly we lso show the truth tle for n AND. ~

6 As noted in the reding, n inverting gte like NAND is complete in tht we cn uild ny function out of just NAND gtes. This is not true of AND gtes since there is no wy to mke n inverter out of n AND. Prep question 4: Show how to crete n OR gte y composing inverting gtes. Another useful logic function is eclusive-or, sometimes clled XOR. The eqution for XOR is = ( ~) (~ ) nd we sometimes revite XOR y writing =. The truth tle for XOR is shown elow in oth forms. Prep question 5 (optionl chllenge question): Sketch n implementtion of n XOR gte using NFETs nd PFETs. A prize goes to the solution with the minimum numer of trnsistors. The CD47 To eperiment with uilding sttic CMOS logic gtes from MOS trnsistors, we will e using the Firchild CD47 integrted circuit. As shown in the pinout elow, this device consists of three NFETs nd three PFETs with some of their terminls tied together. Note tht you must tie pin 4 to (Vdd) nd pin 7 to (GND) for this prt to work properly. Using this device, we will wire up some simple logic gtes nd chrcterize their AC nd DC chrcteristics. The gtes we will wire up will e. An inverter

7 2. A 2-input NAND gte 3. A ~( ( c)) gte (see prep question ). 4. (optionl) Your XOR gte from prep question 5 In preprtion for the l, sketch how you will wire up these gtes using the CD47. Specificlly, drw schemtic showing the pins used y the, gte, nd drin of ech trnsistor. Once you wire up these three gtes, you will evlute ech of them using the following three steps.. Verify their logicl opertion using switch inputs nd n LED s output. Note tht due to the low drive strength of the CD47, you my need to uffer the LED using your 74AC4. 2. Trce the DC trnsfer curve input voltge vs. output voltge for t lest one of your gtes. 3. Oserve the AC trnsfer curve input nd output wveforms vs time.

We are going to stop worrying about discretizing time for a while, and examine. how boolean-valued functions are implemented in CMOS.

We are going to stop worrying about discretizing time for a while, and examine. how boolean-valued functions are implemented in CMOS. 6 Chpter 2 CMOS logic 2.1 Bsics We re going to stop worrying out discretizing time for while, nd exmine how oolen-vlued functions re implemented in CMOS. There re two nullry (no inputs) oolen functions:

More information

Basics of Logic Design: Boolean Algebra, Logic Gates. Today s Lecture

Basics of Logic Design: Boolean Algebra, Logic Gates. Today s Lecture Bsics of Logic Design: Boolen Alger, Logic Gtes Computer Science 104 Tody s Lecture Projects (groups of 2 or 3) Outline Building the uilding locks Logic Design Truth tles, Boolen functions, Gtes nd Circuits

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C; B-26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndom-numer genertor supplied s stndrd with ll computer systems Stn Kelly-Bootle,

More information

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010 /28/2 Lerning Outcomes At the end of this lecture you should: Computer Systems - Architecture Lecture 4 - Boolen Logic Eddie Edwrds eedwrds@doc.ic.c.uk http://www.doc.ic.c.uk/~eedwrds/compsys (Hevily sed

More information

Basics of Logic Design: Boolean Algebra, Logic Gates. Administrative

Basics of Logic Design: Boolean Algebra, Logic Gates. Administrative Bsics of Logic Design: Boolen Alger, Logic Gtes Computer Science 104 Administrtive Homework #3 Due Sundy Midterm I Mondy in clss, closed ook, closed notes Ø Will provide IA32 instruction set hndout Ø Lst

More information

4 The TTL Logic Gate Series

4 The TTL Logic Gate Series 4 The TTL Logic Gte Series 4.1 Circuit Structures In generl, the functions of the vrious stges of ny gte re similr to those of the inverter nd NAN gtes. It is good to rememer, however, tht mny logic functions

More information

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;

Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C; B-26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndom-numer genertor supplied s stndrd with ll computer systems Stn Kelly-Bootle,

More information

Lecture 18. SRAM Cell and Column I/O Design

Lecture 18. SRAM Cell and Column I/O Design Lecture 8 SRAM Cell nd Column I/O Design Res Sleh Dept. of ECE University of British Columi res@ece.uc.c Architecture of 64K SRAM Row decoder m =56 word line Column Pullups itline n=8 n =56 Address input

More information

Words Symbols Diagram. abcde. a + b + c + d + e

Words Symbols Diagram. abcde. a + b + c + d + e Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To

More information

10-Source Transformations Text: ECEGR 210 Electric Circuits I

10-Source Transformations Text: ECEGR 210 Electric Circuits I 10Source Trnsformtions Text: 4.4 4.6 ECEGR 210 Electric Circuits I Introduction Source Trnsformtion Thevenin s Theorem Norton s Theorem Overview Dr. Louie 2 Introduction Consider the two circuits (A nd

More information

R.2 Inequalities and Interval Notation

R.2 Inequalities and Interval Notation R Inequlities nd Intervl Nottion In order to simplify mtters we wnt to define new type of nottion for inequlities This wy we cn do wy with the more ulky set nottion This new nottion is clled using intervls

More information

a. Implement the function using a minimal network of 2:4 decoders and OR gates.

a. Implement the function using a minimal network of 2:4 decoders and OR gates. CSE4 Eercise Solutions I. Given three-input Boolen function f(,, c) = m(, 2, 4, 6, 7) + d().. Implement the function using miniml network of 2:4 decoders nd OR gtes. Stndrd solution: Use s the enle signl,

More information

Lec 2: Gates and Logic

Lec 2: Gates and Logic Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on we-pge Use it for prtner finding First ssignment is to find prtners Due this

More information

Introduction to vectors

Introduction to vectors Introduction to vectors A vector is quntity tht hs oth mgnitude (or size) nd direction. Both of these properties must e given in order to specify vector completely. In this unit we descrie how to write

More information

ENGR HOMEWORK-6-SOLUTIONS

ENGR HOMEWORK-6-SOLUTIONS ENGR -215 HOMEWORK-6-SOLUTIONS 1. Exercise 26.5 2. Exercise 26.6 3. Exercise 26.31 4. Exercise 26.32 5. Exercise 26.36 6. Exercise 26.4 7. Exercise 26.43 8. Exercise 26.54 9. Prolem 26.64 1. Prolem 26.67

More information

Chapter 1 Introduction to CMOS Circuit Design

Chapter 1 Introduction to CMOS Circuit Design Chpter 1 Introduction to CMOS Circuit Design Jin-Fu Li Advnced Relile Systems (ARES) L. Deprtment of Electricl Engineering Ntionl Centrl University Jhongli, Tiwn Outline Introduction MOS Trnsistor Switches

More information

STUDENT NAME and NUMBER: (PLEASE PRINT CLEARLY) Georgia Institute of Technology Department of Electrical and Computer Engineering.

STUDENT NAME and NUMBER: (PLEASE PRINT CLEARLY) Georgia Institute of Technology Department of Electrical and Computer Engineering. STUDENT NAME nd NUMBER: (PLEASE PRINT CLEARLY) Georgi Institute of Technology Deprtment of Electricl nd Computer Engineering Mrks: 2 /2 /2 DATE: Octoer 26, 2 Test #2 ECE23: Introduction to Computer Engineering

More information

Quadratic Equations - 1

Quadratic Equations - 1 Alger Module A60 Qudrtic Equtions - 1 Copyright This puliction The Northern Alert Institute of Technology 00. All Rights Reserved. LAST REVISED Novemer, 008 Qudrtic Equtions - 1 Sttement of Prerequisite

More information

Simple Electric Circuits

Simple Electric Circuits Simple Eletri Ciruits Gol: To uild nd oserve the opertion of simple eletri iruits nd to lern mesurement methods for eletri urrent nd voltge using mmeters nd voltmeters. L Preprtion Eletri hrges move through

More information

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered: Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

More information

! Transistors MOSFET. " Model. ! Zero-th order transistor model. " Good enough for [what?] ! How to construct static CMOS gates

! Transistors MOSFET.  Model. ! Zero-th order transistor model.  Good enough for [what?] ! How to construct static CMOS gates ESE370: Circuit-Level Modeling, Design, nd Optimiztion or Digitl Systems Lec 2: Septemer 2, 2016 Trnsistor Introduction nd Gtes rom Trnsistors Tody! Trnsistors MOSFET " Model! Zero-th order trnsistor model

More information

Sirindhorn International Institute of Technology Thammasat University at Rangsit

Sirindhorn International Institute of Technology Thammasat University at Rangsit Sirindhorn Interntionl Institute of Technology Thmmst University t Rngsit School of Informtion, Computer nd Communiction Technology COURSE : ECS 204 Bsic Electricl Engineering L INSTRUCTOR : Asst. Prof.

More information

CONSERVATIVE FORCES AND SCALAR POTENTIALS

CONSERVATIVE FORCES AND SCALAR POTENTIALS CONSERVATIVE FORCES AND SCALAR POTENTIALS In our study of vector fields, we hve encountered severl types of conservtive forces. If force is conservtive, it hs numer of importnt properties. It is importnt

More information

EECE 481. Static MOS Gate and Flip-Flop Circuits Lecture 8

EECE 481. Static MOS Gate and Flip-Flop Circuits Lecture 8 EECE 48 Sttic MOS Gte nd Flip-Flop Circuits Lecture 8 Rez Molvi Dept. of ECE University of British Columi rez@ece.uc.c Slides Courtesy : Dr. Res Sleh (UBC), Dr. D. Sengupt (AMD), Dr. B. Rzvi (UCLA) EECE

More information

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00 COMP20212 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Digitl Design Techniques Dte: Fridy 16 th My 2008 Time: 14:00 16:00 Plese nswer ny THREE Questions from the FOUR questions provided

More information

Basics of Logic Design Arithmetic Logic Unit (ALU)

Basics of Logic Design Arithmetic Logic Unit (ALU) Bsics of Logic esign Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned ue Mrch 2 Project Groups form groups of 3 y Wed, I will ssign fter tht Project Specifiction(s) will

More information

1.2 What is a vector? (Section 2.2) Two properties (attributes) of a vector are and.

1.2 What is a vector? (Section 2.2) Two properties (attributes) of a vector are and. Homework 1. Chpters 2. Bsis independent vectors nd their properties Show work except for fill-in-lnks-prolems (print.pdf from www.motiongenesis.com Textooks Resources). 1.1 Solving prolems wht engineers

More information

Linear Inequalities A linear inequality in one variable is an inequality such as

Linear Inequalities A linear inequality in one variable is an inequality such as 7.4 Liner Inequlities A liner inequlity in one vrile is n inequlity such s x 5 2, y 3 5, or 2k 5 10. Archimedes, one of the gretest mthemticins of ntiquity, is shown on this Itlin stmp. He ws orn in the

More information

Continuous Random Variables Class 5, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05, Spring 204 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf)

More information

Digital Design. Chapter 2: Combinational Logic Design. Digital Design. Copyright 2006 Frank Vahid

Digital Design. Chapter 2: Combinational Logic Design. Digital Design. Copyright 2006 Frank Vahid Digitl Design Chpter 2: Comintionl Logic Design Digitl Design Copyright 26 rnk Vhid Introduction 2. Digitl circuit Let s lern to design digitl circuits We ll strt with simple form of circuit: Comintionl

More information

DIGITAL CIRCUITS EXAMPLES (questions and solutions) Dr. N. AYDIN

DIGITAL CIRCUITS EXAMPLES (questions and solutions) Dr. N. AYDIN DIGITAL CIRCUITS EXAMPLES (questions nd solutions) Dr. N. AYDIN nydin@yildiz.edu.tr Emple. Assume tht the inverter in the network elow hs propgtion dely of 5 ns nd the AND gte hs propgtion dely of ns.

More information

Lecture 15 - Curve Fitting Techniques

Lecture 15 - Curve Fitting Techniques Lecture 15 - Curve Fitting Techniques Topics curve fitting motivtion liner regression Curve fitting - motivtion For root finding, we used given function to identify where it crossed zero where does fx

More information

Volumes by Slicing; Disks and Washers

Volumes by Slicing; Disks and Washers Volumes y Slicing; Disks nd Wshers Definite integrls hve een used to produce res. We now show tht they cn e used to produce volumes s well. Suppose tht solid etends long the -is nd is ounded on the left

More information

ORTHOGRAPHIC PROJECTIONS OF POINTS, LINES & PLANES

ORTHOGRAPHIC PROJECTIONS OF POINTS, LINES & PLANES ORTHOGRPHIC PROJECTIONS OF POINTS, LINES & PLNES To drw projections of ny oject, one must hve following informtion: ) OBJECT {With its description, well defined} B) OBSERVER {lwys oserving perpendiculr

More information

ET304a Laboratory 5 Thevenin's and Norton's Theorem and the Principle of Superposition

ET304a Laboratory 5 Thevenin's and Norton's Theorem and the Principle of Superposition ET304 Lortory 5 Thevenin's nd Norton's Theorem nd the Principle of Superposition Purpose: Experimentlly determine the Thevenin nd Norton equivlent circuits y mesuring the open circuit voltge nd short circuit

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

APPENDIX D Precalculus Review

APPENDIX D Precalculus Review APPENDIX D Preclculus Review SECTION D. Rel Numers nd the Rel Line Rel Numers nd the Rel Line Order nd Inequlities Asolute Vlue nd Distnce Rel Numers nd the Rel Line Rel numers cn e represented y coordinte

More information

Introduction. Producer s Surplus. Total Costs: Fixed and Variable

Introduction. Producer s Surplus. Total Costs: Fixed and Variable Introduction Producer s Surplus Philip A. Viton Novemer 12, 2014 We hve seen how to evlute consumer s wtp for mrket-induced price chnge: we mesure it (with pproprite cutions, primrily tht we tret it s

More information

Homework 3 Solutions

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

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Basic Algebra

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Basic Algebra SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mthemtics Bsic Alger. Opertions nd Epressions. Common Mistkes. Division of Algeric Epressions. Eponentil Functions nd Logrithms. Opertions nd their Inverses. Mnipulting

More information

16 Algebra: Linear Equations

16 Algebra: Linear Equations MEP Y7 Prctice Book B 16 Alger: Liner Equtions 16.1 Fundmentl Algeric kills This section looks t some fundmentl lgeric skills y emining codes nd how to use formule. Emple 1 Use this code wheel, which codes

More information

DIRECT-CURRENT CIRCUITS

DIRECT-CURRENT CIRCUITS DT-UNT UTS 6 6.7.DNTFY: First do s much series-prllel reduction s possible. ST UP: The.-Ω nd.-ω resistors re in prllel, so first reduce them to single uivlent resistnce. Then find the uivlent series resistnce

More information

Building Finite Automata From Regular Expressions

Building Finite Automata From Regular Expressions Building Automt From Regulr Expressions We mke n FA from regulr expression in two steps: Trnsform the regulr expression into n NFA. Trnsform the NFA into deterministic FA. The first step is esy. Regulr

More information

Oblique Triangles and The Law of Sines Congruency and Oblique Triangles Derivation of the Law of Sines Solving SAA and ASA Triangles (Case 1)

Oblique Triangles and The Law of Sines Congruency and Oblique Triangles Derivation of the Law of Sines Solving SAA and ASA Triangles (Case 1) Olique Tringles nd The Lw of Sines Congruency nd Olique Tringles Derivtion of the Lw of Sines Solving SAA nd ASA Tringles (Cse 1) Are of Tringle Lw of Sines In ny tringle ABC, with sides,, nd c, sin A

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

Numerical Solutions of Linear Systems of Equations

Numerical Solutions of Linear Systems of Equations EE 6 Clss Notes Numericl Solutions of Liner Systems of Equtions Liner Dependence nd Independence An eqution in set of equtions is linerly independent if it cnnot e generted y ny liner comintion of the

More information

Equivalence of Regular Languages and FSMs

Equivalence of Regular Languages and FSMs Equivlence of Regulr Lnguges nd FSMs Red K & S 2.4 Red Supplementry Mterils: Regulr Lnguges nd Finite Stte Mchines: Generting Regulr Expressions from Finite Stte Mchines. Do Homework 8. Equivlence of Regulr

More information

Chapter 9: Quadratic Equations

Chapter 9: Quadratic Equations Chpter 9: Qudrtic Equtions QUADRATIC EQUATIONS DEFINITION + + c = 0,, c re constnts (generlly integers) ROOTS Synonyms: Solutions or Zeros Cn hve 0, 1, or rel roots Consider the grph of qudrtic equtions.

More information

Logical Design. Design with Basic Logic Gates

Logical Design. Design with Basic Logic Gates Logicl Design Zvi Kohvi nd Nirj K. Jh Design ith Bsic Logic Gtes Logic gtes: perform logicl opertions on input signls Positive (negtive) logic polrit: constnt () denotes high voltge nd constnt lo (high)

More information

Chapter 2. Random Variables and Probability Distributions

Chapter 2. Random Variables and Probability Distributions Rndom Vriles nd Proility Distriutions- 6 Chpter. Rndom Vriles nd Proility Distriutions.. Introduction In the previous chpter, we introduced common topics of proility. In this chpter, we trnslte those concepts

More information

Single phase Auto-transformer:

Single phase Auto-transformer: ingle phse Auto-trnsformer: B A E Fig: nput nd Output connections of single phse Auto-trnsformer The input to uto-trnsformer is given cross B nd the output of the utotrnsformer is tken cross E. f the input

More information

Similarly it would not be sensible to travel 60 km due north in order to go from London to Brighton when Brighton is 60 km due south of London.

Similarly it would not be sensible to travel 60 km due north in order to go from London to Brighton when Brighton is 60 km due south of London. HPTER HPTER 1 nd vector nottion When ll is thrown, the direction of the throw is s importnt s the strength of the throw So if netll plyer wnts to pss the ll to nother plyer to her right it would e no use

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY F MATHEMATICAL STUDIES MATHEMATICS FR PART I ENGINEERING Lectures MDULE 14 VECTRS I 1. Crtesin coordintes 2. Sclrs nd vectors 3. Addition nd sutrction of vectors 4. Crtesin components 5. Sclr product

More information

Systems, Matrices, and Applications Systems of Linear Equations

Systems, Matrices, and Applications Systems of Linear Equations Mt Dr. Firoz -: System of equtions nd mtrices Systems, Mtrices, nd pplictions Systems of Liner Equtions System of eqution (Hs solution) Consistent Inconsistent (hs no solution) Dependent For Emple: Consider

More information

SOLUTIONS TO HOMEWORK #1, MATH 54 SECTION 001, SPRING 2012

SOLUTIONS TO HOMEWORK #1, MATH 54 SECTION 001, SPRING 2012 SOLUTIONS TO HOMEWOK #, MATH 5 SECTION, SPING JASON FEGUSON. Bewre of typos. In fct, your solutions my e etter thn mine.. Some prolems hve scrtch work nd solutions. The scrtch work sys how I cme up with

More information

Square Roots Teacher Notes

Square Roots Teacher Notes Henri Picciotto Squre Roots Techer Notes This unit is intended to help students develop n understnding of squre roots from visul / geometric point of view, nd lso to develop their numer sense round this

More information

Unit 4 The Definite Integral

Unit 4 The Definite Integral Unit 4 The Definite Integrl We know wht n indefinite integrl is: the generl ntiderivtive of the integrnd function. There is relted (lthough in some wys vstly different) concept, the definite integrl, which

More information

Algebra Review. How well do you remember your algebra?

Algebra Review. How well do you remember your algebra? Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

More information

ECE and Homework Assignment #2

ECE and Homework Assignment #2 ECE 212-001 nd -002 Homework Assignment #2 1) Do the tions elow or eh eqution:. (,,) = ( XOR ) ( XOR ). (,,) = ( + ) ( + ) ( + ). (,,) = '( + ) + (' (' + ) + ) Note: XOR is the "exlusive-or" untion. A

More information

Section 4.3. By the Mean Value Theorem, for every i = 1, 2, 3,..., n, there exists a point c i in the interval [x i 1, x i ] such that

Section 4.3. By the Mean Value Theorem, for every i = 1, 2, 3,..., n, there exists a point c i in the interval [x i 1, x i ] such that Difference Equtions to Differentil Equtions Section 4.3 The Fundmentl Theorem of Clculus We re now redy to mke the long-promised connection between differentition nd integrtion, between res nd tngent lines.

More information

[Problem submitted by Kee Lam, LACC Professor of Mathematics. Source: Kee Lam]

[Problem submitted by Kee Lam, LACC Professor of Mathematics. Source: Kee Lam] Prolem ) Find the first integer of four consecutive positive integers such tht the difference of the sum of the squres of the lst three integers nd the sum of the squres of first three integers is 7. [Prolem

More information

SOLVING TRIANGLES USING THE SINE AND COSINE RULES

SOLVING TRIANGLES USING THE SINE AND COSINE RULES Mthemtics Revision Guides - Solving Generl Tringles - Sine nd Cosine Rules Pge 1 of 15 M.K. HOME TUITION Mthemtics Revision Guides Level: GCSE Higher Tier SOLVING TRINGLES USING THE SINE ND COSINE RULES

More information

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers. 2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

More information

Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra A Boolen lgebr is set B of vlues together with: - two binr opertions, commonl denoted b + nd, - unr opertion, usull denoted b or ~ or, - two elements usull clled ero nd one, such tht for ever element of

More information

1 What You Need To Know About Basic Maths

1 What You Need To Know About Basic Maths 1 Wht You Need To Know About Bsic Mths Before we cn strt on ny of the more interesting stuff, I thought I d mke sure tht everyone hs the bsic mthemticl bckground necessry to red nd understnd everything

More information

3 Indices and Standard Form

3 Indices and Standard Form MEP Y9 Prctice Book A Indices nd Stndrd Form. Inde Nottion Here we revise the use of inde nottion. You will lredy be fmilir with the nottion for squres nd cubes, nd this is generlised by defining: Emple

More information

Digital Electronics Basics: Combinational Logic

Digital Electronics Basics: Combinational Logic Digitl Eletronis Bsis: for Bsi Eletronis http://ktse.eie.polyu.edu.hk/eie29 by Prof. Mihel Tse Jnury 25 Digitl versus nlog So fr, our disussion bout eletronis hs been predominntly nlog, whih is onerned

More information

MULTIPLYING BINOMIALS

MULTIPLYING BINOMIALS 5.4 Multiplying Binomils (5-27) 283 wife so tht they oth cn e expected to die in the sme yer? ) Find M(y) F(y) to get formul for the life expectncy of person orn in yer y. 2 ) 1969 ) 0.1726y 268.445 GETTING

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

Conceptual Explanations: Exponents

Conceptual Explanations: Exponents Conceptul Eplntions: Eponents An eponent mens repeted multipliction. For instnce, 0 6 mens 0 0 0 0 0 0, or,000,000. You ve probbly noticed tht there is logicl progression of opertions. When you dd the

More information

Integrals as Net Area Calculus 11, Veritas Prep.

Integrals as Net Area Calculus 11, Veritas Prep. Integrls s Net Are Clculus 11, Verits Prep. Prolems 1. Using Prt II of the FTC, clculte 12 12 5 x 2 dx. Then clculte x 2 dx. Compre nd contemplte your results. (Note tht 5 I m not sking you here to find

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

11.2 Logarithmic Functions

11.2 Logarithmic Functions .2 Logrithmic Functions In the lst section we delt with the eponentil function. One thing tht we notice from tht discussion is tht ll eponentil functions pss the horizontl line test. Tht mens tht the eponentil

More information

Compiler Fall 2011 PRACTICE Midterm Exam

Compiler Fall 2011 PRACTICE Midterm Exam Compiler Fll 2011 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs point

More information

Problems. Figure 6.46 For Prob Figure 6.45 For Prob. 6.5.

Problems. Figure 6.46 For Prob Figure 6.45 For Prob. 6.5. Prolems Section 6. pcitors 6.1 If the voltge cross 7.5-F cpcitor is find the current nd the power. te 3t V, 6. A 5-mF cpcitor hs energy w(t) 1 cos 377t J. Determine the current through the cpcitor. 6.3

More information

1. Give a DFA for Σ = {0, 1} and strings that have an odd number of 1 s and any number of 0 s.

1. Give a DFA for Σ = {0, 1} and strings that have an odd number of 1 s and any number of 0 s. DFAs DFA stnds for deterministic finite utomton. Bsiclly, it is directed grph where ech node hs edges coming out of it leled with the letters from fixed finite lphet Σ. One node is designted s the strt

More information

Multiplication and Division - Left to Right. Addition and Subtraction - Left to Right.

Multiplication and Division - Left to Right. Addition and Subtraction - Left to Right. Order of Opertions r of Opertions Alger P lese Prenthesis - Do ll grouped opertions first. E cuse Eponents - Second M D er Multipliction nd Division - Left to Right. A unt S hniqu Addition nd Sutrction

More information

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility

More information

Converting Regular Expressions to Discrete Finite Automata: A Tutorial

Converting Regular Expressions to Discrete Finite Automata: A Tutorial Converting Regulr Expressions to Discrete Finite Automt: A Tutoril Dvid Christinsen 2013-01-03 This is tutoril on how to convert regulr expressions to nondeterministic finite utomt (NFA) nd how to convert

More information

CS 381 Introduction to Theory of Computing Summer 2002 Prelim 2 June 21, 2002

CS 381 Introduction to Theory of Computing Summer 2002 Prelim 2 June 21, 2002 CS 381 Introduction to Theory of Computing Summer 2002 Prelim 2 June 21, 2002 10 points per prolem. 1. For ech of the following lnguges R, find set of strings S L tht contins exctly one string from every

More information

1. a direction in space, and

1. a direction in space, and Chpter 1 Vectors To the left re three isul representtions of the sme ector. Wht is ector? It is simply wy of storing nd hndling two pieces of informtion: 1. direction in spce, nd 2. mgnitude. An rrow is

More information

1 General LR Parsing. Bottom-Up Parsing

1 General LR Parsing. Bottom-Up Parsing ection - Bottom-Up Prsings: 1 Generl LR Prsing 1 Generl LR Prsing Bottom-Up Prsing Bottom-up prsing is more powerful nd preferle LR(1) exists for ny LR(k) (with end-mrkers) there re LR(1) tht do not hve

More information

Regular Sets and Expressions

Regular Sets and Expressions Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

More information

6 JUNE 2002 SOLUTIONS

6 JUNE 2002 SOLUTIONS 1. DFA nd Regulr Expressions () Build the miniml DFA tht ccepts the strings over Σ = {, } whose ll prefixes with length lrger or equl to 3 hve either n even numer of s or even numer of s (or n even numer

More information

Solving Linear Equations - Formulas

Solving Linear Equations - Formulas 1. Solving Liner Equtions - Formuls Ojective: Solve liner formuls for given vrile. Solving formuls is much like solving generl liner equtions. The only difference is we will hve severl vriles in the prolem

More information

Deterministic Finite Automata

Deterministic Finite Automata Deterministic Finite Automt Bkhdyr Khoussinov Computer Science Deprtment, The University of Aucklnd, New Zelnd mk@cs.ucklnd.c.nz In this lecture we introduce deterministic finite utomt, one of the foundtionl

More information

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn 33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of

More information

Arithmetic / Logic Unit ALU Design

Arithmetic / Logic Unit ALU Design 3-it ALU CSE 675.: Introduction to Computer Architecture ALU Control Arithmetic / Logic Unit ALU Design 7/9/5 Presenttion F Slides y Gojko Bić A B 3 3 3-it ALU 3 Result Zero Crry out Our ALU should e le

More information

Or more simply put, when adding or subtracting quantities, their uncertainties add.

Or more simply put, when adding or subtracting quantities, their uncertainties add. Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re

More information

University of Sydney

University of Sydney 2004multivrilefunctions University of Sydney Deprtment of Economics Mthemticl Methods of Economic Anlysis MULTIVARIABLE FUNCTIONS SUMMARY 1. Functions 1) Given two sets X nd Y, function from X to Y, written

More information

5.3 MULTIPLICATION OF BINOMIALS

5.3 MULTIPLICATION OF BINOMIALS 238 (5 16) Chpter 5 Polynomils nd Exponents 5.3 MULTIPLICATION OF BINOMIALS In this section The FOIL Method Multiplying Binomils Quickly In Section 5.2 you lerned to multiply polynomils. In this section

More information

has the desired form. On the other hand, its product with z is 1. So the inverse x

has the desired form. On the other hand, its product with z is 1. So the inverse x First homework ssignment p. 5 Exercise. Verify tht the set of complex numers of the form x + y 2, where x nd y re rtionl, is sufield of the field of complex numers. Solution: Evidently, this set contins

More information

Arithmetic. Numbers ALU. operation. result Morgan Kaufmann Publishers Morgan Kaufmann Publishers

Arithmetic. Numbers ALU. operation. result Morgan Kaufmann Publishers Morgan Kaufmann Publishers Arithmetic Where we ve een: Performnce (seconds, cycles, instructions) Astrctions: Instruction Set Architecture Assemly Lnguge nd Mchine Lnguge Wht s up hed: Implementing the Architecture opertion 32 ALU

More information

Sections 5.2 and 5.3 Signed Numbers; Rational Numbers; Exponents; Order of Operations

Sections 5.2 and 5.3 Signed Numbers; Rational Numbers; Exponents; Order of Operations Sections 5. nd 5.3 Signed Numbers; Rtionl Numbers; Exponents; Order of Opertions Number Line Negtive numbers Positive numbers Objectives 1. Perform opertions with signed nd rtionl numbers. Evlute exponentil

More information

Arithmetic Logic Unit (ALU) Storage Elements. Today s Lecture

Arithmetic Logic Unit (ALU) Storage Elements. Today s Lecture Arithmetic Logic Unit (ALU) Storge Elements Computer Science 4 Tody s Lecture Homework #4 coming soon Building the uilding locks Outline Review igitl uilding locks An Arithmetic Logic Unit (ALU) Storge

More information

Boolean Algebra of C-Algebras

Boolean Algebra of C-Algebras 0 ITB J. Sci., Vol. A, No., 0, 0-6 Boolen Alger of C-Algers Guddti C. Ro & Perumli Sundryy Deprtment of Mthemtics, Andhr University, Viskhptnm-0 00, Indi Deprtment of Mthemtics, GIT, GITAM University,

More information

Laws of Logarithms. Pre Calculus Math 40S: Explained! 213

Laws of Logarithms. Pre Calculus Math 40S: Explained!  213 Lws of Logrithms Pre Clculus Mth 40S: Eplined! www.mth40s.com 1 Logrithms Lesson Prt I Logrithmic to Eponentil Form converting from rithmic to eponentil form: Emple 1: Convert = y to eponentil form: Emple

More information