CS 2383
Data Structures and Algorithms
Learn about formal specifications of abstract data types and their data structure representations, operations, and algorithms. Explore priority queues, dictionaries, graphs, heaps, hash tables, binary search trees, balanced trees,and graph adjacency representations. Examine sorting, searching, dynamic storage handling, and fundamental graph algorithms. Learn about asymptotic analysis of time and space complexity and use it throughout the course. Implement a variety of data structures and graph algorithms.
Prerequisites & course information
Prerequisites : ( CS 1083 or ECE 4403 ) and ( CS 1303 or MATH 2203 ).
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Data Structures and Algorithms · 4 ch (3C 1T) (P) · Undergraduate