Homework III

Tom Kelliher, CS 220

Due Oct. 5, 2011

Remember that the due date is a final due date -- late assignments will not be accepted, except for emergencies. Your solutions to these problems should be collated in the order listed below. Make sure that you show work, that you write your solutions in such a way that I will be able to understand how you arrived at them, and that your solutions are legible. Please leave enough whitespace on your solutions so that I can write comments.

  1. 2.14.4.a. It is possible to do this in four instructions. Assume that the X's represent $t1's original bit values for those bit positions. The X's in $t1 are not to be changed.

  2. 2.15.2.a. It is possible to do this in two instructions.

  3. 2.16.1.a.

  4. 2.16.6.a.

  5. 2.17.3.a. It is possible to do this in three pseudo-instructions. If you're really good, it's possible to do this in three instructions.

  6. 2.17.5.a.

  7. 2.18.2.[ab].

  8. 2.18.5.a.

  9. 2.18.6.a.

Ten problems; each problem is worth five points.


Thomas P. Kelliher 2011-09-27
Tom Kelliher