Description
Problems:
1. [10 points] KT Chapter 1, problem 1, page 22. (.jpg image)
2. [10 points] KT Chapter 1, problem 2, page 22. (.jpg image)
3. [10 points] KT Chapter 1, problem 4, page 23. (.jpg image) You may omit a runtime analysis, but write a
paragraph explaining why your algorithm is correct. (This doesn’t have to be very formal, but do try to make it
convincing.)
4. [10 points] KT Chapter 2, problem 2, page 67. (.jpg image) In (d), assume log2
.
5. [10 points] KT Chapter 2, problem 3, page 67. (.jpg image) Extra Credit: say, and prove, which of the relations
are actually Θ, rather than just big-O.
6. [10 points] KT Chapter 2, problem 5, page 68. (.jpg image)
2