1. Arithmetic
   • Adding two input values in MIPS32
   • C program that adds a range of ints
   • MIPS32 program that adds a range of ints
   • C program that uses recursion to add the ints 1, 2, ..., n.
   • MIPS program that uses recursion to add the ints 1, 2, ..., n.
2. Branching
   • C program that prints whether an input value is negative
   • MIPS program that prints whether an input value is negative
   • MIPS program that reads in two ints x and y and prints their difference. If y is negative, it prints x-y. Other wise it prints y-x.
3. Looping
   • C program that finds the sum of the first n positive integers
   • MIPS program that finds the sum of the first n positive integers
   • MIPS program that finds the sum of the first n positive integers. This version replaces the bgt with core instructions.
   • C program that finds the sum of the elements in a user input list of nonnegative integers. Input is terminated by a negative value.
   • MIPS program that finds the sum of the elements in a user input list of nonnegative integers. Input is terminated by a negative value.
4. I/O
   • A very simple C program that uses functions to read in an int and then print out the int.
   • A MIPS program that uses functions to read in an int and then print it out.
   • A MIPS program that uses functions to read in a list of ints and then print it out.
5. Fibonacci Numbers
   • C program that uses iteration to find the nth Fibonacci number
   • MIPS program that uses iteration to find the nth Fibonacci number
   • C program that uses recursion to find the nth Fibonacci number
   • MIPS program that uses recursion to find the nth Fibonacci number
6. Sorting
   • C implementation of selection sort
   • MIPS implementation of selection sort
   • C implementation of selection sort. This version allocates storage for the list on the heap.
   • MIPS implementation of selection sort This version allocates storage for the list on the heap.
   • MIPS implementation of selection sort This version "dynamically" allocates storage for the list on the stack.
   • C implementation of count sort
   • MIPS implementation of count sort
7. Binary representation
   • A C program that finds the number of ones in the binary representation of an input value.
   • A MIPS program that finds the number of ones in the binary representation of an input value.
8. Parallelism
   • A C program that attempts to implement a spinlock. This has a serious bug.
   • x86 functions that implement a spinlock. These can be used in the preceding C program to correctly implement a spinlock.
   • MIPS program with two different implementations of a lock function
9. Arithmetic Algorithms
   • Decimal addition
   • Binary addition
   • Decimal subtraction
   • Binary subtraction
   • Decimal multiplication
   • Binary multiplication
   • Binary multiplication Binary numbers are stored as computer words
10. MIPS multiply
    • Signed multiplication . The high order 32 bits are stored in hi. The low order 32 bits are stored in lo.
    • Unsigned multiplication with overflow. Use registers hi and lo.
    • Multiplication with no overflow

Class Home Page