Instructor: Alexander Dekhtyar, dekhtyar@csc.calpoly.edu, 14-212
Office Hours:
|
| Who | Where | |
| Tuesday | 11:00am - 12:00pm | Alex | 14-210 |
| Wednsday | 9:00am - 12:00pm | Alex | 14-210 |
Additional appoinments: send email.
| Syllabus | Postscript | ||
| Jupyter Labs Server | dev2.csc.calpoly.edu:5000 | login/password: Cal Poly login/password |
| September 25, Monday: | Lab 1, Part 1 | Due: September 27 | ||
| September 27, Wednesday: | Lab 1, Part 2 | Due: September 29 | ||
| September 29, Friday: | Lab 1, Part 3 | Due: October 2 | ||
| October 2, Friday: | Lab Exercise 1 | Due: October 4 | ||
| October 4, Wednesday: | Lab 2 | Due: October 11 | Strassen's Algorithm | |
| October 20, Friday: | Lab 3 | Due: October 27 | Finding a Median | |
| October 23, Monday: | In-class Worksheet | Due: October 25 | Best Buy/Sell pair (divide-and-conquer) | |
| October 30, Monday: | Lab 4 (paper-and-pencil) | Due: November 8 | MST: Kruskal's and Prim's algorithms | |
| October 30, Monday: | Lab 5, Part 1 | Due: November 1 | MST: Kruskal's and Prim's algorithms | |
| November 1, Wednesday: | Lab 5, Part 2 | Due: November 3 | MST: Kruskal's and Prim's algorithms | |
| November 8, Wednesday: | Lab 5, Part 3 | Due: November 13 | MST: Kruskal's and Prim's algorithms | |
| November 13, Monday: | Lab 6, Part 1 | Due: November 17 | Greedy Algorithms | |
| November 17, Friday: | Lab 6, Part 2 | Due: November 29 | Greedy Algorithms | |
| December 4, Friday: | Lab 6, Part 3 | Due: December 8 | Greedy Algorithms | |
| December 6, Wednesday: | Lab 7 | Due: December 12 | Dynamic Programming |
| Homework 1 | Due: October 16 | Postscript | [October 11, 2023] |
| Lecture 1 | What is an Algorithm? | Postscript | [March 29, 2010] | |
| Lecture 2 | Algorithm Analysis (Preliminaries) | Postscript | [March 29, 2010] | |
| Lecture 3 | Recurrence Relationships | Postscript | [May 24, 2010] | |
| Lecture 4 | Binary Search | Postscript | [September 22, 2017] | |
| Lecture 5 | Algorithm: Second Largest Array Element (selection) | Postscript | [April 4, 2010] | |
| Lecture 6 | Matrix Multiplication: Strassen's Algorithm | Postscript | [September 25, 2017] | |
| Lecture 7 | Selection Problems | Postscript | [May 24, 2010] | |
| Lecture 8 | Graph Algorithms: Part 1: Traversal | Postscript | [May 24, 2010] | |
| Lecture 9 | Graph Algorithms: Part 2: Shortest Paths | Postscript | [May 24, 2010] | |
| Lecture 10 | Graph Algorithms: Part 3: Minimum Spanning Trees | Postscript | [May 24, 2010] | |
| Lecture 11 | Greedy Algorithms: Part 1: Problems | Postscript | [April 7, 2010] | |
| Lecture 12 | Greedy Algorithms: Part 2: Activity Selection | Postscript | [April 8, 2010] | |
| Lecture 13 | Greedy Algorithms: Part 3: Theory | Postscript | [April 13, 2010] | |
| Lecture 14 | Dynamic Programming: Part 1: Rod Cutting | Postscript | [April 20, 2010] | |
| Lecture 15 | Dynamic Programming: Part 2: Overview | Postscript | [April 22, 2010] | |
| Lecture 16 | Dynamic Programming: Part 3: Chain Matrix Multiplication | Postscript | [May 4, 2010] | |
| Lecture 17 | Dynamic Programming: Part 4: Longest Common Subsequence | Postscript | [November 8, 2017] | |
| Lecture 18 | Dynamic Programming: Part 5: Edit Distance | Postscript | [November 8, 2017] |