USC/Viterbi/Computer Science/CSCI 303: Analysis of Algorithms – HW 3

Due March 25, 2010

(The problem sets are due at the beginning of the class. I will not accept late homework.
You are expected to solve the homework problems on your own. You should cite any
sources that you use on problem sets other than the textbook, TA and instructor.)

1. Time analysis[10 points]

Use mathematical induction to prove that the solution of the recurrence

 1 n  20
T ( n)  
T (n / 3)  T ( 2n / 3)  n n  20

is O ( n log n) .

2. Running an algorithm
a. Ex. 15.2-1 [Page 378] (10 points)

b. Ex. 15.4-1 [Page 396] (10 points)

3. Algorithm design
a. Ex. 15.4-5 [Page 397] (15 points)

b. Pr. 15-4 [Page 405] (20 points)

c. Pr. 15-6 [Page 408] (20 points)

d. Pr. 15-7 [Page 408] (20 points)

e. Pr. 15-10 [Page 410] (20 points)

f. Pr. 15-12 [Page 411] (20 points)

4. Mathematical structures and proofs

a. Ex 15.3-3 [Page 389] (10 points)