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

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

Please read carefully. Good luck & Go Gators!!!

University of Florida EEL 3701 Fall 1996 Dr. Eric M. Schwartz

ENEL Digital Circuits Final Examination

Sample Test Paper - I

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

Computer Science Final Examination Friday December 14 th 2001

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

EE 209 Spiral 1 Exam Solutions Name:

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

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Philadelphia University Student Name: Student Number:

CprE 281: Digital Logic

Fundamentals of Digital Design

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes

DE58/DC58 LOGIC DESIGN DEC 2014

Philadelphia University Student Name: Student Number:

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

Karnaugh Maps (K-Maps)

Read this before starting!

CPE100: Digital Logic Design I

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

EE 209 Logic Cumulative Exam Name:

Lecture 2 Review on Digital Logic (Part 1)

EECS 270 Midterm 2 Exam Answer Key Winter 2017

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

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

Read this before starting!

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

Read this before starting!

Boolean Logic Continued Prof. James L. Frankel Harvard University

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

UNIVERSITI TENAGA NASIONAL. College of Information Technology

of Digital Electronics

Experiment 7: Magnitude comparators

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

NTE74LS181 Integrated Circuit TTL Arithmetic Logic Unit/Function Generator

CPE100: Digital Logic Design I

Digital Logic Appendix A

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Class Website:

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

UNIT II COMBINATIONAL CIRCUITS:

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

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

Read this before starting!

SAMPLE ANSWERS MARKER COPY

CSE 140 Spring 2017: Final Solutions (Total 50 Points)

DIGITAL LOGIC CIRCUITS

Combinational Logic. By : Ali Mustafa

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

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

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

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

CHAPTER 7. Exercises 17/ / /2 2 0

Written exam with solutions IE Digital Design Friday 21/

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

Chapter 3 Combinational Logic Design

University of Minnesota Department of Electrical and Computer Engineering

Digital Logic (2) Boolean Algebra

Section 001. Read this before starting! You may use one sheet of scrap paper that you will turn in with your test.

Combinational Logic Trainer Lab Manual

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

Numbers and Arithmetic

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.


CPSC 121 Midterm 1 Tuesday, October 11th, 2011

Numbers and Arithmetic

Cs302 Quiz for MID TERM Exam Solved

Practice Final Exam Solutions

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

CPE100: Digital Logic Design I

Digital Electronics Final Examination. Part A

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

on candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Menu. Review of Number Systems EEL3701 EEL3701. Math. Review of number systems >Binary math >Signed number systems

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.

Design of Combinational Logic

Binary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q

Digital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta

Philadelphia University Faculty of Engineering

211: Computer Architecture Summer 2016

EE371 - Advanced VLSI Circuit Design

CD4028BC BCD-to-Decimal Decoder

Design of Sequential Circuits

Number System conversions

Vidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

BCD-TO-DECIMAL DECODER HIGH-VOLTAGE SILICON-GATE CMOS IW4028B TECHNICAL DATA

CprE 281: Digital Logic

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

Unit 3 Session - 9 Data-Processing Circuits

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

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

CSE 140 Midterm 3 version A Tajana Simunic Rosing Spring 2015

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

Transcription:

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 1/13 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices Show all work on the front of the test papers Box each answer If you need more room, make a clearly indicated note on the front of the page, "MORE ON BACK", and use the back The back of the page will not be graded without an indication on the front This exam counts for 33% of your total grade Read each question carefully and follow the instructions You may not use any notes, HW, labs, other books, or calculators, computers, or any electronic devices The point values for problems may be changed at prof s discretion You must pledge and sign this page in order for a grade to be assigned Boolean expression answers must be in lexical order, (ie, /A before A, A before B, & D 3 before D 2 ) CLEARLY write your name at the top of this test page (and, if you remove the staple, all others) Be sure your exam consists of 13 distinct pages Sign your name and add the date below (If we struggle to read your name, you will lose points) PropaGator 2: UF s PropaGator (Autonomous Surface Vehicle) for RoboBoat competition Failure to follow the below rules will result in NO partial credit The base (radix) of all number should be indicated with a subscript or prefix Truth tables, voltage tables, and timing simulations must be in counting order Label the inputs and outputs of each circuit with activation-levels For each mixed-logic circuit diagram, label inputs of each gate with the appropriate logic PropaGator 2 front view equations For K-maps, label each grouping with the appropriate equation For each circuit design, equations must not be used as replacements for circuit elements Boolean expression answers must be in lexical order, (ie, /A before A, A before B, & D 3 before D 2 ) PLEDGE: On my honor as a University of Florida student, I certify that I have neither given nor received any aid on this examination, nor I have seen anyone else do so SIGN YOUR NAME DATE (30 June 2015) Regrade comments below: Give page # and problem # and reason for the petition Problem Available 1 12 2 14 3 7 4-5 11 6 21 7 5 8 11 9 10 10 9 TOTAL 100 Points

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 2/13 Exam 1 [12%] 1 Solve the following arithmetic problems Remember to show ALL work here and in EVERY problem on this exam (4%) a) Determine the unsigned hexadecimal, octal, binary, and BCD representations of the 4 min number 251 10 Binary: Octal: Hex: BCD: (3%) b) Determine the 10-bit signed magnitude, 1 s complement, and 2 s complement 2 min representations of the decimal number -251 10 Signed Mag: 1 s Comp: 2 s Comp: (2%) c) What is 511 10 251 10 in 10-bit 2 s complement? You must use binary numbers to derive 3 min and determine the solution (not decimal) Remember that you must show all work (Hint: 256+255=511) Please circle your answer

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 3/13 Exam 1 (3%) 1 d) What is 511 10 + 251 10 in 10-bit 2 s complement and 11-bit 2 s complement? You must 3 min use binary numbers to derive and determine the solution (not decimal) Remember that you must show all work Please circle your answers 10-bit 11-bit [14%] 2 Answer the following short questions Show ALL work (4%) a) Draw a circuit like you would in a Quartus schematic entry [bdf] file to DIRECTLY 2 min implement (ie, do NOT simplify) the equation Y = /( /A * B ), where A is active-low, and B and Y are active-high Use the minimum number of gates (3%) b) Draw a complete timing diagram, exactly as Quartus would; include 10ns propagation 3 min delays, as Quartus would Label the inputs and output and the time axis (4%) c) Draw the required switch circuits and LED circuit 2 min to complete the circuit design for this problem The circuits should do nothing else (These should be circuit diagrams, not layout diagrams) Draw the switches in their true positions

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 4/13 Exam 1 (3%) 2 d) Draw a layout of the entire above circuit including 5 min each of the switch and LED circuits for part c and the logic from part a A layout shows each of the parts as 14-pin Chip they appear on the breadboard Include the needed switches, resistors (SIP and/or DIP), and LEDs I don t know what chip you used, so assume whatever pin numbers you want (for the 14-pin chip), along with the normal power and ground pins Label the pin numbers in part a Label the wires for each of the inputs and outputs (A, B, and Y) with their activation levels I suggest that you use labels to replace long wires The dark part of the switches in the figure are the parts that you move to change the switch s closure state Draw the switches in their true positions Vcc GND [7%] 3 Directly implement the below equation with a mixed-logic circuit diagram (Do NOT simplify the equation) Use only gates of the 74HC08 (or their mixedlogic equivalents) Only if necessary, you can also use other SSI components 5 min Use the minimum number of gates required Use the appropriate mixed-logic symbols You are free to choose the activation levels that will optimize your solution (No pin numbers are necessary) G( ) O( ) U( ) Soccer( ) S( ) A( )

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 5/13 Exam 1 [4%] 4 Find the MSOP or MPOS equivalent of the below Boolean expression Show ALL work 5 min (Please verify that you are correctly reading the equation Note that Ball, One and the second Num each have 3 bars above them) Gators = [7%] 5 What are the (SOP or POS) equations for the outputs of the following circuits? Lexical order is NOT necessary for these problems (4%) a) 2-input MUX with (3%) b) 3-state Enable 4 min 4 min G(H) 0 Tues(L) O(L) 1 Y 3-state E(H) En S A(H) U(H) S(L) E(H) 0 1 En 2-input MUX with 3-state Enable 3-state Y S A(H) Tues (L)

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 6/13 Exam 1 [21%] 6 Design a system that counts as shown with the values of 5 10 and 3 10 3 min The system must asynchronously go to the state 5 when Start (active-low) goes true Use a T-FF for the least significant bit of your Start design, a JK-FF for the next more significant bit (if necessary), and a D-FF(s) for any other bits you might need The least-significant count output bit should be active-high; all other count output bits should be active-low Note: All the given FFs have asynchronous clear and set inputs as shown 3 5 (a-d 10%) 3 min Inputs a) Draw a functional block diagram (showing all the inputs, all the outputs, and the functional blocks) Put your design in the dashed box with the inputs and outputs going into or out of the box, on the left or right, respectively This is not a circuit diagram Outputs J K SET Q Q CLR T SET Q Q CLR D SET Q 5 min (a-d 10%) b) Complete the next-state truth table (in counting order) CLR Q

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 7/13 Exam 1 (a-d 10%) 6 c) Find the required simplified (MSOP or MPOS) equations 3 min (a-d 10%) 5 min d) Design the complete circuit, minimizing the total number of components, but using the T-FF, JK-FF, and D-FF(s) (if necessary), as described previously All inputs and outputs of the circuit should be clearly indicated coming into or out of the below dashed box Your design must include the circuitry necessary to asynchronous re-start the system at 5 when the Start (active-low) signal goes true Inputs Outputs

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 8/13 Exam 1 (e-f 4%) 6 e) Use the table in part b (or make a new table) to create the same counter, but this time use 4 min a JK-FF for the least significant bit of your design, a T-FF for the next more significant bit (if necessary), and a D-FF(s) for any other bits you might need Find the required simplified (MSOP or MPOS) equations (e-f 4%) 4 min f) Design the complete circuit as you did in part d, but this time for the design described in part e Inputs Outputs

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 9/13 Exam 1 (g-i 7%) 6 g) Now add a synchronous count signal, Count(H) When Count is false, stop counting, 5 min just as you did you re your lab 5 counter when F and B were both false Complete the next-state truth table (in counting order) Use a JK-FF for the least significant bit of your design, a T-FF for the next more significant bit (if necessary), and a D-FF(s) for any other bits you might need (g-i 7%) 6 h) Find the required simplified (MSOP or MPOS) equations 5 min

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 10/13 Exam 1 (g-i 7%) 6 i) Design the complete circuit as you did in part d and f, but this time for the design 4 min described in parts g-h Inputs Outputs [5%] 7 Use the below equation for this problem 5 min BC A Use K-maps to simply the equation and put the result in MSOP and form MPOS BC A YMSOP = YMPOS =

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 11/13 Exam 1 [12%] 8 Use the below equation for this problem CD AB CD AB (6%) a) Use K-maps to simply the equation and put the result in MSOP and form MPOS Are 7 min these solutions (in part a) equivalent? Explain why or why not YMSOP = YMPOS = Equivalent?: (5%) b) If the terms ABCD=0001 and ABCD=1000, ie, the textbook s d(1,8), are DON T 3 min CAREs (X), determine the new MSOP and MPOS equations Are these solutions (in part b) equivalent? Explain why or why not CD AB CD AB YMSOP = YMPOS = Equivalent?:

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 12/13 Exam 1 [10%] 9 Design a 3-to-8 Decoder with a single enable using as many of the 7 min given 2-to-4 Decoders with the enables (E1, E2, and E3) as necessary Use the minimum number of 2-to-4 Decoders and a minimum number E1 of SSI (AND, NOR, NOT, etc) gates necessary (Note that all the E2 enables on the 2-to-4 Decoders must be true in order for the device to behave like a decoder) E3 X1 X0 2 to 4 Decoder Y3 Y2 Y1 Y0 Inputs Outputs

University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 13/13 Exam 1 [9%] 10 Use the given multiplexers to design mixed-logic circuit diagrams that solve each of the 2 min below problems Be careful to read the equation correctly Choose activation levels for each signal (that has not already been assigned) to minimize the number of additional parts required Use the minimum number of additional SSI gates Show all work (The three below problems are independent) (4%) a) UF 0 = G*/A * (T*/O + O*/R*S + T*S) 4 min 0 1 2 3 E Y UF 0(H) (3%) b) UF 1 = G*/A * (T*/O + O*/R*S + T*S) 3 min T(H) 0 1 2 3 4 5 6 7 E O(H) Y UF 1(H) T(H) O(H) S(H) (2%) b) UF 2 = G*/A * (T*/O + O*/R*S + T*S) (Note that the output is active-low) 3 min 0 1 2 3 4 5 Y UF 2(L) 6 7 E T(H) O(H) S(H)