CSE 431: Algorithms Analysis and Design
This page refers to the Spring 2013 offering of CSE 431 only. The information on this page does not necessarily apply to every offering of CSE 431.
Spring 2013
10215
Algorithms Analysis and Design
Introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, NP-completeness, approximation algorithms, and network flows. For each topic, beside in-depth coverage, we discuss one or more representative problems and their algorithms. In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer scientists and engineers.
None presently available.
CSE 331, MTH 142
