CS 10051 Section 007
		     Homework 1

   Due in class on Thursday, September 18th. Each question is worth 2 points.
   Unless stated otherwise, the exercises are from the textbook.


1. Exercise 2.1: Write pseudocode instructions to carry out ...

2. Exercise 2.10: Write an algorithm that is given your electric

3. Exercise 2.12: Develop a formal argument that "proves" that the sequential ...

4. Exercise 2.13: Modify the sequential search algorithm ...

5. Exercise 2.16: On the sixth line of the ...

6. Exercise 3.10: Suppose selection sort and bubble sort are both performed ...

7. Exercise 3:17. Consider the following list of names ...

8. Exercise 3.28: a. An algorithm that is ...

9. Exercise 3.31: Below is a pseudocode algorithm that ...

10. Trace the following sorting algorithm for sorting the list: 7 1 6 3 2 5 
   into ascending order.

	a)  Insertion sort.
	b)  Selection sort.
	c)  Bubble sort.
	e)  Quicksort.
 
   For each algorithm, describe what operations are being done.