星期五, 6月 26, 2009
星期五, 6月 19, 2009
星期一, 6月 15, 2009
學期成績
配分比例如下
Participation (出席&小考) 50%, Lab 30%, Homework 20%
評分重點
出席: 缺席ㄧ次扣總分五分，三次以上得不及格
小考: 兩次分數加總平均(請假者個案處理)
平時分數最高30分，發問或答題者酌予加分，最高以加到20分為上限。
Lab: 完整性(是否完成所有上機)，準時性，原創性，工整性(程式內容條理是否清晰，說明是否清楚)，正確性
Homework: 完整性，準時性，原創性，工整性，正確性
有話要說(有話就說，無關記分)
ps: 文章意見區關閉，請直接留言在有話要說
星期日, 6月 14, 2009
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.
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)
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)
Hint:
1.
fib(n)=fib(n-1)+fib(n-2)
2.
public static long fib(int n)
星期五, 6月 12, 2009
星期日, 6月 07, 2009
Quiz 6.8.2009
1. Design a static method that can compute the addition of fractions. You must first define Fraction class then write a demo program to verify the class program.
2. Design a non-static method that can compute the addition of fractions. You must first define Fraction class then write a demo program to verify the class program.
3. 列舉至少三個Java記憶體管理的特性
4. 列舉至少三個Java程式的風格
5. Let i, j be two integers. Write a Java program to exchange their values. Please make sure you have good styles of making comments, naming variables, and indenting.
6. Write a complete Java program that uses a for loop to compute the sum of the odd numbers between 1 and 25.
7. 列舉至少三個 API (Application Programming Interface).
8. 列舉 ADT (Abstract Data Type) 的特性.
9. Write a Java program to calculate the cosine function as follows:
Cos(x)=1 - x 2 /2!+ x 4/4!- x 6/6!...
10. Write a Java program to calculate the sin function as follows:
sin(x)=x - x 3/3! + x5/5! - x7/7! ...
11. 請解釋 public static final PI = 3.141592654 中， public, static, final 的意義。
12. 為什麼 static method 不能呼叫 nonstatic method？詳細說明之。
13. 舉三個例子 Object
14. 舉三個例子 Method
2. Design a non-static method that can compute the addition of fractions. You must first define Fraction class then write a demo program to verify the class program.
3. 列舉至少三個Java記憶體管理的特性
4. 列舉至少三個Java程式的風格
5. Let i, j be two integers. Write a Java program to exchange their values. Please make sure you have good styles of making comments, naming variables, and indenting.
6. Write a complete Java program that uses a for loop to compute the sum of the odd numbers between 1 and 25.
7. 列舉至少三個 API (Application Programming Interface).
8. 列舉 ADT (Abstract Data Type) 的特性.
9. Write a Java program to calculate the cosine function as follows:
Cos(x)=1 - x 2 /2!+ x 4/4!- x 6/6!...
10. Write a Java program to calculate the sin function as follows:
sin(x)=x - x 3/3! + x5/5! - x7/7! ...
11. 請解釋 public static final PI = 3.141592654 中， public, static, final 的意義。
12. 為什麼 static method 不能呼叫 nonstatic method？詳細說明之。
13. 舉三個例子 Object
14. 舉三個例子 Method
星期五, 6月 05, 2009
星期一, 6月 01, 2009
Homework 6-1-2009 Modular Sorting
Write a sort method which takes a double array as parameter
and returns the sorted array. Call this method in a main program.
Hint: The lab is a rewriting of Lab Sorting
to make the sorting procedure a reusable method.
and returns the sorted array. Call this method in a main program.
Hint: The lab is a rewriting of Lab Sorting
to make the sorting procedure a reusable method.
訂閱：
文章 (Atom)