CMPT 239
Data Structures & Algorithms
Manhattan University · UGRD · Fall 2026
1 section
Catalog description
Efficiency of search, sort, and hash algorithms. Stacks, queues, priority queues, binary trees, binary search trees, general trees, heaps, and heapsort. Algorithm analysis techniques, worse-case analysis, greedy algorithms, divide and conquer algorithms, recurrent algorithms. Fall. Prerequisite: A grade of C or better in CMPT 102 or CMPT 201 .
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #manhattan-CMPT239Fall 2026UGRD4 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?