| date | viewing | printing | notes | |
|---|---|---|---|---|
| No lecture | July 20 | |||
| Lecture 1 | July 21 | [lec01]pdf | [lec01p]pdf | Algorithms (Chapters 1 & 2) |
| Lecture 2 | July 22 | [lec02]pdf | [lec02p]pdf | Asymptotics 1 (Chapter 3) |
| Lecture 3 | July 27 | [lec03]pdf | [lec03p]pdf | Asymptotics 2 (Chapter 3) |
| Lecture 4 | July 29 | [lec04]pdf | [lec04p]pdf | Summations () |
| Lecture 5 | Aug 3 | [lec05]pdf | [lec05p]pdf | Recurrences (Chapter 4) |
| No lecture | Aug 4 | |||
| Review & Appl. | August 5 | [R&A01]pdf | [R&A01p]pdf | Review and Application of Mathematics Tools |
| Lecture 6 | August 10 | [lec06]pdf | [lec06p]pdf | Min & Max; Selection 1 (Chapter 9) |
| Lecture 7 | August 11 | [lec07]pdf | [lec07p]pdf | Selection 2; Quicksort ( Chapters 7 & 9) |
| Lecture 8 | August 12 | [lec08]pdf | [lec08p]pdf | Sorting; Dynamic Programming 1 (Chapter 15) |
| Lecture 9 | August 17 | [lec09]pdf | [lec09p]pdf | Dynamic Programming 2 (Chapter 15) |
| Lecture 10 | August 18 | [lec10]pdf | [lec10p]pdf | Matrix multiplication (Chapter 15) |
| Lecture 11 | August 19 | [lec11]pdf | [lec11p]pdf | LCS, Greedy Algorithms 1 ( Chapters 15 & 16) |
| Lecture 12 | August 24 | [lec12]pdf | [lec12p]pdf | Greedy Algorithms 2 (Chapter 16) |
| No lecture | August 25 | |||
| Review & Appl. | August 26 | [R&A02]pdf | [R&A02p]pdf | Design Methodologies |
| Lecture 13 | August 31 | [lec13]pdf [lec13]ppt | [lec13p]pdf | Heaps and priority queues (Chapter 6) |
| Lecture 14 | September 1 | [lec14]pdf | [lec14p]pdf | Hashing I (Chapter 11) |
| Lecture 15 | September 2 | [lec15]pdf, [lec15]ppt | [lec15p]pdf | Hashing II (Chapter 11) |
| Lecture 16 | September 7 | [lec16]pdf, [lec16]ppt | [lec16p]pdf | Binary search trees (Chapter 12) |
| Lecture 17 | September 8 | [lec17]pdf | [lec17p]pdf | Red-black trees (Chapter 13) |
| Lecture 18 | September 9 | [lec18]pdf | [lec18p]pdf | Red-black trees; indexed sets |
| Lecture 19 | September 14 | [lec19]pdf | [lec19p]pdf | Disjoint sets (Chapter 21) |
| Review & Appl. | September 15 | [R&A03]pdf | [R&A03p]pdf | Data Structures |
| Lecture 20 | September 16 | [lec20]pdf | [lec20p]pdf | BFS (Chapter 22) |
| Lecture 21 | September 21 | [lec21]pdf | [lec21p]pdf | DFS; topological sorting (Chpater 22) |
| Lecture 22 | September 22 | [lec22]pdf, [lec22]ppt, | [lec22p]pdf | Spanning Trees; Kruskal's Algorithm (Chapter 23) |
| Lecture 23 | September 23 | [lec23]pdf, [lec23]ppt, | [lec23p]pdf | MST: Prim's Algorithm (Chapter 23) |
| Lecture 24 | October 12 | [lec24]pdf, [lec24]ppt | [lec24p]pdf | Single-Source Shortest Paths (SSPs); Dijkstra's Algorithm (Chapter 24) |
| Lecture 25 | October 13 | [lec25]pdf | [lec25p]pdf | SSPs; Bellman-Ford Algorithm; DAGs; Difference Constraints (Chapter 24) |
| Lecture 26 | October 14 | [lec26]pdf | [lec26p]pdf | All-pairs shortest parts (Chapter 25) |
| Lecture 27 | October 19 | [lec27]pdf | [lec27p]pdf | Review Session |
| Lecture 28 | October 20 | [R and A04]pdf [SCC]pdf | R and A04p[]pdf [SCCp]pdf | Review and Appl. |