Computer Science
| CS2383 | Data Structures and Algorithms | 4 ch (3C 1T) [P] |
|---|---|---|
Presents formal specifications of abstract data and their data structure representations, operations, and algorithms. Includes priority queues, dictionaries, graphs, heaps, hash tables, binary search trees, balanced trees, and graph adjacency representations. Covers sorting, searching, dynamic storage handling, and fundamental graph algorithms. Asymptotic analysis of time and space complexity are taught and used throughout the course. Students are expected to implement a variety of data structures and graph algorithms. NOTE: Credit is not given for both CS 2383 and CS 3323. | ||
