CS 5112

Last Updated

  • Schedule of Classes - February 12, 2019 8:29PM EST
  • Course Catalog - January 26, 2019 2:00PM EST

CS 5112
Algorithms and Data Structures for Applications

Course information provided by the 2018-2019 Catalog.

An introduction to some fundamental algorithms and data structures used in current applications. Examples include cryptocurrencies (hashing, Merkle trees, proofs of work), AI (nearest neighbor methods, k-d trees, autoencoders), and VR/AR (gradient descent, least squares, line-drawing algorithms). Six lectures will be replaced by applied clinics taught in the evening. Programming assignments in Python or Java.


Prerequisites/Corequisites Prerequisite: undergraduate data structures course or permission of instructor.

Permission Note Enrollment limited to: Cornell Tech students.

When Offered Fall.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session.  Choose one lecture and one discussion.

  • 3 Credits Graded

  • 17766 CS 5112   LEC 001

  •  

  • Instruction Mode: In Person

    Taught in NYC. Enrollment limited to Cornell Tech students.

  • 18220 CS 5112   DIS 201

  •  

  • Instruction Mode: In Person