19.2. Greedy Algorithms Overview

Try these first

1. 1.

   What is a greedy algorithm?

   Hint

   Consider what type of choices it emphasizes.

2. 2.

   Name one greedy algorithm discussed in class.

   Hint

   Think of algorithms used for finding the shortest path.

3. 3.

   What is the main objective of greedy algorithms?

   • To minimize execution time
   • To maximize local benefits
   • To consider all available options

   Hint

   Think about what drives decisions in greedy approaches.

4. 4.

   True or False: Greedy algorithms are guaranteed to find the global optimum in all problems.

   • True
   • False

   Hint

   Consider the conditions under which greedy strategies succeed.

5. 5.

   You are organizing a conference with 8 sessions, where each session overlaps with others. Given the start and end times, outline a schedule that maximizes the number of sessions using a greedy algorithm.

   Hint

   Remember to focus on the session that finishes earliest.

6. 6.

   Given a set of intervals with various overlaps, can you propose an alternative method to a greedy algorithm that might offer a better solution? Discuss possible algorithms.

   Hint

   Think of how you could assess every interval's choices comprehensively rather than greedily.