Instructor: Alexander Dekhtyar, dekhtyar@csc.calpoly.edu, 14-215
Office Hours:
|
| Who | Where | |
| Tuesday | 11:00am - 12:00pm | Alex | 14-215 |
| Wednsday | 9:00am - 12:00pm | Alex | 14-215 |
| Thursday | 1:00pm - 2:00pm | Alex | 14-215 |
Additional appoinments: send email.
Final Exam Date: Thursday, June 12, 2008, 7:10am
| Syllabus | Postscript |
| Lab 1 | Due: April 1 | Remembering CSC 103 | Postscript | Lab Data | [March 29, 2010] | |
| Lab 1-2 | Due: April 8 | Counting comparisons | Postscript | [March 31, 2010] | ||
| Lab 2 | Due: April 13 | Greedy Algorithms #1 | Postscript | [April 7, 2010] | ||
| Lab 3 | Due: April 20 | Greedy Algorithms #2 | Postscript | Lab Data | [April 13, 2010] | |
| Lab 4 | Due: April 29 | Dynamic Programming #1 | Postscript | [April 20, 2010] | ||
| Lab 5 | Due: May 13 | Dynamic Programming #2 | Postscript | [May 11, 2010] | ||
| Lab 6 | Due: May 25 | Dynamic Programming #3 | Postscript | [May 13, 2010] | ||
| Lab 7 | Due: May 27 | Minimum Spanning Trees | Postscript | [May 24, 2010] | ||
| Lab 8 | Due: Jine 5 | Dynamic Programming #4 | Postscript | [June 1, 2010] |
Lab Data
| Homework 1 | Due: May 6 | Postscript | [May 4, 2010] |
| Lecture 1 | What is an Algorithm? | Postscript | [March 29, 2ch010] | |
| Lecture 2 | Algorithm Analysis (Preliminaries) | Postscript | [March 29, 2010] | |
| Lecture 3 | Algorithm: Second Largest Array Element (selection) | Postscript | [April 4, 2010] | |
| Lecture 4 | Greedy Algorithms: Part 1: Problems | Postscript | [April 7, 2010] | |
| Lecture 4-1 | Greedy Algorithms: Part 2: Making Change | Postscript | [April 7, 2010] | |
| Lecture 4-2 | Greedy Algorithms: Part 3: Egyptian Fractions | Postscript | [April 7, 2010] | |
| Lecture 4-3 | Greedy Algorithms: Part 4: Activity Selection | Postscript | [April 8, 2010] | |
| Lecture 5 | Greedy Algorithms: Part 5: Theory | Postscript | [April 13, 2010] | |
| Lecture 7 | Dynamic Programming: Part 1: Rod Cutting | Postscript | [April 20, 2010] | |
| Lecture 8 | Dynamic Programming: Part 2: Overview | Postscript | [April 22, 2010] | |
| Lecture 9 | Dynamic Programming: Part 3: Chain Matrix Multiplication | Postscript | [May 4, 2010] | |
| Lecture 10 | Solving Recurrences | Postscript | [May 24, 2010] | |
| Lecture 11 | Selection Problems | Postscript | [May 24, 2010] | |
| Lecture 12 | Graph Algorithms: Part 1: Traversal | Postscript | [May 24, 2010] | |
| Lecture 13 | Graph Algorithms: Part 2: Minimum Spanning Trees | Postscript | [May 24, 2010] | |
| Lecture 14 | Graph Algorithms: Part 3: Shortest Paths | Postscript | [May 24, 2010] | |
| Lecture 15 | Graph Algorithms: Part 4: Shortest Paths | Postscript | [May 24, 2010] | |
| Lecture 16 | NP-complete problems | Postscript | [May 24, 2010] |