General Information
For course policies, please see [logistics].
For online Q&A and discussion, please go to [slack].
For assignment submission, please go to “Gradescope” on Canvas.
For office hours, please see [schedule].
For some preliminaries, please see [preliminaries].
Visualization of various sorting algorithms [link].
All the source files/solutions etc. will be shared with any faculty/teachers (whether ND or not) upon request.
Exams
| Sample exams | Supplementary materials | Solution |
|---|---|---|
| Midterm-2022 | Guide Collaboration Doc | solution |
| Final-2022 | Guide Collaboration Doc | solution |
Assignments
| Assignment | Supplementary materials | Solution | Deadline (11PM by default) |
|---|---|---|---|
| WA01 on Gradescope | N/A | On Gradescope | Jan 20th |
| WA02 | latex source | solution | Jan 27th |
| WA03 | latex source | solution | Feb 3rd |
| WA04 | latex source | solution | Feb 10th |
| WA05 | latex source | solution | Feb 17th |
| WA06 | latex source | solution | Feb 26th |
| WA07 | latex source | solution | Mar 3rd |
| WA08 | latex source | solution | Mar 24th |
| WA09 | latex source | solution | Mar 31st |
| WA10 | latex source chain.pdf | solution | Apr 11th |
| WA11 | latex source | solution | April 16th |
| WA12 | latex source | solution | April 21st |
| WA13 | latex source | solution | April 28th |
| WA14 | latex source | solution | May 3rd |
Lectures
| Date | Lecture # | Topic | PPT | Extra Note | CLRS to read |
|---|---|---|---|---|---|
| 01/17 TUE | 01 | Intro. to Algorithms | ppt | ||
| 01/19 THU | 02 | Complexity Analysis | ppt | note | pp 16-29, 43-52 |
| 01/24 TUE | 03 | Complexity/Correctness Analysis | ppt | pp 24-38 | |
| 01/26 WED | 04 | Divide and Conquer | ppt | note | |
| 01/31 TUE | 05 | Divide and Conquer 2 | ppt | pp 88-93 | |
| 02/02 WED | 06 | Randomized Algorithms | ppt | pp 114-124 | |
| 02/07 TUE | 07 | Quicksort | ppt | practice | pp 170-181, 191-193 |
| 02/09 THU | 08 | Linear Time Algorithms | ppt | pp 194-204, 220-222 | |
| 02/14 TUE | 09 | Heaps | ppt | pp 151-166 | |
| 02/16 THU | 10 | Hash Tables | ppt | note | pp 253-260 |
| 02/21 TUE | 11 | Dynamic Programming 1 | ppt | note | pp 359-369 |
| 02/23 THU | 12 | Dynamic Programming 2 | ppt | running example | |
| 02/28 TUE | 13 | Dynamic Programming 3 | ppt | ||
| 03/02 THU | 14 | Greedy Algorithm 1 | ppt | note | pp 414-421 |
| 03/07 TUE | Exam | ppt | |||
| 03/09 THU | 15 | Greedy Algorithm 2 | ppt | ||
| 03/21 TUE | 16 | Amortized Analysis 1 | ppt | pp 451-462 | |
| 03/23 THU | 17 | Amortized Analysis 2 | ppt | pp 465-471 | |
| 03/28 TUE | 18 | Amortized Analysis 3 & Fib-Heap 1 | ppt | pp 505-512, 519-522 | |
| 03/30 THU | 19 | Fib-Heap 2 | ppt | pp 513-518 | |
| 04/04 TUE | 20 | Disjoint Set | ppt | pp 561-572 | |
| 04/06 THU | 21 | BFS/DFS | ppt | pp 595-620 | |
| 04/11 TUE | 22 | MST | ppt | pp 624-638 | |
| 04/13 THU | 23 | SS-SP | ppt | pp 644-662 | |
| 04/18 TUE | 24 | AP-SP | ppt | pp 693-704 | |
| 04/20 THU | 25 | NPC 1 | ppt | ||
| 04/25 TUE | 26 | NPC 2 | ppt | note | |
| 04/27 THU | 27 | NPC3 | ppt | ||
| 05/02 TUE | 28 | Approximation | ppt | pp 1108-1115 |