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

 
View only
 
 
Still loading...
ABCDEFGHIJKLMNOPQRST
1
TopicRequired
Readings
Handouts
/Announcements
Slides
2
CMPSC465, Spring 2014, Data Structures and Algorithms
3
Instructor: Professor Paul Medvedev (pzm11)
4
For up to date Instructor's office hours and location, see http://medvedevgroup.com/medvedev.html
5
T.A. Nima Elyasi, R2:30-4:30 at 346D IST
6
T.A.Orhan Memduh Kislal, Office Hours T1:30 - 3:30 at 355IST
7
8
1/14/2014Intro, induction, loop invariants, performance analysisChapter 2.1, 2.2Syllabusslides1.pdf
9
1/16/2014Asymptotic notation, common functionsChapter 3slides2.pdf
10
1/20/2014Holiday
11
1/21/2014Divide & Conquer (Merge Sort, etc), Recursion TreesCh 2.3, 4.0, 4.4slides3.pdf
12
1/23/2014Solving Recurrences (substitution method, master theorem)Ch 4.3, 4.5slides4a.pdf
13
Abstract data typesCh 10.1Homework 1slides4b.pdf
14
1/27/2014Examples with recursion, proving correctness, and asymptotic grown
15
1/28/2014Backtracking / Dynamic Programming (Weighted Interval Scheduling, Independent Set)Ch 15.3slides5.pdf
16
1/30/2014(tent) Longest Common Subsequence / Segmented Least SquaresCh 15.4slides6.pdf
17
2/3/2014Examples of solving assymptotic growth problems (CLRS Problem 3.3)
18
2/4/2014Greedy Algorithms (Unweighted Interval Scheduling, a.k.a activity selection)Ch 16.1Homework 2slides7.pdf
19
2/6/2014The Maximum Subarray problemCh 4.1, exer.4.1-5no slides/notes available, but I follow the book closely
20
2/10/2014Recurrence solving examples
21
2/11/2014Homework 1 solutions Homework 3
22
2/13/2014no class
23
2/17/2014Dynamic programming exercises
24
2/18/2014Midterm Review and solutions to homeworks 2Homework solutions posted on ANGELmidtermReview1.pdf
25
hw1.sol.pdf
26
hw2.sol.pdf
27
hw3.sol.pdf
28
PracticeMidterm
29
2/20/2014Midterm Review and solutions to homeworks 2 and 3midtermReview2.pdf
30
2/25/2014Midterm 1
31
2/27/2014Greedy algorithms (con't, same slides as on 2/4)Homework 4
32
3/4/2014Priority Queues and HeapsCh 6.1, 6.2, 6.4, 6.5slides8.pdf
33
3/6/2014Binary Search TreesCh 12.1, 12.2, 12.3Homework 5slides9.pdf
34
3/10/2014Spring Break
35
3/11/2014Spring Break
36
3/13/2014Spring Breakhw4.sol.pdf
37
3/17/2014Solutions to HW4
38
3/18/2014Red Black TreesCh 13.1, 13.2, 13.3
39
3/20/2014Red Black Trees Insertion and Rank/Select augmentationCh 14.1
40
3/24/2014Solutions to HW5hw5.sol.pdf
41
3/25/2014Rank/Select augmented data structuresCh 14.2Homework 6
42
3/27/2014Interval Searching augmenting data structuresCh 14.3
43
3/31/2014Exercise CLRS 14-1
44
4/1/2014Midterm Review and HashingCh 11.1,
parts of Ch 11.2 - 11.3
midterm2Review.pdf
45
4/3/2014NO CLASSHW6 due at 2:30, IST 346D
46
4/7/2014Solutions to HW6hw6.sol.pdf
47
4/8/2014Midterm 2
48
4/10/2014Hashing and Graphs / BFSCh 22.1, 22.2slides11.pdf
49
4/14/2014Solutions to midterm
50
4/15/2014Depth-First SearchCh 22.3Homework 7
51
4/17/2014Topolical Sort / Shortest pathsCh 22.4, 24.3
52
4/21/2014Exercises 11.2-2, 11.2-5, 11.4-1, 22.3-11, 22.3-12
53
4/22/2014Shortest paths properties / Bellman FordCh 24.0, 24.1, 24.2
54
4/24/2014Dijkstra's, Minimum Spanning TreesCh 24.3, parts of Ch 23Homework 8
55
4/28/2014HW7 solutionshw7.sol.pdf
56
4/29/2014Prim's algorithm
57
5/1/2014NP-completeness, Final Reviewhw8.sol.pdfslides12.pdf
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
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
Loading...
 
 
 
Sheet1