CS70_Midterm_1_Sum2008

# CS70_Midterm_1_Sum2008 - CS570 Analysis of Algorithms...

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

CS570 Analysis of Algorithms Summer 2008 Exam I Name: _____________________ Student ID: _________________ ____4:00 - 5:40 Section ____6:00 – 7:40 Section Maximum Received Problem 1 20 Problem 2 20 Problem 3 10 Problem 4 15 Problem 5 10 Problem 6 10 Problem 7 15 Total 100 2 hr exam Close book and 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 or FALSE . No need to provide any justification. [ TRUE/FALSE ] There exist a perfect matching and a corresponding preference list such that every man is part of an instability, and every woman is part of an instability. [ TRUE/FALSE ] A greedy algorithm always returns the optimal solution. [ TRUE/FALSE ] The function 100n + 3 is O(n^2) [ TRUE/FALSE ] You are given n elements to insert into an empty heap. You could directly call heap insert n times. Or you could first sort the elements and then call heap insert n times. In either case, the asymptotic time complexity is the same. [ TRUE/FALSE ] If a problem can be solved correctly using the greedy strategy, there will only be one greedy choice (e.g. “choose the object with highest value to weight ratio”) for that problem that leads to the optimal solution. [ TRUE/FALSE ]
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 11

CS70_Midterm_1_Sum2008 - CS570 Analysis of Algorithms...

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

View Full Document
Ask a homework question - tutors are online