Make up a scheduling problem that would be of some interest to you similar to what we did in Exercise. Use graph theory to develop a solution
Assume that the registrar at your school is building a final exam schedule and because the following courses are known to be particularly difficult, the registrar does not want any student to take finals for two of them on the same day. The courses are Anth215, Bio325, Chem264, Mat311, Phy212, Fin323, and ComD265. The asterisks in the given table indicate which courses have students in common and therefore should have their finals on different days. Assume that two courses are related if they have any students in common. Model this set of courses with a graph and use it to design a final exam schedule.
| Anth215 | Bio325 | Chem264 | Mat311 | Phy212 | Fin323 | ComD265 |
Anth215 |
| * | * | * |
| * | * |
Bio325 | * |
| * |
|
| * |
|
Chem264 | * | * |
| * | * |
|
|
Mat311 | * |
| * |
| * | * | * |
Phy212 |
|
| * | * |
|
|
|
Fin323 | * | * |
| * |
|
|
|
ComD265 | * |
|
| * |
|
|
|
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.