| Lecture No | date | View version | printing version | notes | ||
|---|---|---|---|---|---|---|
| Lecture 1 | July 25 | [lec01]pdf | [lec01p]pdf | Algorithms (Chapters 1 & 2) | ||
| Lecture 2 | July 25 | [lec02]pdf | [lec02p]pdf | Asymptotics 1 (Chapter 3) | ||
| Lecture 3 | July 27 | [lec03]pdf | [lec03p]pdf | Asymptotics 2 (Chapter 3) | ||
| Lecture 4 | August 1 | [lec04]pdf | [lec04p]pdf | Summations | ||
| Lecture 5 | August 1 | [lec05]pdf | [lec05p]pdf | Recurrences (I) (Chapter 4) | ||
| Lecture 6 | August 3 | [lec06]pdf | [lec06p]pdf | Recurrences(II) (Chapter 4) | ||
| Review & Appl. | August 8 | [R&A01]pdf | [R&A01p]pdf | Review and Application of Mathematics Tools | ||
| Lecture 7 | August 8 | [lec07]pdf | [lec07p]pdf | Min & Max; Selection 1 (Chapter 9) | ||
| Lecture 8 | August 10 | [lec08]pdf | [lec08p]pdf | Selection 2; Quicksort (Chapters 7 & 9) | ||
| Lecture 9 | August 15 | [lec09]pdf | [lec09p]pdf | Sorting; Dynamic Programming (DP) 1 (Chapter 15) | ||
| Lecture 10 | August 15 | [lec10]pdf | [lec10p]pdf | Dynamic Programming 2 (Chapter 15) | ||
| Lecture 11 | August 17 | [lec11]pdf | [lec11p]pdf | Matrix multiplication (Chapter 15) | ||
| Lecture 12 | August 22 | [lec12]pdf | [lec12p]pdf | Longest Common Sequence (Chapter 15) | ||
| Lecture 13 | August 22 | [lec13]pdf | [lec13p]pdf | Greedy Algorithms 1 (Chapter 16) | ||
| Review & Appl. | August 24 | [R&A02]pdf | [R&A02p]pdf | Design Methodologies | ||
| Lecture 14 | August 29 | [lec14]pdf | [lec14p]pdf | Heaps and Priority Queues(Chapter 6) | ||
| Lecture 14 | August 29 | [lec14]pdf [lec14]ppt | [lec14p]pdf | Priority Queues (Chapter 6) | ||
| Lecture 15 | August 31 | [lec15]pdf | [lec15p]pdf | Hashing I (Chapter 11) | ||
| Lecture 16 | September 5 | [lec16]pdf [lec16]ppt | [lec16p]pdf | Hashing II (Chapter 11) | ||
| Lecture 17 | September 5 | [lec17]pdf [lec17]ppt | [lec17p]pdf | Binary search trees (Chapter 12) | ||
| Lecture 18 | September 7 | [lec18]pdf | [lec18p]pdf | Red-black trees (Chapter 13) | ||
| Mid Semester Break (Monday 12 September - Friday 23 September) | ||||||
| Lecture 20 | September 26 | [lec19]pdf | [lec19p]pdf | Red-black trees; indexed sets (Chapter 13) | ||
| Lecture 21 | September 26 | [lec20]pdf | [lec20p]pdf | Disjoint sets (Chapter 21) | ||
| Lecture 22 | September 28 | [lec21]pdf | [lec21p]pdf | BFS/DFS; topological sorting(Chapter 22) | ||
| Review & Appl. | October 12 | [R&A03]pdf | [R&A03p]pdf | Data Structures | ||
| Lecture 23 | October 17 | [lec23]pdf | [lec23p]pdf | Minimum spanning trees: Kruskal's algorithm (Chapter 23) | ||
| Lecture 24 | October 17 | [lec24]pdf | [lec24p]pdf | MST: Prim's algorithm (Chapter 23) | ||
| Lecture 25 | October 19 | [lec25]pdf [lec25]ppt | [lec25p]pdf | Single-Source Shortest Paths (SSPs): Dijkstra's algorithm (Chapter 24) | ||
| Lecture 26 | October 24 | [lec26]pdf | [lec26p]pdf | SSPs; Bellman-Ford Algorithm; DAGs; Difference Constraints (Chapter 24) | ||
| Lecture 27 | October 24 | [lec27]pdf | [lec27p]pdf | All-pairs shortest paths (Chapter 25) | ||
| Lecture 28 | October 26 | [graph alg. review]pdf | [graph alg. review]pdf | Graph algorithms R & A | ||
| Lecture 29 | October 31 | [lec29]pdf | [lec29p]pdf--> | Course Review Session (Past Final Exam.) | ||
| Final Exam | November 10 (Thursday) | |||||