Look-Up Table ROM values for a Distributed Arithmetic (DA) scheme to implement the following expression is provided in Appendix 1: I=2xxo +4xx1 +2xx2+4xx3 Undertake a check calculation with the following values of x (in8-bit 2's complement) and comment on the calculated result. Data XO X1 X2 X3 decimal -10 -20 30 40

You are using a signed 8-bit ALU to do the following arithmetic operations. Assume two numbers in binary are, a = (0110 1111)2 and b = (0110 0100)2.                                                                                                                                             6+4+5=15   (i) C = a + b (ii) D = a - b

20. Suppose we have just found yet another representation for floating point numbers. Using this representation, a li2-bit floating point number has 1 bit for the sign of the number, 4 bits for the exponent and 7 bits for the mantissa, which is normalized as in the Simple Model so that the first digit to the right of the radix points must be a 1. Numbers in the exponent are in signed 2's complement representation. No bias is used and there are no implied bits. Show the representation for the smallest positive number this machine can represent using the following format (simply fill in the squares provided). What decimal number does this equate to? : SIGN EXPONENT MANTISSA

a) 13–9 b) –13 –13 Perform the above decimal arithmetic problems by first converting the numbers to binary, 2’s complement form (using a 7 bit word in every case). Then perform the 2’s compliment addition. Show the result in binary indicating as in the problem above whether each result is positive or negative or overflowed (by writing “positive”, “negative” or “overflow” next to the binary answer) and then follow with the decimal value of the result if there was no overflow.