Algorithm Design
Instructor: Hossein Jowhari
Office: Math 402
Email: jowhari at kntu dot ac dot ir
Semester: Spring 2019 (97-2)
Classroom: 101
Time: SAT-MON 7:30-9am
TA: Saeed Odak
Recommended Textbook: Algorithm Design by Eva Tardos and Jon Klienberg
Lectures :
- Lec 1: Intorduction to the course
- Lec 2: Stable Marriage problem pdf
- Lec 3: Worst-case analysis I pdf
- Lec 4: Worst-case analysis II
- Lec 5: Graph exploration: BFS, DFS
- Lec 6: BFS and DFS (analysis and implementation) pdf
- Lec 7: Greedy Algorithms (Interval Scheduling)
- Lec 8: Greedy Algorithms (Interval Scheduling, Shortest Path)
- Lec 9: Greedy Algorithms (Shortest Path, Minimum Spanning Tree)
- Lec 10: Divide & Conquer (Counting Inversions, Closest Pair)
- Lec 11: Divide & Conquer (Closest Pair, Integer Multiplication)
- Lec 12: Solutions for selected problems
- Lec 13: Solutions for selected problems
- Midterm
- Lec 14: Midterm review. Dynamic Programming (Weighted Interval Scheduling)
- Lec 15: Dynamic Programming (Subset-Sum problem, Sequence Alignment)
- Lec 16: Dynamic Programming (Shortest Path, Bellman-Ford)
- Lec 17: Network Flow I (Ford-Fulkerson)
- Lec 18: Network Flow II (Ford-Fulkerson)
- Lec 19: Solutions for selected problems
Midterm Grades: pdf
Homeworks :
- Homework 1: pdf
- Homework 2: pdf
- Homework 3: pdf
- Homework 4: pdf
- Homework 5: pdf