Handed out: Tuesday May 6th
Due: Tuesday June 3 AT THE START OF CLASS
0) Do Exercise 1.2-3 on page 13
1) Do Exercise 2.1-3 on page 21 BUT do it for Binary Search under the additional
Input condition that the sequence is sorted. That is for all i and j such that 0
< i < j<= n, ai < aj
2) Do Problem 2-4 on page 39
3) Do Exercise 3.1-3 on page 50
4) Do Problem 3-3a on page 58
but don't worry about partitioning your list into equivalence classes
5) Do Problem 3-4 parts a, b, c on page 59
6) Do Exercise 7.1-1 on page 148 but with respect to the array A = {13, 19, 5,
12, 8, 7, 4, 11, 2, 9}
7) Do Exercises 7.2-3 on page 153
8) Do Problem 7-6 on page 163
Bonus Question: Exercise 2.3-7 on page 37