Consider the following Regis University CS courses offered on Mon., Wed., and Fr

Question

Consider the following Regis University CS courses offered on Mon., Wed., and Fri. D CS 210 - Introduction to Programming: 9:00a 10:00a CS 310 Data Structures: 9:30a 10:30a CS 324 - Algorithms and Complexity: 10:00a 11:00a CS 390-Principles of Programming Languages: 10:00a-11:00a D CS 473 - Introduction to Artificial Intelligence: 11:30a 12:30p The following CC&IS; faculty teach the above courses D A: Professor Smallwood may teach CS 210, CS 310, or CS 324 B: Professor Blumenthal may teach CS 324, CS 390, CS 473 D C: Professor Hart may teach CS 210, CS 390, or CS 473 Naturally, at any given time a single Professor can only teach during one class section period. 4. Create a schedule that assigns these professors to teach all of the previous courses in the given time slots. Frame this as a CSP problem where the courses are the variables. Give the domains and binary constraints

Explanation / Answer

Constraint Satisfaction Problem (CSP) objective is to get a value for every variable defined according to constraints or restriction in the area of interest.

According to the given problems courses are taken as variable which are offered on specific days of week.

Let us donate Professors as Prof. Smallwood(A), Prof. Blumenthai(B), Prof Hart(C)

Variables:

Courses: CS 210, 310, 324, 390, 473

Domains are combinations which help in scheduling the courses e.g.

Constraints :

A (210, 310, 324), B(324, 390, 473) and C(210, 390, 473)

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.