阿摩線上測驗
登入
首頁
>
中山◆資工◆離散數學與演算法
>
110年 - 110 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#104300
> 申論題
題組內容
3.
(a)[10%] Show that if any 19 integers are selected from the set S = {1, 2, …, 35}, there are at least two whose sum is 36.
相關申論題
(b)[10%] Write a statement that generalizes the results of part (a).
#441566
4. [10%] Given an alphabet Σ, is there a languagewhere A* = A?
#441567
5. [10%] Find the generating function for the number of integer solutions to the equation
#441568
6. (Algorithm points) [10%] Find by Euclidean algori thm.
#441569
7. (Algorithm points) [10%] Please express quicksort algorithm and analyze its time complexity in detail.
#441570
8.(Algorithm points) [10%] Please express the construction of Huffman coding and analyze its time complexity in detail.
#441571
1. Find the general solutions of y1 and y2 (10 分)
#441572
2. The tank in Fig. 1 contains 80 Ib of salt dissolved in 500 gal of water. The inflow per minute is 20 1b of salt dissolved in 20 gal of water. The outflow is 20 gal/min of the uniform mixture. Find the time when the salt content y(t) in the tank reaches 95% of its limiting value (as t→ ∞). (10 分)
#441573
3. Find out the particular solution of the ODE (10 分) y"+4y=-12 sin2x, y(0)= 1.8, y'(0)=5.0
#441574
4. Use the Laplace transform to solve the following ODE (10 分)
#441575
相關試卷
110年 - 110 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#104300
110年 · #104300
109年 - 109 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#105755
109年 · #105755
108年 - 108 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#105778
108年 · #105778