Computational Algorithms 101:
The university timetabling/scheduling problem is NP-Hard meaning its highly time and resource intensive. With hundreds, if not thousands, of classes and only a finite amount of hours, there's no easy way to make considerations for every single person. Although...