CS581: Algorithms, Spring 2014
Problem Set 8:
Maximum Flow
Due: Thursday, March 13, 2014, at the beginning of class
1. Suppose that you wish to find, among all minimum cuts in a flow network G, one that contains
the smallest number of edges crossing the c
CS581: Algorithms, Spring 2014
Study Guide 1:
Asymptotic Notation, Recurrences, Divide and Conquer, Dynamic Programming
General Study Notes:
As a practice, you should always be able to give the asymptotic runtime notation for an
algorithm that you are giv
CS581: Algorithms, Spring 2014
Problem Set 3:
Divide and Conquer II and Dynamic Programming I
Due: Thursday, January 30, 2014, at the beginning of class
1. How would you modify Strassens algorithm to multiply n x n matrices in which n is not an exact
powe
CS581: Algorithms, Spring 2014
Problem Set 2:
Recurrences and Divide and Conquer
Due: Thursday, January 23, 2014, at the beginning of class
1. Solve the following recurrences, showing your work. Assume T(1) = 1 in all cases. Give your
answers in notation.
CS581: Algorithms, Spring 2014
Problem Set 1:
Asymptotic Notation and Recurrences
Due: Thursday, January 16, 2014, at the beginning of class (12:40PM)
1. Work problem 3-3a on page 61-62 (Ordering by asymptotic growth rates).
Hints:
Refer to Section 3.2 an
CS581: Algorithms, Spring 2014
Study Guide 2:
Greedy Algorithms, Amortized Analysis
Exam #2 will cover material from Chapters 16, 17, 21, 23, 26, as well as homeworks 6-9.
Sections of the text not included on the exam are sections 16.4, 16.5, 21.2, 21.4,
CS581: Algorithms, Spring 2014
Problem Set 4:
Dynamic Programming II
Due: Thursday, February 6, 2014, at the beginning of class
1. Suppose that in the rod-cutting problem of Section 15.1, we also had limit li on the number of
pieces of length i that we ar
CS581: Algorithms, Spring 2014
Problem Set 5:
Dynamic Programming III
Due: Thursday, February 13, 2014, at the beginning of class
1. Work problem 15-3 on page 405 (Bitonic euclidean traveling-salesman problem). Your
solution must be a bottom-up dynamic pr
CS581 Advanced Design and Analysis of Algorithms Course Syllabus, Spring 2014
Page 1 of 3
Advanced Design and Analysis of Algorithms
CS581, Spring 2014
Class web page: http:/web.eecs.utk.edu/~parker/Courses/CS581-spring14
Meeting place/time: MK 525, Tuesd
CS581: Algorithms, Spring 2014
Problem Set 9:
Amortized Analysis
Due: Tuesday, March 25, 2014, at the beginning of class
1. Work problem 17.2-1, page 458 (Suppose we perform a sequence)
2. Work problem 17.3-3, page 462 (Consider an ordinary binary min-hea
CS581: Algorithms, Spring 2014
Problem Set 6:
Greedy Algorithms I
Due: Thursday, February 27, 2014, at the beginning of class
1. (Ch. 16) Not just any greedy approach to the activity-selection problem produces a maximumsize set of mutually compatible acti
CS581: Algorithms, Spring 2014
Problem Set 7:
Greedy Algorithms II
Due: Thursday, March 6, 2014, at the beginning of class
1. Work problem 16-2 (page 447, Scheduling to minimize average completion time).
2. Work exercise 23.1-10 on page 630 (Given a graph