活動名稱
【解題達人! We want you!】
活動說明
阿摩站上可謂臥虎藏龍，阿摩發出200萬顆鑽石號召達人們來解題!
針對一些題目可能有疑問但卻缺少討論，阿摩主動幫大家尋找最佳解!
懸賞試題多達20萬題，快看看是否有自己拿手的科目試題，一旦你的回應被選為最佳解，一題即可獲得10顆鑽石。
懸賞時間結束後，只要摩友觀看你的詳解，每次也會得到10顆鑽石喔!
關於鑽石
如何使用:
- ✔懸賞試題詳解
- ✔購買私人筆記
- ✔購買懸賞詳解
- ✔兌換VIP
(1000顆鑽石可換30天VIP) - ✔兌換現金
(50000顆鑽石可換NT$4,000)
如何獲得:
- ✔解答懸賞題目並被選為最佳解
- ✔撰寫私人筆記販售
- ✔撰寫詳解販售(必須超過10讚)
- ✔直接購買 (至站內商城選購)
** 所有鑽石收入，都會有10%的手續費用
近期考題
1. Voiceless stops are usually aspirated in all following words EXCEPT
(A) pod
(B) spa
(C) tower
(D) twin
(A) pod
(B) spa
(C) tower
(D) twin
Question set V
【題組】21. We find a spanning tree for the graph using the depth-first search algorithm, starting with vertex e. Note that if two or more vertices qualify, then the one with the least alphabetical order is selected. What is the sum of the weights involved in the resulting tree?
(A) 31；
(B) 32；
(C)33；
(D) 34.
Suppose we have an undirected graph G=(V,E), where V=(a,b,c,d,e,fg,ij and E=([(a,i), 2], [(a,b), 6J, [(a,g),
4], [(b,c), 7, [(b,e), 9], [(c,d), 4], [(d,8), 5], [(e,8), 8], [(f,8), 2], [(f,i),3]). Note that [(x,v),w] indicates that
there is an edge, with weight w, between vertices x and y. Please answer the following questions.
【題組】21. We find a spanning tree for the graph using the depth-first search algorithm, starting with vertex e. Note that if two or more vertices qualify, then the one with the least alphabetical order is selected. What is the sum of the weights involved in the resulting tree?
(A) 31；
(B) 32；
(C)33；
(D) 34.