19.4.1. Formal representation of the Algorithm

Try these first

1. 1.

   Define a greedy algorithm.

   Hint

   Think about the immediate benefits.

2. 2.

   What is interval scheduling?

   Hint

   Consider how you would schedule appointments.

3. 3.

   What is a greedy algorithm?

   • An algorithm that always returns the first answer
   • An algorithm that makes optimal local choices
   • An algorithm that uses backtracking

   Hint

   Think about how decisions are made step-by-step.

4. 4.

   True or False: Greedy algorithms guarantee an optimal solution for all problems.

   • True
   • False

   Hint

   Consider the limitations of greedy choices.

5. 5.

   Consider a series of intervals: (1, 4), (3, 5), (0, 6), (5, 7), (8, 9), (5, 9). Which intervals would you select using a greedy approach? Why?

   Hint

   Remember to choose based on finishing times.

6. 6.

   Create a set of four intervals (with given times) such that the shortest interval selection would yield fewer total bookings than a longer interval.

   Hint

   Explore combinations and overlaps carefully.