Department of Computer Science
Middlebury College
CS 302 - Algorithms and Complexity
Spring 2013

instructor: Dave Kauchak
e-mail: [first_initial][last_name]
office hours: MBH 635
  M/W 1-2:30pm
  F 11am-12
  and by appointment

time: T/Th 9:30-10:45am
location: MBH 403
web page: or go/cs302


Other information:


Note: This is a tentative schedule and will likely change
2/12introduction (.tex)Ch. 1, 2assignment 1 (.tex)
2/14big-O (ppt)Ch. 3assignment 2 (.tex) 
2/19recurrences (ppt)Ch. 4-4.1, 4.3-4.5assignment 3 (.tex) 
2/21quicksort, randomized algorithms (ppt)Ch. 7assignment 4 (.tex) 
2/26sorting conclusions (ppt)
linear sorting
Ch. 8assignment 5 (.tex) 
2/28order statistics (ppt),
basic data structures (ppt)
Ch. 9, 10assignment 6 (.tex) 
3/5amortized analysis, heaps (ppt)Ch. 6, Ch. 17.1assignment 7 (.tex) 
3/7heaps (ppt), binomial heaps (ppt)Ch. 19-19.3assignment 8 (.tex) 
3/12binary search trees (ppt)Ch. 12, 18assignment 9 (.tex) 
3/14B-trees (ppt), disjoint setsCh. 21.1-21.2assignment 10 (.tex) 
3/19review (ppt)  midterm
3/21hashtables (ppt)Ch. 11, except 11.3.3, 11.5  
4/2greedy algorithms (ppt) Ch. 16-16.3assignment 11 (.tex) 
4/4more greedy (ppt) assignment 12 (.tex) 
4/9dynamic programming (ppt)Ch. 15-15.4assignment 13 (.tex) 
4/11dynamic programming (ppt)Ch. 15.5assignment 14 (.tex) 
4/16graph basics (ppt)Ch. 22assignment 15 (.tex) 
4/18shortest paths (ppt)Ch. 24-24.3assignment 16 (.tex) 
4/23minimum spanning trees (ppt)Ch. 23assignment 17 (.tex) 
4/25network flow (ppt)Ch. 26-26.2assignment 18 (.tex) 
4/30flow applications (ppt)Ch. 26.3assignment 19 (.tex) 
5/2NP-completeness (ppt)Ch. 24assignment 20 (.tex) 
5/7NP-complete reductions (ppt) assignment 21 (.tex) 
5/9review (ppt)  final