CS70_Midterm_Exam_1_Sum_2006

CS70_Midterm_Exam_1_Sum_2006 - CS570 Analysis of Algorithms...

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

View Full Document Right Arrow Icon
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
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) 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 ]
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/15/2011 for the course CS 570 taught by Professor Shahriarshamsian during the Spring '08 term at USC.

Page1 / 9

CS70_Midterm_Exam_1_Sum_2006 - CS570 Analysis of Algorithms...

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

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