July 11, 2007
Exercises 16.1-3
Sorting the lectures’ starting time and finish time. When time t is one lecture’s starting time if there are free hall then assign to it, otherwise the current halls are all occupied, then we need to create a new hall. If time t is one lecture’s finish time, then release the hall. This algorithm is optimal and is easy to prove.
Exercises 16.1-2
Yes, because we can exchange the start and end time and get a equal problem.
