(CSE 340) Design and Analysis of Algorithms 0,

3 Credits

Algorithms for searching, sorting, manipulating graphs and trees, finding shortest paths and minimum spanning trees, scheduling tasks, etc.: proofs of their correctness and analysis of their asymptotic runtime and memory demands. Designing algorithms: recursion, divide-and-conquer, greediness, dynamic programming. Limits on algorithm efficiency using elementary NP-completeness theory. Prerequisites: ( MATH 022 or MATH 032 or MATH 052 or MATH 082 ) and CSE 140 and CSE 017 Attribute/Distribution: Q