![[Bowdoin Computer Science]](bowdoin-cs-logo.small.jpg){kind=logo}
| Lec. | Date | Topic | CLRS Reading | Notes** | Homework and Solutions |
| 1 | Sept 6 [Mon] | Introduction and overview.
Insertion sort. |
1, 2.1-2.2 | L01.pdf | H0.pdf |
| 2 | Sept 8 [Wed] | Mergesort. Asymptotic growth. | 2.3, 3 | L02.pdf | H1.pdf | Sol |
| 3 | Sept 13 [Mon] | Asymptotic growth and summations. | A, 4.1 | L03.pdf | |
| 4 | Sept 15 [Wed] | Summations and Recurrences. Zeno's paradoxes. | 4.1-4.2 | L04.pdf
Zeno's paradoxes |
H2.pdf | Sol |
| 5 | Sept 20 [Mon] | Recurrences, Master method, Strassen's matrix multiplication algorithm. | 4.3-4.4, 7.1-7.2 | L05.pdf | |
| 6 | Sept 22 [Wed] | Quicksort. | 7.3-7.4, C.2 | L06.pdf | |
| 7 | Sept 27 [Mon] | Sorting lower bounds. Linear time sorting. | 8 | L07.pdf | H3.pdf | Sol |
| 8 | Sept 29 [Wed] | Selection. | 9 | L08.pdf | |
| 9 | Oct 4 [Mon] | Heaps. Heapsort. | 6 | L09.pdf | H4.pdf | Sol |
| 10 | Oct 6 [Wed] | Binary search trees.
|
10, 12.1-12.3 | L10.pdf | |
| 11 | Oct 13 [Wed] | Exam Review (L1-L10)
Practice: 231 Fall 2003 For other practice exams check links |
|
||
| Oct 18 [Mon] | Exam 1 (L1-L11) | ||||
| 12 | Oct 20 [Wed] | Skip lists. Hashing. | 11.1-11.3, handout[GT], skiplists.pdf | L11.pdf | H5.pdf |
| 13 | Oct 25 [Mon] | Exam hand back and discussion.
Red-black trees. |
13
Animation RB-trees RB-trees |
L12.pdf | |
| 14 | Oct 27 [Wed] | Red-black trees. Augmented search trees. | 13, 14 | L13.pdf | Joke of the day
(replace grad with undergrad.. :) ) |
| 15 | Nov 1 [Mon] | Augmented search trees. Interval tree. | 14 | H6.pdf | Sol | |
| 16 | Nov 3 [Wed] | Dynamic programming. | 15.2-15.3 | L14.pdf | H7.pdf |
| 17 | Nov 8 [Mon] | Greedy algorithms. | 16.1-16.2 | L15.pdf | H8.pdf | Sol |
| 18 | Nov 10 [Wed] | Amortized Analysis. | 17.1-17.3 | L16.pdf | |
| 19 | Nov 15 [Mon] | Splay trees. | animation | L17.pdf
handout [Kozen] |
H9.pdf | Sol |
| 20 | Nov 17 [Wed] | Pessimal algorithms.
Exam Review (L10-20) Practice: 231 Fall 2003 | Sol For other practice exams check links |
Pessimal algorithms (Broder, Stolfi) | ||
| Nov 22 [Mon] | Exam 2 (L12-20) | ||||
| 21 | Nov 29 [Mon] | Exam hand back and discussion. Basic graph algorithms: BFS, DFS. | B.4-B.5,22.1-22.4 | basicgraph.pdf | H10.pdf | Sol |
| 22 | Dec 1 [Wed] | Topological sort. | 22.1-22.4 | ||
| 23 | Dec 6 [Mon] | Shortest paths. | 24.0, 24.3 | shp,pdf | H11.pdf | Sol |
| 24 | Dec 8 [Wed] | Minimum spanning trees. Union-find. | 23, 21.1-21.3 | mst.pdf | |
| TBD | Final review. | review.pdf | |||
| Dec 17, 2-5pm, Searles 223 | Final Exam (L1-24) |