CS641 HW3

1. Exercise 2.14.1 and 2.14.2, using form a. for the destination register.
Note that "extract and set" here means using the source register bits
in Field to set the bits in the destination Field without changing
the bits in the rest of the destination register.  Do this in
C or Java and MIPS.  In C or Java, also do it for general i and j 
values (assume i>j and i < 32).

2. Exercise 2.10.4 and 2.10.5.

3. Exercise 2.18.4 and 2.18.5 for loop a.

4. Exercise 2.25.1-4

5. Exercise 3.10.1-5

6. Sorting floating point numbers.  Show the bit patterns for the
following single precision (for simplicity) numbers:
--x1, the most negative number possible (so -x1 is largest)
--x2, the least negative number possible (so -x2 is smallest > 0)
--x3, zero
--x4, the smallest positive number possible
--x5, the largest positive number possible

Argue that these are in proper binary order, so that bgt would
always branch if comparing neighbors (x1 vs x2, etc.)

Show the bit patterns for +infinity, -infinity and NaN (see pg. 246),
and determine how they binary-compare to x1 and x5.