CS 374 AL1
CS 374 AL1 - Intro to Algs & Models of Comp
Fall 2025
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Intro to Algs & Models of Comp | CS374 | AL1 | 66445 | LEC | 4 | 1100 - 1215 | T R | 0027/1025 Campus Instructional Facility | Jeff Erickson Emily Kyle Fox |
| Intro to Algs & Models of Comp | ECE374 | AL1 | 66542 | LEC | 4 | 1100 - 1215 | T R | 0027/1025 Campus Instructional Facility | Jeff Erickson Emily Kyle Fox |
See full schedule from Course Explorer
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.
Section Description
For up-to-date information about CS course restrictions, please see the following link:
http://go.cs.illinois.edu/csregister