試卷名稱:110年 - 110 國立中央大學_碩士班招生考試_資工類:資料結構與演算法#105890
年份:110年
科目:研究所、轉學考(插大)◆資料結構與演算法
10. The adjacency list below is for an AOE network. The end field points to a list of adjacent vertices, dur
field is the duration of the activity, link field points to another adjacent vertex, vertex field is the id of
the adjacent vertex, count filed is the number of immediate predecessors. Which of the following
statements are true?
(A) The total duration of the critical path is 18.
(B) Path 0, 1, 4, 6, 8 is not a critical path.
(C) Path 0, 2, 4, 7, 8 is a critical path.
(D) The latest time that event 4 (i.e., vertex 4) can occur is 8.