ex1_no_sol_s11 - EEL3701 – Dr. Gugel Spring 2009 Exam #1...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: EEL3701 – Dr. Gugel Spring 2009 Exam #1 • • NAME____________________________________ UF ID#____________________________________ Open book and open notes, 90-minute examination. No electronic devices are permitted. All work and solutions are to be written on the exam where appropriate. Page 1) 7 points _________________ Page 2) 16 points _________________ Page 3) 20 points _________________ Page 4) 17 points _________________ Page 5) 20 points _________________ Page 6) 20 points _________________ TOTAL _________________ of 100 Re-grade Requests – Must be handed in the day exams are returned to students: _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ _______________________________________________________________________________________ 1. Perform the following binary additions and subtractions by hand. Show all your work below. Assume the numbers are all unsigned binary. (2,2,3 pt.) 10101010 10111011 + 10001111 Page 1 10101001 - 10010010 1010.101 x 0100.010 Page Score = 2. Given the following logic truth table, simplify with the K-Map below into Minimum Sum of Products (MSOP) and Minimum Product of Sums (MPOS). (8 pt.) ABCD 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 Y 1 1 0 0 1 1 X 1 0 X 0 1 X X 1 1 AB CD Y (MSOP) = __________________________ Y (MPOS) = ______________________________ 3. Simplify the equation below with De Morgan’s Rule and Boolean Identities to find a MSOP. (8 pt.) Y = (A + C) (A * B) (A * B * C) Y = ___________________________________________ MSOP Page 2 Page Score = 4. Directly synthesize a circuit for the following equation using only 2 Input NOR gates. (10 pt.) Y = ( W+X ) ( W + Z ) ; Y.H, W.L, X.L, Z.H Do Not Simplify the Equation! 5. Given the 4 bit magnitude comparator below. Find the logic equation for Z.H. (10 pt.) Z.H A>B iA>B A=B 4 bit Mag Comparator iA=B A<B iA<B A3 A2 A1 A0 B3 B2 B1 B0 GND C.H D.L W.L X.H Y.L GND E.L F.L Z.H = __________________________________________________ Page 3 Page Score = 6. Find the logic equation for A.H, B.L and Y.L. SIMPLIFY IF NECESSARY. (4, 5, 2 pt.) GND +5V GND IA3 A.H IA2 OUTA IA1 IA0 Dual 4:1 MUX IB3 B.L IB2 OUTB IB1 IB0 EN S1 S0 E.H C.L D.H A.H = ___________________________ +5V 1K OC Y.L OC EN S1 S0 OUTA OUTB 0 X X 0 0 1 0 0 IA0 IB0 1 0 1 IA1 IB1 1 1 0 IA2 IB2 1 1 1 IA3 IB3 B.L = __________________________ Y.L = ____________________________________________________________________ 7. In the circuit for #6, if we remove the pull-up resistor, what is the new equation for Y.L? (3 Pt.) Y.L = ____________________________________________________________________ 8. In the circuit for #6, if you swap the pull-up resistor with a pull-down, what is the new Y.L? (3 Pt.) Y.L = ____________________________________________________________________ Page 4 Page Score = 9. You are given as many Tri-state buffers with high true enables, Tri-state buffers with low true enables and pull-up, pull-down resistors as needed and no other gates. Build a 2:4 decoder with high true inputs and outputs. The best design will receive the most points. (10 pt.) 10. Derive the logic equation for the following circuit below. Show all intermediate terms as both high and low signals. DO NOT SIMPLIFY. (10 pt.) Y.H = _________________________________________________________________ Page 5 Page Score = 11. Design a circuit that multiplies a 3 bit signed number by -2. i.e. compute N x -2 where N is a 3 bit signed input. Show the block diagram for the device and show the circuits for the most significant bit and least significant bit. The best design receives highest points. Create a block diagram, logic truth table, simplify and then show the resultant circuits. (14 pt.) 12. For the Nest State Table below, draw the corresponding State Diagram. Assume the design is based on a simple counter consisting of (3) D Flip-Flops and a corresponding logic block. (6 pt.) Q2 Q1 Q0 D2 D1 D0 0 0 0 0 1 0 0 0 1 0 1 1 0 1 0 1 0 0 0 1 1 1 0 1 1 0 0 1 1 0 1 0 1 1 1 1 1 1 0 0 0 0 1 1 1 0 0 1 Page 6 Page Score = ...
View Full Document

This note was uploaded on 01/15/2012 for the course EEL 3701c taught by Professor Gugel during the Spring '05 term at University of Florida.

Ask a homework question - tutors are online