Homework 22
CSSE 221 – Fundamentals of Software Development Honors
Fall 2008–2009

Recall the Due Dates and (from the syllabus) the Late (and early) Assignment Policy and guidelines for maintaining Academic Integrity.

Also recall that you can get help on any of these problems during the CSSE lab assistant hours, and you can use the Assignments Discussion Forum on Angel to discuss, clarify, or get help on these problems.

Things to do

1. Continue working on your Simulation project. Your team should have a UML class diagram and have begun implementing per your Iterative Enhancement Plan by now.
   • Reminder: Each team member must maintain and commit to the repository her coding statistics, as described in Coding statistics.
2. Complete your Sierpinski project.
   • Don't bang your head on the wall over the Sierpinski project!
   • If you aren't making clear progress after about 30 minutes, get help!
3. Do the written problems below.

Written problems

Write your answers to these questions. Turn your answers in via the appropriate Homework Drop Box on Angel.

1. The nth Fibonacci number, written fibonacci(n), is defined by:

   	fibonacci(0) = 0
   	fibonacci(1) = 1
   	fibonacci(n) = fibonacci(n-1) + fibonacci(n-2) for n > 1
   

   Write a TAIL-recursive function fibonacci(n) that returns the nth Fibonacci number.
   • You do NOT need to enter the code into Eclipse and test it.
   • No credit unless the function is tail recursive.
   • Don't bang your head on the wall over this exercise!
   • If you aren't making clear progress after about 20 minutes, bring your questions to class!