CMPT 438
Algorithms
Manhattan University · UGRD · Fall 2026
1 section
Catalog 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 .
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #manhattan-CMPT438Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?