## COSI 30b Assignments

UL>
• Friday, 24 January, 1997

Due Tuesday 28 January
Read CL&R Chapter 1, Section II Introduction, Chapter 7
Explain, if possible, why page 8, top says "n times" for c_1.

Due Friday, 31 January
Suggest algorithms whose running times are not monotone
increasing in their arguments.
Provide best-, average- and worst-time costs for Selection Sort.
Do CL&R Exercises 1.3-3, 1.3-4, 1.3-5, 1.3-6
Do CL&R Problem 1-3d

• Friday, 31 January 1997

Due Tuesday, 4 February 1997
Read Chapter 8, Sections 1, 2, 3; be sure you can do the
exercises, but don't hand them in.

Due Friday, 7 February 1997
Do Problems 8-2 b, c, d; 8-3; 8-4 a, b; 8-5 a, b.

Due Tuesday, 11 February

• Friday, 7 February

Due Tuesday, 11 February

Due Friday, 14 February
Do Exercises 9.1-1, 9.1-3, 9.1-5, 9.1-6, 9.2-3, 9.2-4
Problem 9-1a, b; 9-2a.

• Friday, 14 February

There will be a quiz on Friday, 21 February, during class,
so there is no written assignment due next week

Due Tuesday, 18 February
Review Part III, Introduction and Chapter 11.

Due Tuesday, 25 February
Read Chapter 12, Sections 12.1, 12.2, 12.4 (12.3 has been deleted.)

Due Friday, 28 February
Do 12.1-2, 12.1-3; 12.2-1, 12.2-2, 12.2-3; 12.4-1, 12.4-4.

Due Tuesday, 11 March 1997
Review Sections 13.1, 13.2, 13.3; read Section 14.1

Due Friday, 14 March 1997
Do 13.1-1, 13.1-5; 13.2-2; 13.3-3, 13.3-6; 14.1-2, 14.1-4

Due Tuesday, 18 March 1997
Read Part IV, Introduction; Section 16.1, 16.2.

Due Friday, 21 March 1997
Do Exercises 16.1-1, 16.3-1, 16.4-1; Problem 16-2 (pseudocode only.)

Due Friday, 4 April 1997
Read Sections 17.1, 17.2, 17.3; no written assignment.
This was originally assigned for 28 March, which turned out to be a holiday, as did 1 April.

Due Tuesday, 8 April