Assignment 1: Computer Arithmetic, Fall 2013

Due: 5pm, Thursday, Oct 3, 2013 (Electronic submission via Clew is required) 1. (10 marks) How many digits in the decimal representation are required for an unsigned binary integer with up to n-bit? 2. (10 marks) Convert two decimal numbers (59.3125)10 and (59.3125)10 into binary sign-magnitude representations for k = 7 and m = 4, where k and m indicate the number of integer and fraction digits in the representation, respectively. 3. (15 marks) (Continued from Problem 2) Find radix complement and diminishedradix complement representations for the two numbers for (i). r = 2, k = 7, m = 4. (ii) r = 8, k = 3, m = 2. 4. (15 marks) Let A = 11011, B = 10111, and C = 10101 be three 2s complement numbers in 5 bits. Perform 2s complement operations A + C and B + C to obtain the results. Verify to check whether or not there is an overow. Provide a method led to correct result if there is an overow. 5. (15 marks) (Continued from Problem 2) Find the representations for the two numbers with the negative decimal system. 6. (15 marks) (Continued from Problem 2) Find the representations for the two numbers with the negative binary system. 7. (10 marks) (Continued from Problem 2) Find the representations for the two numbers with the binary signed-digit number system with k = 7, m = 4. At least one positive integer digit, one positive fraction digit, one negative integer digit, and one negative fraction digit must appear in the representation. 8. (10 marks) Given signed-digit number system with r = 2, k = 5, m = 0, and digit set (1, 0, 1). How many different values can it represent? How many different representations does it have? What is the redundancy of the system? Find all the representations for the decimal value 9 with this number system.