CMSC-641 Algorithms Assignments (fall 99)
Read and follow the document
"
How to solve and write-up homework." Always, hand in each
of the three problems separately.
Homework 1: Fundamentals
(due 5:30pm, Tuesday, September 14)
- Problem 1: Problem 4-5 (sloppiness)
- Problem 2: Problem 6-2 (avg case analysis of max)
- Problem 3: Problem 10-2 (weighted median)
Homework 2: Dynamic Programming
(due Tuesday, September 21)
- Problem 1: Problem 16-1 (bitonic TSP)
- Problem 2: Exercise 16.3-6 (longest monotonic sequence)
- Problem 3: Problem 16-5 (Viterbi alg)
Homework 3: Greedy, Matroids, and Amortized Analysis
(due Tuesday, September 28)
- Problem 1: Exercise 17.4-2 (matrix matroid)
- Problem 2: Problem 17-3 (scheduling).Explicitly
identify the matroid.
- Problem 3: 18-3 (weighted balanced trees)
Homework 4: Loop Invariants, Fibonacci Heaps,
and Amortized Analysis
(due Tuesday, October 5)
- Problem 1: Do
Special Problem Fredman
(Fredman's Algorithm)
- Problem 2: Exercise 21.3-2 (Fibonacci Heaps)
- Problem 3: Problem 21-2 (Fibonacci Heaps)
Homework 5: Union/Find, Network Flow
(due Tuesday, October 12)
- Problem 1: Exercise 22.4-4 (analysis of union/find)
- Problem 2: Problem 22-1 (off-line min)
- Problem 3: Exercise 27.3-5 (d-regular bipartite graphs)
Homework 6: Network Flow
(due Tuesday, November 2)
- Problem 1: Exercise 27.5-4 (preflow-push)
- Problem 2: Problem 27-1 (escape problem)
- Problem 3: Problem 27-5 (scaling)
No HW due October 26.
Homework 7: Parallel Algorithms
(due Tuesday, November 9)
- Problem 1: Problem 28-2 (Batcher's odd-even merge)
- Problem 2: Problem 30-1 (parallel prefix)
- Problem 3: Problem 30-3 (connected components)
Project Proposal
(due Tuesday, November 16)
- Hand in TWO copies of your project proposal.
(Each group will critique one proposal and return it
with comments on Thursday, November 18.)
Homework 8: NP-Completeness
(due Thursday, December 2) [Last HW]
- Problem 1: Problem 36-1 (independent set)
- Problem 2: Problem 36-2 (graph coloring)
- Problem 3: Problem 37-1 (bin packing)