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

Similar documents
Writing Exams: Writing Exams. Exam Review

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

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Digital Circuit Engineering

Factorising FACTORISING.

Digital Circuit Engineering

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.

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

Lecture 6: Coding theory

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

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

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

Unit 4. Combinational Circuits

Digital Circuit Engineering

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

Bridging the gap: GCSE AS Level

Algebra 2 Semester 1 Practice Final

Engr354: Digital Logic Circuits

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

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

CS 491G Combinatorial Optimization Lecture Notes

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

Area and Perimeter. Area and Perimeter. Solutions. Curriculum Ready.

SIMPLE NONLINEAR GRAPHS

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

GM1 Consolidation Worksheet

Chapter 4 State-Space Planning

Geometry of the Circle - Chords and Angles. Geometry of the Circle. Chord and Angles. Curriculum Ready ACMMG: 272.

Logarithms LOGARITHMS.

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

Fast Boolean Algebra

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

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

Lesson 2.1 Inductive Reasoning

Polynomials. Polynomials. Curriculum Ready ACMNA:

2.4 Linear Inequalities and Interval Notation

Maintaining Mathematical Proficiency

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Trigonometry Revision Sheet Q5 of Paper 2

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

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

Scientific notation is a way of expressing really big numbers or really small numbers.

Non Right Angled Triangles

Lesson 2.1 Inductive Reasoning

Math 154B Elementary Algebra-2 nd Half Spring 2015

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

Chapter 8 Roots and Radicals

Trigonometry and Constructive Geometry

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

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

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.

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

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

9.1 Day 1 Warm Up. Solve the equation = x x 2 = March 1, 2017 Geometry 9.1 The Pythagorean Theorem 1

Lecture 11 Binary Decision Diagrams (BDDs)

= x x 2 = 25 2

Project 3: Using Identities to Rewrite Expressions

I 3 2 = I I 4 = 2A

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

Chapters Five Notes SN AA U1C5

Name Ima Sample ASU ID

Section 2.1 Special Right Triangles

Bases for Vector Spaces

12.4 Similarity in Right Triangles

Algebra Basics. Algebra Basics. Curriculum Ready ACMNA: 133, 175, 176, 177, 179.

K 7. Quadratic Equations. 1. Rewrite these polynomials in the form ax 2 + bx + c = 0. Identify the values of a, b and c:

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

5. Every rational number have either terminating or repeating (recurring) decimal representation.

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

Similarity and Congruence

Lecture 2e Orthogonal Complement (pages )

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

Digital Circuit Engineering

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

1 This diagram represents the energy change that occurs when a d electron in a transition metal ion is excited by visible light.

CS 360 Exam 2 Fall 2014 Name

6.5 Improper integrals

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

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?

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved.

Simplifying Algebra. Simplifying Algebra. Curriculum Ready.

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

CS 573 Automata Theory and Formal Languages

Chapter 9 Definite Integrals

Boolean algebra.

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

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

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

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

Review of Gaussian Quadrature method

20 MATHEMATICS POLYNOMIALS

Discrete Structures Lecture 11

Name Solutions to Test 3 November 8, 2017

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Year 10 Maths. Semester One Revision Booklet.

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

SIMPLIFICATION OF BOOLEAN ALGEBRA. Presented By: Ms. Poonam Anand

1 Nondeterministic Finite Automata

Exercise 3 Logic Control

Transcription:

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 Exms: riting Exms EE 2607 MIDTERM rleton University Mrh 4, 2008 Open ook. In the spirit of the oe of honor of rleton University I solemnly elre this exmintion is ompletely my own work, n I i not i my nswer to ny question y ishonorle mens. NME STUDENT No rite nswers on the question sheet. Use itionl pper if neessry. ttempt ll questions. UTHORIED MEMORND TURN OFF ell phones n personl ommunitions equipment n EVE THEM IN OUR KNPSK. Notes, ooks, n non-ommuniting lultor re llowe. oolen If you use mp, inite in the spe unerneth it, for whih funtion it is. If you use lger, inite the rules use t the right sie of eh line. Espeilly for sorption, D2, Swp, onesus n other less ovious ones Mrks will e eute if you on t! ) Simplify g= +DEF + PEH +JK +MNG D D 00 0 0 00 0 0 mp of 2

riting Exms: riting Exms riting Exms Timing yourself: 80 min, 00% 5 min for 0%. /2 hour for lenup. Give Up: If you n t get it move on. RTF: Re The Foolish uestion; re it gin DMN IT ht ws ske for? Just the stte tle? Then on t mke K-mps. Di it wnt iruit. Then rw it! Exm Rey + = ook for simple methos: Don t o ll lger questions y multiplying out. (++)(++)(+)= += NO NO NO! F oes not equl its ul F = (++)(++)(+) F ul = ++(+) = +++ = + (F ul ) ul = F = (+)(+) Tke ul Dist +nythng = (use simp twie) + = + 3 riting Exms: riting Exms Time yourself: 5 min for 0%. /2 hour for lenup. Give Up: Try n esier question. RTF: Re it gin riting Exms ook for simple methos: Don t o ll lger questions y multiplying out. (++)(++)(+)=+++++++++ First look for simplifitions. re there three m spe for the nswer? Do you nee thirty? No! see simplifition elow. + = + + + += + Simplify t eh step: Right elow: +nything = eft leg: +nything = + nything Nose: += F n F ul F = (++)(++)(+) F ul = ++(+) = +++ = + (F ul ) ul = F = (+)(+) Tke ul Dist +nythng = (use simp twie) + = + ++++ 4

ommon Mistkes: ommon Mistkes ommon Mistkes. Sying is the sme s 2. Sying n expression is equl to its ul. 3. Not using + = to simplify expressions efore using omplex rules. Not reuing using + E = + E. Simplifying n reuing first sves lger. 4. Sying + = Everyoy knows etter thn this, ut they still o it. 5. hen you tke ul, or generl Demorgn, o not put in the rkets in your he. ( + ) + DE ==> (+)(D +E) ( + ) + DE ==> (() + ) + (DE) ==> ((+))(D +E) 6. Not knowing D2. + =( + )( +) 7. Krnugh mp my not give the simplest iruit, ut it oes give the simplest Σ of Π iruit. Unless you mess up the loops 5 oolen lger: oolen lger oolen lger. Simplify ( + ) 2. Simplify D +E 3. Tke the ul of F=( + )( + ) + 4. Ftor + 5. Ftor + 6. Fin the ul of G=( + )( + ) + D 7. Ftor + D 8. onstrut simplest iruit with MUs + D + D 6

oolen lger: oolen lger. Simplify ( + ) 2. Simplify D +E 3. Tke the ul of F=( + )( + ) + 4. Ftor + 5. Ftor + oolen lger rule += rule DeMorg + D + E =+D+E rule +E=+E F={( + )( + )} + rket NDs F ul ={()+()} ( + )( + ) rule D2 ( +)( + ) rule D2 =( + )( +)( + ) rule D2 6. Fin the ul of G=( + )( + ) + D {( + )( + )} + D rket NDs G ul ={(0)+()}D ul 0 =D rules 0=0; x+0=x 7. Ftor + D ( + )( + D) rule D2 8. onstrut with MUs + D + D =( + )( + )( + D)( + D) rule D2 + D D + D = =D 7 oolen lger: oolen lger K-Mps; ommon Errors hek our Mp Entries One vrile in the wrong squre, you re tost! hek for rp roun, n ier rp roun Using lger fter mp simplifition. Usully not help: K-mp gives the simplest Σ of Π iruit. it of ftoring might lower gte ount. Poor Poor ou fin two etter loops three gtes Goo Fin iggest loops + = ( + ) two gtes Don t Tret Multiple Output Prolems ike Unrelte iruits Mp of F Mp of G SHRE GTES Mp of F 2 gtes, none shre 9 gtes, 3 shre Mp of G 8

oolen lger: oolen lger K-Mps; ommon Errors Do not onfuse 5-vrile mps n ul-output mps. 5-vrile use the lrgest irles, Try to enlrge irle y using oth mps. Multiple output Shring is very importnt to sve gtes Often (esp exms) some smller irles will give fewer gtes. shring lowers gte ount. smller irles inrese letter ount. lne these Multiple Output Mpping Rules Do Hlf-Mps First (Exept for Ps) No frien rule ll friens gone to rk sie rule st two rules re heuristis They help, ut ut not lwys, They o not reple ll thinking. 9 Multiple Outputs Detils: Multiple Outputs Detils Multiple Outputs Detils Exmple.-33 Fin the equtions with minimum logi Minimiztion with shring () Hlf Mps ook for hlf-mp irles (one letter terms) These o not require n ND gte. n n e irle without loss of potentil gte shring. No Friens (one )Rule (2) irle squres tht re on only one mp thus nnot e shre. No Friens, They ent To The Drk Sie, Rule (2) Fin squres tht nnot e usefully shre euse tht squre on other mps is lrey irle. irle them hlf-mp qurter-mp one Mp f No frien one frien ie Mp g 0

Multiple Outputs Detils: Multiple Outputs Detils No est Friens Rule onesome rule) (2) oop squres tht pper on only one mp There is no wy to shre them. oop them with s mny rothers, or s, s possile. No est friens Just rothers irle him with his rothers est irle y (fmily) 00 0 0 00 0 0 00 0 0 No frien 00 here 0 0 Mp of Mp of No frien here 00 0 0 00 0 0 No frien here 00 0 0 00 0 0 Mp of Mp of Multiple Outputs Detils: Multiple Outputs Detils My est Friens re Gone Rule. (They went over to the rk sie) (2) ith no est friens left, we nnot usefully shre loops. oop these new frienless s with fmily. h one est frien 00 0 0 00 0 0 00 0 0 00 0 0 Frien went to the rk sie Mp of oop him with fmily Mp of est frien s gone est frien s gone 00 0 0 00 0 0 00 0 0 00 0 0 Mp of oop him His est frien is gone. Mp of 2

Multiple Outputs Detils: Multiple Outputs Detils Exmp.-33Fin the minimum Σ of Π Minimum numer of ND terms Poor Metho etter Metho () irle hlf mps (none) rgest irles 7 ND terms (2) No Friens, ( s on only one mp) F F G G H H oop Frienless s, they will never shre Unfortuntely you hve hoies; severl wys to loop some squres hoies F F G H hoies G H 3 Fin the minimum Σ of Π(ont): Fin the minimum Σ of Π(ont) Fin the minimum Σ of Π(ont) hoies hoie () hosen irles re she Shows unneessry reunny hoie (2) hoie (3) hoies John s Solution 6 ND terms Tom s Solution 5 ND terms nie s Solution 5 ND terms F F F 4 G G G F G H H H H

Prolems from De 96.: Prolems from De 96. Sketh the Output veforms D Prolems from De 96. D th (inverte lok) Trnsprent when? the when? D D Flip-Flop ege triggere Equilivlent to gte D G D th Trnsprent when the when 5 Prolems from De 96.: thes et from De 96. Exmple.-34 Sketh the Output veforms D T T T Prolems from De 96. D th (inverte lok) Trnsprent when low the when high D D Flip-Flop Rising ege triggere D G 0 0 0+ 0+0 0+0 + T T T NOR gte D th Trnsprent when = the when =0 6

Prolems from De 96.: Prolems from De 96. thes et from De 96.thes et from De 96. Exmple.-35 Sketh the Output veforms D T T T D th (inverte lok) Trnsprent when lok low the when high D D Flip-Flop Rising ege triggere D G 0 0 0+ 0+0 0+0 + T T T NOR gte D th Trnsprent when = the when=0 7 Prolems from De 96.: thes et. from De 96. Exmple.-36 Sketh the Output veforms R S E R S Prolems from De 96. Reset() - set() th Set output to 0 when R=0 Set output = when RS=0 Store output when SR= F Synhronous Stte Grph x=0 x=0 x= 0 z=0 x= z= K Stte= Synhronous Stte Grph G x= x=0 z= x= x=0/z= x=/z=0 K Stte Show stte s well s Stte Stte 8

Prolems from De 96.: thes et. from De 96. Exmple.-37 Sketh the Output veforms R S E R() S() 0 0 0 Prolems from De 96. Reset()-set() th Set output = when RS=0 Set output to 0 when R=0 Store output when SR= Set ominnt F Synhronous Stte Grph K x=0 x=0 x= 0 z=0 x= z= Sketh the iruit. Stte 0 Stte 0 Stte Stte Stte= Stte only hnges on the lok ege Synhronous Stte Grph G x= x=0 = x= K = Stte Stte Stte Stte Show stte s well s Stte Stte 9 Summry So Fr: Summry So Fr Summry So Fr T flip flop En K R Re the question! ll of it! lwys hek for x + = Use this to simplify nywhere. lwys reue + x = + x Use nywhere exept for hzrs Too mny people sy x + = x 0 00 Put stte tles in K-mp orer 0 0 0 0 0 00 0 0 To tell Moore from Mely in wor prolems. Moore Outputs Outputs will pper fter the next tive lok ege. 2. Mely Outputs Outputs will pper fter the input hnges Flip flops Smple D input just efore the lok.. Trnsfer this to the output just fter the lok. never hnges exept t lok eges T-flip flops Toggle fter every lok ege if - enle (provie it hs n enle) K D K D R D K Input using output Moore Mely 20

Summry So Fr: Summry So Fr Must Do ith Finite-Stte Mhines. Rerrnge the stte tle into Krnugh mp orer.. hnge sttes only t n tive lok ege. Often one when on timing igrms. NoNo. Rememer tht FSMs re multiple output mhines. th for shre gtes when you loop mps. Next-Stte ogi Output ogi 2 2 2 2 2 0 0 0 0 0 D 2 D D 0 D 2 MU OGI: MU OGI MU OGI F= + e + e + + e Rell x + x = x x + x = x + F= 0 + e + e + 0 + 0e F= + e + 0e + + e e + e +e + + e e e e e + 0 + + + + e e +0 + + 0 + 0 + + 0 These MUs oth nee Use the sme input MU 22

MU OGI: MU OGI GOOD UK 23 MU OGI: MU OGI 24

MU OGI: MU OGI 25 MU OGI: MU OGI 26

MU OGI: MU OGI 27 MU OGI: MU OGI 28

MU OGI: MU OGI 29 MU OGI: MU OGI 30

MU OGI: MU OGI 3