CMSC 37000: Algorithms -- Winter 2006

Assignments

After each class, find and study the relevant sections in the text.

______________________________________________________________________________________________________________________________________________________________

Homework 10 (March 2, 6:30pm. Due Tuesday, March 7)

Homework 9 (Feb 25, 5:30pm. Due Tuesday, February 28)

Homework 8 (Feb 19, 5:30am. Due Tuesday, February 21)

Links to material supporting the classes given by Pedro Felzenszwalb:

Hidden Markov Models and the Viterbi algorithm (Feb 7): Lawrence Rabiner's tutorial. (30 pages)
Line Segment Intersection algorithm (Feb 9): Dave Mount's notes. (6 pages)

Homework 7 (updated Feb 11, 3:30pm. Due Tuesday, February 14)

Homework 6 (due Tuesday, January 31)

"Loop invariants" handout (January 27)

Homework 5 (due Tuesday, January 24)

Homework 4 (due Tuesday, January 17)

Homework 3 (due Tuesday, January 17)

Homework 2 (due Tuesday, January 10)

"Binary Search" handout (January 5)

Homework 1 (due Tuesday, January 10)