[Bowdoin Computer Science]

CS231 Fall 2003: Syllabus

Lec. Date Topic CLRS Reading Notes, Homework
1 Sept 4 [Thu] Introduction and overview. Insertion sort. 1, 2.1-2.2  
2 Sept 9 [Tue] Asymptotic growth. Mergesort. 2.3, 3 H1.pdf |Sol
3 Sept 11 [Thu] Summations and recurrences. A, 4.1  
4 Sept 16 [Tue] Recurrences. 4.1-4.2 H2.pdf |Sol
5 Sept 18 [Thu] Recurrences and Master method. 4.3-4.4, 7.1-7.2  
6 Sept 23 [Tue] Quicksort. 7.3-7.4, C.2 H3.pdf | Sol
7 Sept 25 [Thu] Quicksort. Sorting lower bounds. Linear time sorting. 8  
8 Sept 30 [Tue] Linear time sorting. Selection. 8, 9 H4.pdf | Sol
9 Oct 2 [Thu] Heaps. Heapsort. 6  
10 Oct 7 [Tue] Binary search trees. 10, 12.1-12.3 H5.pdf | Sol
  Oct 9 [Thu] Skip lists. Exam Review (L1-L9) handout[GT]   
  Oct 14 [Tue] Exam 1 (L1-L9)    
11 Oct 16 [Thu] Exam solutions. Zeno's paradoxes. handout  
12 Oct 23 [Thu] Quiz. Hashing. 11.1-11.3 H6.pdf  Sol 
13 Oct 28 [Tue] Red-black trees. 13 H7.pdf  
14 Oct 30 [Thu] Augmented search trees. Interval tree. 14  
15 Nov 4 [Tue] Dynamic programming. 15.2-15.3  
16 Nov 6 [Thu] Greedy algorithms. 16.1-16.2 H8.pdf | sol 
17 Nov 11 [Tue] Amortized Analysis. 17.1-17.3  
18 Nov 13 [Thu] Splay trees. handout [Kozen] H9.pdf  | sol 
  Nov 18 [Tue] Exam Review (L10-17)      
  Nov 20 [Thu] Exam 2 (L10-17) | Sol    
19 Nov 25 [Tue] Exam hand back and discussion. Basic graph algorithms. Pessimal algorithms. B.4-B.5,22.1-22.4 Pessimal algorithms H10.pdf | sol
20 Dec 2 [Tue] BFS, DFS, Topological sort. 22.1-22.4  
21 Dec 4 [Thu] Shortest paths. 24.0, 24.3 H11.pdf | sol 
22 Dec 9 [Tue] Minimum spanning trees. Union-find. 23, 21.1-21.3  
23 Dec 11 [Thu] Graph review. Complexity theory. 36  
Dec 16 7-9pm Final review.  
  Dec 19, 2-5pm Final Exam (L1-23)