申論 1閱讀以下Java 程式，列出數學式以說明變數e 在計算什麼？接著撰寫遞迴（recursive）程式public static double etx（int accuracy, int x）來計算前述變數e 的值，撰寫時必須使用etx 規定的參數與資料型態。（25 分）import java.util.Scanner;public class EtoX{public static void main( String[] args ){Scanner input = new Scanner( System.in );int number = 1;int accuracy;int factorial = 1;int x;double e = 1.0;double exponent = 1.0;x = input.nextInt();accuracy = input.nextInt();while ( number < accuracy ){exponent *= x;factorial *= number;e += exponent / factorial;number++;} // end while loopSystem.out.printf( "x: %d%ne: %f%n", x, e );} // end main} // end class EtoX
本卷皆為申論題，點「看答案與解析」查看擬答。
弱點分析
未作答的題目不計分。看我的紀錄
申論 2下列為資料結構List 的Java 程式，而ListTest 為測試類別（class），試回答以下問題：（35 分）⑴ListTest 中”List<Integer> list = new List<>();”會先後呼叫那些methods？傳送那些參數值？結果新物件list 的屬性值為何？⑵執行ListTest.java 後會列印出什麼？⑶撰寫public T removeFromBack() throws EmptyListException。class ListNode<T>{T data;ListNode<T> nextNode;ListNode(T object){this(object, null);}ListNode(T object, ListNode<T> node){data = object;nextNode = node;}T getData()ListNode<T> getNext()} // end class ListNode<T>public class List<T>{private ListNode<T> firstNode;private ListNode<T> lastNode;private String name;public List(){this("list");}public List(String listName){name = listName;firstNode = lastNode = null;}public void insertAtFront(T insertItem)public void insertAtBack(T insertItem)public T removeFromFront() throws EmptyListExceptionpublic T removeFromBack() throws EmptyListExceptionpublic boolean isEmpty()public void print(){if (isEmpty()){System.out.printf("Empty %s%n", name);return;}System.out.printf("The %s is: ", name);ListNode<T> current = firstNode;while (current != null){System.out.printf("%s ", current.data);current = current.nextNode;}System.out.println();}} // end class List<T>public class EmptyListException extends RuntimeException{public EmptyListException(){this("List");}public EmptyListException(String name){super(name + " is empty");}} // end class EmptyListExceptionpublic class ListTest{public static void main(String[] args){List<Integer> list = new List<>();try{list.insertAtFront(-1);list.insertAtFront(99);list.print();int removedItem = list.removeFromFront();removedItem = list.removeFromFront();list.print();removedItem = list.removeFromFront();list.print();}catch (EmptyListException emptyListException){emptyListException.printStackTrace();}}} // end class ListTest
申論 3下列程式Stack<T>繼承上題的List<T>。試撰寫Stack 中的建構子Stack()，以及兩個主要methods: push(…)與pop()。（25 分）public class Stack<T> extends List<T>{public Stack()public void push(T object)public T pop() throws EmptyListException} // end class StackInheritance
申論 4下列Python 程式的執行結果為何？（15 分）class Shape:def __init__(self, x, y):self.x = xself.y = yself.description = "unknown"def area(self):return self.x * self.ydef perimeter(self):return 2 * self.x + 2 * self.ydef describe(self, text):self.description = textclass Square(Shape):def __init__(self, x):self.x = xself.y = xclass DoubleSquare(Square):def __init__(self, y):self.x = 2 * yself.y = ydef perimeter(self):return 2 * self.x + 3 * self.yrectangle = Shape(100, 45)print(rectangle.perimeter())dictionary = {}dictionary["DoubleSquare"] = DoubleSquare(5)dictionary["Rectangle"] = Shape(600,45)dictionary["Square"] = Square(20)print(dictionary["Square"].area())dictionary["DoubleSquare"].describe("Double square")print(dictionary["Rectangle"].description)