{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS70_Final__Fall_2006

# CS70_Final__Fall_2006 - CS570 Analysis of Algorithms Fall...

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

CS570 Analysis of Algorithms Fall 2006 Final Exam Name: _____________________ Student ID: _________________ Maximum Received Problem 1 20 Problem 2 15 Problem 3 15 Problem 4 15 Problem 5 15 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) 20 pts Mark the following statements as TRUE , FALSE, or UNKNOWN . No need to provide any justification. [ TRUE/FALSE ] P is the class of problems that are solvable in polynomial time. [ TRUE/FALSE ] NP is the class of problems that are verifiable in polynomial time [ TRUE/FALSE ] It is not known whether P NP [ TRUE/FALSE ] If an NP-complete problem can be solved in linear time, then all the NP complete problems can be solved in linear time [ TRUE/FALSE ] Maximum matching problem in a bipartite graph can be efficiently solved thru the solution of an equivalent max flow problem [ TRUE/FALSE ] The following recurrence equation has the solution )). n log( n ( ) n ( T 2 = Θ n 3 ) 2 n ( T 2 ) n ( T + = [ TRUE/FALSE/UNKNOWN ] If a problem is not in P, it should be in NP-complete [ TRUE/FALSE/UNKNOWN ] If a problem is in NP, it must also be in P.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 11

CS70_Final__Fall_2006 - CS570 Analysis of Algorithms Fall...

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

View Full Document
Ask a homework question - tutors are online