CMPT 438 - Algorithms

Description
Algorithm analysis techniques, worse-case analysis, greedy algorithms, divide and conquer algorithms, dynamic programming algorithms, branch-and-bound, and NP-completeness. Students will design algorithms, prove them correct, implement them, and then verify their implementation. Fall. Prerequisites: A grade of C or better in CMPT 102 or CMPT 201 and CMPT 238 and CMPT 335.
Credits
3
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2019, Fall 2018, Fall 2017
Offered
MWTh, TuF, TuWF
Avg. Class Size
26
Avg. Sections
1