{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS70_Midterm_Exam_1_Sum_2006

# CS70_Midterm_Exam_1_Sum_2006 - CS570 Analysis of Algorithms...

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

CS570 Analysis of Algorithms Summer 2006 Exam 1 Name: _____________________ Student ID: _________________ Maximum Received Problem 1 20 Problem 2 10 Problem 3 10 Problem 4 10 Problem 5 10 Problem 6 20 Problem 7 20

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 ] The running time of an algorithm is θ (g(n)) if and only if its best-case running time is Ω (g(n)) and its average-case running time is O(g(n)). [ TRUE/FALSE ] A dynamic programming algorithm tames the complexity by making sure that no subproblem is solved more than once. [ TRUE/FALSE ] The memoization approach in dynamic programming has the disadvantage that sometimes one may solve subproblems that are not really needed. [ TRUE/FALSE ] A greedy algorithm finds an optimal solution by making a sequence of choices and at each decision point in the algorithm, the choice that seems best at the moment is chosen. [ TRUE/FALSE ] If a problem can be solved correctly using the greedy strategy, there will only be
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