CS 374

• Course in Catalog
• List of Terms offered
• Register for Classes

Credit: 4 hours.

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.

Same as ECE 374. Prerequisite: One of CS 173, MATH 213; CS 225.

• My Favorites
• My Schedule