19.1.1. Greedy algorithms: Interval scheduling

Try these first

1. 1.

   What is a greedy algorithm?

   Hint

   Think about local versus global solutions.

2. 2.

   Why is interval scheduling important?

   Hint

   Consider scenarios in classrooms or project management.

3. 3.

   What is the main goal of a greedy algorithm?

   • To maximize local optimum choices
   • To explore all possible options
   • To achieve a global optimum

   Hint

   Think about how we summarize our choices.

4. 4.

   Selecting the earliest finishing time is a common strategy for what problem?

   • True
   • False

   Hint

   Reflect on the main discussion around scheduling.

5. 5.

   Create a scenario with ten intervals and demonstrate how to apply the greedy algorithm to select non-overlapping intervals. Explain why they are optimal.

   Hint

   Focus on finishing times to guide your choices.

6. 6.

   Design a set of intervals where the greedy approach leads to a less than optimal number of bookings made. Explain why that is the case.

   Hint

   Remember to include a counterexample.