Lecture Notes and Slides

Links will fail if notes are not yet posted. In that case check back later.

These slides are constantly being updated throughout the quarter. The slides are often updated after each lecture to fill in missing details and correct mistakes. Hence, the slides will not be in the final form until after a particular topic is finished. Please check back and update them often.

Notes are in PDF format. You need the Acrobat Reader to view them. You can download the Acrobat Reader for free here

Divide and Conquer

Greedy Methods

Dynamic Programming

Randomized Algorithms

Comlexity classes P vs. NP

Search Techniques (Back Tracking)

Search Techniques (Branch and Bound)

Back to the Course Home Page