Jesse Hartloff

CSE 331
Introduction to Algorithm Analysis and Design
Summer 2015

syllabus
Piazza
Office Hours: Monday, Wednesday: 1-3pm in Davis 344

Anonymous feedback form:

Schedule

Date Topic Reading Section(s) Notes
1: Tuesday, May 26 Introduction (Slides1) 1.1
2: Thursday, May 28 Stable Marriage Problem, Gale-Shapley Algorithm (Slides2) 1.1 cont'
3: Tuesday, June 2 Gale-Shapley Analysis, Asymptotic Analysis (Slides3, Gale-Shapley) 1.2, 2.1-2.4
4: Thursday, June 4 Asymptotic Analysis (Slides4) 2.1-2.4 (HW0 due)
5: Tuesday, June 9 Graph Basics (Slides5, Graphs) 3.1
6: Thursday, June 11 BFS and DFS (Slides6) 3.2 Guest Lecturer: Andrew Hughes
7: Tuesday, June 16 Runtime of BFS and DFS / Topological Ordering (Slides7) 3.3 and 3.6 (PA1 due)
8: Thursday, June 18 Greedy Algorithm Intro: Interval Scheduling (Slides8) 4.1 (HW1 due)
9: Tuesday, June 23 Greedy Algo's: Interval Scheduling II (Slides9) 4.1 and 4.2
10: Thursday, June 25 Greedy Algo's: Shortest Path/Dijkstra (Slides10) 4.4
11: Tuesday, June 30 Greedy Algo Examples and Midterm Review (Greedy, Midterm Review) (PA2 due)
12: Thursday, July 2 Greedy Algo's: Minimum Spanning Tree (Slides12) 4.5 and 4.6 (HW2 due)
13: Tuesday, July 7 No Class (Sample Midterm)
14: Thursday, July 9 Midterm Exam
15: Tuesday, July 14 Midterm Review / DnC: Merge Sort (Slides15) 5.1
16: Thursday, July 16 DnC: Closest Pair of Points (Slides16) 5.4
17: Tuesday, July 21 Divide and Conquer Examples () (PA3 due)
18: Thursday, July 23 Dynamic Programming: Weighted Interval Scheduling (Slides18) 6.1 and 6.2
19: Tuesday, July 28 Dynamic Programming: Knapsack Problem (Slides19) 6.4 (HW3 due)
20: Thursday, July 30 Dynamic Programming: Bellman-Ford Algorithm (Slides20) 6.8
21: Tuesday, August 4 P vs NP and Dynamic Programming Examples (Slides21) 8.1 (HW4 due)
22: Thursday, August 6 Final Exam Review (Final Review) CH 1-6 (Sample Final)
23: Tuesday, August 11 Examples (Greedy, DnC, Dynamic Programming) CH 1-6 (PA4 due)
24: Thursday, August 13 Final Exam