CS 110 Arch/OS
Grading - Fibonacci Grading
What this project attempts to do is:
Any ideas that you have will be accepted...
to trace execution of a recursive and nonrecursive solutions
get students to program in assembly,
learn how to use gdb
trace sliding windows in the SPARC
15 points total.
Would like to see annotations where things happen, e.g., calls
and returns. They should know that the Frame Pointer is the
old Stack Pointer.
They should recognize the change in windows, i.e., a new register set,
maybe changes in wim/cwp.
They should use out registers and in registers to pass parameters
and return results.
A global register is fine for the count of the total number of calls.
They should allocate appropriate space on the Stack for each call.
Looking for reasonable implementations and reasonable comments.
What are you to do?
Read the projects given to you and grade them using 15 points as total.
There is no specific answers, just a reasonable implementation and
Last modified Nov 2, 2001 by email@example.com