advertisement

CS4335 Tutorial (Week Three) Question 1: For the interval partitioning problem, we have the following lectures: a (9, 10), b(9, 11), c(10, 13), d(10:30, 12:30), e(10:30, 13), f(11, 14), g(12:30,15), where the first number is the starting time and the second number is the time that the lecture finishes. Find the minimum number of classrooms to schedule all lectures so that no two occur at the same time in the same classroom. Question 2: For the scheduling to minimize lateness problem, the jobs are given as follows: 1 2 3 4 5 ti 1 5 3 3 2 di 5 5 6 7 7 Schedule all the jobs to minimize maximum lateness. Question 3 Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and (2) Prim’s algorithm. 2 1 4 3 2 4 1 1 7 4 6 5 2 6 3 7 8 5 3 9 1 1 4 1 1 10 9 5 2 8 11 12 8