CMSC 37000: Algorithms -- Winter 2010


HANDOUTS


Course home

A large part of the prerequisites is covered in the instructor's Discrete Mathematics Lecture Notes.


Asymptotic Equality and Inequality

Binary search

Dynamic programming: The knapsack problem

Divide and Conquer: The Karatsuba-Ofman integer multiplication algorithm

The Method of Reverse Inequalities

Amortized analysis

Loop invariants

Lovász toggle

Repeated Squares and Euclid's Algorithm


Return to the course home page

Return to the Department of Computer Science home page

Go to top