CMSC 37000: Algorithms -- Winter 2007


HANDOUTS


Course home

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


Fundamental algorithms in number theory: Euclid's algorithm and modular exponentiation

Amortized cost

Loop invariants

The Method of Reverse Inequalities (problem set)

Divide and Conquer: The Karatsuba-Ofman integer multiplication algorithm

Dynamic programming: The knapsack problem

Binary search


Return to the course home page

Return to the Department of Computer Science home page

Go to top