University Registrar Needs Help Assigning Classrooms Courses Spring Semester Given List N Q43784606
The university registrar needs your help in assigning classrooms to courses for the spring semester. You are given a list of n courses, and for each course 1 sisn, you have its start time si and end time ei. Give an O(n log n) algorithm that finds an assignment of courses to classrooms which minimizes the total number of classrooms required. Each classroom can be used for at most one course at any given time. Prove both the correctness and running time of your algorithm. Show transcribed image text The university registrar needs your help in assigning classrooms to courses for the spring semester. You are given a list of n courses, and for each course 1 sisn, you have its start time si and end time ei. Give an O(n log n) algorithm that finds an assignment of courses to classrooms which minimizes the total number of classrooms required. Each classroom can be used for at most one course at any given time. Prove both the correctness and running time of your algorithm.
Expert Answer
Answer to The university registrar needs your help in assigning classrooms to courses for the spring semester. You are given a lis…
OR