edited by
14,132 views
50 votes
50 votes

The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ respectively in chronological order: $“a_s \: b_s \: c_s \: a_e \: d_s \: c_e \: e_s \: f_s \: b_e \: d_e \: g_s \: e_e \: f_e \: h_s \: g_e \: h_e”$. Here, $x_s$ denotes the starting time and $x_e$ denotes the ending time of activity X. We need to schedule the activities in a set of rooms available to us. An activity can be scheduled in a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required?

  1. $3$
  2. $4$
  3. $5$
  4. $6$
edited by

11 Answers

–1 votes
–1 votes
ans 4
Answer:

Related questions

25 votes
25 votes
3 answers
4
Kathleen asked Sep 17, 2014
7,498 views
What is the weight of a minimum spanning tree of the following graph?$29$$31$$38$$41$