Question

CENG 4313 MidTerm Exam Fall 2015 Q3. (25 points) Write an ARM assembly language subroutine (named: nfibo) to calculate and return the n-th Fibonacci number. Fibonacci numbers (or a Fibonacci sequence) are a series of numbers with a property that the next number in the series is a sum of previous two numbers. Starting the series from 0, 1 as the first two numbers we have 0, 1, (0+1)=1, (1+1)=2, (1+2)=3, (2+3)=5, (3+5)=8, (5+8)=13, (8+13)=21, (13+21)=34,..... The subroutine, nfibo, accepts n as an input in R0 and returns the corresponding Fibonacci number at the n-th position in R0. Don't try to use an array to map as Fibonacci is an infinite series. This programming can be done with loops, or a recursive subroutine. Recursive subroutine is shorter and easier to write then loops, but both are doable, you can choose either method. As always the subroutine should preserve all the registers except the return/output register. F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 ... 0 1 1 2 3 5 8 13 21 34 55 89 ... For example if n=3, return value would be 2 if n=6, return value would be 8

          CENG 4313
MidTerm Exam
Fall 2015
Q3. (25 points)
Write an ARM assembly language subroutine (named: nfibo) to calculate and return the n-th
Fibonacci number.
Fibonacci numbers (or a Fibonacci sequence) are a series of numbers with a property that the
next number in the series is a sum of previous two numbers. Starting the series from 0, 1 as the
first two numbers we have
0, 1, (0+1)=1, (1+1)=2, (1+2)=3, (2+3)=5, (3+5)=8, (5+8)=13, (8+13)=21, (13+21)=34,.....
The subroutine, nfibo, accepts n as an input in R0 and returns the corresponding Fibonacci
number at the n-th position in R0. Don't try to use an array to map as Fibonacci is an infinite
series. This programming can be done with loops, or a recursive subroutine. Recursive
subroutine is shorter and easier to write then loops, but both are doable, you can choose either
method.
As always the subroutine should preserve all the registers except the return/output register.
F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 ...
0 1 1 2 3 5 8 13 21 34 55 89 ...
For example
if n=3, return value would be 2
if n=6, return value would be 8

CENG 4313
MidTerm Exam
Fall 2015
Q3. (25 points)
Write an ARM assembly language subroutine (named: nfibo) to calculate and return the n-th
Fibonacci number.
Fibonacci numbers (or a Fibonacci sequence) are a series of numbers with a property that the
next number in the series is a sum of previous two numbers. Starting the series from 0, 1 as the
first two numbers we have
0, 1, (0+1)=1, (1+1)=2, (1+2)=3, (2+3)=5, (3+5)=8, (5+8)=13, (8+13)=21, (13+21)=34,.....
The subroutine, nfibo, accepts n as an input in R0 and returns the corresponding Fibonacci
number at the n-th position in R0. Don't try to use an array to map as Fibonacci is an infinite
series. This programming can be done with loops, or a recursive subroutine. Recursive
subroutine is shorter and easier to write then loops, but both are doable, you can choose either
method.
As always the subroutine should preserve all the registers except the return/output register.
F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 ...
0 1 1 2 3 5 8 13 21 34 55 89 ...
For example
if n=3, return value would be 2
if n=6, return value would be 8

Added by Paul G.

Question

Please give Ace some feedback