Final Project - Dance Recital Optimization Algorithm CSC213 ...

Final Project - Dance Recital Optimization Algorithm CSC213 The Assignment Your job is to create a ​program​ to implement an ​algorithm​ that makes scheduling the dance recital easier for the dance studio. Background Alyce Carella Dance center has classes for children of all ages, and at the end of the school year, a recital is held for all students. Each class has one dance number in the recital, but some children take multiple classes, and students need time between numbers to change costumes. This scheduling presents a problem for the dance studio director, as they want to reduce the number of children scrambling to change into a different costume between dances. Sometimes it’s possible to have conflicts, with children having back-to-back dance numbers, but if not, having the fewest number of conflicts is ideal. The Data The dance studio has 10 classes, and therefore 10 dances in the recital. Each class has 7 students. See the attached class listing, with students' ID numbers listed for each class. To determine the possible arrangements of classes in the recital, we are using a mathematical technique called ​permutations​. Permutations tell us how many different ways a set can be arranged when order matters. Think of a locker combination that has a 4 digit code. Of 10 numbers (0 through 9), you choose 4 numbers to make the code and the order of those numbers matters. For our dance recital, we have 10 classes, and we are choosing 10 classes. Similar concept to the above, but think of a locker combination with 10 digits.