CS 374 BL1

CS 374 BL1 - Intro to Algs & Models of Comp

Fall 2025

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Intro to Algs & Models of CompCS374BL170641LEC41530 - 1645 T R  0027/1025 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompECE374BL170642LEC41530 - 1645 T R  0027/1025 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompECE374BLZ72199LEC41530 - 1645 T R  0027/1025 Campus Instructional Facility 

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