Algorithms

[Seiden’s:_Theoritical Computer Science Cheat Sheet]

 

Lecture Topic Slides Assignment Recitations
1  Analysis of Algorithms [] 1 Write up (latex intro) Overleaf.com 
2  Union-Find  []  2 Problems
3 Sorting and Comparators []  2 Problems
4  Merge Sort []  2 Problems
5  Quick Sort  [] 2 Problems
6  Master Method (NL) [] 1  Write up
7  Priority Queues [] 2 Problems
8  Geometric Search  [] 2 Problems
9 Balance Search Trees [] 2 Problems
10 Undirected Graph
Algorithms
[] 2 Problems
11  Minimum Spanning Trees  [] 2 Problems
12  Directed Graphs Algorithms  [] 2 Problems
13  Shortest Path [] 2 Problems
14 Max Flow []  2 Problems
15 String Sorts [] 2 Problems
16 SubString Search/Tries [] 2 Problems
17 Back tracking [] 2 Problems
18  Dynamic Programming I (NL) [] 2 Problems
19 Dynamic Programming II (NL) [] 2 Problems
20 Dynamic Programming III (NL) [] 2 Problems
21 Markov Models (NL) [] 2 Problems
22 Bloom Filters  (Backup) [] 2 Problems
23 Intractability I (NP vs NP) (NL) [] 1 Write up.
24  Intractability (reductions) (NL) []

Homeworks are due Every Monday and Thursday at 10:00pm.  To submit follow the instruction in each Java Class in the portfolio.  There 40 implementation problems and 3 write ups.  We will drop the 5 lowest implementation problems.