Course Websites

CS 374 AYD - Intro to Algs & Models of Comp

Last offered Spring 2023

Official Description

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.

Related Faculty

Intro to Algs & Models of CompAYD65092DIS01200 - 1250 W F  1304 Siebel Center for Comp Sci Alexander Roe
Chandra Chekuri