4. a. Use the bit shifting technique to divide the following positive (not twos

ID: 669778 • Letter: 4

Question

4. a. Use the bit shifting technique to divide the following positive (not twos complement) binary number by 8.

10110

b. Explain how you found the answer.

c. What is the base 10 value of the original number?

d. What is the base 10 value of the quotient?

5. Consider a 13 bit floating point number representation with the following fields:

1 bit sign

4 bit exponent (excess 8)

8 bit fraction

Convert the following floating point number using the given representation into its base 10 equivalent. Show your work.

c. Do a binary addition of the two numbers in a. and b. above. Show your work.

d. Take the resulting sum from c. and place it back into the floating point format. Is there a problem with the result? Explain.

e. Convert the following base 10 number into the floating point representation (normalized) described above. Show your work.

-9.75

f. Show the computer representation of the largest number that can be represented using this format.

g. What is the base 10 equivalent for your answer to f. Show your work.

dividing a number by 8 means right shift by 3

10110 will become 10.11

base 10 of original no. is 22

base 10 of quotient is 8

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.