2017-18 Catalog

Search Results

CSE 340 (MATH 340) Design and Analysis of Algorithms 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. Credit will not be given for both CSE 340 (Math 340) and CSE 441 (Math 441).
Prerequisites: (MATH 022 or MATH 096 or MATH 032) and (CSE 261 or MATH 261)

MATH 340 (CSE 340) Design and Analysis of Algorithms 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-andconquer, greediness, dynamic programming. Limits on algorithm efficiency using elementary NP-completeness theory. Credit will not be given for both MATH 340 (CSE 340) and MATH 441 (CSE 441).
Prerequisites: (MATH 022 or MATH 096 or MATH 032) and (CSE 261 or MATH 261)