Design and Analysis of Algorithms
CSC 8301 - Spring 2017
| Help |
Instructor Mirela Damian, Mendel 167A.
Office hours are on Wednesdays, 4:00 pm - 6:00 pm, in Mendel 167A. Online forum: use Piazza to post questions and answers (not via email) | ||
|---|---|---|---|
| Jan. | 18 | Lecture #1: Introduction. Efficiency Analysis Framework | (pdf, notes) |
| Jan. | 25 | Lecture #2: Mathematical Analysis of Non-Recursive Algorithms | (pdf, notes) |
| Feb. | 1 | Lecture #3: Mathematical Analysis of Recursive Algorithms | (pdf, notes) |
| Feb. | 8 | Lecture #4: Brute Force, Exhaustive Search, Graph Traversal Algorithms | (pdf) |
| Feb. | 15 | Lecture #5: Algorithm Design Technique: Decrease and Conquer | (pdf, notes) |
| Feb. | 22 | Lecture #6: Algorithm Design Technique: Divide and Conquer | (pdf, notes) |
| Mar. | 1 | Lecture #7: Algorithm Design Technique: Transform and Conquer, part I | (pdf, notes) |
| Mar. 6 - 12: Spring Break | |||
| Mar. | 15 | Midterm exam | |
| Mar. | 22 | Lecture #8: Algorithm Design Technique: Transform and Conquer, part II | (pdf, notes) |
| Mar. | 29 | Lecture #9: Space-For-Time Tradeoffs | |
| Apr. | 5 | Lecture #10: Dynamic Programming | |
| Apr. | 12 | Lecture #11: Greedy Technique | |
| Apr. | 19 | Lecture #12: Linear Programming and the Maximum Flow Problem | |
| Apr. | 26 | Lecture #13: P; NP; NPC; Backtracking and Branch-and-Bound | |
| May | 3 | Lecture #14: Approximation Algorithms | |
| Final Exam: | Wednesday, May 10, 6:15 pm - 9:00 pm in Mendel G92 | ||