[作業]Computer Architecture #2

[LGiant (收藏記憶)]

Computer Architecture
Homework 2
(Due 3/21 5:00 pm)

(1)  Write a MIPS assembly program that reads an integer n (2 < = n < = 30)
     and computes numbers of the Fibonacci sequence upto and including the
     n'th Fibonacci number. The i'th Fibonacci number is defined as
     Fib(i) = Fib(i-1) + Fib(i-2) for i=2, 3, ... n. Assume Fib(0) = 0 and
     Fib(1) = 1.The program must use recursion and may not explicitly store
     Fib(i) in memory. It should only print the final value of Fib(n).

(2)  H&P 4.23

(3)  H&P 4.46

 Note:  Please email problem 1 to the TA ([e-mail]).
        Put "Computer Architecture HW #2" in the subject line of your email.
        Turn in the rest of the homework (problem 2 and 3) to office 211.

PS. 如果說上課來不及交的同學，可以直接拿給助教，或於5:00前放到我櫃子裡.
    我會一起拿過去的，謝謝！

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 140.112.3.42