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

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

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

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

Fundamentals of Digital Design

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

Philadelphia University Student Name: Student Number:

ENEL Digital Circuits Final Examination

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

Computer Science Final Examination Friday December 14 th 2001

Sample Test Paper - I

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

Lecture 2 Review on Digital Logic (Part 1)

CprE 281: Digital Logic

Experiment 7: Magnitude comparators

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

ENEL Digital Circuit Design. Final Examination

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

Numbers and Arithmetic

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

Read this before starting!

Numbers and Arithmetic

of Digital Electronics

Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs

DE58/DC58 LOGIC DESIGN DEC 2014

Philadelphia University Student Name: Student Number:

Boolean Logic Continued Prof. James L. Frankel Harvard University

Read this before starting!

Read this before starting!

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

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

SAMPLE ANSWERS MARKER COPY

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

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

DIGITAL LOGIC CIRCUITS

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.

Combinational Logic. By : Ali Mustafa

Systems I: Computer Organization and Architecture

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

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

CPE100: Digital Logic Design I

Read this before starting!

Karnaugh Maps (K-Maps)

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

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

Cs302 Quiz for MID TERM Exam Solved

'XNH8QLYHUVLW\ (GPXQG73UDWW-U6FKRRORI(QJLQHHULQJ. ECE 110 Fall Test I. Michael R. Gustafson II


CPE100: Digital Logic Design I

University of Minnesota Department of Electrical and Computer Engineering

Number System conversions

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

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

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Digital Logic (2) Boolean Algebra

EECS 270 Midterm 2 Exam Answer Key Winter 2017

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

NTE74LS181 Integrated Circuit TTL Arithmetic Logic Unit/Function Generator

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

Combinational Logic Trainer Lab Manual

Hakim Weatherspoon CS 3410 Computer Science Cornell University

Binary addition example worked out

EECS 270 Midterm Exam 2 Fall 2009

CpE358/CS381. Switching Theory and Logical Design. Summer

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

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

Digital Logic Appendix A

Signals and Systems Digital Logic System

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

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

Class Website:

EEE130 Digital Electronics I Lecture #4

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

Logic Design Combinational Circuits. Digital Computer Design

Sample Marking Scheme

Digital Electronics Final Examination. Part A

EE 209 Logic Cumulative Exam Name:

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Chapter 7 Combinational Logic Networks

Design of Combinational Logic

211: Computer Architecture Summer 2016

CHAPTER 7. Exercises 17/ / /2 2 0

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

CPSC 121 Midterm 1 Tuesday, October 11th, 2011

School of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics

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

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

CPE100: Digital Logic Design I

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)

Prove that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).

CS311 Lecture: Introduction to Digital Logic

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

CS1800 Discrete Structures Fall 2017 October, CS1800 Discrete Structures Midterm Version A

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

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

CPS311 Lecture: Introduction to Digital Logic

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

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

Transcription:

Page 1/12 Exam 1 May the Schwartz Instructions: be with you! Turn off all cell phones and other noise making devices and put away all electronics 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 Last Name, First Name This exam counts for 20% of your total grade Read each question carefully and follow the instructions You may not use any notes, HW, labs, other books, or calculators 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 Put your name at the top of this test page (and, if you remove the staple, all others) Be sure your exam consists of 12 distinct pages Sign your name and add the date below UF IEEE s SoutheastCon 2015 robot for Hardware Competition Please read carefully Good luck & Go Gators!!! 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 equations For K-maps, label each grouping with the appropriate equation Labels inside of parts must be provided whenever it can be confusing, eg, they MUST be specified for MUXes and Decoders, but not for NANDs and ORs 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 Regrade comments below: Give page # and problem # and reason for the petition SIGN YOUR NAME Pages 2-3 14 4 3 5 13 6 7 7 13 8 12 9 11 10 11 11-12 16 TOTAL 100 Available Points

Page 2/12 Exam 1 [14%] 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 number 56710 Binary: Octal: Hex: BCD: (3%) b) Determine the 12-bit signed magnitude, 1 s complement, and 2 s complement 3 min representations of the decimal number -56710 (I strongly recommend that you check your work before moving on to the next problem) Signed Mag: 1 s Comp: 2 s Comp: (1%) c) What is -810 in 4-bit 2 s complement? (Hint: 2 3 = 8) You must show all work 1 min (-8)2 4-bit 2 s comp:

Page 3/12 Exam 1 (2%) 1 c) What is -204810 56710 in 12-bit 2 s complement? (Hint: 2 11 = 2048) You must use 3 min binary numbers to derive and determine the solution (not decimal) You must show all work (-204810 56710)2 12-bit 2 s comp: (2%) 1 d) What is 102410 56710 in 12-bit 2 s complement?? (Hint: 2 10 = 1024) You must use 3 min binary numbers to derive and determine the solution (not decimal) You must show all work (102410 56710)2 12-bit 2 s comp: (2%) 1 e) Perform the requested operations in binary Show 4 digits after the binary point and 1 digit after the hex point What is the answer in both binary and hex? 110111 100 Quotient =

Page 4/12 Exam 1 [3%] 2 Simplify the following logic equation using only Boolean identities, laws or theorems Show all steps Give the solution in MSOP form 5 min Ga = (T + O ) + R (T + S OR ) Ga =

Page 5/12 Exam 1 [13%] 3 Answer the following questions (3%) a) Sketch the bdf file so that it looks like what you would create in Quartus for the equation Y = /( A + /B) with A(H), B(L), Y(H) using the minimum number of gates (3%) b) Draw a complete timing diagram, exactly as Quartus would; include 10ns propagation delays, as Quartus would Label the inputs and output and the time axis 3 min (4%) c) Draw the required switch circuits and LED circuit to 2 min complete the circuit design for this problem (These should be circuit diagrams, not layout diagrams) Draw the switches in their true positions (3%) d) Draw a layout of the entire above circuit including each 5 min of the switch and LED circuits for part c and the logic from part a A layout shows each of the parts as they 14-pin Chip 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 b 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

Page 6/12 Exam 1 [7%] 4 Directly implement the below equation with a mixed-logic circuit diagram 5 min (Do NOT simplify the equation) Use only gates of 74HC02 chips (or their mixed-logic equivalents) Use the minimum number of gates required Use the appropriate mixed-logic symbols You are free to choose the activation levels for all signals except that Gat (the output) must be activelow Label the parts and pin numbers for your circuit design 2 3 5 6 02 1 4 Gat = ({[(O + R ) G ] + R } [O ) W ] + L 8 9 10 O( ) 11 12 13 R( ) G( ) Gat(L) R( ) O( ) W( ) L( )

Page 7/12 Exam 1 [5%] 5 Use only open-collector gates (of any real SSI-type gate) to directly implement the below equation (Do NOT simply the equation) Show your work! M must be active-high and U must be active-low, but you may chose all other activation levels Beat = (M + I + Z ) (Z + O + U) [8%] 6 Determine the sequence of outputs, for Q2(H), Q1(H), and Q0(H), starting at Q2Q1Q0=000 7 min Assume the asynchronous clear, CLR(L), is false and a series of clocks (CLK) occur to create the sequence of outputs Show ALL work List the next 7 values in the sequence Q0_L Q1 AND2 inst3 TFF PRN T Q Q2 Vcc VCC CLK CLRN inst2 CLR Q2 NOT inst4 Q2_L Q2_L CLK DFF PRN D Q CLRN inst CLR Q1 Q1 NOT inst5 Q1_L Q1_L Vcc CLK JKFF PRN J Q K CLRN inst1 CLR Q0 Q0 NOT inst6 Q0_L Sequence =

Page 8/12 Exam 1 [12%] 7 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 four below problems are independent) 3 min (3%) a) Gog0 = A*/T (O + /R /S + /O S) 0 1 2 3 Y O(H) R(H) 3 min (3%) b) Gog1 = A*/T (O + /R /S + /O S) (Note the enable) 4-input MUX with non 3-state Enable 0 1 2 3 E Y 3 min (3%) c) Gog2 = A*/T (O + /R /S + /O S) (Note the enable) O(H) R(H) 4-input MUX with non 3-state Enable 0 1 2 3 E Y O(H) R(L) (3%) d) Gog3 = A*/T (O + /R /S + /O S) (Note the mux size and enable) 3 min 0 1 2 3 4 5 6 7 E 8-input MUX with non 3-state Enable Y T(H) O(H) R(H)

Page 9/12 Exam 1 [11%] 8 Solve the following Karnaugh Map Boolean Algebraic simplifications problems (6%) a) Simply the below equation and put the result in MSOP and form MPOS Label your circles! 8 min Y = (A + B + C + D) (A + B + D) (A + B + C ) (A + C + D) (B + C + D ) (A + B + C) CD AB CD AB Y MSOP = Y MPOS = (4%) b) If the terms ABCD=1000, 1001, and 1101, ie, the textbook s d(8,9,13), are DON T CAREs (X), determine the new MSOP and MPOS equations CD AB CD AB Y MSOP = Y MPOS = (1%) c) Are the above equations (in part b) equivalent? Why or why not? 2 min

Page 10/12 Exam 1 [11%] 9 Solve the below decoder-related problems (4%) a) Determine the truth table for the 5 min below decoder Also create a functional block diagram from the given block diagram 2:4 Decoder Z 0 W 0 W 1 Z 1 Z 2 Z 3 (4%) b) Determine the equations for the decoder (use space above) Simplify the equations 6 min Design a circuit (use space below) to implement this design Use only SSI gates (3%) c) Add an active-low enable to the above truth table (on the left) and complete the table (It 3 min is not necessary to put this augmented table in counting order) Add to (but do NOT modify) the above circuit for the new design Use the signal names in part b in your design below Rename the new outputs P3 through P0

Page 11/12 Exam 1 [16%] 10 Design the following specified multiplexers (4%) a) Create a functional block diagram and then design a 4-input multiplexer (with no enable) For this design, use only 2-input multiplexers with no enables Only if necessary, you may use SSI parts to complete your design Use the minimum number of MUXs (4%) b) Create a functional block diagram and then design a 4-input multiplexer with a non tri-state enable For this design, use only 2-input multiplexers with non tri-state enables (All enables can have any activation-level) Only if necessary, you may use SSI parts to complete your design Use the minimum number of MUXs

Page 12/12 Exam 1 (4%) 10 c) Create a functional block diagram and then design a 4-input multiplexer with no enable For this design, use only 2-input multiplexers with tri-state enables (All enables can have any activation-level) Only if necessary, you may use SSI parts to complete your design Use the minimum number of MUXs (4%) d) Create a functional block diagram and then design a 4-input multiplexer with a tristate enable For this design, use only 2-input multiplexers with tri-state enables (All enables can have any activation-level) Only if necessary, you may use SSI parts to complete your design Use the minimum number of MUXs