{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Computer Science 150 - Fall 2001 - Subramanian - Midterm 3

# Computer Science 150 - Fall 2001 - Subramanian - Midterm 3...

This preview shows pages 1–3. Sign up to view the full content.

CS 150, Midterm #3, Fall 2001 CS 150, Fall 2001 Midterm #3 Dr. Vivek Subramanian Problem 1 Recalculate the various propogation delays in a 4-bit carry lookahead adder and a ripple adder assuming that XOR gates have twice the delay of all other gates. Problem 2 The easiest wat to perform arithmetic operations using the sign-and-magnitude system is to convert to 2's complement for your calculations. You are given the following components: - A 4-bit universal shift register file:///C|/Documents%20and%20Settings/Jason%20Raftery/My%20Documents/U...cience%20150%20-%20Fall%202001%20-%20Subramanian%20-%20Midterm%203.htm (1 of 7)1/27/2007 5:35:49 PM

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS 150, Midterm #3, Fall 2001 - As many 1-bit full adders as you need - As many 2-input XOR gates as you need - AS many 2-input NAND gates as you need a) Design a circuit to convert a 4-bit sign-and-magnitude number of 2's complement number. b) Design a circuit to convert a 4-bit 2's complement to a sign-and-magnitude number.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

Computer Science 150 - Fall 2001 - Subramanian - Midterm 3...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online