The University of Michigan Department of Electrical Engineering and Computer Science. EECS 270 Fall Practice Final Exam.

Similar documents
Practice Final Exam Solutions

For smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance

Fundamentals of Digital Design

Final Exam. ECE 25, Spring 2008 Thursday, June 12, Problem Points Score Total 90

CPE100: Digital Logic Design I

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Written exam with solutions IE Digital Design Friday 21/

Simplify the following Boolean expressions and minimize the number of literals:

CPE100: Digital Logic Design I

Quiz 2 Solutions Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)

Written exam for IE1204/5 Digital Design with solutions Thursday 29/

Why digital? Overview. Number Systems. Binary to Decimal conversion

Computer Science Final Examination Friday December 14 th 2001

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

Sequential Logic Worksheet

Exam for Physics 4051, October 31, 2008

Sample Test Paper - I

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

Philadelphia University Student Name: Student Number:

Time Allowed 3:00 hrs. April, pages

UNIVERSITI TENAGA NASIONAL. College of Information Technology

COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015

DE58/DC58 LOGIC DESIGN DEC 2014

Written reexam with solutions for IE1204/5 Digital Design Monday 14/

Sequential Circuit Analysis

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

CSE 140 Midterm 2 - Solutions Prof. Tajana Simunic Rosing Spring 2013

University of Minnesota Department of Electrical and Computer Engineering

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد

Digital Logic Appendix A

Chapter 7 Logic Circuits

Boolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Chapter 2 Boolean Algebra and Logic Gates

Written exam with solutions IE1204/5 Digital Design Friday 13/

Quiz 2 Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)

CSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015


ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

ECE 2300 Digital Logic & Computer Organization

Digital Logic Design - Chapter 4

Philadelphia University Student Name: Student Number:

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences

Synchronous Sequential Circuit

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

Written exam with solutions IE1204/5 Digital Design Monday 23/

Cs302 Quiz for MID TERM Exam Solved

Show that the dual of the exclusive-or is equal to its compliment. 7

CSCI 2150 Intro to State Machines

Solution (a) We can draw Karnaugh maps for NS1, NS0 and OUT:

Clocked Sequential Circuits UNIT 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS. Analysis of Clocked Sequential Circuits. Signal Tracing and Timing Charts

Sequential Circuits Sequential circuits combinational circuits state gate delay

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Synchronous Sequential Circuit Design. Digital Computer Design

Unit 7 Sequential Circuits (Flip Flop, Registers)

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

Review Problem 1. should be on. door state, false if light should be on when a door is open. v Describe when the dome/interior light of the car

EECS 270 Midterm Exam 2 Fall 2009

WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of

Karnaugh Maps (K-Maps)

CPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic

Boolean Algebra and Digital Logic

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Design of Datapath Controllers

Signals and Systems Digital Logic System

ENGG 1203 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR. Parity checking (for interest) Recall : Simplification methods. Recall : Time Delay

Number System conversions

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO

ECE20B Final Exam, 200 Point Exam Closed Book, Closed Notes, Calculators Not Allowed June 12th, Name

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

ENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic

Synchronous Sequential Logic

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

EECS 270 Midterm 2 Exam Answer Key Winter 2017

Unit 2 Session - 6 Combinational Logic Circuits

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

ENEL Digital Circuits Final Examination

Different encodings generate different circuits

10/12/2016. An FSM with No Inputs Moves from State to State. ECE 120: Introduction to Computing. Eventually, the States Form a Loop

Week-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

Lecture 8: Sequential Networks and Finite State Machines

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

Digital Logic Design. Midterm #2

EE 209 Logic Cumulative Exam Name:

Read this before starting!

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

MC9211 Computer Organization

Preparation of Examination Questions and Exercises: Solutions

Ch 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1

Transcription:

The University of Michigan Department of Electrical Engineering and Computer Science EECS 270 Fall 2003 Practice Final Exam Name: UM ID: For all questions, show all work that leads to your answer. Problem # Possible Points Points Earned 1 13 2 19 3 14 4 17 5 15 6 12 7 10 Total 100 I have neither given nor received any unauthorized aid on this exam. Signed:

1. Number Conversion: 13 Points Total (a: 3 pts) -20 10 =? 2 using a 6-bit two s-complement representation (b: 3 pts) 11010 2 (two s-complement representation) =? 2 (one scomplement representation): (c: 3 pts) AB.9 16 =? 8 (d: 4 pts) Represent the decimal number 26.6 with a binary number containing no more than eight bits. What is the numerical error in this representation of the number 26.6?

2. K-Maps: 19 Total Points Consider the following function and its K-map: F = Σ ABCD (0, 2, 5, 10, 15) + d(7) C CD AB 00 01 11 10 A 00 01 11 10 1 0 0 0 0 1 0 0 0 d 1 0 1 0 0 1 D B (a: 3 pts) Construct the minimal S.O.P. expression for F.

(b: 4 pts) Construct the minimal P.O.S. expression for F. (c: 3 pts) What is the cost of each expression (S.O.P and P.O.S.) in terms of number of literals? (d: 4 pts) Are the S.O.P. and P.O.S. identical functions?.

(e: 5 pts) Change two cells in the K-map above to don t cares, and derive the new minimal S.O.P and P.O.S. expressions. Choose your don t cares such that: 1) The new minimal S.O.P. and P.O.S. are equal functions 2) The sum of the literals from the S.O.P. and P.O.S. is minimal.

3. Sequential Circuits: 14 Total Points Given the circuit above, complete the timing diagram for signals n, out, and out_b. Assume that following values for the D-latch: t setup = t hold = 1.5ns t CQ HL = t CQ LH = 1ns t DQ HL = t DQ LH = 2ns Also, assume the NOR gates have a rising and falling delay of 1ns. Mark any regions of metastability with:

4. State Machine Design: 17 Total Points Given a state machine with one input x and one output Q. Let num_cyc_1 denote the number of previous clock cycles where x was a one and num_cyc_0 denote the number of previous clock cycles where x was a zero. The state machine sets Q = 1 if (num_cyc_1 - num_cyc_0) is a multiple of 3, i.e (num_cyc_1 - num_cyc_0) = -6, -3, 0, 3, 6 When the state machine starts, num_cyc_0 and num_cyc_1 are assumed to be zero. Example sequence: X: 100 001 110 101 110 Q: 101 001 001 010 100 num_cyc_0: 001 234 444 556 666 num_cyc_1: 011 111 234 455 678 Draw the state diagram for this state machine using no more than 5 states. Identify which state your machine should start in. Draw neatly and avoid crossing lines if possible.

5. Counter/Shifter Design: 15 Total Points Consider the design on the next page, constructed with one up counter and one right/up shift register. Let outputs out3-out0 be the binary representation of a number x between 0 and 15 (out3 is the MSB). What is the repeating sequence of numbers x this design will produce? Hint: Assume the counter starts in state Q3 Q0 = 0011

6. Codes: 12 Total Points You have designed a system that transmits one of four 5-bit codes A, B, C, D, shown below, across a microwave link. A: 0 1 1 0 0 B: 1 1 0 1 0 C: 1 0 1 0 1 D: 0 0 0 1 1 (a: 4 pts) What is the minimum Hamming distance of this code? (b: 4 pts) Your manager explains to the customer that the microwave link is very robust and only a single bit in any 5-bit code can be flipped. If the data transmitted by the microwave link is corrupted and you receive the code X, shown below, can the received code be corrected? If yes, what was the transmitted code? If no, what is the set of possible transmitted codes? X: 11101 (c: 4 pts) After buying your system, your customer finds that the microwave link is not quite as reliable as your manager had claimed. Your manager blames you for the problem and tells you to develop a solution, once again interrupting your latch design project. Upon investigation, you find that the link is such that either no bits are flipped in a transmitted code, or exactly two bits are flipped. Given this new information, can the code be corrected? If yes, what was the transmitted code? If no, what is the set of possible transmitted codes?

7. CMOS: 10 Total Points (a: 5 pts) Given the circuit below, write out the Boolean equation for out as a function of inputs A and B. (b: 5 pts) Is the gate shown below a valid CMOS gate? Briefly explain why or why not.