Paper , Order, or Assignment Requirements

Exercice#1 : Implement and test the problem of Tours of Hanoi with a recursive method. Test it with 5 disks and 3 pegs. How could you generalize it if you have 4 pegs instead of 3?

Exercise#2: Implement and rum the linear recursive method to calculate Fibonacci (5). Implement a similar solution to calculate F(n)=F(n-1)+F(n-2)+F(n-3) and F(0)=F(1)=F(2)=1.

HW#3 : List Abstraction, Chapter 7.

Page 273. R. 7.2, R.7.4; R.7.5; R7.8; R.7.10; R.7.11;

Page 274. R.7.12 ;

R-7.17) Hint Remember to use the equals method to test equality.

R-7.18) Hint For good measure, set all references to null.

Page 275 C-7-23

Page 275 C-7-25