CSE201 - Analysis of Algorithms
Course Basics
Class: TuTh, Soc Sci 2 071, 11:40AM-1:15PM
Instructor: C. (Sesh) Seshadhri (sesh@)
Office hours: Tue, 1:30-2:30
Piazza: Piazza link
Course Description
Introduction to the analysis of algorithms, at the graduate level. We assume that you . We will cover a variety of algorithmic
techniques and their analysis: graph traversals, divide and conquer, dynamic programming, and greedy algorithms.
Students should have taken an undergraduate course in algorithms and should be familiar
with the basics (data structures, analysis using big-Oh notation, the concept of graphs). Students will need to write proofs in Latex.
Course Textbook
We will mostly follow Introduction to Algorithms, Third Edition by Cormen, Leiserson, Rivest and Stein.