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