2. Consider multiplying two unsigned integers in base 10: 312 201 312 4 62712 a.
ID: 3591195 • Letter: 2
Question
2. Consider multiplying two unsigned integers in base 10: 312 201 312 4 62712 a. Using the same multiplication algorithm with m-5 bits, provide two examples of multiplying unsigned binary numbers (note your answer will require more than b. What is the minimum number of bits required to store the product of two c. In general, what is the minimum number of bits required to store the product of d. Using the same algorithm, provide two examples of multiplying two signed two's e. Discuss any potential problems associated with your examples in part (d). In m=5 bits) unsigned 5-bit numbers? two unsigned m-bit numbers? complement binary integers addition, discuss a possible remedy that might fix those issues.Explanation / Answer
a) Example 1:
10101
11111
----------------
10101
10101
10101
10101
10101
-----------------------
1010001011
Example : 2
10111
11111
----------------
10111
10111
10111
10111
10111
-----------------------
1011001001
b)
If any one of the number is zero the product is zero and we need only one bit. So miminum number of bit required is 1.
The maximum number of bit required to store the product of multiplicat of two 5 bits number and n bits number is 10 bits.
c)
In general If any one of the number is zero the product is zero and we need only one bit. So miminum number of bit required is 1. The maximum number of bit required to store the product of multiplicat of m bits number and n bits number is m+n bits.
Your comment is most welcome.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.