Question discussion

Eleven activities have the (start, finish) times (1, 4), (3, 5), (0, 6), (5, 7), (3, 9), (5, 9), (6, 10), (8, 11), (8, 12), (2, 14) and (12…

2522Medium DSSSB TGT Computer Science 0 replies 1 views
0

Eleven activities have the (start, finish) times (1, 4), (3, 5), (0, 6), (5, 7), (3, 9), (5, 9), (6, 10), (8, 11), (8, 12), (2, 14) and (12, 16). What is the maximum number of activities that can be scheduled so that no two of them overlap (an activity may start at the moment another one finishes)?

  • A3
  • B5
  • C4
  • D6
Correct answer: C

Explanation

The greedy method of always choosing the compatible activity with the earliest finish time selects (1, 4), (5, 7), (8, 11) and (12, 16), which is the maximum of 4.

Discussion 0

Nobody has replied yet. Start the discussion!