Algorithms, Spring 2020 at CIS

Instructor:
David Woodruff

Lectures:
710ETpm on Saturday

Office Hours:
Coordinate with Reyna

TAs:
Reyna Wu (renawu@gmail.com)
Course Description
Design and Analyze Algorithms!
Algorithms: divideandconquer, hashing and data structures, randomization, linear programming
Analysis: recurrences, probabilistic analysis
Dual to Algorithms: complexity theory and lower bounds
New Models: data streams
Grading
Grading is based on 3 homeworks each worth 10%, an exam worth 20%, a final project worth 40%, and class participation worth 10%
Latex
We encourage homework solutions, scribe notes, and final projects to be typeset in LaTeX. If you are not familiar with LaTeX, see this introduction.
Lectures
Problem Sets
Homework 1
Homework 2
Homework 3
References
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