資訊推薦

• 18. On January 2, 2018, QQQ Inc.purchased equipment with a cost of HK$10,440,000, a useful life of 1
• 7. 舊制 BMI 的計算法是「 」，而英國數學家於 2013 年提出一項新制 BMI的計算方法為「 」。現有甲、乙、丙三人的體重及身高如下表：  試問甲、乙、丙三人中誰的新制 BMI 值會比舊制
• 【題組】(5 points) (b) Given an undirected, weighted graph in Figure 1, what is theminimum spanning tree
• 【題組】(5 points) (c) Describe the sequence of adding edges to form the MST of the graphin Figure 1 usi
• 3.(8 points) Use the Euclidcan algorithm to find the greatest common divisor of167,076 and 1,928,737
• 4.(5 points) Five people occupy five seats. If five seats are arranged in a circle, bowmany differen
• 5. (4 points) Let G = (V, E) be a graph. If V has twelve members, in which fourmembers each has a de
• 6. (8 points) A class at a college consists of 19 students who sit at a circular table.The instructo
• 7.(2 x 5 points) Please find the tight asymptotic upper bounds of the followingrecurrences in big-O
• 【題組】(b) T(n) = 2T(n-1) +n
• 8. (8 points) Given a sequence of n integers A = (a1, a2,..., an), the longestincreasing subsequence
• 3. Let be sets from a universe .【題組】(a) Write a quantified statement to express the proper subset r
• 【題組】(b). Calculate equilibrium constant k. (計算此反應的平衡常數)
• 【題組】(c). Calculate △G0(in KJ) for the reaction. (F = 96485 C/ mole)
• V There is a binary tree stored in an array as:in which Thi] is the parent of T(2i + 1] and T(2i + 2
• 1. ______除役前，戰時或有需要時可動員，採「常備平時募兵、後備戰時徵兵」模式，以儲備充足後備人力，並藉逐年增加招募志願士兵，以減少徵集義務役士兵。(A)36歲　(B)37歲　(C)38歲　(D
• 【題組】(d). Calculate Ecell (V)at 298K when = 2.0 M, [H⁺] = 1.0 M, [I⁻] = 1.0 M, = 1.0 x M.
• 二、計算題： 1.BBB Company purchases an oil tanker depot by cash on January l, 2015, at a cost of $300,000
• 【題組】(b) Prepare any journal entries required for the depot and the environmental liability on Decemb
• 【題組】(c) On December 31, 2024, BBB pays a demolition firm to dismantle the depot and remove the tanks
• 9. (7 points) Given a set S of n numbers, the k-partition problem is to determinewhether or not S ca
• 10. (4 x 2 points) True or False Questions. If your answer is False, please brieflyjustify.(No point
• 【題組】(b) Merge Sort has worst-case time complexity O(n log n), while the worst-casetime complexity of
• 【題組】(c) Searching a specific key in a binary search tree takes O(log n) time, where nis the number o
• 【題組】(d) Given the pre-order and level-order traversal sequences, we can construct aunique binary tre