Give a pseudo code, code the algorithm in java, and give the outputs from the details below.
Question:
Give a pseudo code, code the algorithm in java, and give the outputs from the details below.
The data is above. You can also use object-orientated programming. Separate all of the classes and the main program. Also run the program to show the output.
Inputs: . Course Offerings: Course Code, Name, Credits, Prerequisites, Faculty, Duration, Room . Faculty Availability: Name, Course Code, Times, Days, Location . Student List: Names . Classroom Information: Name, Capacity
Outputs: . Optimal Schedule: Course Code, Name, Faculty, Time Slot, Room
1. Make a list of all possible time slots for each course based on faculty availability and available classrooms.
2. Make a graph G = (V, E), where V is the set of nodes representing courses, faculty, and classrooms, and E is the set of edges representing scheduling conflicts.
3. For each course node, add edges to all nodes representing courses that conflict with the course in terms of faculty availability and classroom availability.
4. Apply a graph coloring algorithm to G to find a valid schedule for all courses.
5. Check that the schedule satisfies the constraints: . Room capacity: Ensure that each course is scheduled in a feasible capacity room. . Faculty workload: Ensure that each faculty member is not scheduled for more courses than their workload limit. . Student scheduling conflicts: Ensure that no two courses are scheduled at the same time for students with a scheduling conflict.
6. If the schedule is valid, output the optimal schedule, including the course code, name, faculty name, time slot, and room.
7. If the schedule is not valid, return to step 1 and repeat the process with a different set of possible time slots until a valid schedule is found.
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill