📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!
  • google app store apple app store
    • ✖

      Question

      The Activity Selection Problem can be optimally solved

      using a greedy approach. What is the greedy choice typically made at each step?
      A Select the activity with the shortest duration. Correct Answer Incorrect Answer
      B Select the activity that starts earliest. Correct Answer Incorrect Answer
      C Select the activity that finishes earliest. Correct Answer Incorrect Answer
      D Select the activity with the latest start time. Correct Answer Incorrect Answer
      E Select the activity that overlaps with the fewest other activities. Correct Answer Incorrect Answer

      Solution

      The standard greedy strategy for the Activity Selection Problem is to always choose the activity that finishes earliest among the remaining compatible activities. This leaves the maximum amount of time available for subsequent activities, thus maximizing the total number of selected activities.

      Practice Next
      More Algorithms Questions
      ask-question