Lab Hanoi Tower

The pseudocode for Hanoi Tower is as follows:

solve(N, Src, Aux, Dst)

if N is 0 return

solve(N-1, Src, Dst, Aux)

Move N from Src to Dst

solve(N-1, Aux, Src, Dst)

Write the Java program based on the pseudocode in the above.

Lab Factorial

Write a Java program that computes N!where N is a positive integer.

Hint:public static long factorial(int n)

Lab Recursive Method

Write a recursive method to compute Fibonacci series.

Hint:

1.fib(n)=fib(n-1)+fib(n-2)

2.public static long fib(int n)

Lab Java Constructor

Use Display 4.14 to call 4.13 (2nd ed.) orDisplay 4.12 to call 4.11 (1st ed.).

After you finish the above, try the following

Date birthday = new Date("Jan",1,2000);

birthday.Date("Feb",1,2000);

birthday.setDate("Feb",1,2000);

birthday=new Date("Mar",1,2000);

(method定義)

(主程式)

(結果)

Lab Static Method

Define a Complex class with a static method for computing complex addition. Use (2+3i)+(4+5i) in your test.