CS 232 - Algorithms and Data Structures

An index page for various class resources

last modified 04/26/2006

Syllabus

Quizzes

• Quiz 1 - Friday, January 27
• Quiz 2 - Friday, February 10
• Quiz 3 - Wednesday, March 1
• Quiz 4 - Friday, March 17
• Quiz 5 - Friday, March 31
• Quiz 6 - Wednesday, April 12
• Quiz 7 - Monday, April 24
• Quiz 8 - Wednesday, May 3

Readings

• 4/28/06, Weiss, Chapter 20
• 4/21/06, Weiss, Chapter 19
• 4/4/06, Weiss, Chapter 18
• 3/24/06, Weiss, Section 7.6
• 3/13/06, Weiss, Chapter 8
• 2/8/06, Weiss, Chapter 7
• 1/16/06, Weiss, Chapter 5

Homework

• Problems 18.1, 18.2, 18.3, and 18.6; due 4/12, in class
• Problems 8.1abc, 8.4, 8.5, and 8.6; due 3/22, in class
• Show that the following recurrence relation yields a quadratic big-oh bound: T(N) = 3T(N/2) + O(N²); T(1) = c₁; due 2/20/06, at noon
• Problem 5.14, and show that the following recurrence relation yields a linear big-oh bound:    T(N) = T(3N/4) + T(N/6) + kN; T(1) = c₁; due 2/17/06, in class
• Problems 5.11 and 5.17, due 1/20/06, in class

Programming Assignments

•     Program 1 - Skyline, due Friday, March 17; portion due Friday February 5 (Class test cases now available: PhaseIII, PhaseIV/V); due to slow grading, most people's Phase V is due Monday, April 3.)
•     Program 2 - Edit Distance, due Friday, April 28; portions due Tuesday/Wednesday, April 11/12  (Class tests now available.  Also EditHopeful.jar was updated at 4:30 p.m. on April 19.  See links on assignment page)