Practice Topological Sorting Of Dags (23.2.5) - Directed Acyclic Graphs (DAGs)

Practise this section

10 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define a Directed Acyclic Graph.
Show hintHide hint
Think about the word 'acyclic'. What does it mean?
Question 2.
What does in-degree mean in the context of a DAG?
Show hintHide hint
Consider how many arrows point towards a task.
3Question 3.
What does a DAG resemble in project management?
- Cycle
- Task Dependency
- Random Tasks
Show hintHide hint
Think about how tasks relate to each other.
4Question 4.
True or False: A cycle in a DAG allows for topological sorting.
- True
- False
Show hintHide hint
What happens to dependencies if they loop?
Question 5.
Create your own DAG with at least five tasks and define the dependencies. Then, perform a topological sort.
Show hintHide hint
Think about a daily routine and what tasks depend on others.
Question 6.
Given a complex job structure where teams cannot start until the previous team finishes, outline a strategy to organize this structure using a DAG.
Show hintHide hint
What is the final task that can be performed without waiting?

6 more questions in this section. Enroll free to practise them all.