CS 5112
Algorithms and Data Structures for Applications
This course covers the algorithms and data structures that are fundamental to modern large-scale applications. We will cover a range of techniques including advanced graph algorithms, hash tables, vector search, and streaming and sketching algorithms. Applications will include selected topics in storage and memory systems and machine learning.
Prerequisites & course information
a strong foundation in programming, typically demonstrated by successful completion of basic undergraduate-level computer science courses. Familiarity with fundamental concepts in discrete mathematics is expected, including basic graph theory and asymptotic notation. Students without these format prerequisites may request permission from the instructor.
Sources
- Course catalogue ↗2026-2027