201. Given:

1. import java.util.*； 

2. class A{} 

3. class B extends A{}

 4. public class Test{ 

5. public static void main(Strang[] args){ 

6. List＜A＞ listA = new LinkedList＜A＞()； 

7. List＜B＞ listB = new LinkedList＜B＞()； 

8. List＜Obect＞ listO = new LinkedList＜Obect＞()； 

9. //insert code here 

10. } 

11. public static void m1(List＜? extends A＞ list){} 

12. public static void m2(List＜A＞ list){}

 Place a result onto each method call to indicate what would happen if the method call were inserted at line 9. Note: Results can be used more than once. 

二、台灣人甲女與乙男在美國依當地規定之方式締結依美國法有效之 婚姻,然而回台灣之後並未辦理結婚登記數年後,乙歸化為A 國人,並與A國人丙女於A國結婚,若A國之法律規定配偶有繼承權,且規定重婚無效。請問:乙死亡,台灣之法院應如何選定 準據法以判定甲、丙是否有對乙之繼承權?(50%)

簡答題:請說明史特佛賓（D. L. Stufflebeam）之「背景－投入－過程－產出」課 程評鑑模式（Context-Input-Process-Product Model）內容，並說明此評鑑模式的 優缺。

(1)這一題的難度值(P 值)與鑑別度值(D 值)各自 為何?

(2)這一題的試題品質如何?

202. Given: NumberNames nn = new NumberNames()； nn.put("one", 1)； System.out.println(nn.getNames())； Place the code into position to create a class that maps from Strings to integer values. The result of execution must be [one]. Some options may be used more than once. public class NumberNames{ private HashMap＜ Place here , Place here ＞ map = new HashMap＜ Place here , Place here Place here ； 

216. Given: 1. import java.util.*, 2. public class TestGenericConversion{ 3. public static void main(String[] args){ 4. List list = new LinkedList()； 5. list.add("one")； 6. list.add("two")； 7. System.out.print(((String)list.get(O)).length())； 8. } 9. } Refactor this class to use generics without changing the code's behavior.

217. Place the code into the GenericB class definition to make the class compile successfully. 

218. Place the code elements in position so that the Flags2 class will compile and make appropriate use of the wait/notify mechanism. Note You may reuse code elements. 

220. Which factor or factors (A) It is possible for more than two threads to deadlock at once. (B) The JVM implementation guarantees that multiple threads cannot enter into a deadlocked state. (C) Deadlocked threads release once their sleep() method's sleep duration has expired. (D) Deadlocking can occur only when the wait(), notify() and notifyAll() methods are used incorrectly. (E) It is possible for a single-threaded application to deadlock if synchronized blocks are used incorrectly. (F) If a piece of code is capable of deadlocking, you cannot eliminate the possibility of deadlocking by inserting invocations of Thread.yield().

225. Given: 10. Runnable r = new Runnable(){ 11. public void run(){ 12. try{ 13. Thread.sleep(1000)； 14. }catch(InterruptedException e){ 15. System.out.println("interrupted")； 16. } 17. System.out.println("ran")； 18. } 19. }； 20. Thread t = new Thread(r)； 21. t.start()； 22. System.out.println("started")； 23. t.sleep(2000): 24. System.out.println("interrupting")； 25. t.interrupt()； 26. System.out.println("ended")； Assume that sleep(n) executes in exactly n milliseconds. and all other code executes in an insignificant amount of time. Place the fragments in the output area to show the result of running this code.