### Question details

Convert -511 into a 32-bit two’s complement binary number.
\$ 20.00

1. Convert -511 into a 32-bit two’s complement binary number.

2. Given the bit pattern A=1000 0000 1100 1010 0100 0000 0000 0000

3. Given x = 0000 0000 0000 0000 0000 0000 0010 0101(two) and
y = 0000 0000 0000 0000 0000 0000 1111 0110(two)   in two’s complement binary representation, show all of your work for the following:

a. x × y using standard shift and add method.

b. Using Booth’s algorithm. Which method is more efficient in this case?

4.  What is the IEEE-754 single-precision binary representation of the floating point number 63.25?

5. Given x = 0011 1111 1011 1100 0000 0000 0000 0000(two) and
y = 0011 1001 1111 1000 0000 0000 0000 0000(two)   in single precision IEEE 754-floating point numbers, perform the following operations.  Show all of your work and express the final answer in single precision IEEE 754-floating point representation.

a. x + y

b. x × y

### Fornicola

Available solutions
• Convert -511 into a 32-bit two’s complement binary number.
\$20.00

Step 1: Begin with the decimal fraction and multiply by 2. The whole n

Submitted on: 01 Oct, 2015 04:54:28 This tutorial has not been purchased yet .
Attachment: binary logic.docx