CSC 415 Foundations of Computer Science I
Homework #6
Due: Feb 26 (1 week)
Section 3.5 (p. 150)
27, 33, 42
Additional notes:
For question #27, write explanation on why the
theta complexity you chose is correct for the algorithm.
For question #33, proof is required. So
you must give c and n0.
Section 5.1 (p. 232-233)
2, 9, 10, 11, 33 (for n = 4), 63
For #9-11, assume that A0 is 2000, A1 is 2000 + 2000
+ interest on 2000, etc.
As a hint, once again you need to use strong
mathematical induction for #63.