CS70_Exam 2- Summer 2007 solution

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

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

View Full Document Right Arrow Icon
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.
Background image of page 1

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

View Full DocumentRight Arrow Icon
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
Background image of page 2
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. If we multiply each edge with the same multiple “f”, the max flow also gets
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/08/2010 for the course CS 570 taught by Professor Shahriarshamsian during the Fall '08 term at USC.

Page1 / 9

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

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online