阿摩線上測驗登入

首頁 > 中山◆資工◆離散數學與演算法 > 108年 - 108 國立中山大學_碩士班招生考試_資工系(資安)：離散數學與演算法#105778 >

題組內容

7. (Algorithm points) In each of the following, . Solve for relative to the given set , and determine the appropriate Ibig-Oh" form for

(b)

其他申論題

5. Let be a set of five positive integers the maximum of which is at most 9. Prove that the sums of the elements in all the nonempty subsets of S cannot all be distinct.

6. (a) Fermat's Theorem. If is a prime, prove that for each .

(b) Buler's Theorem. For each n Ezt,n ＞ 1, and each a EZ, prove that if gcd(a,n) = 1, then (a中(n) = 1(mod n).

(a) Apply Dijkstra's algorithm to the graph shown in the following Fig. 1 and determine the shortest distance from vertex b to each of the other vertices in the graph.

(b) Find a shortest path from vertex g to each of the vertices a, b, and c.

申論題 1. 依據避碰規則，球形號標應為何種顏色？

阿摩線上測驗

提供最完整的考試資料庫，包含歷年試題、詳解、申論題等學習資源，
幫助學生有效準備各類考試。

© 2008-2026 Yamol Tech Ltd. All Rights Reserved.
阿摩線上測驗--最強大的互動線上測驗版權所有

如有任何問題或建議，歡迎聯繫我們