CS 5112

CS 5112

Course information provided by the Courses of Study 2019-2020.

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.

When Offered Fall.

Permission Note Enrollment limited to: Cornell Tech students.
Prerequisites/Corequisites Prerequisite: undergraduate data structures course or permission of instructor.

View Enrollment Information

  •   Regular Academic Session. 

  • 3 Credits Graded

  • 12810 CS 5112   LEC 001

  • Taught in NYC. Enrollment limited to Cornell Tech students.