CS5800 home

Gradescope HW submissions : Must be latex-ed pdfs (or code file when appropriate).

Welcome to CS 5800 - Algorithms. Bookmark this page! General structure of the course:

13 modules (1 weeks each) with readings, lecture notes, slides, explanations (video), recorded lectures, and of course a homework.
Assignments (homeworks) are focused on algorithmic techniques, and are generally expecting answers "on paper". There are one or two homeworks that require programming and have to be demoed to the TAs
Topics covered include Analysis of Algorithms, sorting, Divide and Conquer, Greedy, Dynamic Programming, Amortized Analysis, Graph Algorithms, and other advanced topics.
To take the course, students are expected to have a basic background in math (discrete math, linear algebra, probabilities, calculus), some familiarity with basic algorithm design (sorting, greedy, graphs) and a basic background in imperative programming.