recategorized
2,854 views
4 votes
4 votes

In Activity-Selection problem, each activity $i$ has a start time $s_i$ and a finish time $f_i$ where $s_i \leq f_i$. Activities $i$ and $j$ are compatible if

  1. $s_i \geq f_j$
  2. $s_j \geq f_i$
  3. $s_i \geq f_j$ or $s_j \geq f_i$
  4. $s_i \geq f_j$ and $s_j \geq f_i$
recategorized

1 Answer

Best answer
0 votes
0 votes

Answer is C

Two activities are compatible if they can be completed in some order and don't overlap in time. To complete two activities, START time of one activity must be greater than or equal to FINISH time of other activity i.e one activity must start only after other finishes. So, 

 Si >= Fj or Sj >= Fi

selected by
Answer:

Related questions

3 votes
3 votes
1 answer
2
2 votes
2 votes
2 answers
3
2 votes
2 votes
1 answer
4
go_editor asked Aug 9, 2016
4,295 views
If there are n integers to sort, each integer had d digits and each digit is in the set $\{1, 2, \dots, k\}$, radix sort can sort the numbers in$O(d \: n \: k)$$O(d n^k)$...