CS 6150: A Practical Graduate Advanced Algorithms Course at UVU

摘要

Two years ago Utah Valley University (UVU) began offering a Master of Computer Science Degree(MCS). This program needed to be distinct from other similar programs in our service area, and needed to align with the workforce development goals of UVU. The CS 6150 Advanced Algorithms course, one of the fundamental core courses students take in the MCS program, exhibits this distinctiveness. This paper describes five problems taught to students when they take CS 6150. They are: Balancing a Two-wheeled Robot, Stable Marriage Problem, Lemoine's Conjecture, Largest Triangle and Blockchains. These problems are an eclectic set of problems that are not commonly taught in data structures and algorithms textbooks and courses, but provide enough theory to be rigorous while giving experience with real-world, practical problems around which to develop new professional skills. Students are required to produce performant, working code while learning about the algorithms and related theories, concepts and mathematics involved. This blend supports the unique missions of UVU and the MCS Program. Student feedback is that the course is difficult, for reasons such as new advanced material and higher expectations of graduate students, however they also enjoy the challenging projects and they use the knowledge and skills they develop in school and work.