24.4.2.2. Constructing the Schedule

Try these first

1. 1.

   What is a poset?

   Hint

   Think about how elements relate to each other.

2. 2.

   Define a cover in a poset.

   Hint

   Visualize a Hasse diagram.

3. 3.

   What defines a maximal element in a poset?

   • Has elements below it
   • Has no elements above it
   • Is the greatest element

   Hint

   Think about elements in relation to others.

4. 4.

   True or False: All posets must have a maximal and a minimal element.

   • True
   • False

   Hint

   Consider different types of posets.

5. 5.

   You have a poset with elements {A, B, C, D}. A covers B, B covers C. Identify all covers, maximal and minimal elements.

   Hint

   Draw a Hasse diagram to visualize these relationships.

6. 6.

   Illustrate a set of tasks with dependencies and perform topological sorting to find a valid task order.

   Hint

   Sketch out a dependency diagram for clarity.