23.2.6. Indegree and Outdegree in DAGs

Try these first

1. 1.

   Define a Directed Acyclic Graph (DAG).

   Hint

   Think about the meaning of directed and acyclic.

2. 2.

   What does it mean if a vertex has an indegree of zero?

   Hint

   Consider what would happen if all tasks depended on it.

3. 3.

   What does DAG stand for?

   • Directed Acyclic Graph
   • Directed Alluvial Graph
   • Dense Acyclic Graph

   Hint

   Remember the definition of the structure.

4. 4.

   True or False: Every vertex in a DAG must have a non-zero indegree.

   • True
   • False

   Hint

   Consider what happens during task sequencing.

5. 5.

   You have six tasks: Get Visa, Buy Tickets, Get Passport, Buy Gifts, Get Insurance, Exchange Currency. Create a DAG and provide a topological sort that respects all dependencies.

   Hint

   Map your tasks with clear dependencies before sorting.

6. 6.

   List a scenario in a class project where tasks might form a DAG, delineate high indegree tasks versus low indegree tasks, and express which tasks could begin the project.

   Hint

   Identify tasks that support others and those that start the process.