course scheduling features to help new CS students schedule their courses. The new

cohort of CS students bring their class offerings and the available time slots where gray

represents reserved.

Course Lecture Time Lab$/$Practical Time

CS$303$ Sun Tue Thu $11,12$ MON WED $10,11,12,1$

CS$600$ Sun Tue Thu $12,1$ MON WED $11,1,2$

CS$101$ Sun Tue Thu $10,11,12,1,2,3$ None

CS$202$ Everyday $10,11$ None

Time SUN TUE THU MON WED

$10$

$11$

$12$

$1$

$2$

$3$

You also include the following set of constraints:

$(1)$ Each class must be assigned to exactly one timeslot

$(2)$ Each timeslot can be assigned to a maximum of one class

$(3)$ No classes can be scheduled during the reserved timeslots

$(4)$ The Mon Wed selection for CS$202$ must occur at the same time as the Sun Tue Thu

selection.

Use the following abbreviations to facilitate writing your solution

CS$101$ Lecture $->$ L$1$

CS$202$ Lecture $->$ L$2$

CS$303$ Lecture $->$ L$3$

CS$303$ Lab $->$ P$3$

CS$600$ Lecture $->$ L$6$

CS$600$ Lab $->$ P$6$

Sun Tue Thu $10->10$S

Sun Tue Thu $11->11$S

Mon Wed $10->10$M

Mon Wed $11->11$M

and so on

A$.$ Which of the following options is preferred to represent this as a CSP$?$ Explain your answer:

$1.$ using meeting times as variables and courses as the values of in the domains?

$2.$ using courses as variables and the time slots as values?

B$.$ Now using courses are variables and times as values, list the variable and the initial domain

values. L$1$ is done for you

Variable Domain

L$110$S $11$S $12$S $1$S $2$S $3$S

C$.$ Update the table by removing the values that are incompatible with the constraint#$3.$

D$.$ Simulate DFS with forward checking only on your variables and the reduced domains in part

C above. Show your steps. How many times did you backtrack?

E$.$ Write a python program so solve this CSP using forward$-$checking. The program should output

a schedule of the $4$ courses that doesn$$t violate any of the constraints.

Create a PDF file that includes answers to questions in parts A$,$ B$,$ C$,$ D$.$

Write a python program to solve this CSP as instructed in part E$.$