Algorithms, May-June 2020 at CIS (Both Classes)

Instructor: David Woodruff
Lectures: 7-10ETpm on Friday (first class), 7-10ETpm on Saturday (second class)
Office Hours: Coordinate with Tianrui Liu and/or Handan Luo depending on your class
TAs: Tianrui Liu ( and Handan Luo (

Course Description Grading Latex Lectures Problem Sets References

Course Description

Design and Analyze Algorithms!
Algorithms: divide-and-conquer, hashing and data structures, polynomials, embeddings, Fast Fourier Transform, multiplicative weights
Analysis: recurrences, probabilistic analysis


Grading is based on 3 homeworks each worth 10%, an exam worth 20%, a final project worth 40%, and class participation worth 10%


We encourage homework solutions, scribe notes, and final projects to be typeset in LaTeX. If you are not familiar with LaTeX, see this introduction.


Problem Sets

  • Homework 1
  • Homework 2
  • Homework 3


    Materials from the following course might be useful in various parts of this course: Undergraduate Algorithms Class at Carnegie Mellon University
    Maintained by David Woodruff