CSC 3501 Chapter : Mips Assignment
Document Summary
Assignment 1 (due feb. 22th by the end of the day) Please put the code for each problem in a separate file. Please use the function name given below as the labels for your procedures. We will test your implementation by calling procedures using these labels. You should implement the functions in mips assembly. To compile and run the assembly programs you write, you need to download the mars mips simulator from: http://courses. missouristate. edu/kenvollmar/mars/download. htm (java 1. 4. 2 or later is required for the simulator. ) Submission: email your programs (source code) as an attachment directly to ta: In this problem, there are three pegs, two empty and one with a set of n disks of increasing size. The task is to move all the disks from their initial position to another peg without placing a larger disk on top of a smaller one. The number of steps it takes to do so can be computed using the following recursive function:
