所屬科目:教甄◆資訊科技概論專業(電腦科)
47. Suppose there is a binary tree whose number of nodes is 2n , (n is a positive integer), how many nodes does this binary tree contain at least? (A) (B) (C) (D)
49. Given the relation below
what values will be retrieved by the following SQL statement?
SELECT A, B FROM Y WHERE Y.B = Y.C (A) 2, 5 (B) 3, 6 (C) 5, 2 (D) 2, 2
56. Regarding the following Pseudocode, which item is WRONG?
(A) Its function is insertion sort (B) After this Pseudocode is executed, A[n] is the maximum value (C) Its execution time isθ(n 2 ) (D) Its function is selection sort
58. What is the output result of the following program?
(A) 60 59 42 42 32 27 (B) 27 32 42 42 59 60 (C) 32 60 59 42 42 27 (D) 60 59 32 42 42 27
71. In non-preemptive shortest job first scheduling, consider the following five processes each having its own unique burst time and arrival time. What is the average waiting time?
(A) 3.6 (B) 5.2 (C) 7.8 (D) 9.6