

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Instructions and code snippets for completing mips homework assignments related to computing fibonacci numbers and factorials. Problem statements, hints, and example code for writing mips programs using stack memory and procedure calls. The estimated time to finish each problem is also provided.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Estimated time to finish: Prob. 1 : 120 Minutes. Prob. 2 : 20 Minutes. Prob. 3 : 50 Minutes. Total : 190 Minutes. Problem 1: Write MIPS program to compute Fibonacchi number : (120 Mins) Fibonachi number: 0,1,1,2,3,5,8,13,….. F(n) = 0 when n = 0; F(n) = 1 when n = 1; Otherwise F(n)= F(n-1) + F(n-2).. # hint: stack memory and procedure call and return. # FIBO: … … j $ra nop. Problem2 : Write drive program and check the result.(20Mins) .data textdata: .asciiz “Fibonacci number is =\n” **_# output format and output when n = 4.
.text .globl __start # or main.. __start: Problem 3: Write MIPS program to compute Factorial. (50 Mins) Factorial: 1,1,2,6,24,120,….. F(n) = 1 when n = 0; Otherwise F(n)= n* F(n-1).
# hint: stack memory and procedure call and return. .