midterm99 - The first 5 Questions are very short answer...

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: The first 5 Questions are very short answer questions: 1. (1pts) What is the Hamming distance between these two bit patterns: 0011 and 0100? 2. (3pts) How far apart must valid code words be to allow Single Error Detection (SED)? Double Error Correction (DEC)? Quadruple (4) Error Correction Quintuple (5) Error Detection (QECQED)? 3. (3pts) What is the difference between the Mealy and Moore models of sequential design? 4. (3pts) What is the difference between a Flip-flop and a Latch? 5. (3pts) Write the equation for the carry into the 5th adder cell in an ALU using carrylookahead, in terms of P's and G's. 6. (2pts) Write next to each of the following equations if they are SOP or POS. (X +Y+Z )(X+Y+Z) XYZ +XYZ 7. (3pts) Show how to make an OR, an AND, and a NOT gate using using only NAND gates. 8. (3pts) Show how to make an SR latch using only NAND gates. 9. (10 pts) Assume you have 12-bit data words, and your memory system supports Single Error Correction. For each of the following patterns recieved from memory identify and correct any errors that may have occurred during transmission or storage. Assume the same organization of carry and data bits as we used in class. The first one is done for you. Given: 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 Given: 1 1 0 1 1 0 1 1 1 0 0 1 1 0 0 1 0 The Data Word is: 010101101011 The Data Word is: 10. (9 pts) You have derived the following karnaugh maps for the inputs to a JK flip-flop. Unfortunately, the parts department just called and your company is completely out of JK flip-flops. All they have left in stock is Toggle flip-flops, which you will have to use instead. Show the resulting karnaugh map for the modified version of the circuit (the one that uses the Toggle instead of the JK flip-flop.) J 1 1 Y2 d d d d d d d d X 1 1 Y3 K d d Y2 d d 1 1 1 1 1 1 X d d d d Y3 Y1 Y1 11. (20pts) Given the following state transition table, draw the Karnaugh maps for Y1', Y2', and Y3', and Z in terms of X, Y1, Y2 and Y3, and then write minimum boolean equations for each. Use Don't Care variables if they are available. Y1 0 0 0 1 1 1 1 Present State Y2 0 0 1 0 0 1 1 Y3 0 1 1 0 1 0 1 Y1' 1 1 1 0 1 0 1 X=0 Y2' 0 0 0 0 0 0 0 Y3' Next State 0 1 0 1 1 1 1 Y1' 1 1 1 0 0 0 1 X=1 Y2' 0 1 1 0 1 0 1 Y3' 1 1 0 0 1 0 0 X=0 0 0 0 1 0 1 0 Output (Z) X=1 1 0 0 1 1 1 0 12. (20 pts) Given the following Karnaugh maps, implement the sequential machine using a JK FF for Y1, a Toggle FF for Y2, and an SR FF for Y3. You do not need to draw the gates, but you do need to write down the input equations for each of the inputs of each of the Flip Flops in the circuit. Y1' 1 1 Y2 1 1 1 1 X 1 1 Y3 Y2' 1 1 d Y2 1 1 Y1 1 1 1 X 1 Y3 1 Y3' 1 1 1 Y2 1 1 1 1 Y1 X Y3 1 Y1 13. (20 pts) You have been hired by the country of Freedonia to design a toll both for their national highway. In Freedonia there are only two types of coins, the 50 Somolian piece and the 30 Somolian piece. The toll booth requires an input of at least 115 Somolians before the toll gate is raised, and gives no change. Only one coin can be deposited at a time. Let X1=50 Somolians and X2=30 Somolains. Z=1 indicates the Gate should be raised, Z=0 signals No Go Joe. (Everyone in Freedonia is named "Joe".) Draw the State Transistion Diagram (the circles and the arcs) for this finite state machine. Let S0=nothing deposited (the Start state). Once you have a state transition diagram, assign bit patterns to each state and write down the corresponding state transition table. Assume you are using a Mealy model. Also, label the transitions on the diagram using the following format: X1 X2 Z So, for example, 01 0 would be used to indicate that a 30 Somolian piece was deposited, and the output at that point should be a 0. ...
View Full Document

Ask a homework question - tutors are online