19.5.1. Inductive Argument

Try these first

1. 1.

   What does a greedy algorithm aim to achieve?

   Hint

   Think about what decision-making style it resembles.

2. 2.

   Name one application of greedy algorithms discussed in this section.

   Hint

   Consider scenarios where resource allocation is needed.

3. 3.

   What is the purpose of the greedy approach in problem-solving?

   • To find an optimal solution by considering all choices
   • To make local choices aiming for global optimum
   • To verify democratic choices

   Hint

   Focus on the decision-making aspect of the method.

4. 4.

   True or False: All greedy strategies guarantee an optimal solution.

   • True
   • False

   Hint

   Think about the examples discussed in class.

5. 5.

   Given a set of bookings with starting and finishing times, outline how you would apply the greedy algorithm to find the maximum number of non-conflicting bookings. Provide an example set and walk through your reasoning.

   Hint

   Work step-by-step: Sorting, selecting, and checking for conflicts.

6. 6.

   Create your counterexample demonstrating that choosing the shortest booking first does not yield the maximum number of bookings. Describe the scenario and explain the outcome.

   Hint

   Think about integrating longer and shorter time slots in different configurations.