CMSC 27200/37000 Algorithms -- Winter 2004
Handouts, assignments, tests

Mar. 12

Last years's final exam

Mar. 8

Midterm 2

Mar. 5

Homework 19 problems 19.1 - 19.2
Mar. 3

Homework 18 problems 18.1 - 18.2

Mar. 1

Homework 17 problems 17.1 - 17.3
Pseudocode for basic algorithms in Number Theory: the Euclidean algorithm and Repeated squaring

Feb. 27

Homework 16 problems 16.1 - 16.8
Branch-and-bound: improved exponential time bounds; Maximum independent sets in graphs

Feb. 23

Quiz 2

Feb. 20

Homework 15 problems 15.1 - 15.4

Feb. 13

Homework 14 problem 14.1
AVL Trees

Feb. 11

Homework 13 problem 13.1
Graphs and Digraphs

Feb. 9

Homework 12 problems 12.1 - 12.2

Feb. 4

Midterm 1

Feb. 2

Homework 11 problems 11.1 - 11.2

Jan. 30

A dynamic programming solution: maximum common substring
Linear time graph algorithms: digraph reversal, sorting adjacency lists, recognizing undirected graphs
k-way merge in O(nlog k) using a heap
Polynomiality of Knapsack with tiny input parameters
Homework 10 problems 10.1 - 10.6

Jan. 28

A dynamic programming solution: the "Interval Sum" problem
Homework 9 problems 9.1 - 9.3

Jan. 26

Homework 8 problems 8.1 - 8.3

Jan. 23

Batcher's Odd-Even Sorting Network: n=8 CORRECTED VERSION
Homework 7 problems 7.1 - 7.3

Jan. 21

Quiz 1

Jan. 19

Homework 6 problems 6.1 - 6.5

Jan. 16

A dynamic programming solution: maximum all-ones square.
Homework 5 problems 5.1 - 5.8

Jan. 14

String Edit Distance
Binary Search to find item in sorted array
Homework 4 problems 4.1 - 4.5

Jan. 12

Dynamic programming: the knapsack problem
Homework 3 problems 3.1 - 3.3

Jan. 9

The Karatsuba-Ofman algorithm
Evaluation of recurrent inequalities
Homework 2 problems 2.1 - 2.4

Jan. 7

Asymptotic Notation
Homework 1 problems 1.1 - 1.5

Return to course home page