Other articles


  1. Problem Set 3

    Due 27 February by 10pm

    Your assignment is to code a recursive implementation of Quick Sort in MIPS assembly and run it on the simulator.

    You can find the tools for this assignment here.

    Here is an example of quick sort in C.

    #include <stdio.h>
    
    int data[] = { 
     46,78 …
  2. Problem Set 2

    Due 20 Feruary by 10pm

    Problem set 2 is available here.

    You will use my hacked up version of Prof. McMillan's MIPS simulator to modify the code we wrote in class. This is brand new code so expect and report the occasional bug.

  3. Programming MIPS

    Today we will back up a bit and write some MIPS code live in class. There is no better way to learn to program than actually doing it.

    Let's start with an implementation of insertion sort in C. Here is a typical implementation.

    #include <stdio.h>
    
    int data[] = { 42, 19 …
  4. Lecture 5 - Assembly and Simulator

    You can find the slides for today here.

    Copying the code from the slides loses for formatting so I'll put the code fragments here.

    Slide 9

         add   $t0,$zero,$zero     # sum = 0
         add   $t1,$zero,$zero     # for (i = 0; ...
    loop:
         addu  $t0,$t0,$t1   # sum = sum + i;
         addi  $t1,$t1 …
  5. Problem Set 1

    Problem set 1 is available here. This is brand new code so expect and report the occasional bug.

    The little text field should turn red if you have the format wrong and green when it thinks you have the answer correct.

  6. Welcome

    Welcome to the site for Comp 411 section 2 for spring 17.

social