The assignment:
This is a non-programming assignment made up of exercises from the text. Some of the problems call for algorithms. Use the same pseudocode conventions described in class and in the text. Some of the problems call for answers for which I want you to supply a supporting argument. These are noted below. Be sure to make your pseudocode and arguments clear and complete.

• (2 points) Exercise 1.2-3, page 13. Before solving this problem, record your first guess for discussion in class. In your writeup, show how you arrived at your final answer.
• (8 points) Problem 1-1, page 13. Just show the answers for the first (1 second) column. Hint: use exponential notation for the answer for lg(n).
• (5 points) Exercise 2.3-2, page 36. (The "standard" way does not use sentinels.)
• (5 points) Exercise 2.3-5, page 37. Your argument for the running time of Binary Search can be informal.