23.2.4. Characterization of DAGs

Try these first

1. 1.

   What is a Directed Acyclic Graph?

   Hint

   Think about the two key characteristics: directed and acyclic.

2. 2.

   Define indegree.

   Hint

   Remember, it relates to how many tasks depend on this task.

3. 3.

   What defines a Directed Acyclic Graph?

   • A graph with cycles
   • A directed graph without cycles
   • An undirected graph

   Hint

   Focus on the keywords in the definition.

4. 4.

   Can a DAG have more than one starting point?

   • True
   • False

   Hint

   Think about tasks that can happen simultaneously.

5. 5.

   Given a graph with the following edges: A -> B, A -> C, B -> D, C -> E, and D -> E. Determine if this graph is a DAG.

   Hint

   Check for paths that may return to start points.

6. 6.

   Propose a new task flow for a project where tasks A, B, C, and D lead to a final task E. Identify the edges to create a valid DAG.

   Hint

   Visualize how each task must flow into the next.