Question
A programmer needs scheduling tasks with dependencies, and the chosen structure has the property that it exists only for directed acyclic graphs. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Topological Sort
Explanation:
Topological Sort fits because it supports scheduling tasks with dependencies and it exists only for directed acyclic graphs.
Both clues point to this choice.
Leave a Reply