group E $[$Readl$-$Only$]-$ Word

QUESTION $)$

University Course Scheduling with Faculty Conflicts

This Constraint Satisfaction Problem $($CSP$)$ involves scheduling courses at a university while considering faculty availability and course requirements.

Variables:

Each variable represents a course offered $($e$.$g$.,$ CS$101,$ Math$202).$

Domains:

Each domain consists of possible time slots for the course $($e$.$g$.,$ Monday $9$:$00$ AM$,$ Tuesday $2$:$00$ PM$,$ etc.$).$

Constraints:

Faculty Availability: A faculty member cannot teach two courses at the same time. $($This requires identifying which faculty teaches each course$).$

Course Prerequisites: Some courses have prerequisite courses that must be completed before enrollment. A course cannot be scheduled in a time slot that conflicts with its prerequisite's time slot.

Room Availability: Certain courses may require specific types of rooms $($e$.$g$.,$ labs, computer labs$).$ The chosen time slot for a course must be available in a compatible room.

Student Conflicts: Ideally, students shouldn't have multiple high$-$demand courses scheduled for the same time slot. $($This might be a soft constraint with different weighting depending on the exam focus$).$

End of drourrent: