Course Websites

CS 374 BL1 - Intro to Algs & Models of Comp

Last offered Fall 2024

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:

Related Faculty

Intro to Algs & Models of CompBL170641LEC41230 - 1345 T R  0027/1025 Campus Instructional Facility Ivan Thomas Abraham
Nickvash Kani