CS124 HW #1
Friday, February 14
- [10] Problem 1.1.3 pg 5
- [15] Problem 1.2-2 pg 11
- [15] Problem 1.3-5 pg 15
- [15] Problem 1.4 -1 pg 17
- [10] Problem 2.1-8 pg 32
- [10] Problem 8.2-3 pg 160
- [10] Problem 8.2-4 pg 160
- [15] Solve the recurrence relation: T(n) = T(n-a) + T(a) + n where a>= 1 is
a constant, by using iteration to generate a guess and then using substitution
to verify it. Show all work.