91.404 Midterm Exam
Fall 2008
NAME:
1. (5 points each) Give asymptotically tight upper (big O) bounds for T(n) in each of the
following recurrences. Justify your solutions by either giving the particu
91.404 Analysis of Algorithms
Final Exam
Name:
1. Recurrence (20 points) Related Outcomes: 1, 8
a. Find the tightest upper bound that you can on the closed-form solution for the
following recurrence:
Homework #5
1. (10 points) Exercise 6.1-5 (page 154):
Ans:
Yes. For an array with sorted order, we have A[i] <= A[j] for i<j, and satisfies that
A[PARENT(i)] <= A[i] since PARENT(i) < i.
2. (10 points