Practice Dependency Problem Description (23.2.2) - Directed Acyclic Graphs (DAGs)

Practise this section

10 questions

Flashcard drill
3 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.
What is a Directed Acyclic Graph (DAG)?
Show hintHide hint
Think of the meaning of 'Acyclic'.
Question 2.
What do we understand by in-degree of a vertex?
Show hintHide hint
Consider incoming arrows.
3Question 3.
What is the key feature of a Directed Acyclic Graph (DAG)?
- Contains cycles
- Has directed edges with a cycle
- Has no cycles
Show hintHide hint
Focus on the definition of 'Acyclic'.
4Question 4.
True or False? Topological sorting is possible for graphs with cycles.
- True
- False
Show hintHide hint
Consider the implications of a cycle.
Question 5.
You are given a set of tasks with cyclic dependencies (A -> B, B -> C, C -> A). Explain why a topological sort cannot be performed.
Show hintHide hint
Reflect on circular dependencies.
Question 6.
For a DAG consisting of tasks A, B, C, and dependencies A -> B, A -> C, C -> D, determine a possible valid topological order.
Show hintHide hint
Think about which tasks can be completed first based on their dependencies.

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