Homework 2

CS 240

50 points, due Mar. 3, 1999

All problems are from the text. Solutions must be turned in in dead tree form. All other submissions will be sent to /dev/null.

1. 6 pts. 4.13. Your description should consist of the C code, using masks and shifts as need be, to compute A_upper_adjusted and A_lower from A.

2. 8 pts. 4.14.

3. 8 pts. 4.18. You will need to be careful in regard to the selection of signed ( add, slt, etc.) and unsigned ( addu, sltu, etc.) instructions.

4. 5 pts. 4.23. Your modification should consist of the addition of a few logic gates.

5. 6 pts. 4.42. I expect an informal proof. Just consider addition. There are cases which must be considered.

6. 17 pts. 4.47, 4.51.