CS 232 - Algorithms and Data Structures

An index page for various class resources

last modified 04/28/2004

Syllabus

Quizzes

• Quiz 1 - Wednesday, January 28
• Quiz 2 - Wednesday, February 11
• Quiz 3 - Monday, February 23
• Quiz 4 - Friday, March 5
• Quiz 5 - Friday, March 26
• Quiz 6 - Wednesday, April 7
• Quiz 7 - Friday, April 23
• Quiz 8 - Wednesday, May 5

Readings

•   1/19/04    Weiss, Chapter 5, Sections 1-3; Chapter 8, Sections 1-3 
•   1/26/04    Weiss, Chapter 5, Sections 4-8
•   2/18/04    Weiss, Chapter 6
•   3/19/04    Weiss, Chapter 18
•   3/31/04    Weiss, Chapter 19, Sections 1-4
•   4/13/04    Weiss, Chapter 21, Sections 1-3
•   4/23/04    Weiss, Chapter 14

Homework

• Due Saturday, May 8: Phase IV of the Spell Checker
• Due Monday, April 19: Problems 19.1 and 19.2
• Due Wednesday, Apr. 7: Problems 18.3, 18.6, 18.9, and find an O(N) algorithm do determine if a binary tree is balanced.  Use the AVL (depths off by at most one) definition of balanced. 
• Due Tuesday, Mar. 16: Phase III of the Spell Checker
• Due Friday, Feb. 20: OPTIONAL, score to be added to results of last Monday's homework:
     T(N) = T(N-3) + c*(2N); T(1) = k;   and
     T(N) = T(N/7) + 2T(3N/7) + cN; T(1) = k 
  NOTE:  Since this wasn't posted until Thursday morning, it isn't due until Friday at 6 p.m.!
• Due Wednesday, Feb. 18: Phase II of the Spell Checker
• Due Monday, Feb. 16: Problems 5.3, 5.5, and prove the best possible bounds that you can for the following two problems:
     T(N) = T(3N/4) + T(N/6) + cN; T(1) = k;   and
     T(N) = T(N/3) + c; T(1) = k
• Due Monday, Feb. 9: Phase I of the Spell Checker
• Due Friday, Jan. 30: Problems 5.12, 5.14, 5.16; extra credit 5.17
• Due Monday, Jan. 26: Problems 5.7, 5.11, 5.15