| Lec. |
Date |
Topic |
CLRS Reading |
Notes |
Homework |
Solutions |
| 1 |
05/16 [Thu] |
Introduction and overview. Insertion sort. |
1, 2.1-2.2 |
L01.ps | pdf
|
H01.ps | pdf
|
ps |
pdf
|
| 2 |
05/17 [Fri] |
Asymptotic growth. Mergesort. |
2.3, 3 |
L02.ps | pdf
|
H02.ps | pdf
|
ps |
pdf
|
| 3 |
05/20 [Mon] |
Summations and recurrences. |
A, 4.1 |
L03.ps | pdf
|
H03.ps | pdf
|
ps |
pdf
|
| 4 |
05/21 [Tue] |
Recurrences. Strassen's algorithm. |
4.1-4.2, 28.1-28.2 |
L04.ps | pdf
|
H04.ps | pdf
|
ps |
pdf
|
| 5 |
05/22 [Wed] |
Master method. Quicksort. |
4.3-4.4, 7.1-7.2 |
L05.ps | pdf
|
H05.ps | pdf
|
ps |
pdf
|
| 6 |
05/23 [Thu] |
Quicksort. |
7.3-7.4, C.2 |
L06.ps | pdf
|
H06.ps | pdf
|
ps |
pdf
|
| 7 |
05/24 [Fri] |
Sorting lower bounds. Linear time sorting. |
8 |
L07.ps | pdf
|
H07.ps | pdf
|
ps |
pdf
|
| 8 |
05/27 [Mon] |
Selection. |
9 |
L08.ps | pdf
|
H08.ps | pdf
|
ps |
pdf
|
| 9 |
05/28 [Tue] |
Heaps. Heapsort. |
6 |
L09.ps | pdf
|
H09.ps | pdf
|
ps |
pdf
|
| 10 |
05/29 [Wed] |
Binary search trees. Skip lists. |
10, 12.1-12.3, handout[GT] |
L10.ps | pdf
|
H10.ps | pdf
|
ps |
pdf
|
| |
05/30 [Thu] |
Exam Review (L1-10) |
|
|
|
|
| |
05/31 [Fri] |
Exam 1 (L1-10) ps |
|
|
|
|
| 11 |
06/03 [Mon] |
Hashing. |
11.1-11.3 |
L11.ps | pdf
|
H11.ps | pdf
|
ps |
pdf
|
| 12 |
06/04 [Tue] |
Red-black trees. |
13 |
L12.ps | pdf
|
H12.ps | pdf
|
ps |
pdf
|
| 13 |
06/05 [Wed] |
Augmented search trees. Interval tree. |
14 |
L13.ps | pdf
|
H13.ps | pdf
|
ps |
pdf
|
| 14 |
06/06 [Thu] |
Dynamic programming. |
15.2-15.3 |
L14.ps | pdf
|
H14.ps | pdf
|
ps |
pdf
|
| 15 |
06/07 [Fri] |
Greedy algorithms. |
16.1-16.2 |
L15.ps | pdf
|
H15.ps | pdf
|
ps |
pdf
|
| 16 |
06/10 [Mon] |
Amortized Analysis. |
17.1-17.3 |
L16.ps | pdf
|
H16.ps | pdf
|
ps |
pdf
|
| 17 |
06/11 [Tue] |
Amortized Analysis. |
|
|
H17.ps | pdf |
ps |
pdf |
| 18 |
06/12 [Wed] |
Splay trees. |
handout [Kozen] |
L17.ps | pdf |
|
|
| |
06/13 [Thu] |
Exam Review (L11-17) |
|
|
|
|
| |
06/14 [Fri] |
Exam 2 (L11-17)
ps
|
|
|
H18.ps |
pdf
|
ps |
pdf
|
| 19 |
06/17 [Mon] |
Basic graph algorithms. |
B.4-B.5,22.1-22.4 |
L19.ps | pdf
|
H19.ps | pdf
|
ps |
pdf
|
| 20 |
06/18 [Tue] |
Basic graph algorithms. Minimum spanning trees. |
22, 23 |
L20.ps | pdf
|
H20.ps | pdf
|
ps |
pdf
|
| 21 |
06/19 [Wed] |
Minimum spanning trees. Union-find. |
23, 21.1-21.3 |
L21.ps | pdf
|
|
|
| 22 |
06/20 [Thu] |
Union-Find. Shortest paths. |
24.0, 24.3 |
L22.ps | pdf
|
H21.ps | pdf
|
ps |
pdf
|
| 23 |
06/21 [Fri] |
Shortest paths. NP-completeness. |
36 |
L23.ps | pdf
|
|
|
| 24 |
06/24 [Mon] |
NP-completeness. Reducibility. |
36 |
|
|
|
| |
06/27 [Thu] |
Final Exam (L1-24)
ps
(7:00-10:00 pm D106) |
|
|
|
|
![[Duke Computer Science]](dukecs.gif){kind=small}