Question: algorithm struct exam int s;//start time of exam int f://finish time of exam intp://exam priority (lowest number=highest priority) V/assume that priorities may change but once
struct exam int s;//start time of exam int f://finish time of exam intp://exam priority (lowest number=highest priority) V/assume that priorities may change but once an exam is being held in the hall it cannot be interrupted struct hall{ exam current_exam;//the current exam being held in the hall } Suppose we have a set of exams to be scheduled in one hall. Each exam has a priority. Assume that priorities may change but once an exam is being held in the hall it cannot be interrupted. Give a greedy algorithm to determine the maximum size set of non-overlapping exams to be scheduled in this hall. What is the worst case run time of your algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
