CS 232 - Algorithms and Data Structures
An index page for various class resources
last modified 02/13/2006
Syllabus
New SkylineViewer class available (reports bogus skylines!) Assignment link updated; also available here.
Quizzes
- Quiz 1 - Friday, January 28
- Quiz 2 - Friday, February 11
- Quiz 3 - Friday, February 25
- Quiz 4 - Monday, March 14
- Quiz 5 - Wednesday, March 23
- Quiz 6 - Friday, April 8
- Quiz 7 - Friday, April 22
- Quiz 8 - Wednesday, May 4
Readings
- 4/1/05 Weiss, Chapter 20
- 3/16/05 Weiss, Chapter 19
- 3/7/05 Weiss, Chapter 18
- 2/3/05 Weiss, Chapter 7
- 1/28/05 Weiss, Chapter 5, Sections 4-8; Chapter 8, Sections 4-6
- 1/17/05 Weiss, Chapter 5, Sections 1-3; Chapter 8, Sections 1-3
Homework
- Due Monday, Feb. 21: Problems 5.5, and prove the best possible bounds that you can for the following two problems. It is NOT sufficient to cite a theorem from the book. You must complete the proof.
T(N) = T(3N/4) + T(N/6) + cN; T(1) = k; and
T(N) = T(N/3) + c; T(1) = k - Due Wednesday, Feb. 9, Problem 5.25
- Due Thursday, Feb. 3, 3 p.m., Problems 5.7, 5.16
- Due Friday, Jan. 28, Problems 5.14 and 5.15a (do part a only for all code fragments)
- Due Friday, Jan. 21, Problems 5.11 and 5.17
Programming Assignments