CS 561, Study Problems
Prof. Jared Saia, University of New Mexico
NOT for Turnin - Just for Review for Final
1. Problem 26-3 from our textbook (Algorithmic Consulting)
2. Exercise 34.5-2 from textbook
CS 561, HW6
Prof. Jared Saia, University of New Mexico
Due: Nov 11th
1. Problem 4 from the 2014 midterm
2. Problem 5 from the 2014 midterm
3. Prove via induction that any tree over n nodes has exactly
CS 561, HW7
Prof. Jared Saia, University of New Mexico
Due: Dec. 2
1. Exercise 26.2-4: Minimum cut corresponding to maximum ow
2. Exercise 26.2-11 : Edge Connectivity
3. A bipartite graph is a graph t
CS 561, HW5
Prof. Jared Saia, University of New Mexico
Due: October 30th
1. (Probability) Solve Problem 5 on the midterm from 2013 at
http:/www.cs.unm.edu/saia/classes/561-f13/mid.pdf
2. Problem 17-2
CS 561, HW4
Prof. Jared Saia, University of New Mexico
Due: October 14th
1. Consider the following alternative greedy algorithms for the activity
selection problem discussed in class. For each algorit
CS 561, HW3
Prof. Jared Saia, University of New Mexico
Due: September 30th
1. Problem 4-5 (VLSI chip testing) - This is a really good divide and
conquer problem that I left out of the last hw
2. Show
CS 561, HW2
Prof. Jared Saia, University of New Mexico
Due: Sept. 16
1. In this problem you will use Cherno bounds to show that for most
of the levels of a skip list, the size of the level is very tig
CS 561, HW1
Prof. Jared Saia, University of New Mexico
Due: Sept. 4th
Exercise number are all from the third edition of Cormen, Leiserson,
Rivest and Stein. Remember: you are encouraged to work on the