Computer Science 361
Algorithms and Data Structures
Fall 2016

Course Details Syllabus Lectures Resources


Week Date Topic Code Reading Assignments
1 8/29 Introduction to Algorithms -- Preface (till Overview) Assignment 1 due 9/5
8/31 Stable Matching Problem code 1.1 (stop at Extensions) --
9/2 Asymptotic Growth -- 2.1-2.2 --
2 9/5 Labor Day -- -- Assignment 2 due 9/12
9/7 Asymptotic growth -- 2.1-2.2 --
9/9 Asymptotic growth, Priority queues -- 2.4, 2.5 --
3 9/12 Priority queues code 2.5 Assignment 3 due 9/21
9/14 Graphs, BFS, DFS code 3.1-3.3 --
9/16 BFS, DFS, Topological sort code 3.1-3.3, 3.6 --
4 9/19 Greedy Algorithms -- 4.1, 4.4-4.5, 4.8 --
9/21 Greedy Algorithms corrected 4.1, 4.4-4.5, 4.8 --
9/23 Greedy Algorithms -- 4.1, 4.4-4.5, 4.8 Assignment 4 due 9/30
5 9/26 Greedy Algorithms -- 4.1, 4.4-4.5, 4.8 --
9/28 Greedy Algorithms -- 4.1, 4.4-4.5, 4.8 --
9/30 Greedy Algorithms -- 4.1, 4.4-4.5, 4.8 --
6 10/3 Greedy Algorithsm (Dijkstras) -- 4.1, 4.4-4.5, 4.8 --
10/5 Greedy Algorithms (Dijkstras) -- 4.1, 4.4-4.5, 4.8 --
10/7 Greedy Algorithms (Prims) -- 4.1, 4.4-4.5, 4.8 --
7 10/10 Divide and Conquer -- 5.1-5.3 --
10/12 Midterm Exam -- -- --
10/14 Divide and Conquer code 5.1-5.3 --
8 10/17 Fall Break -- -- --
10/19 Divide and Conquer -- 5.1-5.3 Assignment 5 due 10/28
10/21 Divide and Conquer code 5.1-5.3 --
9 10/24 Divide and Conquer -- 5.1-5.3 --
10/26 Dynamic programming -- 6.1-6.2, 6.4, 6.6, 6.8 --
10/28 Dynamic programming -- 6.1-6.2, 6.4, 6.6, 6.8 --
10 10/31 Dynamic programming -- 6.1-6.2, 6.4, 6.6, 6.8 --
11/2 Dynamic programming -- 6.1-6.2, 6.4, 6.6, 6.8 --
11/4 Dynamic programming -- 6.1-6.2, 6.4, 6.6, 6.8 Assignment 6 due 11/14
11 11/7 DP: Bellman Ford -- 6.8 --
11/9 DP: Bellman Ford -- 6.8 --
11/11 DP: Bellman Ford -- 6.8 --
12 11/14 DP: Bellman Ford, Floyd Warshall -- 6.8 --
11/16 DP: Floyd Warshall -- 6.8 --
11/18 Balanced Trees code 2-3 reading --
13 11/21 Balanced Trees code 2-3    RB Assignment 7 due 12/7
11/23 Thanksgiving Break -- -- --
11/25 Thanksgiving Break -- -- --
14 11/28 Balanced Trees code RB reading --
11/30 Balanced Trees code RB reading --
12/2 NP-Completeness -- 8.1-8.4 --
15 12/5 NP-Completeness -- 8.1-8.4 --
12/7 NP-Completeness -- 8.1-8.4 Extra Credit HW 8 due 12/14
12/9 Reading Period -- -- --


Last modified: Fri Aug 16 12:06:44 PDT 2013