Lab Hanoi Tower

The pseudocode for Hanoi Tower is as follows:solve(N, Src, Aux, Dst)if N is 0 returnsolve(N-1, Src, Dst, Aux)Move N from Src to Dstsolve(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)

Homework 6-1-2009 Modular Sorting

Write a sort method which takes a double array as parameterand returns the sorted array. Call this method in a main program.Hint: The lab is a rewriting of Lab Sortingto make the sorting procedure a reusable method.

Lab Array

Study Display 6.1, and then write a program that can sort numbers in ascending order.

Lab Magic Parking Tower

A parking tower is out of order someday. If you park a Benz, you will end up with a Torben. Write a program to simulate this scenario. First create a class called CarParked which has a static method called outOfOrder. Name an object called yourCar, which happens to be a Benz. Your program should contain a class called CarParked and a test program called CarParkedDemo which test the method by CarParked.outOfOrder(yourCar).Hint: You may study Display 5.14 to get some ideas.

Lab Static Method

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

Lab Math methods

Compute the following mathematical functions.

Math.round(3.2)
Math.round(3.6)
Math.floor(3.2)
Math.floor(3.6)
Math.ceil(3.2)
Math.ceil(3.6)

Lab Finding the max of three numbers

Write a static method that computes the maximum of three float numbers.

Lab Finding the max of three numbers

Write a static method that computes the maximum of three float numbers.

Homework 5-4-2009

Do Project 7 of Chapter 4.

Lab Java Constructor

Write constructors in the lab Fraction Addition.

Lab Method Overloading

date1.setDate(1,2,2008);date2.setDate("February",2, 2008);date3.setDate(2008);

Homework 4-27-2009

Do project 2 of Chapter 4.

強烈要求同學一定要親自動手做，鼓勵同學將理論與實作密切配合。
相信只要同學真正的努力用功，縱使資質稍差，應該都可以學到Java程式設計之知識

Lab ADT

Define a Complex class and write an object oriented program to compute (2+3i)+(4+5i) in Java.The methods should include an access and a mutator.

Class definition 3

Do Display 4.7 (3rd, 2nd ed.) or 4.5 (1st ed.). Then use Display 4.8 to call 4.7.QuestionIn Display 4.7, if the method setDate has the parameter as setDate(int month, int day, int year), what kind of changes should be made in its body of codes?

Homework 4-13-2009 Fraction Multiplication

Write a program to implement a method that can multiply 2 fractions. You will implement a class called Fraction consisting of a numerator and a denominator. The multiplication of2 fractions should be equal to a fraction.Use 1/2 * 1/3 as the test.Hints:Fraction f1, f2;f1.multiply(f2);due date: 4/27/2009

lab Fraction equality test

Write a program to implement a method that can check whether 2 fractions are equal. You will implement a class called Fraction consisting of a numerator and a denominator. The equality test of 2 fractions should return a boolean value.Use the following as the tests.* 1/2, 2/4* 5/6, 6/7Hints:Fraction f1, f2;f1.equals(f2);

lab Fraction Addition

Write a program to implement a method that can do additions of 2 fractions. You will implement a class called Fraction consisting of a numerator and a denominator. The additions of2 fractions should be equal to a fraction.Use 1/2+1/3 as the test.Hints:Fraction f1, f2;f1.add(f2);

Homework 3-30-2009: counter

Define a class called Counter whose objects count things. An object of this class records a count that is a nonnegative integer. Include methods to set the counter to 0, to increase the count by 1, and to decrease the count by 1. Include an accessor method that returns the current count value and a method that outputs the count to the screen. Write a program to testcounter.reset();counter.inc();counter.inc();counter.dec();counter.output();