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