Practice Modeling Dependencies With Graphs (23.2.3)

Practise this section

8 questions

Flashcard drill
2 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define a Directed Acyclic Graph (DAG).
Show hintHide hint
Think about what cycles in a graph imply.
Question 2.
What is the purpose of topological sorting?
Show hintHide hint
Consider how tasks would be completed.
3Question 3.
What is true about a Directed Acyclic Graph?
- True
- False
Show hintHide hint
Think about what a cycle would mean in terms of task dependencies.
4Question 4.
Which of the following is a requirement for topological sorting?
- The graph must be directed
- The graph must be acyclic
- Both A and B
Show hintHide hint
Consider the importance of direction and cycles.
Question 5.
Given five tasks with the following dependencies: A -> B, A -> C, B -> D, C -> D. Describe the topological orderings possible.
Show hintHide hint
Look for tasks without incoming edges to start.
Question 6.
If a new task E is introduced with dependencies: E -> A, how does this affect topological sorting?
Show hintHide hint
Track how each task's position changes.

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