1. In this problem, we present an algorithm that can be used to determine the base...

   

Transcribed Image Text:

1. In this problem, we present an algorithm that can be used to determine the base two (binary) representation of a nonnegative integer n. The output is a sequence of binary digits ro, 1,..., rk such that k = n (TkTk−1 · · · T10)2 = Σr;2² = i=0 In this code, r, is stored in r(i), the i-th entry of the array r. Algorithm base2(n) Let q = n Let i = 0 While (i = 0 OR q 0) r(i) = q mod 2 q = q div 2 i = i + 1 End While return r (a) Use this code to determine the binary representation for n = 678. (b) What decimal number corresponds to (1111011)2? How would you modify this code to determine the base b representation of n for a specified positive integer b? 1. In this problem, we present an algorithm that can be used to determine the base two (binary) representation of a nonnegative integer n. The output is a sequence of binary digits ro, 1,..., rk such that k = n (TkTk−1 · · · T10)2 = Σr;2² = i=0 In this code, r, is stored in r(i), the i-th entry of the array r. Algorithm base2(n) Let q = n Let i = 0 While (i = 0 OR q 0) r(i) = q mod 2 q = q div 2 i = i + 1 End While return r (a) Use this code to determine the binary representation for n = 678. (b) What decimal number corresponds to (1111011)2? How would you modify this code to determine the base b representation of n for a specified positive integer b?

Answer rating: 100% (QA)

Using the provided algorithm to determine the binary representation for n 678 Algorithm base2n Let q ... View the full answer