CMPSC 465 Fall 2017
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

ABCDEFGHIJKLMNOPQRST
1
TopicRequired
Handouts
/Announcements
2
CMPSC465, Fall 2017, Data Structures and Algorithms
3
Instructor: Professor Paul Medvedev (pzm11)
4
5
SyllabusSyllabus
6
Professor OH:Professor OH
7
Piazzahttps://piazza.com/class/j6h3u1trhlr6xx?cid=9
8
Professor OH:http://medvedevgroup.com/medvedev.html
9
TA Office Hours:See Piazza
10
11
Past and curent schedule
12
8/21/2017 (recit)no recitation
13
8/21/2017Intro, Insertion sortCh 2.1SyllabusSlides posted on Canvas
14
8/23/2017Insertion sort, Loop InvariantsCh 2.1Insertion Sort animation
15
8/25/2017Running time analysis, Asymptotic notationCh 2.2, 3.1
16
8/28 (recit)no recitation
17
8/28/2017Asymptotic notationCh 3.1
18
8/30/2017Asymptotic notation, Merge sortCh 2.3Homework 1 postedMerge Sort Animation
19
9/1/2017Maximum-subarray problemCh 2.3, Ch 4.1
20
9/4 (recit)Labor day, no class
21
9/4/2017Labor day, no class
22
9/6/2017Maximum-subarray problemCh 4.1Homework 1 due
23
9/8/2017Solving Recurrence relationsCh 4.5 and 4.3
24
9/11 (recit)Review of Homework 1 solutions and asymptotic practice problems
25
9/11/2017Solving Recurrence relations and dynamic programming
26
9/13/2017DP: Fibonnaci Numbers and Rod Cutting Ch 15.1
27
9/15/2017Going over HW2 solutionsHomework 2 due
28
29
30
Tentative schedule
31
9/18 (recit)Review loop invariant proof of correctness of Merge algorithm
32
9/18/2017No class
33
9/20/2017DP: Rod cutting
34
9/22/2017DR: Weighted interval scheduling (Evening Comprehension Exam)
35
9/25 (recit)
36
9/25/2017DP: Weighted Interval schedulingHomework 3 due, before class
37
9/27/2017DP: Longest Common Subsequence
38
9/29/2017*** DP: Longest Common Subsequence and independent set on a grid
39
10/2 (recit)
40
10/2Greedy Algorithms (Unweighted Interval Scheduling, a.k.a activity selection)
41
10/4/2017Greedy Algorithms: Scheduling to minimize lateness
42
10/6/2017Data Structures and Abstract Data types Revew
43
10/9 (recit)
44
10/9/2017Midterm review
45
10/11/2017Priority queues and binary heaps (Evening Midterm)
46
10/13/2017Binary Search Trees
47
10/16 (recit)
48
10/16/2017Red Black Trees
49
10/18/2017Red Black Trees
50
10/20/2017Red Black Trees
51
10/23 (recit)
52
10/23/2017Rank/Select augmentation
53
10/25/2017Interval Trees: augmenting data structures
54
10/27/2017Interval trees, hashing.
55
10/30 (recit)
56
10/30/2017Hashing
57
58
11/3/2017**** TBD
59
11/6 (reict)
60
11/6/2017Depth-First Search
61
11/8/2017DFS and Topological Sort
62
11/10/2017Topological Sort and shortest paths
63
11/13(recit)
64
11/13/2017homework review
65
11/15/2017Shortest paths properties (Evening Comprehension Exam)
66
11/17/2017*** Shortest paths properties / Bellman Ford
67
11/20 - 11/26 holidays
68
11/27 (recit)
69
11/27/2017**** TBD
70
11/29/2017Bellman Ford, Dijkstra's
71
12/1/2017Dijkstra's / Minimum Spanning Trees
72
12/4 (recit)
73
12/4/2017homework review
74
12/6/2017Minimum Spanning Trees (Evening Comprehension Exam)
75
12/8/2017Final Review
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100