CS 3343/3341 Analysis of Algorithms
Spring 2004 Calendar
Week   Dates    Lecture Topics                   Assign-
 ments   		 Recita-
 tions   
1 January
13, 15		 Examples: GCD, Traveling Salesman.
Algorithm efficiency Jan 13, Jan 15 		Assign 1 None
2 Jan 20, 22
(19th: MLK)		 Algorithm efficiency, Big-Oh, etc.
Jan 20, Jan 22		 Assign 2 Rec 1
3 January
27, 29		 Brute-force, divide and conquer
Jan 27, Jan 29		 Assign 3 Rec 2
4 February
3, 5		 Matrix multiplication
Feb 03, Feb 05		 Assign 4 Rec 3
5 February
10, 12		 Master Theorem Feb 10
Searching lists Feb 12		 Assign 5 Rec 4
6 February
17, 19		 Correctness Proofs Feb 17
Heapsort Feb 19		 Assign 6 Rec 5
7 February
24, 26		 Heapsort (con't) Feb 24
Dynamic Programming Feb 26		 Assign 7
(answers)		 Rec 6
8 March
2, 4		 Review Mar 2
Mid-Term Exam Mar 4		 Exam
(answers)		 None
9 March
9, 11		 Dynamic P (con't) Mar 9
Wrap-up Mar 11 		Assign 8 Rec 7
               Remainder of course taught by Dr. Steven Kwek               
  May 7
10:30-1:15pm		 Final Exam Final+answers
 (Review)		  
 
     
  • Exams: There is an hour exam on Thurday of the eighth week
    as shown above, given from 3:30-4:45pm in class, March 4.
    Note that this is a change: previously the exam was
    scheduled for Feb 19; now it is March 4.

  • Assignments: These must be handed in by midnight on the
    Tuesday after the week assigned, for full credit. They
    are worth 75% of credit up to midnight on the Thursday
    after the week assigned. (Assignments can be turned
    in by hand in class or can be slipped under my door.)

  • Recitations: On T or R, 2:00-2:50pm. Work problems in teams
    and discuss extra material.

  • Lectures: An outline of lecture topics.