CS 245 • Spring 2011

Schedule

Please keep in mind that this schedule is tentative, and may change at any time.

Topics Deadlines
Week 01
01/24 & 01/26
Introduction,
Algorithm Analysis I
 
Week 02
01/31 & 02/02
Algorithm Analysis II,
Recurrence Relations
 
Week 03
02/07 & 02/09
Basic Data Structures Homework #1 Due
Mon 02/09 @ 2:40pm
Week 04
02/14 & 02/16
Binary Search Trees, Heaps  
Week 05
02/21 & 02/23
No class 02/21
Trees IV
Homework #2 Due
Wed 02/21 @ 2:40pm
Week 06
02/28 & 03/02
Sorting Algorithms I,
Sorting Algorithms II
Project #1 Due
Mon 02/28 @ 2:40pm
Week 07
03/07 & 03/09
Midterm Review
Midterm Exam #1
Homework #3 Due
Mon 03/07 @ 2:40pm
Week 08
03/14 & 03/16
Spring Break – No Classes
Week 09
03/21 & 03/23
Midterm Discussion,
Sorting Algorithms III
Project #2 Due
Wed 03/23 @ 2:40pm
Week 10
03/28 & 03/30
Hash Tables
Disjoint Sets
 
Week 11
04/04 & 04/06
Trees V,
Trees VI
Homework #4 Due
Mon 04/04 @ 2:40pm
Week 12
04/11 & 04/13
Graphs I
Graphs II
Project #3 Due
Wed 04/13 @ 2:40pm
Week 13
04/18 & 04/20
Midterm Review
Midterm Exam #2
Homework #5 Due
Mon 04/18 @ 2:40pm
Week 14
04/25 & 04/27
Midterm Retry
Graphs III
Homework #6 Due
Mon 04/25 @ 2:40pm
Week 15
05/02 & 05/04
Hard Problems
Project 4 Help
Homework #7 Due
Wed 05/07 @ 2:40pm
Week 16
05/09 & 05/11
Dynamic Programming
Final Review
Project #4 Due
Wed 05/16 @ 3:00pm
Finals Week
05/16 3:00pm
Final Exam HR 235 at 3:00pm

See the news pages for the course calendar.