For a Computer Engineering Microcontrollers Class: Remember the Fibonacci Sequen

Question

For a Computer Engineering Microcontrollers Class:

Remember the Fibonacci Sequence Example that we worked on the Sample Exam and re-write it in the C language. Store the list of the first 14 Fibonacci numbers (up to value of 233) in the ROM and assume the 4 switches are connected to the upper 4 pins of P1 (P1.4-P1.7).

Sample Exam Example:

The Fibonacci Sequence is a widely used sequence in scientific applications. It's first two numbers are 0 and 1, and any other number in the sequence can be calculated as a sum of the two previous numbers. The sequence for the first 5 numbers is given as 0, 1, 1, 2, 3. Your task is to write an Assembly program to generate a Fibonacci sequence by dividing it into the seperate modules listed below.

a) Assume there are 4 switches connected to P1 for a user to be able to enter any combination desired up to 1310 (14 possibilities). Write code to take the user input and store it in R7. Assume that if the input is larger than 13, it will be stored as 13.

b) Calculate the values of the first 14 Fibonacci numbers and write code to store them in a look up table in the ROM starting at location 300H.

c) Write a code that reads the input value stored in R7 and fetches the list of Fibonacci numbers based on the input value, (i.g. if R7=5, the first five Fibonacci numbers will be fetched.) Once a value is fetched from the ROM look-up table, it needs to be displayed on P2. Insert a delay after displaying each number (assume a DELAY subroutine is available for your use).

Explanation / Answer

import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo import java.util.Scanner;
class Fib come back (1);
       else if(n==2)
   come (1);
       else
   come (fib(n-1)+fib(n-2));
   }
}
class RecFibDemo

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.