CS570 Exam II Spring 2012 (2)

# CS570 Exam II Spring 2012 (2) - CS570 Analysis of...

• Notes
• dang026tangwenye11
• 8

This preview shows pages 1–3. Sign up to view the full content.

CS570 Analysis of Algorithms Spring 2012 Exam II Name: _____________________ Student ID: _________________ ____12:30 PM Section ____2:00 PM Section Maximum Received Problem 1 20 Problem 2 20 Problem 3 20 Problem 4 20 Problem 5 20 Total 100 2 hr exam Close book and notes If a description to an algorithm is required please limit your description to within 200 words, anything beyond 200 words will not be considered. This study resource was shared via CourseHero.com

This preview has intentionally blurred sections. Sign up to view the full version.

1) 20 pts Mark the following statements as TRUE , FALSE . No need to provide any justification. [ FALSE ] If f is a maximum s-t flow in a flow network G, then for all edges e out of s, we have f(e) = c e . [ FALSE ] Let (A, B) be a minimum s-t cut with respect to the capacities { c e : e E}. Now suppose we add 1 to every capacity, then (A,B) is still a minimum s-t cut with respect to these new capacities {1 + c e : e E}. [ TRUE ] If we multiply each edge with t he same positive multiple “f”, the max flow also gets multiplied by the same factor. [ TRUE ] If a problem can be solved by dynamic programming, then it can always be solved by exhaustive search. [ TRUE ] Sequence alignment problem between sequence X and sequence Y can be solved using dynamic programming in O(mn) when |X| = m and |Y| = n. [ FALSE ] Bellman-Ford algorithm cannot solve the shortest path problem in graphs with negative cost edges in polynomial time. [ FALSE ] If a dynamic programming solution is set up correctly, i.e. the recurrence equation is correct and the subproblems are always smaller than the original problem, then the resulting algorithm will always find the optimal solution in polynomial time. [ TRUE ] In the Ford Fulkerson algorithm, choice of augmenting paths can affect the number of iterations. [ FALSE ] If in a flow network all edge capacities are distinct, then there exists a unique min-cut. [ TRUE ] Max flow in a flow network can be found in polynomial time.
This is the end of the preview. Sign up to access the rest of the document.
• Fall '11
• Arthur
• Trigraph, ar stu, Shortest path problem, Flow network, Maximum flow problem, Max-flow min-cut theorem

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern