阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)◆資料結構與演算法
>
110年 - 110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108
> 試題詳解
22. Suppose you can take any arbitrary portion of cach item. What is the highest total value you can get by filling your knapsack?
(A) 184
(B) 100
(C)90
(D) 84
答案:
登入後查看
統計:
尚無統計資料
詳解 (共 1 筆)
MoAI - 您的AI助手
B1 · 2025/11/16
#7105813
1. 題目解析 本題是一個「分數背包問題...
(共 1238 字,隱藏中)
前往觀看
0
0
相關試題
1..(A)O(B)X
#3061710
2.Consider two algorithms whose running times T(n) satisfy the following recurrences: Algorithm A: T(n) = 1000T(n/2) + 0(n1000)Algorithm B: T(n) = 2T(n - 1000) + 0(1)Then, Algorithm A is asymptotically faster than Algorithm B.(A)O(B)X
#3061711
3.Consider two algorithms whose running times T(n) satisfy the following recurrences: Algorithm A: T(n) = 4T(n/2) + 0(1) Algorithm B: T(n) = 2T(n/4)+ 0(1) Then, Algorithm A is asymptotically faster than Algorithm B.(A)O(B)X
#3061712
4.The running time of a dynamic programming algorithm is always θ(P) where P is the number of subproblems.(A)O(B)X
#3061713
5. Both depth-first search (DFS) and breadth-first search (BFS) are linear-time algorithrs.(A)O(B)X
#3061714
6. Every weighted graph has a unique minimum spanning tree (MST).(A)O(B)X
#3061715
7. Given an adjacency-list representation of a directed graph G = (V, E, w), it takes O(V) time to compute the in-degree of every vertex.(A)O(B)X
#3061716
8.Given a weighted directed graph G = (V,E, w) with no negative-weight edges, we can solve its single source shortest path problem in O(V + E) time.(A)O(B)X
#3061717
9. Given a weighted directed graph G = (V,E,w), we can determine whether a negative-weight cycle exists in G in O(V + E) time.(A)O(B)X
#3061718
10. Every problem in NP can be solved in exponential time. Please choose the best possible answer in each of the following qucstions. In questions that ask for time complexities, please choose the tightest bound.(A)O(B)X
#3061719
相關試卷
110年 - 110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108
2021 年 · #113108
110年 - 110 國立中央大學_碩士班招生考試_資工類:資料結構與演算法#105890
2021 年 · #105890
109年 - 109 東吳大學_轉學生招生考試_資訊管理學系三年級︰資料結構#105850
2020 年 · #105850
104年 - 104 國立交通大學_碩士班考試入學試題_資訊聯招:資料結構與演算法#113199
2015 年 · #113199