Course Websites

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: 1 to 4 undergraduate hours. 1 to 4 graduate hours. May be repeated in the same or separate terms if topics vary.

MCS Algorithms: Analysis of algorithms, major paradigms of algorithm design including recursive algorithms, divide-and-conquer algorithms, dynamic programming, graph algorithms, greedy and local search, and reductions. Introduction to some advanced topics in algorithms including randomization and discrete optimization for combinatorial problems. One to two weeks on topics at the discretion of the instructor. Prerequisites: discrete mathematics, data structures, linear algebra and probability at the undergraduate level. Intended audience: graduate students who have not had a design- and proof-based algorithms course at the undergraduate level. This is in contrast to CS 473 which is suitable for those who have such a course. For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister