### CS5800 Algorithms Sec 2, FALL 2021

### ANNOUNCEMENTS
*check/reload this page every day

Gradescope HW submissions : Must be latex-ed pdfs.
Discussion forum :
piazza.com/northeastern/summer2021/cs580050585202150/home
- 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.

###