卷別
計算機結構與作業系統(B)
選擇國立臺灣大學 2022 · 考試 · 第 13 題
考科作業系統
(5 pts) Regarding the critical-section problem and synchronization, select correct description(s).
(複選;至少一個正確選項,每個選項獨立計分。)
- (A)A resource-allocation graph has a cycle if and only if there is a deadlock.
- (B)The "progress" requirement implies the "bounded waiting" requirement.
- (C)The "bounded waiting" requirement implies the "progress" requirement.
- (D)The "freedom from deadlock" property implies the "freedom from starvation" property.
- (E)The "freedom from starvation" property implies the "freedom from deadlock" property.