CSE 378 Spring 2007

CSE Home

About Us

Search

Contact Info

Homework #3 - MIPS Assembly Language Practice Assigned: 4/9/2007 Due:4/17/2007 at 5pm Write either quick, merge, or radix sort (you choose) in MIPS assembly. Test in SPIM as you did in homework 2. A template can be found here. FINAL HOMEWORK MUST USE SPIM TEMPLATE PROVIDED ABOVE - points will be lost if template is not used. Work individually Follow MIPS calling conventions Your implementation must be recursive, even if this is not the most efficient way to do it. For teaching purposes we ask you write a recursive implementation. Algorithms for sorting can be found on Wikipedia quick sort merge sort radix sort Turnin Once you have completed the assignment, submit it for grading via turnin. Call the file sort.s and place it in a location accessible via UNIX, and log into attu via SSH. Change your directory so that you are in the same directory as the file you wish to submit. Once there, run "turnin -c cse378 -p hw3 sort.s" to submit the file for grading. You do not need to zip the files up or compress them in any other way, as this will be handled by turnin. A few notes about turnin: You may submit your assignment as many times as you wish until the due date. Only the latest version of what you have turned in will be kept and graded. If you are using a late day, run "turnin -c cse378 -p hw3_late sort.s" to turn in your assignment. The late turnin will be available for 24 hours starting at the end of the regular turnin.

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Shen]