19.4.2.1. Initial Condition

Try these first

1. 1.

   What is a greedy algorithm?

   Hint

   Think about making the most optimal choice available at each step.

2. 2.

   Can you name one real-world application of greedy algorithms?

   Hint

   Consider situations where resources or time must be managed efficiently.

3. 3.

   What is the main characteristic of a greedy algorithm?

   • It considers future consequences
   • It makes the best local choice
   • It backtracks for better outcomes

   Hint

   Think about choices that prioritize immediate results over future impact.

4. 4.

   True or False: A greedy algorithm guarantees an optimal solution in every case.

   • True
   • False

   Hint

   Consider examples where a local choice disrupts a better global solution.

5. 5.

   Given a set of bookings with start and finish times, design an algorithm for scheduling that could improve upon a greedy approach.

   Hint

   Reflect on how you can store previous selections to influence future choices.

6. 6.

   Create a scenario with six bookings, demonstrating conflicting times and then explain how to choose an optimal set using the greedy algorithm.

   Hint

   Pay attention to how overlapping can eliminate potential choices.