CS 5112

CS 5112

Course information provided by the 2025-2026 Catalog.

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 A strong foundation in programming, typically demonstrated by successful completion of basic undergraduate-level computer science courses.

Enrollment Information Enrollment limited to: Cornell Tech students. 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

Last 4 Terms Offered 2025FA, 2024FA, 2023FA, 2021FA

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits GradeNoAud

  • 19404 CS 5112   LEC 030

    • TR
    • Aug 25 - Dec 8, 2025
    • Conway, A

  • Instruction Mode: In Person

    Enrollment limited to: Cornell Tech students.

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits GradeNoAud

  • 21086 CS 5112   LEC 031

    • TR
    • Aug 25 - Dec 8, 2025
    • Conway, A

  • Instruction Mode: Distance Learning-Synchronous

    Enrollment limited to: Part-time Cornell Tech Master's students.