Practice Directed Acyclic Graphs (dags) (23.2) - Directed Acyclic Graphs (DAGs)

Practice: Directed Acyclic Graphs (DAGs)

Lesson 23.2Directed Acyclic Graphs (DAGs)

Practise this section

9 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
3 questions · about 2 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
Remember the key property of a DAG.
Question 2.
What does in-degree and out-degree refer to?
Show hintHide hint
Think of how edges point to or away from a task.
3Question 3.
What is a Directed Acyclic Graph?
- A graph with cycles
- A directed graph without cycles
- A graph with undirected edges
Show hintHide hint
Think about the meaning of acyclic.
4Question 4.
Is it possible to topologically sort a graph with cycles?
- True
- False
Show hintHide hint
Consider if you can complete a task if it depends on itself.
Question 5.
Create a DAG for scheduling a software development project with the following tasks: Design, Code, Test, Deploy. Assume Design must be completed before Code, and Code must be completed before Test. How would you represent this graphically?
Show hintHide hint
Draw the tasks and the dependencies between them.
Question 6.
Explain how the presence of a cycle affects the workflow in a project management scenario. What strategies can be employed to prevent cycles in task dependencies?
Show hintHide hint
Consider what happens when one task relies on another that also depends back on the first.

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