This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 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 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....
View Full Document
This note was uploaded on 05/17/2009 for the course CS 150 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.
- Spring '08
- Computer Science