Programming Project

CDA 3203
Extra Credit Project
The Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,… has its Nth term defined as the
sum of the previous two terms. Start with the first two terms: F0 = 0 , F1 = 1 . Then the
Nth term is FN = FN −2 + FN −1 , so that F2 = F0 + F1 = 1 , F3 = F1 + F2 = 2 , F4 = F2 + F3 = 3 ,
and so on. In this project you are to write an assembly language program that will
generate the Nth term of the Fibonacci sequence.
Assume that the user has stored the desired term number N in RAM[0]. Your program
should generate the Nth Fibonacci number and store it in RAM[1]; it should also be
returned at the top of the stack. Write an assembly language program to accomplish this.
Make a sketch of RAM showing where N, FN , and any other variables are stored. Draw
a flow chart of your logic steps used to solve the problem. Write the pseudo VM code
used in your program. Write the assembly language commands implementing your
solution. Be sure to account for the cases N = 0 and N = 1.
Due by the end of the day Thursday, April 20.