For below 8 bits (abcd efgh) the Horner's scheme is
= ((((((((-a*2 + b)2 + c)2 + d)2 + e)2 + f)2 + g)2 + h
Substituting 1001 1101 in abcd efgh
= ((((((((-1*2 + 0)2 + 0)2 + 1)2 + 1)2 + 1)2 + 0)2 + 1
((((((-2)2 + 0)2 + 1)2 + 1)2 + 1)2 + 0)2 + 1
(((((-4)2 + 1)2 + 1)2 + 1)2 + 0)2 + 1
((((-8 + 1)2 + 1)2 + 1)2 + 0)2 + 1
((((-7)2 + 1)2 + 1)2 + 0)2 + 1
(((-14 + 1)2 + 1)2 + 0)2 + 1
(((-13)2 + 1)2 + 0)2 + 1
((-26 + 1)2 + 0)2 + 1
((-25)2 + 0)2 + 1
(-50 + 0)2 + 1
(-50)2 + 1
-100 + 1
= -99
--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy
Learning!
Using Horner's scheme, represent (evaluate) the 2's complement number 10011101 in decimal. CAUTION: You will earn...
i need questions 2-6 done so i can see if my work is right 2 (3 points) Using Horner's scheme, represent (evaluate the binary unsigned whole number 10011101 in decimal CAUTION: You will earn NO CREDITS if you don't use Homer's scheme to more efficiently evaluate polynomial (In particular, you will get a 0 if you resort to evaluating the polynomial directly;"brute force") You will earn NO CREDITS if you simply show the final result and not clearly show working...
Perform the following, using 1's complement math. You must use the A-B = A+(-B) form of subtraction. All numbers are already in 1's complement form. Remember you may have to extend the sign of the numbers so that both top and bottom number have the same numbers of bits. Your answer will be represented in the same number of bits as the problem. EX. Problem (a) uses 5 bits. Therefore your answer will be represented in 5 bits. Don't forget...