CMPT 238

Data Structures and Algorithms - I

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. Fall. Prerequisite: A grade of C or better in CMPT 102 or CMPT 201 .

Sections

Current meeting, instructor, credit, and enrollment details

Updated 9 hours ago

001

Availability not recently verified

Class #manhattan-CMPT238Fall 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?