Home Work # 1, Due: August 29, 2007

Home Work # 2, Due: September 12, 2007

Home Work # 2 solution

Home Work # 3, Due: October 3, 2007

Home Work # 3 solution

Home Work # 4, Due: October 14, 2007

Home Work # 4 solution

Home Work # 5, Due: November 5, 2007

Home Work # 5 solution

Home Work # 6, Due: November 19, 2007

Some MIPS programs discussed in class:

Max and min of an array

Factorial – iterative version

Factorial – with double precision output

Factorial – recursive version

countbits – recursive version, solution to a problem in the mid-term # 1

computing C(n,m) recursively using C(n,m) = C(n-1,m) + C(n-1,m-1)

solution to Towers of Hanoi