midterm - The first 10 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 10 Questions are very short answer questions: 1. (3pts) How far apart must valid code words be to allow Single Error Detection (SED)? Single Error Correction (SEC)? Double Error Detection Triple Error Correction (DECTED)? 2. (3pts) What is the difference between the Mealy and Moore models of sequential design? 3. (2pts) Write next to each of the following equations if they are SOP or POS. ABC +ABC (A +B+C )(A+B+C) ¡¡ ¡¡ ¡ ¢¡ ¡ ¡¡ ¡ 4. (3pts) Write down an example of a 4-bit 1-hot code. Which common combinational circuit produces this kind of code? 5. (2pts) What is the Hamming distance between these two bit pattens: 0111 and 1000? 6. (2pts) Why are circuits designed using bipolar technology hotter than circuits using CMOS? -1- 7. (5pts) List a functionally complete set of gates. Show how to make this set using only NAND gates. 8. (3pts) Draw the logic that comprises an SR latch. 9. (2pts) What is the difference between a latch and a Flip-Flop? 10. (5pts) Write the equation for the carry into the 8th adder cell in an ALU using carrylookahead, in terms of P’s and G’s. -2- 11. (10 pts) Design a single-bit full adder using 2 4-input Muxes. (A 4-input Mux has 4 data inputs and 2 control lines). 12. (10 pts) Assume you have 8-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. 101001000110 011011001110 001010001110 Data Word: 10101001 Data Word: Data Word: -3- ¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡ ¢¢ ¢¢ ¢¢ ¢¢ ¢¢ ¢¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡ ¢ ¢ ¢ ¢ ¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¢ ¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡¡¡¡¡¡¢ ¡¡¡¡¡¡¡¡ ¢ 13. (50 pts) Implement the following sequential machine using a Toggle FF for Y1, a JK FF for Y2, and an RS 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. Present State 000 001 010 011 100 101 110 Next State X=0 X=1 000 010 100 110 001 011 101 001 011 101 100 010 010 110 Output X=0 X=1 0 0 0 0 1 0 0 0 1 0 1 0 1 1 -4- -5- ...
View Full Document

This note was uploaded on 05/06/2008 for the course ECS 154a taught by Professor Singh during the Winter '05 term at UC Davis.

Ask a homework question - tutors are online