CS 374 BYF - Intro to Algs & Models of Comp
Last offered Fall 2022
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.
|Intro to Algs & Models of Comp||BYF||66452||DIS||0||1400 - 1450||W F||4070 Electrical & Computer Eng Bldg||Nickvash Kani|