Course Websites

Analysis of algorithms, major paradigms of algorithm design including recursive algorithms, divide-and-conquer algorithms, dynamic programming, greedy algorithms, and graph algorithms. Formal models of computation including finite automata and Turing machines. Limitations of computation arising from fundamental notions of algorithm and from complexity-theoretic constraints. Reductions, undecidability and NP-completeness. Course Information: Same as ECE 374. Prerequisite: One of CS 173, MATH 213; CS 225.

This section is intended for Chicago City Scholars only. There may be online and in person components. You are responsible for completing homeworks, quizzes, and any in person activities that are required. Please speak with your professor regarding expectations. Weekly in-person meeting in Classroom A at 200 S. Wacker Dr. Chicago. For up-to-date information about CS course restrictions, please see the following link: http:// go.cs.illinois.edu/csregister.