CS70_Exam 2- Summer 2007 solution

# CS70_Exam 2- Summer 2007 solution - CS570 Analysis of...

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

CS570 Analysis of Algorithms Summer 2007 Exam 2 Name: _____________________ Student ID: _________________ Maximum Received Problem 1 10 Problem 2 20 Problem 3 20 Problem 4 10 Problem 5 20 Problem 6 20 Note: The exam is closed book closed notes.

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

View Full Document
1) 10 pts Mark the following statements as TRUE or FALSE . No need to provide any justification. [ TRUE/FALSE ] TRUE Binary search could be called a divide and conquer technique [ TRUE/FALSE ] FALSE If you have non integer edge capacities, then you cannot have an integer max flow [ TRUE/FALSE ] TRUE The Ford Fulkerson algorithm with real valued capacities can run forever [ TRUE/FALSE ] TRUE If we have a 0-1 valued s-t flow in a graph of value f, then we have f edge disjoint s- t paths in the graph [ TRUE/FALSE ] TRUE Merge sort works because at each level of the algorithm, the merge step assumes that the two lists are sorted
2) 20pts Prove or disprove the following for a given graph G(V,E) with integer edge capacities Ci a. If the capacities on each edge are unique then there is a unique min cut b.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ 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