Input | Output |
---|---|
![]() Which schedule is an equivalent serial schedule for the precendence graph in <image 1>? (A) T3 -> T1 -> T2 (B) T2 -> T1 -> T3 (C) T1 -> T2 -> T3 (D) There are no serial schedules for the graph. Answer with the option's letter from the given choices directly. No punctuation. | (B) T2 -> T1 -> T3 Expected Answer: D Difficulty: Medium Subfield: Operating System |
![]() Which schedule is an equivalent serial schedule for the precendence graph in <image 1>? (A) T3 -> T1 -> T2 (B) T2 -> T1 -> T3 (C) T1 -> T2 -> T3 (D) There are no serial schedules for the graph. Answer with the option's letter from the given choices directly. No punctuation. | A Expected Answer: D Difficulty: Medium Subfield: Operating System |
Rows per page