This preview shows page 1. Sign up to view the full content.
Unformatted text preview: * D D 1. Use Boot's Algorithm to compute -3 * 6, where both the multiplicand and multiplier are 4 bit number and the product is a 8 bit number (10%) 2. Use the nonrestoring binary in teger division algorithm to perform 0000 1011 / 0011. (10%) 3. For a 4 bits carry look-ahead adder, define pi , the i th propagate term and gi the ith generate term. (4%). Let c0 be the carry in the least significant bit. Write down c4 in terms of c0, pi and gi (6%) 4. Show the IEEE 754 binary representation for the 20.510 in it...
View Full Document
This note was uploaded on 05/01/2010 for the course COMPUTER S 005 taught by Professor Huncheng during the Spring '08 term at Minneapolis College of Art and Design.
- Spring '08
- Computer Science